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-e1a14da [2018-12-24 13:54:57,914 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-24 13:54:57,916 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-24 13:54:57,929 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-24 13:54:57,929 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-24 13:54:57,930 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-24 13:54:57,931 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-24 13:54:57,934 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-24 13:54:57,936 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-24 13:54:57,937 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-24 13:54:57,945 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-24 13:54:57,945 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-24 13:54:57,946 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-24 13:54:57,947 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-24 13:54:57,948 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-24 13:54:57,949 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-24 13:54:57,950 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-24 13:54:57,951 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-24 13:54:57,954 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-24 13:54:57,957 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-24 13:54:57,960 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-24 13:54:57,961 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-24 13:54:57,966 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-24 13:54:57,966 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-24 13:54:57,966 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-24 13:54:57,967 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-24 13:54:57,970 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-24 13:54:57,974 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-24 13:54:57,975 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-24 13:54:57,976 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-24 13:54:57,977 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-24 13:54:57,977 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-24 13:54:57,978 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-24 13:54:57,979 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-24 13:54:57,981 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-24 13:54:57,981 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-24 13:54:57,982 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 [2018-12-24 13:54:58,000 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-24 13:54:58,000 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-24 13:54:58,001 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-24 13:54:58,001 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-24 13:54:58,002 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-24 13:54:58,002 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-24 13:54:58,002 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-24 13:54:58,002 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-24 13:54:58,002 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-24 13:54:58,003 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-24 13:54:58,003 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-24 13:54:58,003 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-24 13:54:58,003 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-24 13:54:58,003 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-24 13:54:58,004 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-24 13:54:58,004 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-24 13:54:58,004 INFO L133 SettingsManager]: * Use SBE=true [2018-12-24 13:54:58,005 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-24 13:54:58,005 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-24 13:54:58,005 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-24 13:54:58,005 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-24 13:54:58,006 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-24 13:54:58,006 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-24 13:54:58,006 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-24 13:54:58,006 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-24 13:54:58,006 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-24 13:54:58,006 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-24 13:54:58,007 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-24 13:54:58,007 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-24 13:54:58,007 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-24 13:54:58,007 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-24 13:54:58,008 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 13:54:58,008 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-24 13:54:58,008 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-24 13:54:58,008 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-24 13:54:58,008 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-24 13:54:58,009 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-24 13:54:58,009 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-24 13:54:58,009 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-24 13:54:58,009 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-24 13:54:58,046 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-24 13:54:58,062 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-24 13:54:58,070 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-24 13:54:58,071 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-24 13:54:58,072 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-24 13:54:58,073 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 [2018-12-24 13:54:58,073 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl' [2018-12-24 13:54:58,120 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-24 13:54:58,122 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-24 13:54:58,122 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-24 13:54:58,123 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-24 13:54:58,123 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-24 13:54:58,141 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 24.12 01:54:58" (1/1) ... [2018-12-24 13:54:58,156 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 24.12 01:54:58" (1/1) ... [2018-12-24 13:54:58,189 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-24 13:54:58,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-24 13:54:58,191 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-24 13:54:58,191 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-24 13:54:58,203 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 24.12 01:54:58" (1/1) ... [2018-12-24 13:54:58,203 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 24.12 01:54:58" (1/1) ... [2018-12-24 13:54:58,205 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 24.12 01:54:58" (1/1) ... [2018-12-24 13:54:58,206 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 24.12 01:54:58" (1/1) ... [2018-12-24 13:54:58,212 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 24.12 01:54:58" (1/1) ... [2018-12-24 13:54:58,216 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 24.12 01:54:58" (1/1) ... [2018-12-24 13:54:58,217 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 24.12 01:54:58" (1/1) ... [2018-12-24 13:54:58,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-24 13:54:58,219 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-24 13:54:58,219 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-24 13:54:58,219 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-24 13:54:58,220 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 24.12 01:54:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 13:54:58,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-24 13:54:58,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-24 13:54:58,603 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-24 13:54:58,604 INFO L280 CfgBuilder]: Removed 13 assue(true) statements. [2018-12-24 13:54:58,604 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:54:58 BoogieIcfgContainer [2018-12-24 13:54:58,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-24 13:54:58,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-24 13:54:58,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-24 13:54:58,609 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-24 13:54:58,609 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 24.12 01:54:58" (1/2) ... [2018-12-24 13:54:58,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fd3452e and model type speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:54:58, skipping insertion in model container [2018-12-24 13:54:58,611 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 24.12 01:54:58" (2/2) ... [2018-12-24 13:54:58,613 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-limited.bpl [2018-12-24 13:54:58,623 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-24 13:54:58,631 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-12-24 13:54:58,649 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2018-12-24 13:54:58,691 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-24 13:54:58,691 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-24 13:54:58,692 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-24 13:54:58,692 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-24 13:54:58,692 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-24 13:54:58,692 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-24 13:54:58,692 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-24 13:54:58,692 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-24 13:54:58,713 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2018-12-24 13:54:58,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-24 13:54:58,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:58,726 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-24 13:54:58,730 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:58,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:58,738 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2018-12-24 13:54:58,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:58,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:58,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:58,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:58,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:58,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:58,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 13:54:58,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-24 13:54:58,941 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:54:58,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-24 13:54:58,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-24 13:54:58,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 13:54:58,960 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2018-12-24 13:54:59,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:59,204 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2018-12-24 13:54:59,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 13:54:59,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-24 13:54:59,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:59,221 INFO L225 Difference]: With dead ends: 25 [2018-12-24 13:54:59,222 INFO L226 Difference]: Without dead ends: 20 [2018-12-24 13:54:59,225 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 [2018-12-24 13:54:59,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-24 13:54:59,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2018-12-24 13:54:59,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-24 13:54:59,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-24 13:54:59,263 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2018-12-24 13:54:59,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:59,265 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-24 13:54:59,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-24 13:54:59,265 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-24 13:54:59,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-24 13:54:59,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:59,266 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-24 13:54:59,266 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:59,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:59,267 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2018-12-24 13:54:59,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:59,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:59,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:59,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:59,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:59,582 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-12-24 13:54:59,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:59,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:59,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:59,598 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-24 13:54:59,600 INFO L207 CegarAbsIntRunner]: [0], [18], [23] [2018-12-24 13:54:59,637 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:54:59,637 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:54:59,708 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:54:59,709 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. [2018-12-24 13:54:59,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:59,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:54:59,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:59,716 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 [2018-12-24 13:54:59,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:59,727 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:54:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:59,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:59,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-24 13:54:59,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:59,822 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 [2018-12-24 13:54:59,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:59,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:59,889 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 [2018-12-24 13:54:59,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:59,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:59,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:59,924 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 [2018-12-24 13:54:59,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:54:59,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:00,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:00,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:00,053 INFO L303 Elim1Store]: Index analysis took 122 ms [2018-12-24 13:55:00,055 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 [2018-12-24 13:55:00,057 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:00,289 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:00,342 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:00,417 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:00,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:00,598 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. [2018-12-24 13:55:00,599 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2018-12-24 13:55:00,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:00,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:00,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:00,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:00,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:00,743 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:00,743 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:00,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:00,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:00,748 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:00,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:00,756 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 [2018-12-24 13:55:00,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:00,830 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. [2018-12-24 13:55:00,831 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:00,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:00,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:00,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:00,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:00,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-24 13:55:01,001 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:01,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 13:55:01,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 13:55:01,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:55:01,003 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 6 states. [2018-12-24 13:55:01,151 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-12-24 13:55:01,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:01,828 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2018-12-24 13:55:01,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 13:55:01,832 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2018-12-24 13:55:01,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:01,833 INFO L225 Difference]: With dead ends: 39 [2018-12-24 13:55:01,833 INFO L226 Difference]: Without dead ends: 37 [2018-12-24 13:55:01,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-12-24 13:55:01,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-24 13:55:01,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 16. [2018-12-24 13:55:01,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-24 13:55:01,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2018-12-24 13:55:01,841 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 3 [2018-12-24 13:55:01,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:01,841 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 32 transitions. [2018-12-24 13:55:01,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 13:55:01,841 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 32 transitions. [2018-12-24 13:55:01,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-24 13:55:01,842 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:01,842 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-24 13:55:01,843 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:01,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:01,843 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2018-12-24 13:55:01,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:01,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:01,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:01,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:01,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:01,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:01,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:01,935 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:01,936 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-24 13:55:01,936 INFO L207 CegarAbsIntRunner]: [0], [20], [23] [2018-12-24 13:55:01,938 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:01,938 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:01,958 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:01,958 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. [2018-12-24 13:55:01,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:01,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:01,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:01,959 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 [2018-12-24 13:55:01,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:01,977 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:01,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:02,007 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 [2018-12-24 13:55:02,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:02,023 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 [2018-12-24 13:55:02,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:02,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:02,038 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 [2018-12-24 13:55:02,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:02,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:02,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:02,072 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 [2018-12-24 13:55:02,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:02,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:02,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:02,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:02,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 [2018-12-24 13:55:02,101 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:02,148 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:02,169 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:02,190 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:02,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:02,235 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. [2018-12-24 13:55:02,236 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2018-12-24 13:55:02,268 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:02,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:02,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:02,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:02,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:02,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:02,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:02,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:02,287 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:02,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:02,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:02,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, 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 [2018-12-24 13:55:02,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:02,376 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. [2018-12-24 13:55:02,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:02,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:02,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:02,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:02,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-24 13:55:02,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2018-12-24 13:55:02,459 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:55:02,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 13:55:02,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 13:55:02,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:55:02,460 INFO L87 Difference]: Start difference. First operand 16 states and 32 transitions. Second operand 4 states. [2018-12-24 13:55:02,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:02,545 INFO L93 Difference]: Finished difference Result 18 states and 39 transitions. [2018-12-24 13:55:02,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 13:55:02,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-24 13:55:02,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:02,548 INFO L225 Difference]: With dead ends: 18 [2018-12-24 13:55:02,549 INFO L226 Difference]: Without dead ends: 17 [2018-12-24 13:55:02,549 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 [2018-12-24 13:55:02,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-24 13:55:02,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-24 13:55:02,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-24 13:55:02,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 38 transitions. [2018-12-24 13:55:02,554 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 38 transitions. Word has length 3 [2018-12-24 13:55:02,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:02,554 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 38 transitions. [2018-12-24 13:55:02,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 13:55:02,555 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 38 transitions. [2018-12-24 13:55:02,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-24 13:55:02,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:02,555 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-24 13:55:02,556 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:02,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:02,556 INFO L82 PathProgramCache]: Analyzing trace with hash 30560, now seen corresponding path program 1 times [2018-12-24 13:55:02,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:02,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:02,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:02,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:02,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:02,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:02,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 13:55:02,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-24 13:55:02,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:55:02,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-24 13:55:02,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-24 13:55:02,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 13:55:02,692 INFO L87 Difference]: Start difference. First operand 17 states and 38 transitions. Second operand 3 states. [2018-12-24 13:55:02,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:02,747 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2018-12-24 13:55:02,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 13:55:02,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-24 13:55:02,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:02,748 INFO L225 Difference]: With dead ends: 21 [2018-12-24 13:55:02,748 INFO L226 Difference]: Without dead ends: 20 [2018-12-24 13:55:02,748 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 [2018-12-24 13:55:02,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-24 13:55:02,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-12-24 13:55:02,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-24 13:55:02,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2018-12-24 13:55:02,754 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 37 transitions. Word has length 3 [2018-12-24 13:55:02,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:02,754 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 37 transitions. [2018-12-24 13:55:02,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-24 13:55:02,754 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 37 transitions. [2018-12-24 13:55:02,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-24 13:55:02,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:02,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-24 13:55:02,755 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:02,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:02,756 INFO L82 PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times [2018-12-24 13:55:02,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:02,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:02,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:02,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:02,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:02,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:02,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:02,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:02,921 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-24 13:55:02,921 INFO L207 CegarAbsIntRunner]: [0], [10], [23] [2018-12-24 13:55:02,924 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:02,925 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:02,932 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:02,932 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. [2018-12-24 13:55:02,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:02,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:02,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:02,933 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-24 13:55:02,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:02,945 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:02,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:02,964 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 [2018-12-24 13:55:02,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:02,969 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 [2018-12-24 13:55:02,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:02,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:02,981 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 [2018-12-24 13:55:02,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:02,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:02,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:02,996 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 [2018-12-24 13:55:03,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:03,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:03,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:03,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:03,017 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 [2018-12-24 13:55:03,018 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:03,066 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:03,084 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:03,118 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:03,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:03,150 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. [2018-12-24 13:55:03,150 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2018-12-24 13:55:03,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:03,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:03,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:03,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:03,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:03,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:03,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:03,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:03,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:03,232 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:03,240 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:03,241 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 [2018-12-24 13:55:03,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:03,291 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. [2018-12-24 13:55:03,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:03,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:03,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:03,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:03,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:03,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-24 13:55:03,376 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:03,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 13:55:03,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 13:55:03,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:55:03,377 INFO L87 Difference]: Start difference. First operand 17 states and 37 transitions. Second operand 6 states. [2018-12-24 13:55:03,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:03,626 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2018-12-24 13:55:03,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 13:55:03,628 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2018-12-24 13:55:03,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:03,629 INFO L225 Difference]: With dead ends: 39 [2018-12-24 13:55:03,629 INFO L226 Difference]: Without dead ends: 38 [2018-12-24 13:55:03,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-12-24 13:55:03,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-24 13:55:03,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 18. [2018-12-24 13:55:03,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-24 13:55:03,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2018-12-24 13:55:03,635 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 43 transitions. Word has length 3 [2018-12-24 13:55:03,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:03,636 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 43 transitions. [2018-12-24 13:55:03,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 13:55:03,636 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 43 transitions. [2018-12-24 13:55:03,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:55:03,636 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:03,636 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:55:03,637 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:03,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:03,637 INFO L82 PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times [2018-12-24 13:55:03,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:03,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:03,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:03,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:03,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:03,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:03,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:03,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:03,831 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:55:03,831 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [23] [2018-12-24 13:55:03,838 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:03,838 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:03,849 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:03,849 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. [2018-12-24 13:55:03,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:03,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:03,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:03,850 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 [2018-12-24 13:55:03,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:03,861 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:03,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:03,873 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 [2018-12-24 13:55:03,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:03,887 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 [2018-12-24 13:55:03,892 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:03,894 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:03,895 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 [2018-12-24 13:55:03,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:03,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:03,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:03,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 [2018-12-24 13:55:03,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:03,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:03,983 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:04,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:04,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, 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 [2018-12-24 13:55:04,009 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:04,051 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:04,068 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:04,081 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:04,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:04,115 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. [2018-12-24 13:55:04,115 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2018-12-24 13:55:04,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:04,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:04,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:04,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:04,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:04,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:04,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:04,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:04,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:04,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:04,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:04,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 66 [2018-12-24 13:55:04,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:04,206 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. [2018-12-24 13:55:04,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:04,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:04,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:04,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:04,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:04,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:04,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:04,344 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:04,345 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:04,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:04,348 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:04,349 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:04,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:04,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:04,352 INFO L303 Elim1Store]: Index analysis took 112 ms [2018-12-24 13:55:04,354 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 [2018-12-24 13:55:04,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:04,407 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. [2018-12-24 13:55:04,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:55:04,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:04,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:04,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:04,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:04,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:55:04,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:04,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:55:04,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:55:04,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:55:04,490 INFO L87 Difference]: Start difference. First operand 18 states and 43 transitions. Second operand 8 states. [2018-12-24 13:55:05,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:05,053 INFO L93 Difference]: Finished difference Result 49 states and 91 transitions. [2018-12-24 13:55:05,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:55:05,053 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-24 13:55:05,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:05,055 INFO L225 Difference]: With dead ends: 49 [2018-12-24 13:55:05,055 INFO L226 Difference]: Without dead ends: 44 [2018-12-24 13:55:05,056 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 [2018-12-24 13:55:05,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-24 13:55:05,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 22. [2018-12-24 13:55:05,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-24 13:55:05,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2018-12-24 13:55:05,063 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 58 transitions. Word has length 4 [2018-12-24 13:55:05,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:05,063 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 58 transitions. [2018-12-24 13:55:05,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:55:05,063 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 58 transitions. [2018-12-24 13:55:05,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:55:05,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:05,064 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:55:05,064 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:05,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:05,064 INFO L82 PathProgramCache]: Analyzing trace with hash 941028, now seen corresponding path program 1 times [2018-12-24 13:55:05,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:05,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:05,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:05,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:05,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:05,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:05,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:05,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:05,233 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:55:05,233 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [23] [2018-12-24 13:55:05,235 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:05,235 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:05,242 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:05,243 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. [2018-12-24 13:55:05,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:05,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:05,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:05,243 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 [2018-12-24 13:55:05,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:05,256 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:05,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:05,268 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 [2018-12-24 13:55:05,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,273 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 [2018-12-24 13:55:05,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,281 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 [2018-12-24 13:55:05,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,294 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 [2018-12-24 13:55:05,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,308 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 [2018-12-24 13:55:05,309 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:05,350 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:05,368 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:05,381 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:05,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:05,414 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. [2018-12-24 13:55:05,415 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2018-12-24 13:55:05,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,518 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 [2018-12-24 13:55:05,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:05,583 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. [2018-12-24 13:55:05,583 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:05,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,677 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,683 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:05,690 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 [2018-12-24 13:55:05,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:05,806 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. [2018-12-24 13:55:05,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:55:05,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:05,824 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:05,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:05,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:05,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2018-12-24 13:55:05,878 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:05,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:55:05,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:55:05,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:55:05,879 INFO L87 Difference]: Start difference. First operand 22 states and 58 transitions. Second operand 8 states. [2018-12-24 13:55:06,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:06,677 INFO L93 Difference]: Finished difference Result 47 states and 98 transitions. [2018-12-24 13:55:06,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:55:06,677 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-24 13:55:06,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:06,678 INFO L225 Difference]: With dead ends: 47 [2018-12-24 13:55:06,678 INFO L226 Difference]: Without dead ends: 46 [2018-12-24 13:55:06,679 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 [2018-12-24 13:55:06,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-24 13:55:06,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 24. [2018-12-24 13:55:06,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-24 13:55:06,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 70 transitions. [2018-12-24 13:55:06,687 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 70 transitions. Word has length 4 [2018-12-24 13:55:06,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:06,688 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 70 transitions. [2018-12-24 13:55:06,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:55:06,688 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 70 transitions. [2018-12-24 13:55:06,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:55:06,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:06,689 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:55:06,689 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:06,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:06,689 INFO L82 PathProgramCache]: Analyzing trace with hash 941588, now seen corresponding path program 1 times [2018-12-24 13:55:06,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:06,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:06,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:06,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:06,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:06,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:06,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:06,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:06,762 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:55:06,762 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [25] [2018-12-24 13:55:06,765 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:06,766 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:06,776 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:06,776 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. [2018-12-24 13:55:06,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:06,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:06,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:06,777 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 [2018-12-24 13:55:06,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:06,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:06,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:06,803 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 [2018-12-24 13:55:06,809 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 [2018-12-24 13:55:06,823 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:06,824 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 [2018-12-24 13:55:06,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:06,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:06,854 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 [2018-12-24 13:55:06,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:06,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:06,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:06,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, 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 [2018-12-24 13:55:06,887 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:06,910 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:06,925 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:06,936 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:06,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:06,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. [2018-12-24 13:55:06,968 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2018-12-24 13:55:07,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,012 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 [2018-12-24 13:55:07,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:07,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. [2018-12-24 13:55:07,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2018-12-24 13:55:07,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:07,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:07,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:07,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-24 13:55:07,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2018-12-24 13:55:07,094 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:55:07,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 13:55:07,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 13:55:07,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:55:07,095 INFO L87 Difference]: Start difference. First operand 24 states and 70 transitions. Second operand 4 states. [2018-12-24 13:55:07,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:07,160 INFO L93 Difference]: Finished difference Result 28 states and 79 transitions. [2018-12-24 13:55:07,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 13:55:07,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-24 13:55:07,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:07,162 INFO L225 Difference]: With dead ends: 28 [2018-12-24 13:55:07,162 INFO L226 Difference]: Without dead ends: 27 [2018-12-24 13:55:07,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:55:07,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-24 13:55:07,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-12-24 13:55:07,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-24 13:55:07,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 77 transitions. [2018-12-24 13:55:07,169 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 77 transitions. Word has length 4 [2018-12-24 13:55:07,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:07,170 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 77 transitions. [2018-12-24 13:55:07,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 13:55:07,170 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 77 transitions. [2018-12-24 13:55:07,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:55:07,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:07,171 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:55:07,171 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:07,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:07,172 INFO L82 PathProgramCache]: Analyzing trace with hash 941152, now seen corresponding path program 1 times [2018-12-24 13:55:07,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:07,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:07,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:07,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:07,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:07,354 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2018-12-24 13:55:07,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:07,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:07,387 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:07,388 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:55:07,388 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [23] [2018-12-24 13:55:07,390 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:07,390 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:07,396 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:07,396 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. [2018-12-24 13:55:07,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:07,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:07,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:07,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 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 [2018-12-24 13:55:07,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:07,407 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:07,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:07,430 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 [2018-12-24 13:55:07,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,436 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 [2018-12-24 13:55:07,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,444 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 [2018-12-24 13:55:07,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,454 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 [2018-12-24 13:55:07,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,476 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,477 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,478 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 [2018-12-24 13:55:07,479 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:07,519 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:07,539 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:07,559 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:07,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:07,592 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. [2018-12-24 13:55:07,593 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2018-12-24 13:55:07,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,635 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 [2018-12-24 13:55:07,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:07,683 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. [2018-12-24 13:55:07,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:07,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,742 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,745 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,748 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:07,750 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:55:07,752 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 [2018-12-24 13:55:07,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55: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. [2018-12-24 13:55:07,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2018-12-24 13:55:07,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:07,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:07,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:07,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:07,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:55:07,910 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:07,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:55:07,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:55:07,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:55:07,912 INFO L87 Difference]: Start difference. First operand 26 states and 77 transitions. Second operand 8 states. [2018-12-24 13:55:08,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:08,350 INFO L93 Difference]: Finished difference Result 44 states and 95 transitions. [2018-12-24 13:55:08,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:55:08,350 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-24 13:55:08,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:08,352 INFO L225 Difference]: With dead ends: 44 [2018-12-24 13:55:08,352 INFO L226 Difference]: Without dead ends: 43 [2018-12-24 13:55:08,353 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 [2018-12-24 13:55:08,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-24 13:55:08,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 25. [2018-12-24 13:55:08,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-24 13:55:08,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 70 transitions. [2018-12-24 13:55:08,360 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 70 transitions. Word has length 4 [2018-12-24 13:55:08,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:08,360 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 70 transitions. [2018-12-24 13:55:08,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:55:08,360 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 70 transitions. [2018-12-24 13:55:08,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:55:08,361 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:08,361 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:55:08,362 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:08,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:08,362 INFO L82 PathProgramCache]: Analyzing trace with hash 943510, now seen corresponding path program 1 times [2018-12-24 13:55:08,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:08,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:08,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:08,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:08,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:08,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:08,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:08,473 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:08,473 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:55:08,474 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [25] [2018-12-24 13:55:08,475 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:08,475 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:08,481 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:08,481 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. [2018-12-24 13:55:08,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:08,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:08,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:08,482 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 [2018-12-24 13:55:08,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:08,492 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:08,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:08,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-24 13:55:08,513 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 [2018-12-24 13:55:08,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:08,525 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 [2018-12-24 13:55:08,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:08,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:08,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 [2018-12-24 13:55:08,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:08,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:08,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:08,556 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 [2018-12-24 13:55:08,557 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:08,583 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:08,594 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:08,605 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:08,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:08,633 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. [2018-12-24 13:55:08,633 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2018-12-24 13:55:08,663 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:08,664 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:08,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:08,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:08,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:08,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:08,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:08,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, 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 [2018-12-24 13:55:08,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:08,703 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. [2018-12-24 13:55:08,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2018-12-24 13:55:08,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:08,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:08,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:08,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:08,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-24 13:55:08,755 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:08,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 13:55:08,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 13:55:08,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:55:08,756 INFO L87 Difference]: Start difference. First operand 25 states and 70 transitions. Second operand 6 states. [2018-12-24 13:55:09,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:09,033 INFO L93 Difference]: Finished difference Result 43 states and 96 transitions. [2018-12-24 13:55:09,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 13:55:09,034 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2018-12-24 13:55:09,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:09,034 INFO L225 Difference]: With dead ends: 43 [2018-12-24 13:55:09,035 INFO L226 Difference]: Without dead ends: 42 [2018-12-24 13:55:09,035 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 [2018-12-24 13:55:09,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-24 13:55:09,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 26. [2018-12-24 13:55:09,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-24 13:55:09,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 76 transitions. [2018-12-24 13:55:09,042 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 76 transitions. Word has length 4 [2018-12-24 13:55:09,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:09,043 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 76 transitions. [2018-12-24 13:55:09,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 13:55:09,043 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 76 transitions. [2018-12-24 13:55:09,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:55:09,044 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:09,044 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:55:09,044 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:09,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:09,044 INFO L82 PathProgramCache]: Analyzing trace with hash 943074, now seen corresponding path program 1 times [2018-12-24 13:55:09,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:09,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:09,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:09,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:09,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:09,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:09,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:09,232 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:09,232 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:55:09,232 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [23] [2018-12-24 13:55:09,233 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:09,233 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:09,239 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:09,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 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:55:09,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:09,240 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:09,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:09,240 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 [2018-12-24 13:55:09,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:09,249 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:09,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:09,268 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 [2018-12-24 13:55:09,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,275 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 [2018-12-24 13:55:09,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,289 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 [2018-12-24 13:55:09,297 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,313 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 [2018-12-24 13:55:09,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,323 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,325 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,328 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,329 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 [2018-12-24 13:55:09,330 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:09,361 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:09,377 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:09,391 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:09,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:09,425 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. [2018-12-24 13:55:09,425 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2018-12-24 13:55:09,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,507 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 [2018-12-24 13:55:09,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:09,554 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. [2018-12-24 13:55:09,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:09,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:09,616 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 [2018-12-24 13:55:09,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:09,676 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. [2018-12-24 13:55:09,676 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:09,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:09,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:09,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:09,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:09,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:55:09,751 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:09,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:55:09,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:55:09,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:55:09,752 INFO L87 Difference]: Start difference. First operand 26 states and 76 transitions. Second operand 8 states. [2018-12-24 13:55:10,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:10,171 INFO L93 Difference]: Finished difference Result 56 states and 123 transitions. [2018-12-24 13:55:10,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:55:10,172 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-24 13:55:10,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:10,173 INFO L225 Difference]: With dead ends: 56 [2018-12-24 13:55:10,173 INFO L226 Difference]: Without dead ends: 55 [2018-12-24 13:55:10,174 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 [2018-12-24 13:55:10,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-24 13:55:10,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2018-12-24 13:55:10,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-24 13:55:10,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 88 transitions. [2018-12-24 13:55:10,182 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 88 transitions. Word has length 4 [2018-12-24 13:55:10,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:10,183 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 88 transitions. [2018-12-24 13:55:10,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:55:10,183 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 88 transitions. [2018-12-24 13:55:10,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:55:10,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:10,184 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:55:10,184 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:10,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:10,184 INFO L82 PathProgramCache]: Analyzing trace with hash 929868, now seen corresponding path program 2 times [2018-12-24 13:55:10,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:10,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:10,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:10,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:10,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:10,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:10,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:10,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:10,261 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:55:10,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:55:10,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:10,262 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 [2018-12-24 13:55:10,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:55:10,271 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:55:10,278 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-24 13:55:10,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:55:10,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:10,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-24 13:55:10,294 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,294 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 [2018-12-24 13:55:10,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,301 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 [2018-12-24 13:55:10,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,307 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 [2018-12-24 13:55:10,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,317 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 [2018-12-24 13:55:10,318 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:10,347 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:10,362 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:10,373 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:10,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:10,504 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. [2018-12-24 13:55:10,505 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2018-12-24 13:55:10,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,544 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,549 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 [2018-12-24 13:55:10,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:10,604 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. [2018-12-24 13:55:10,605 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:10,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,677 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:10,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, 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 [2018-12-24 13:55:10,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:10,744 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. [2018-12-24 13:55:10,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:10,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:10,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:10,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:10,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:10,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2018-12-24 13:55:10,855 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:10,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:55:10,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:55:10,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:55:10,856 INFO L87 Difference]: Start difference. First operand 28 states and 88 transitions. Second operand 8 states. [2018-12-24 13:55:11,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:11,221 INFO L93 Difference]: Finished difference Result 66 states and 142 transitions. [2018-12-24 13:55:11,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:55:11,222 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-24 13:55:11,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:11,223 INFO L225 Difference]: With dead ends: 66 [2018-12-24 13:55:11,223 INFO L226 Difference]: Without dead ends: 64 [2018-12-24 13:55:11,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:55:11,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-24 13:55:11,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 32. [2018-12-24 13:55:11,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-24 13:55:11,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 99 transitions. [2018-12-24 13:55:11,232 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 99 transitions. Word has length 4 [2018-12-24 13:55:11,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:11,233 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 99 transitions. [2018-12-24 13:55:11,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:55:11,233 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 99 transitions. [2018-12-24 13:55:11,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:55:11,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:11,233 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:55:11,234 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:11,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:11,234 INFO L82 PathProgramCache]: Analyzing trace with hash 930056, now seen corresponding path program 1 times [2018-12-24 13:55:11,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:11,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:11,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:55:11,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:11,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:11,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:11,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:11,315 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:11,315 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:55:11,316 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [25] [2018-12-24 13:55:11,317 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:11,317 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:11,322 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:11,322 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. [2018-12-24 13:55:11,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:11,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:11,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:11,322 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 [2018-12-24 13:55:11,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:11,340 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:11,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:11,371 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 [2018-12-24 13:55:11,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:11,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 [2018-12-24 13:55:11,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:11,384 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:11,384 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 [2018-12-24 13:55:11,387 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:11,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:11,391 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:11,392 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 [2018-12-24 13:55:11,399 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:11,401 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:11,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:11,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:11,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2018-12-24 13:55:11,406 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:11,435 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:11,451 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:11,463 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:11,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:11,492 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. [2018-12-24 13:55:11,493 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2018-12-24 13:55:11,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:11,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:11,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:11,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:11,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:11,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:11,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:11,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:11,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:11,526 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:11,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:11,528 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 [2018-12-24 13:55:11,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:11,569 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. [2018-12-24 13:55:11,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:11,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:11,586 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:11,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:11,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:11,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-24 13:55:11,618 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:11,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 13:55:11,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 13:55:11,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:55:11,619 INFO L87 Difference]: Start difference. First operand 32 states and 99 transitions. Second operand 6 states. [2018-12-24 13:55:11,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:11,812 INFO L93 Difference]: Finished difference Result 45 states and 113 transitions. [2018-12-24 13:55:11,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 13:55:11,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2018-12-24 13:55:11,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:11,813 INFO L225 Difference]: With dead ends: 45 [2018-12-24 13:55:11,814 INFO L226 Difference]: Without dead ends: 44 [2018-12-24 13:55:11,814 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 [2018-12-24 13:55:11,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-24 13:55:11,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2018-12-24 13:55:11,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-24 13:55:11,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 104 transitions. [2018-12-24 13:55:11,827 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 104 transitions. Word has length 4 [2018-12-24 13:55:11,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:11,827 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 104 transitions. [2018-12-24 13:55:11,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 13:55:11,828 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 104 transitions. [2018-12-24 13:55:11,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:55:11,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:11,828 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:55:11,829 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:11,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:11,829 INFO L82 PathProgramCache]: Analyzing trace with hash 947418, now seen corresponding path program 1 times [2018-12-24 13:55:11,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:11,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:11,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:11,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:11,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:11,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:11,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 13:55:11,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-24 13:55:11,870 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:55:11,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-24 13:55:11,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-24 13:55:11,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 13:55:11,870 INFO L87 Difference]: Start difference. First operand 33 states and 104 transitions. Second operand 3 states. [2018-12-24 13:55:11,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:11,898 INFO L93 Difference]: Finished difference Result 34 states and 104 transitions. [2018-12-24 13:55:11,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 13:55:11,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-24 13:55:11,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:11,900 INFO L225 Difference]: With dead ends: 34 [2018-12-24 13:55:11,900 INFO L226 Difference]: Without dead ends: 31 [2018-12-24 13:55:11,900 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 [2018-12-24 13:55:11,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-24 13:55:11,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-24 13:55:11,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-24 13:55:11,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 101 transitions. [2018-12-24 13:55:11,909 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 101 transitions. Word has length 4 [2018-12-24 13:55:11,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:11,909 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 101 transitions. [2018-12-24 13:55:11,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-24 13:55:11,909 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 101 transitions. [2018-12-24 13:55:11,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:55:11,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:11,910 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:55:11,910 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:11,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:11,910 INFO L82 PathProgramCache]: Analyzing trace with hash 933340, now seen corresponding path program 1 times [2018-12-24 13:55:11,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:11,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:11,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:11,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:11,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:12,102 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2018-12-24 13:55:12,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:12,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:12,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:12,112 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:55:12,112 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [23] [2018-12-24 13:55:12,113 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:12,113 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:12,117 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:12,117 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. [2018-12-24 13:55:12,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:12,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:12,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:12,118 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 [2018-12-24 13:55:12,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:12,131 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:12,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:12,143 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 [2018-12-24 13:55:12,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,148 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 [2018-12-24 13:55:12,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,161 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 [2018-12-24 13:55:12,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,188 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 [2018-12-24 13:55:12,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,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 [2018-12-24 13:55:12,198 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:12,224 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:12,240 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:12,252 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:12,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:12,280 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. [2018-12-24 13:55:12,280 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2018-12-24 13:55:12,297 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,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, 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 [2018-12-24 13:55:12,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:12,360 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. [2018-12-24 13:55:12,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:12,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,384 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,387 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,391 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,392 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:12,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, 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 [2018-12-24 13:55:12,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:12,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. [2018-12-24 13:55:12,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:55:12,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:12,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:12,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:12,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:12,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2018-12-24 13:55:12,492 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:12,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:55:12,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:55:12,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:55:12,493 INFO L87 Difference]: Start difference. First operand 31 states and 101 transitions. Second operand 8 states. [2018-12-24 13:55:12,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:12,861 INFO L93 Difference]: Finished difference Result 59 states and 152 transitions. [2018-12-24 13:55:12,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:55:12,864 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-24 13:55:12,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:12,865 INFO L225 Difference]: With dead ends: 59 [2018-12-24 13:55:12,865 INFO L226 Difference]: Without dead ends: 58 [2018-12-24 13:55:12,866 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 [2018-12-24 13:55:12,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-24 13:55:12,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 34. [2018-12-24 13:55:12,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-24 13:55:12,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 119 transitions. [2018-12-24 13:55:12,880 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 119 transitions. Word has length 4 [2018-12-24 13:55:12,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:12,881 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 119 transitions. [2018-12-24 13:55:12,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:55:12,881 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 119 transitions. [2018-12-24 13:55:12,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:55:12,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:12,882 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:55:12,885 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:12,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:12,885 INFO L82 PathProgramCache]: Analyzing trace with hash 937744, now seen corresponding path program 1 times [2018-12-24 13:55:12,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:12,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:12,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:12,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:12,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:12,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:12,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:12,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:12,982 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:55:12,982 INFO L207 CegarAbsIntRunner]: [0], [14], [24], [25] [2018-12-24 13:55:12,983 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:12,983 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:12,989 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:12,989 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. [2018-12-24 13:55:12,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:12,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:12,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:12,990 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 [2018-12-24 13:55:13,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:13,002 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:13,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:13,009 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 [2018-12-24 13:55:13,017 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 [2018-12-24 13:55:13,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:13,025 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 [2018-12-24 13:55:13,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:13,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:13,041 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 [2018-12-24 13:55:13,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:13,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:13,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:13,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, 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 [2018-12-24 13:55:13,061 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:13,079 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:13,092 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:13,103 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:13,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:13,132 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. [2018-12-24 13:55:13,132 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2018-12-24 13:55:13,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:13,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:13,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:13,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:13,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:13,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:13,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:13,170 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 [2018-12-24 13:55:13,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:13,199 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. [2018-12-24 13:55:13,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2018-12-24 13:55:13,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:13,212 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:13,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:13,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:13,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-24 13:55:13,240 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:13,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 13:55:13,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 13:55:13,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:55:13,241 INFO L87 Difference]: Start difference. First operand 34 states and 119 transitions. Second operand 6 states. [2018-12-24 13:55:13,688 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2018-12-24 13:55:14,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:14,197 INFO L93 Difference]: Finished difference Result 51 states and 145 transitions. [2018-12-24 13:55:14,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 13:55:14,198 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2018-12-24 13:55:14,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:14,199 INFO L225 Difference]: With dead ends: 51 [2018-12-24 13:55:14,199 INFO L226 Difference]: Without dead ends: 50 [2018-12-24 13:55:14,199 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 [2018-12-24 13:55:14,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-24 13:55:14,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2018-12-24 13:55:14,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-24 13:55:14,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 125 transitions. [2018-12-24 13:55:14,210 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 125 transitions. Word has length 4 [2018-12-24 13:55:14,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:14,211 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 125 transitions. [2018-12-24 13:55:14,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 13:55:14,211 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 125 transitions. [2018-12-24 13:55:14,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:55:14,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:14,212 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:55:14,212 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:14,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:14,212 INFO L82 PathProgramCache]: Analyzing trace with hash 937308, now seen corresponding path program 1 times [2018-12-24 13:55:14,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:14,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:14,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:14,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:14,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:14,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:14,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:14,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:14,317 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:55:14,317 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [23] [2018-12-24 13:55:14,319 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:14,319 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:14,323 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:14,323 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. [2018-12-24 13:55:14,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:14,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:14,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:14,324 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 [2018-12-24 13:55:14,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:14,336 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:14,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:14,347 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 [2018-12-24 13:55:14,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,353 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 [2018-12-24 13:55:14,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,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 [2018-12-24 13:55:14,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,376 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 [2018-12-24 13:55:14,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,391 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,394 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 [2018-12-24 13:55:14,395 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:14,427 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:14,443 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:14,455 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:14,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:14,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. [2018-12-24 13:55:14,484 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2018-12-24 13:55:14,532 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,533 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,544 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 [2018-12-24 13:55:14,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:14,591 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. [2018-12-24 13:55:14,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:14,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:14,627 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 [2018-12-24 13:55:14,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:14,696 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. [2018-12-24 13:55:14,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:14,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:14,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:14,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:14,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:14,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:55:14,773 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:14,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:55:14,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:55:14,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:55:14,774 INFO L87 Difference]: Start difference. First operand 35 states and 125 transitions. Second operand 8 states. [2018-12-24 13:55:15,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:15,277 INFO L93 Difference]: Finished difference Result 64 states and 172 transitions. [2018-12-24 13:55:15,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:55:15,278 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-24 13:55:15,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:15,279 INFO L225 Difference]: With dead ends: 64 [2018-12-24 13:55:15,279 INFO L226 Difference]: Without dead ends: 63 [2018-12-24 13:55:15,279 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 [2018-12-24 13:55:15,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-24 13:55:15,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 37. [2018-12-24 13:55:15,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-24 13:55:15,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2018-12-24 13:55:15,287 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 4 [2018-12-24 13:55:15,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:15,288 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2018-12-24 13:55:15,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:55:15,288 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2018-12-24 13:55:15,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:55:15,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:15,289 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:55:15,289 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:15,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:15,289 INFO L82 PathProgramCache]: Analyzing trace with hash 29185378, now seen corresponding path program 1 times [2018-12-24 13:55:15,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:15,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:15,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:15,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:15,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:15,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:15,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:15,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:15,403 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:55:15,403 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [25] [2018-12-24 13:55:15,404 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:15,404 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:15,408 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:15,408 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. [2018-12-24 13:55:15,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:15,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:15,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:15,409 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 [2018-12-24 13:55:15,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:15,424 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:15,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:15,442 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 [2018-12-24 13:55:15,446 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 [2018-12-24 13:55:15,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:15,455 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 [2018-12-24 13:55:15,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:15,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:15,472 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 [2018-12-24 13:55:15,476 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:15,481 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:15,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:15,483 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 [2018-12-24 13:55:15,484 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:15,517 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:15,527 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:15,537 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:15,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:15,565 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. [2018-12-24 13:55:15,565 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2018-12-24 13:55:15,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:15,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:15,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:15,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:15,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:15,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:15,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:15,634 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 [2018-12-24 13:55:15,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:15,668 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. [2018-12-24 13:55:15,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:55:15,693 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:15,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:15,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:15,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:15,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:15,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:15,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:15,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:15,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:15,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 59 [2018-12-24 13:55:15,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:15,758 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. [2018-12-24 13:55:15,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2018-12-24 13:55:15,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:15,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:15,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:15,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:15,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:55:15,837 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:15,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:55:15,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:55:15,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:55:15,837 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 8 states. [2018-12-24 13:55:16,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:16,215 INFO L93 Difference]: Finished difference Result 57 states and 164 transitions. [2018-12-24 13:55:16,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:55:16,215 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-24 13:55:16,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:16,216 INFO L225 Difference]: With dead ends: 57 [2018-12-24 13:55:16,217 INFO L226 Difference]: Without dead ends: 56 [2018-12-24 13:55:16,217 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 [2018-12-24 13:55:16,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-24 13:55:16,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2018-12-24 13:55:16,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-24 13:55:16,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 143 transitions. [2018-12-24 13:55:16,229 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 143 transitions. Word has length 5 [2018-12-24 13:55:16,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:16,230 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 143 transitions. [2018-12-24 13:55:16,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:55:16,230 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 143 transitions. [2018-12-24 13:55:16,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:55:16,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:16,231 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:55:16,231 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:16,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:16,231 INFO L82 PathProgramCache]: Analyzing trace with hash 29184942, now seen corresponding path program 1 times [2018-12-24 13:55:16,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:16,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:16,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:16,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:16,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:16,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:16,395 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:16,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:16,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:16,396 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:55:16,396 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [23] [2018-12-24 13:55:16,397 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:16,397 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:16,401 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:16,402 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. [2018-12-24 13:55:16,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:16,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:16,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:16,402 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 [2018-12-24 13:55:16,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:16,419 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:16,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:16,437 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 [2018-12-24 13:55:16,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,445 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 [2018-12-24 13:55:16,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,455 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 [2018-12-24 13:55:16,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,544 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 [2018-12-24 13:55:16,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,659 INFO L303 Elim1Store]: Index analysis took 113 ms [2018-12-24 13:55:16,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, 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 [2018-12-24 13:55:16,661 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:16,803 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:16,822 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:16,835 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:16,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:16,868 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. [2018-12-24 13:55:16,869 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:55:16,896 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,897 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,911 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 [2018-12-24 13:55:16,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:16,957 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. [2018-12-24 13:55:16,958 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:16,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,983 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:16,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, 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 [2018-12-24 13:55:17,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:17,058 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. [2018-12-24 13:55:17,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2018-12-24 13:55:17,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:17,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:17,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:17,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:17,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:17,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:17,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:17,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:17,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:17,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:17,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:17,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:17,101 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:55:17,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:17,103 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 [2018-12-24 13:55:17,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:17,157 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. [2018-12-24 13:55:17,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2018-12-24 13:55:17,198 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:17,199 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:17,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:17,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:17,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:55:17,266 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:17,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:55:17,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:55:17,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:55:17,267 INFO L87 Difference]: Start difference. First operand 38 states and 143 transitions. Second operand 10 states. [2018-12-24 13:55:18,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:18,348 INFO L93 Difference]: Finished difference Result 68 states and 184 transitions. [2018-12-24 13:55:18,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:55:18,349 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2018-12-24 13:55:18,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:18,350 INFO L225 Difference]: With dead ends: 68 [2018-12-24 13:55:18,350 INFO L226 Difference]: Without dead ends: 67 [2018-12-24 13:55:18,350 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 [2018-12-24 13:55:18,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-24 13:55:18,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2018-12-24 13:55:18,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-24 13:55:18,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2018-12-24 13:55:18,361 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 5 [2018-12-24 13:55:18,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:18,361 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2018-12-24 13:55:18,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:55:18,361 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2018-12-24 13:55:18,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:55:18,362 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:18,362 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:55:18,362 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:18,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:18,363 INFO L82 PathProgramCache]: Analyzing trace with hash 29171924, now seen corresponding path program 1 times [2018-12-24 13:55:18,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:18,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:18,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:18,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:18,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:18,749 WARN L181 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2018-12-24 13:55:18,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:18,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:18,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:18,778 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:55:18,778 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [25] [2018-12-24 13:55:18,779 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:18,780 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:18,783 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:18,783 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. [2018-12-24 13:55:18,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:18,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:18,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:18,784 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 [2018-12-24 13:55:18,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:18,795 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:18,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:18,804 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 [2018-12-24 13:55:18,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:18,807 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 [2018-12-24 13:55:18,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:18,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:18,815 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 [2018-12-24 13:55:18,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:18,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:18,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:18,819 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 [2018-12-24 13:55:18,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:18,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:18,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:18,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:18,904 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 [2018-12-24 13:55:18,905 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:18,932 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:18,947 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:18,959 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:18,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:18,989 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. [2018-12-24 13:55:18,989 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2018-12-24 13:55:19,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:19,012 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:19,012 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:19,013 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:19,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:19,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:19,017 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:19,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:19,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:19,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:19,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:19,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 66 [2018-12-24 13:55:19,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:19,064 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. [2018-12-24 13:55:19,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:19,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:19,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:19,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:19,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:19,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:19,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:19,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:19,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:19,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:19,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:19,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:19,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:19,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:19,098 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 [2018-12-24 13:55:19,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:19,156 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. [2018-12-24 13:55:19,156 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:55:19,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:19,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:19,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:19,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:19,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:55:19,216 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:19,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:55:19,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:55:19,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:55:19,216 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 8 states. [2018-12-24 13:55:19,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:19,589 INFO L93 Difference]: Finished difference Result 56 states and 158 transitions. [2018-12-24 13:55:19,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:55:19,590 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-24 13:55:19,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:19,591 INFO L225 Difference]: With dead ends: 56 [2018-12-24 13:55:19,591 INFO L226 Difference]: Without dead ends: 55 [2018-12-24 13:55:19,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:55:19,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-24 13:55:19,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 37. [2018-12-24 13:55:19,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-24 13:55:19,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2018-12-24 13:55:19,602 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 5 [2018-12-24 13:55:19,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:19,602 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2018-12-24 13:55:19,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:55:19,602 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2018-12-24 13:55:19,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:55:19,603 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:19,603 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:55:19,603 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:19,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:19,604 INFO L82 PathProgramCache]: Analyzing trace with hash 29189286, now seen corresponding path program 1 times [2018-12-24 13:55:19,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:19,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:19,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:19,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:19,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:19,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:19,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:19,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:19,677 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:55:19,677 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [27] [2018-12-24 13:55:19,678 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:19,678 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:19,684 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:19,684 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. [2018-12-24 13:55:19,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:19,684 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:19,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:19,685 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 [2018-12-24 13:55:19,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:19,694 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:19,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:19,705 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 [2018-12-24 13:55:19,709 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 [2018-12-24 13:55:19,717 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 [2018-12-24 13:55:19,726 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:19,727 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 [2018-12-24 13:55:19,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:19,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:19,741 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 [2018-12-24 13:55:19,742 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:19,757 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:19,768 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:19,776 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:19,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:19,801 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. [2018-12-24 13:55:19,801 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2018-12-24 13:55:19,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:19,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:19,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:19,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:19,837 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 [2018-12-24 13:55:19,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:19,852 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. [2018-12-24 13:55:19,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2018-12-24 13:55:19,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:19,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:19,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:19,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:19,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-24 13:55:19,966 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:19,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 13:55:19,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 13:55:19,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:55:19,967 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 6 states. [2018-12-24 13:55:20,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:20,091 INFO L93 Difference]: Finished difference Result 45 states and 143 transitions. [2018-12-24 13:55:20,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 13:55:20,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-12-24 13:55:20,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:20,094 INFO L225 Difference]: With dead ends: 45 [2018-12-24 13:55:20,094 INFO L226 Difference]: Without dead ends: 44 [2018-12-24 13:55:20,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-12-24 13:55:20,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-24 13:55:20,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2018-12-24 13:55:20,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-24 13:55:20,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 138 transitions. [2018-12-24 13:55:20,104 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 138 transitions. Word has length 5 [2018-12-24 13:55:20,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:20,104 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 138 transitions. [2018-12-24 13:55:20,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 13:55:20,105 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 138 transitions. [2018-12-24 13:55:20,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:55:20,105 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:20,105 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:55:20,105 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:20,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:20,106 INFO L82 PathProgramCache]: Analyzing trace with hash 29175208, now seen corresponding path program 1 times [2018-12-24 13:55:20,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:20,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:20,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:20,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:20,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:20,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:20,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:20,220 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:20,220 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:55:20,220 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [23] [2018-12-24 13:55:20,221 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:20,221 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:20,224 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:20,224 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. [2018-12-24 13:55:20,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:20,225 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:20,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:20,225 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 [2018-12-24 13:55:20,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:20,241 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:20,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:20,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 [2018-12-24 13:55:20,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:20,255 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 [2018-12-24 13:55:20,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:20,260 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:20,261 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 [2018-12-24 13:55:20,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:20,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:20,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:20,274 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 [2018-12-24 13:55:20,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:20,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:20,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:20,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:20,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 [2018-12-24 13:55:20,287 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:20,316 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:20,329 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:20,339 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:20,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:20,722 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. [2018-12-24 13:55:20,723 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2018-12-24 13:55:20,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:20,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:20,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:20,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:20,863 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:20,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:20,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:20,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:20,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:20,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:20,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:20,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, 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 [2018-12-24 13:55:20,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:20,930 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. [2018-12-24 13:55:20,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:20,989 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:20,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:20,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:20,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:21,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:21,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:21,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:21,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:21,008 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:21,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:21,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:21,012 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:55:21,012 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 [2018-12-24 13:55:21,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55: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. [2018-12-24 13:55:21,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2018-12-24 13:55:21,110 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:21,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:21,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:21,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:21,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:21,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:21,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:21,126 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:21,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:21,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:21,132 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:21,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:21,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:21,140 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 [2018-12-24 13:55:21,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:21,192 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. [2018-12-24 13:55:21,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2018-12-24 13:55:21,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:21,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:21,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:21,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:21,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-24 13:55:21,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:21,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:55:21,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:55:21,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:55:21,273 INFO L87 Difference]: Start difference. First operand 39 states and 138 transitions. Second operand 10 states. [2018-12-24 13:55:21,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:21,844 INFO L93 Difference]: Finished difference Result 71 states and 207 transitions. [2018-12-24 13:55:21,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:55:21,847 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2018-12-24 13:55:21,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:21,847 INFO L225 Difference]: With dead ends: 71 [2018-12-24 13:55:21,848 INFO L226 Difference]: Without dead ends: 70 [2018-12-24 13:55:21,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2018-12-24 13:55:21,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-24 13:55:21,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 40. [2018-12-24 13:55:21,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-24 13:55:21,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 144 transitions. [2018-12-24 13:55:21,859 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 144 transitions. Word has length 5 [2018-12-24 13:55:21,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:21,859 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 144 transitions. [2018-12-24 13:55:21,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:55:21,859 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 144 transitions. [2018-12-24 13:55:21,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:55:21,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:21,860 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:55:21,860 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:21,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:21,860 INFO L82 PathProgramCache]: Analyzing trace with hash 29179612, now seen corresponding path program 1 times [2018-12-24 13:55:21,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:21,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:21,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:21,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:21,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:21,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:21,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:21,946 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:21,946 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:55:21,946 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [25] [2018-12-24 13:55:21,947 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:21,947 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:21,951 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:21,951 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. [2018-12-24 13:55:21,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:21,952 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:21,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:21,952 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 [2018-12-24 13:55:21,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:21,966 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:21,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:21,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:21,977 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 [2018-12-24 13:55:21,980 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 [2018-12-24 13:55:21,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:21,986 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 [2018-12-24 13:55:21,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:21,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:21,994 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 [2018-12-24 13:55:22,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:22,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:22,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:22,006 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 [2018-12-24 13:55:22,006 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:22,026 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:22,037 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:22,046 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:22,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:22,073 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. [2018-12-24 13:55:22,073 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2018-12-24 13:55:22,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:22,110 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:22,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:22,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:22,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:22,113 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:22,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:22,115 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 [2018-12-24 13:55:22,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:22,143 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. [2018-12-24 13:55:22,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:55:22,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:22,197 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:22,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:22,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:22,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:22,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:22,201 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:22,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:22,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:22,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, 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 [2018-12-24 13:55:22,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:22,290 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. [2018-12-24 13:55:22,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2018-12-24 13:55:22,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:22,306 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:22,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:22,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:22,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:55:22,345 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:22,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:55:22,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:55:22,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:55:22,345 INFO L87 Difference]: Start difference. First operand 40 states and 144 transitions. Second operand 8 states. [2018-12-24 13:55:22,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:22,640 INFO L93 Difference]: Finished difference Result 59 states and 171 transitions. [2018-12-24 13:55:22,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:55:22,641 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-24 13:55:22,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:22,642 INFO L225 Difference]: With dead ends: 59 [2018-12-24 13:55:22,642 INFO L226 Difference]: Without dead ends: 58 [2018-12-24 13:55:22,643 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 [2018-12-24 13:55:22,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-24 13:55:22,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2018-12-24 13:55:22,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-24 13:55:22,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2018-12-24 13:55:22,653 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 5 [2018-12-24 13:55:22,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:22,654 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2018-12-24 13:55:22,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:55:22,654 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2018-12-24 13:55:22,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:55:22,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:22,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:55:22,655 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:22,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:22,655 INFO L82 PathProgramCache]: Analyzing trace with hash 29179176, now seen corresponding path program 1 times [2018-12-24 13:55:22,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:22,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:22,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:22,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:22,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:22,987 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 17 [2018-12-24 13:55:23,013 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:23,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:23,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:23,013 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:55:23,013 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [23] [2018-12-24 13:55:23,017 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:23,017 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:23,021 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:23,021 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. [2018-12-24 13:55:23,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:23,021 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:23,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:23,022 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 [2018-12-24 13:55:23,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:23,033 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:23,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:23,054 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 [2018-12-24 13:55:23,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,080 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 [2018-12-24 13:55:23,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,085 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 [2018-12-24 13:55:23,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,091 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 [2018-12-24 13:55:23,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,102 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 [2018-12-24 13:55:23,103 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:23,132 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:23,148 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:23,160 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:23,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:23,187 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. [2018-12-24 13:55:23,187 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:55:23,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,214 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,226 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 [2018-12-24 13:55:23,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:23,287 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. [2018-12-24 13:55:23,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:23,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,322 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,323 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,325 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,326 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 [2018-12-24 13:55:23,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:23,374 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. [2018-12-24 13:55:23,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2018-12-24 13:55:23,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,467 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:55:23,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:23,469 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 [2018-12-24 13:55:23,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:23,549 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. [2018-12-24 13:55:23,549 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2018-12-24 13:55:23,581 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:23,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:23,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:23,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:23,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:55:23,641 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:23,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:55:23,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:55:23,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:55:23,642 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 10 states. [2018-12-24 13:55:24,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:24,400 INFO L93 Difference]: Finished difference Result 71 states and 197 transitions. [2018-12-24 13:55:24,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:55:24,401 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2018-12-24 13:55:24,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:24,402 INFO L225 Difference]: With dead ends: 71 [2018-12-24 13:55:24,402 INFO L226 Difference]: Without dead ends: 70 [2018-12-24 13:55:24,403 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 [2018-12-24 13:55:24,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-24 13:55:24,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 38. [2018-12-24 13:55:24,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-24 13:55:24,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 132 transitions. [2018-12-24 13:55:24,414 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 132 transitions. Word has length 5 [2018-12-24 13:55:24,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:24,414 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 132 transitions. [2018-12-24 13:55:24,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:55:24,414 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 132 transitions. [2018-12-24 13:55:24,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:55:24,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:24,415 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:55:24,415 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:24,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:24,415 INFO L82 PathProgramCache]: Analyzing trace with hash 29231506, now seen corresponding path program 1 times [2018-12-24 13:55:24,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:24,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:24,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:24,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:24,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:24,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:55:24,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:24,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:24,532 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:55:24,532 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [25] [2018-12-24 13:55:24,533 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:24,534 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:24,536 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:24,536 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. [2018-12-24 13:55:24,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:24,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:24,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:24,537 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 [2018-12-24 13:55:24,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:24,545 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:24,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:24,555 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 [2018-12-24 13:55:24,561 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:24,561 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 [2018-12-24 13:55:24,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:24,571 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:24,571 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 [2018-12-24 13:55:24,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:24,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:24,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:24,577 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 [2018-12-24 13:55:24,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:24,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:24,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:24,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:24,586 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 [2018-12-24 13:55:24,587 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:24,613 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:24,628 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:24,640 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:24,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:24,670 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. [2018-12-24 13:55:24,670 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2018-12-24 13:55:24,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:24,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:24,693 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:24,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:24,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:24,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:24,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:24,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:24,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:24,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:24,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:24,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 [2018-12-24 13:55:24,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:24,748 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. [2018-12-24 13:55:24,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:24,933 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-12-24 13:55:24,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:24,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:25,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:25,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:25,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:25,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:25,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:25,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:25,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:25,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:25,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:25,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:25,251 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:55:25,251 INFO L303 Elim1Store]: Index analysis took 315 ms [2018-12-24 13:55:25,252 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 [2018-12-24 13:55:25,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:25,775 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. [2018-12-24 13:55:25,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:25,973 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-12-24 13:55:25,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:25,975 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:26,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:26,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:26,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:55:26,133 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:26,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:55:26,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:55:26,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:55:26,134 INFO L87 Difference]: Start difference. First operand 38 states and 132 transitions. Second operand 8 states. [2018-12-24 13:55:26,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:26,514 INFO L93 Difference]: Finished difference Result 66 states and 183 transitions. [2018-12-24 13:55:26,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:55:26,515 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-24 13:55:26,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:26,516 INFO L225 Difference]: With dead ends: 66 [2018-12-24 13:55:26,516 INFO L226 Difference]: Without dead ends: 65 [2018-12-24 13:55:26,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:55:26,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-24 13:55:26,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 41. [2018-12-24 13:55:26,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-24 13:55:26,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2018-12-24 13:55:26,532 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 5 [2018-12-24 13:55:26,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:26,532 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2018-12-24 13:55:26,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:55:26,533 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2018-12-24 13:55:26,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:55:26,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:26,533 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:55:26,534 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:26,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:26,534 INFO L82 PathProgramCache]: Analyzing trace with hash 29231070, now seen corresponding path program 1 times [2018-12-24 13:55:26,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:26,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:26,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:26,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:26,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:26,778 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 18 [2018-12-24 13:55:26,841 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:26,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:26,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:26,841 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:55:26,841 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [23] [2018-12-24 13:55:26,845 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:26,845 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:26,848 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:26,849 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. [2018-12-24 13:55:26,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:26,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:26,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:26,849 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 [2018-12-24 13:55:26,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:26,864 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:26,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:26,877 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 [2018-12-24 13:55:26,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:26,884 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 [2018-12-24 13:55:26,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:26,892 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:26,892 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 [2018-12-24 13:55:26,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:26,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:26,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:26,909 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 [2018-12-24 13:55:26,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:26,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:26,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:26,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:26,926 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 [2018-12-24 13:55:26,927 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:26,965 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:26,982 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:26,995 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:27,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:27,028 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. [2018-12-24 13:55:27,028 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2018-12-24 13:55:27,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,058 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,062 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,066 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 [2018-12-24 13:55:27,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:27,114 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. [2018-12-24 13:55:27,115 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:27,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,155 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:55:27,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, 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 [2018-12-24 13:55:27,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:27,207 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. [2018-12-24 13:55:27,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:27,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,260 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:27,263 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 [2018-12-24 13:55:27,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:27,320 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. [2018-12-24 13:55:27,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:27,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:27,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:27,382 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:27,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:27,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:55:27,401 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:27,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:55:27,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:55:27,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:55:27,402 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 10 states. [2018-12-24 13:55:28,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:28,045 INFO L93 Difference]: Finished difference Result 93 states and 253 transitions. [2018-12-24 13:55:28,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:55:28,046 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2018-12-24 13:55:28,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:28,047 INFO L225 Difference]: With dead ends: 93 [2018-12-24 13:55:28,047 INFO L226 Difference]: Without dead ends: 92 [2018-12-24 13:55:28,048 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 [2018-12-24 13:55:28,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-24 13:55:28,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 48. [2018-12-24 13:55:28,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-24 13:55:28,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 192 transitions. [2018-12-24 13:55:28,060 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 192 transitions. Word has length 5 [2018-12-24 13:55:28,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:28,060 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 192 transitions. [2018-12-24 13:55:28,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:55:28,060 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 192 transitions. [2018-12-24 13:55:28,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:55:28,061 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:28,061 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:55:28,061 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:28,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:28,061 INFO L82 PathProgramCache]: Analyzing trace with hash 29248868, now seen corresponding path program 1 times [2018-12-24 13:55:28,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:28,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:28,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:28,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:28,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:28,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:28,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:28,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:28,131 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:55:28,131 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [27] [2018-12-24 13:55:28,132 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:28,132 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:28,134 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:28,135 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. [2018-12-24 13:55:28,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:28,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:28,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:28,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 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 [2018-12-24 13:55:28,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:28,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:28,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:28,171 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 [2018-12-24 13:55:28,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, 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 [2018-12-24 13:55:28,208 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 [2018-12-24 13:55:28,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:28,224 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 [2018-12-24 13:55:28,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:28,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:28,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, 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 [2018-12-24 13:55:28,235 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:28,249 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:28,259 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:28,269 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:28,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:28,292 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. [2018-12-24 13:55:28,292 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2018-12-24 13:55:28,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:28,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:28,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:28,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:28,319 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 [2018-12-24 13:55:28,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:28,335 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. [2018-12-24 13:55:28,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2018-12-24 13:55:28,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:28,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:28,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:28,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-24 13:55:28,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2018-12-24 13:55:28,374 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:55:28,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 13:55:28,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 13:55:28,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:55:28,374 INFO L87 Difference]: Start difference. First operand 48 states and 192 transitions. Second operand 4 states. [2018-12-24 13:55:28,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:28,417 INFO L93 Difference]: Finished difference Result 56 states and 215 transitions. [2018-12-24 13:55:28,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 13:55:28,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-24 13:55:28,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:28,422 INFO L225 Difference]: With dead ends: 56 [2018-12-24 13:55:28,422 INFO L226 Difference]: Without dead ends: 55 [2018-12-24 13:55:28,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:55:28,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-24 13:55:28,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2018-12-24 13:55:28,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-24 13:55:28,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 211 transitions. [2018-12-24 13:55:28,436 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 211 transitions. Word has length 5 [2018-12-24 13:55:28,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:28,436 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 211 transitions. [2018-12-24 13:55:28,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 13:55:28,436 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 211 transitions. [2018-12-24 13:55:28,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:55:28,437 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:28,437 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:55:28,437 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:28,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:28,437 INFO L82 PathProgramCache]: Analyzing trace with hash 29235350, now seen corresponding path program 1 times [2018-12-24 13:55:28,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:28,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:28,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:28,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:28,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:28,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:28,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:28,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:28,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:28,492 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:55:28,492 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [25] [2018-12-24 13:55:28,493 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:28,493 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:28,496 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:28,496 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. [2018-12-24 13:55:28,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:28,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:28,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:28,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 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 [2018-12-24 13:55:28,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:28,505 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:28,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:28,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 [2018-12-24 13:55:28,519 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 [2018-12-24 13:55:28,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:28,527 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 [2018-12-24 13:55:28,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:28,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:28,542 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 [2018-12-24 13:55:28,548 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:28,552 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:28,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:28,554 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 [2018-12-24 13:55:28,555 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:28,576 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:28,587 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:28,597 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:28,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:28,622 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. [2018-12-24 13:55:28,623 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2018-12-24 13:55:29,625 WARN L181 SmtUtils]: Spent 997.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2018-12-24 13:55:29,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:29,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:29,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:29,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:29,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:29,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:29,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:29,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 [2018-12-24 13:55:29,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:29,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. [2018-12-24 13:55:29,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2018-12-24 13:55:29,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:29,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:29,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:29,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:29,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:29,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:29,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:29,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:29,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:29,719 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 [2018-12-24 13:55:29,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:29,748 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. [2018-12-24 13:55:29,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2018-12-24 13:55:29,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:29,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:29,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:29,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:29,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:55:29,800 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:29,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:55:29,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:55:29,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:55:29,800 INFO L87 Difference]: Start difference. First operand 52 states and 211 transitions. Second operand 8 states. [2018-12-24 13:55:30,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:30,156 INFO L93 Difference]: Finished difference Result 85 states and 266 transitions. [2018-12-24 13:55:30,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:55:30,156 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-24 13:55:30,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:30,157 INFO L225 Difference]: With dead ends: 85 [2018-12-24 13:55:30,158 INFO L226 Difference]: Without dead ends: 84 [2018-12-24 13:55:30,158 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 [2018-12-24 13:55:30,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-24 13:55:30,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 54. [2018-12-24 13:55:30,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-24 13:55:30,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 223 transitions. [2018-12-24 13:55:30,177 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 223 transitions. Word has length 5 [2018-12-24 13:55:30,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:30,177 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 223 transitions. [2018-12-24 13:55:30,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:55:30,177 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 223 transitions. [2018-12-24 13:55:30,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:55:30,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:30,178 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:55:30,178 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:30,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:30,179 INFO L82 PathProgramCache]: Analyzing trace with hash 29235038, now seen corresponding path program 1 times [2018-12-24 13:55:30,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:30,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:30,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:30,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:30,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:30,337 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:30,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:30,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:30,338 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:55:30,338 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [23] [2018-12-24 13:55:30,339 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:30,339 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:30,341 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:30,342 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. [2018-12-24 13:55:30,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:30,342 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:30,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:30,342 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-24 13:55:30,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:30,351 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:30,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:30,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:30,359 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 [2018-12-24 13:55:30,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,365 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 [2018-12-24 13:55:30,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,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, 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 [2018-12-24 13:55:30,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,380 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,380 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,381 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 [2018-12-24 13:55:30,384 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,387 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,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 [2018-12-24 13:55:30,390 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:30,418 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:30,433 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:30,444 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:30,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:30,472 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. [2018-12-24 13:55:30,472 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:55:30,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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 [2018-12-24 13:55:30,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:30,552 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. [2018-12-24 13:55:30,553 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:30,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,577 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,581 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,590 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 [2018-12-24 13:55:30,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:30,634 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. [2018-12-24 13:55:30,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:30,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,663 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,672 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:30,675 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:55:30,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, 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 [2018-12-24 13:55:30,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:30,778 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. [2018-12-24 13:55:30,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:55:30,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:30,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:30,851 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:30,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:30,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:55:30,871 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:30,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:55:30,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:55:30,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:55:30,872 INFO L87 Difference]: Start difference. First operand 54 states and 223 transitions. Second operand 10 states. [2018-12-24 13:55:31,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:31,669 INFO L93 Difference]: Finished difference Result 96 states and 303 transitions. [2018-12-24 13:55:31,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:55:31,670 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2018-12-24 13:55:31,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:31,671 INFO L225 Difference]: With dead ends: 96 [2018-12-24 13:55:31,671 INFO L226 Difference]: Without dead ends: 94 [2018-12-24 13:55:31,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:55:31,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-24 13:55:31,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 61. [2018-12-24 13:55:31,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-24 13:55:31,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 265 transitions. [2018-12-24 13:55:31,689 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 265 transitions. Word has length 5 [2018-12-24 13:55:31,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:31,689 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 265 transitions. [2018-12-24 13:55:31,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:55:31,689 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 265 transitions. [2018-12-24 13:55:31,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:55:31,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:31,690 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:55:31,690 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:31,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:31,690 INFO L82 PathProgramCache]: Analyzing trace with hash 29239194, now seen corresponding path program 1 times [2018-12-24 13:55:31,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:31,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:31,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:31,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:31,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:31,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:31,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:31,817 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:31,817 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:55:31,817 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [25] [2018-12-24 13:55:31,818 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:31,819 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:31,822 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:31,822 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. [2018-12-24 13:55:31,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:31,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:31,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:31,823 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 [2018-12-24 13:55:31,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:31,834 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:31,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:31,842 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 [2018-12-24 13:55:31,846 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 [2018-12-24 13:55:31,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:31,853 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 [2018-12-24 13:55:31,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:31,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:31,874 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 [2018-12-24 13:55:31,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:31,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:31,887 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:31,888 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 [2018-12-24 13:55:31,888 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:31,906 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:31,917 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:31,927 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:31,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:31,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. [2018-12-24 13:55:31,953 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2018-12-24 13:55:31,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:31,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:31,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:31,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:31,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:31,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:32,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:32,001 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 [2018-12-24 13:55:32,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:32,027 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. [2018-12-24 13:55:32,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:55:32,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:32,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:32,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:32,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:32,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:32,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:32,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:32,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:32,052 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:55:32,053 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 [2018-12-24 13:55:32,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:32,083 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. [2018-12-24 13:55:32,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2018-12-24 13:55:32,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:32,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:32,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:32,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:32,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:55:32,142 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:32,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:55:32,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:55:32,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:55:32,143 INFO L87 Difference]: Start difference. First operand 61 states and 265 transitions. Second operand 8 states. [2018-12-24 13:55:32,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:32,490 INFO L93 Difference]: Finished difference Result 82 states and 289 transitions. [2018-12-24 13:55:32,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:55:32,491 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-24 13:55:32,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:32,492 INFO L225 Difference]: With dead ends: 82 [2018-12-24 13:55:32,492 INFO L226 Difference]: Without dead ends: 81 [2018-12-24 13:55:32,493 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 [2018-12-24 13:55:32,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-24 13:55:32,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 61. [2018-12-24 13:55:32,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-24 13:55:32,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 265 transitions. [2018-12-24 13:55:32,513 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 265 transitions. Word has length 5 [2018-12-24 13:55:32,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:32,513 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 265 transitions. [2018-12-24 13:55:32,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:55:32,513 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 265 transitions. [2018-12-24 13:55:32,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:55:32,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:32,514 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:55:32,514 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:32,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:32,514 INFO L82 PathProgramCache]: Analyzing trace with hash 28818276, now seen corresponding path program 1 times [2018-12-24 13:55:32,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:32,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:32,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:32,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:32,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:32,776 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-12-24 13:55:32,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:32,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:32,792 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:32,792 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:55:32,792 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [25] [2018-12-24 13:55:32,793 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:32,793 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:32,795 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:32,796 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. [2018-12-24 13:55:32,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:32,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:32,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:32,796 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 [2018-12-24 13:55:32,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:32,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:32,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:32,815 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 [2018-12-24 13:55:32,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:32,818 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 [2018-12-24 13:55:32,841 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:32,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:32,867 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 [2018-12-24 13:55:32,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:32,931 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:32,961 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:32,962 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 [2018-12-24 13:55:32,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:32,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:32,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:32,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:32,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 [2018-12-24 13:55:32,977 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:33,003 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:33,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:33,031 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:33,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:33,060 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. [2018-12-24 13:55:33,060 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2018-12-24 13:55:33,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,092 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 [2018-12-24 13:55:33,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:33,136 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. [2018-12-24 13:55:33,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:33,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,311 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,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, 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 [2018-12-24 13:55:33,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:33,365 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. [2018-12-24 13:55:33,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:33,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:33,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:33,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:33,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:33,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2018-12-24 13:55:33,414 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:33,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:55:33,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:55:33,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:55:33,415 INFO L87 Difference]: Start difference. First operand 61 states and 265 transitions. Second operand 8 states. [2018-12-24 13:55:33,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:33,730 INFO L93 Difference]: Finished difference Result 87 states and 319 transitions. [2018-12-24 13:55:33,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:55:33,730 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-24 13:55:33,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:33,732 INFO L225 Difference]: With dead ends: 87 [2018-12-24 13:55:33,732 INFO L226 Difference]: Without dead ends: 86 [2018-12-24 13:55:33,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:55:33,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-24 13:55:33,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 67. [2018-12-24 13:55:33,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-24 13:55:33,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 302 transitions. [2018-12-24 13:55:33,753 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 302 transitions. Word has length 5 [2018-12-24 13:55:33,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:33,754 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 302 transitions. [2018-12-24 13:55:33,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:55:33,754 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 302 transitions. [2018-12-24 13:55:33,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:55:33,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:33,754 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:55:33,755 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:33,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:33,755 INFO L82 PathProgramCache]: Analyzing trace with hash 28822120, now seen corresponding path program 1 times [2018-12-24 13:55:33,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:33,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:33,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:33,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:33,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:33,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:55:33,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:33,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:33,845 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:55:33,846 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [25] [2018-12-24 13:55:33,846 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:33,846 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:33,849 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:33,849 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. [2018-12-24 13:55:33,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:33,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:33,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:33,850 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 [2018-12-24 13:55:33,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:33,862 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:33,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:33,875 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 [2018-12-24 13:55:33,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,880 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 [2018-12-24 13:55:33,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,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 [2018-12-24 13:55:33,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,892 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2018-12-24 13:55:33,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:33,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, 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 [2018-12-24 13:55:33,908 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:33,940 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:33,987 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:33,999 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:34,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:34,029 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. [2018-12-24 13:55:34,029 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2018-12-24 13:55:34,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:34,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:34,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:34,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:34,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:34,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:34,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:34,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:34,058 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:34,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:34,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:34,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, 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 [2018-12-24 13:55:34,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:34,106 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. [2018-12-24 13:55:34,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:34,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:34,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:34,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:34,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:34,131 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:34,133 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:34,134 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:34,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:34,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:34,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:34,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:34,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:34,140 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:55:34,141 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 [2018-12-24 13:55:34,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:34,187 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. [2018-12-24 13:55:34,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:34,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:34,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:34,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:34,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:34,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:55:34,251 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:34,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:55:34,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:55:34,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:55:34,252 INFO L87 Difference]: Start difference. First operand 67 states and 302 transitions. Second operand 8 states. [2018-12-24 13:55:34,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:34,584 INFO L93 Difference]: Finished difference Result 86 states and 334 transitions. [2018-12-24 13:55:34,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:55:34,584 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-24 13:55:34,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:34,586 INFO L225 Difference]: With dead ends: 86 [2018-12-24 13:55:34,586 INFO L226 Difference]: Without dead ends: 85 [2018-12-24 13:55:34,587 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 [2018-12-24 13:55:34,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-24 13:55:34,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2018-12-24 13:55:34,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-24 13:55:34,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 314 transitions. [2018-12-24 13:55:34,610 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 314 transitions. Word has length 5 [2018-12-24 13:55:34,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:34,610 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 314 transitions. [2018-12-24 13:55:34,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:55:34,610 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 314 transitions. [2018-12-24 13:55:34,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:55:34,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:34,611 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:55:34,611 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:34,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:34,611 INFO L82 PathProgramCache]: Analyzing trace with hash 28947050, now seen corresponding path program 2 times [2018-12-24 13:55:34,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:34,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:34,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:34,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:34,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:34,903 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2018-12-24 13:55:35,169 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-12-24 13:55:35,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:35,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:35,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:35,237 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:55:35,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:55:35,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:35,237 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 [2018-12-24 13:55:35,256 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:55:35,256 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:55:35,262 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-24 13:55:35,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:55:35,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:35,268 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 [2018-12-24 13:55:35,271 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 [2018-12-24 13:55:35,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:35,293 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 [2018-12-24 13:55:35,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:35,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:35,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 [2018-12-24 13:55:35,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:35,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:35,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:35,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 [2018-12-24 13:55:35,316 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:35,335 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:35,347 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:35,358 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:35,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:35,385 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. [2018-12-24 13:55:35,385 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2018-12-24 13:55:35,411 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:35,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:35,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:35,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:35,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:35,417 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:35,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:35,420 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 [2018-12-24 13:55:35,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:35,448 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. [2018-12-24 13:55:35,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:55:35,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:35,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:35,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:35,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:35,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:35,473 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:35,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:35,476 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:35,477 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:35,478 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 [2018-12-24 13:55:35,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:35,507 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. [2018-12-24 13:55:35,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2018-12-24 13:55:35,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:35,523 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:35,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:35,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:35,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2018-12-24 13:55:35,593 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:35,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:55:35,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:55:35,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:55:35,594 INFO L87 Difference]: Start difference. First operand 69 states and 314 transitions. Second operand 8 states. [2018-12-24 13:55:36,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:36,431 INFO L93 Difference]: Finished difference Result 110 states and 397 transitions. [2018-12-24 13:55:36,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:55:36,432 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-24 13:55:36,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:36,433 INFO L225 Difference]: With dead ends: 110 [2018-12-24 13:55:36,433 INFO L226 Difference]: Without dead ends: 107 [2018-12-24 13:55:36,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:55:36,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-24 13:55:36,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 78. [2018-12-24 13:55:36,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-24 13:55:36,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 360 transitions. [2018-12-24 13:55:36,456 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 360 transitions. Word has length 5 [2018-12-24 13:55:36,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:36,456 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 360 transitions. [2018-12-24 13:55:36,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:55:36,456 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 360 transitions. [2018-12-24 13:55:36,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:55:36,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:36,457 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:55:36,457 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:36,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:36,457 INFO L82 PathProgramCache]: Analyzing trace with hash 28950958, now seen corresponding path program 1 times [2018-12-24 13:55:36,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:36,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:36,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:55:36,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:36,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:36,598 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2018-12-24 13:55:36,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:36,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:36,607 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:36,607 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:55:36,607 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [26], [27] [2018-12-24 13:55:36,609 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:36,610 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:36,613 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:36,613 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. [2018-12-24 13:55:36,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:36,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:36,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:36,614 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 [2018-12-24 13:55:36,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:36,623 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:36,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:36,631 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 [2018-12-24 13:55:36,635 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 [2018-12-24 13:55:36,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:36,643 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 [2018-12-24 13:55:36,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:36,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:36,653 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 [2018-12-24 13:55:36,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:36,663 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:36,664 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:36,665 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 [2018-12-24 13:55:36,665 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:36,688 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:36,700 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:36,710 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:36,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:36,736 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. [2018-12-24 13:55:36,737 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2018-12-24 13:55:36,764 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:36,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:36,766 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:36,767 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:36,768 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:36,770 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:36,771 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:36,772 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 [2018-12-24 13:55:36,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:36,798 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. [2018-12-24 13:55:36,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2018-12-24 13:55:36,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:36,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:36,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:36,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:36,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-24 13:55:36,846 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:36,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 13:55:36,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 13:55:36,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:55:36,847 INFO L87 Difference]: Start difference. First operand 78 states and 360 transitions. Second operand 6 states. [2018-12-24 13:55:37,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:37,103 INFO L93 Difference]: Finished difference Result 87 states and 367 transitions. [2018-12-24 13:55:37,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 13:55:37,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-12-24 13:55:37,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:37,105 INFO L225 Difference]: With dead ends: 87 [2018-12-24 13:55:37,106 INFO L226 Difference]: Without dead ends: 86 [2018-12-24 13:55:37,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-12-24 13:55:37,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-24 13:55:37,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2018-12-24 13:55:37,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-24 13:55:37,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 357 transitions. [2018-12-24 13:55:37,128 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 357 transitions. Word has length 5 [2018-12-24 13:55:37,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:37,128 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 357 transitions. [2018-12-24 13:55:37,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 13:55:37,129 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 357 transitions. [2018-12-24 13:55:37,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:55:37,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:37,129 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:55:37,129 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:37,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:37,130 INFO L82 PathProgramCache]: Analyzing trace with hash 29052324, now seen corresponding path program 1 times [2018-12-24 13:55:37,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:37,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:37,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:37,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:37,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:37,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:37,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:37,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:37,276 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:55:37,276 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [23] [2018-12-24 13:55:37,277 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:37,277 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:37,280 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:37,280 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. [2018-12-24 13:55:37,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:37,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:37,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:37,280 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 [2018-12-24 13:55:37,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:37,288 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:37,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:37,297 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 [2018-12-24 13:55:37,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,300 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 [2018-12-24 13:55:37,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,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 [2018-12-24 13:55:37,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,311 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,313 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 [2018-12-24 13:55:37,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,321 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 [2018-12-24 13:55:37,321 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:37,349 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:37,363 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:37,375 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:37,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:37,404 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. [2018-12-24 13:55:37,404 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2018-12-24 13:55:37,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,431 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,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 [2018-12-24 13:55:37,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:37,481 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. [2018-12-24 13:55:37,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:37,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,510 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,512 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,515 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:55:37,516 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 [2018-12-24 13:55:37,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:37,560 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. [2018-12-24 13:55:37,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:37,581 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:37,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 86 [2018-12-24 13:55:37,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:37,643 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. [2018-12-24 13:55:37,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:37,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:37,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:37,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:37,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:37,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:55:37,716 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:37,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:55:37,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:55:37,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:55:37,717 INFO L87 Difference]: Start difference. First operand 76 states and 357 transitions. Second operand 10 states. [2018-12-24 13:55:38,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:38,283 INFO L93 Difference]: Finished difference Result 133 states and 461 transitions. [2018-12-24 13:55:38,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:55:38,283 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2018-12-24 13:55:38,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:38,285 INFO L225 Difference]: With dead ends: 133 [2018-12-24 13:55:38,285 INFO L226 Difference]: Without dead ends: 132 [2018-12-24 13:55:38,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:55:38,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-24 13:55:38,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 75. [2018-12-24 13:55:38,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-24 13:55:38,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 351 transitions. [2018-12-24 13:55:38,306 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 351 transitions. Word has length 5 [2018-12-24 13:55:38,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:38,307 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 351 transitions. [2018-12-24 13:55:38,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:55:38,307 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 351 transitions. [2018-12-24 13:55:38,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:55:38,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:38,307 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:55:38,308 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:38,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:38,308 INFO L82 PathProgramCache]: Analyzing trace with hash 29056604, now seen corresponding path program 1 times [2018-12-24 13:55:38,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:38,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:38,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:38,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:38,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:38,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:38,456 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-12-24 13:55:38,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:38,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:38,465 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:38,465 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:55:38,465 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [25] [2018-12-24 13:55:38,466 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:38,466 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:38,468 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:38,468 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. [2018-12-24 13:55:38,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:38,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:38,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:38,469 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 [2018-12-24 13:55:38,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:38,480 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:38,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:38,488 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 [2018-12-24 13:55:38,490 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 [2018-12-24 13:55:38,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:38,496 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 [2018-12-24 13:55:38,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:38,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:38,507 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 [2018-12-24 13:55:38,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:38,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:38,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:38,517 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 [2018-12-24 13:55:38,517 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:38,538 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:38,549 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:38,559 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:38,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:38,586 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. [2018-12-24 13:55:38,586 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2018-12-24 13:55:38,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:38,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:38,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:38,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:38,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:38,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:38,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:38,622 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 [2018-12-24 13:55:38,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:38,652 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. [2018-12-24 13:55:38,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2018-12-24 13:55:38,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:38,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:38,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:38,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:38,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:38,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:38,674 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:38,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:38,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:38,677 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 [2018-12-24 13:55:38,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:38,709 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. [2018-12-24 13:55:38,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2018-12-24 13:55:38,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:38,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:38,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:38,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:38,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:55:38,760 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:38,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:55:38,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:55:38,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:55:38,761 INFO L87 Difference]: Start difference. First operand 75 states and 351 transitions. Second operand 8 states. [2018-12-24 13:55:39,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:39,110 INFO L93 Difference]: Finished difference Result 113 states and 411 transitions. [2018-12-24 13:55:39,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:55:39,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-24 13:55:39,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:39,111 INFO L225 Difference]: With dead ends: 113 [2018-12-24 13:55:39,111 INFO L226 Difference]: Without dead ends: 112 [2018-12-24 13:55:39,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:55:39,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-24 13:55:39,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 77. [2018-12-24 13:55:39,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-24 13:55:39,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 363 transitions. [2018-12-24 13:55:39,136 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 363 transitions. Word has length 5 [2018-12-24 13:55:39,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:39,136 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 363 transitions. [2018-12-24 13:55:39,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:55:39,136 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 363 transitions. [2018-12-24 13:55:39,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:55:39,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:39,137 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-12-24 13:55:39,137 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:39,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:39,138 INFO L82 PathProgramCache]: Analyzing trace with hash 904669396, now seen corresponding path program 2 times [2018-12-24 13:55:39,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:39,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:39,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:39,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:39,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:39,244 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:55:39,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:39,244 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:39,244 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:55:39,244 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:55:39,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:39,244 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 [2018-12-24 13:55:39,252 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:55:39,252 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:55:39,259 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:55:39,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:55:39,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:39,264 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 [2018-12-24 13:55:39,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,266 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 [2018-12-24 13:55:39,271 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,274 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 [2018-12-24 13:55:39,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,281 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 [2018-12-24 13:55:39,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,287 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,292 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 [2018-12-24 13:55:39,293 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:39,340 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:39,384 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:39,396 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:39,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55: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. [2018-12-24 13:55:39,425 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2018-12-24 13:55:39,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,463 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 [2018-12-24 13:55:39,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:39,507 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. [2018-12-24 13:55:39,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:39,533 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,544 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,547 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 [2018-12-24 13:55:39,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:39,594 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. [2018-12-24 13:55:39,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2018-12-24 13:55:39,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,632 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 [2018-12-24 13:55:39,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:39,680 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. [2018-12-24 13:55:39,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2018-12-24 13:55:39,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,726 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:39,728 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 [2018-12-24 13:55:39,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:39,784 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. [2018-12-24 13:55:39,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:55:39,809 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:39,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:39,883 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:39,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:39,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2018-12-24 13:55:39,903 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:39,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-24 13:55:39,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-24 13:55:39,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:55:39,903 INFO L87 Difference]: Start difference. First operand 77 states and 363 transitions. Second operand 11 states. [2018-12-24 13:55:40,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:40,686 INFO L93 Difference]: Finished difference Result 136 states and 478 transitions. [2018-12-24 13:55:40,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:55:40,686 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2018-12-24 13:55:40,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:40,688 INFO L225 Difference]: With dead ends: 136 [2018-12-24 13:55:40,689 INFO L226 Difference]: Without dead ends: 131 [2018-12-24 13:55:40,689 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 [2018-12-24 13:55:40,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-24 13:55:40,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 77. [2018-12-24 13:55:40,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-24 13:55:40,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2018-12-24 13:55:40,715 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2018-12-24 13:55:40,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:40,715 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2018-12-24 13:55:40,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-24 13:55:40,716 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2018-12-24 13:55:40,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:55:40,716 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:40,716 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:55:40,717 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:40,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:40,717 INFO L82 PathProgramCache]: Analyzing trace with hash 904729414, now seen corresponding path program 1 times [2018-12-24 13:55:40,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:40,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:40,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:55:40,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:40,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:40,970 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2018-12-24 13:55:41,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:41,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:41,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:41,034 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:55:41,034 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [25] [2018-12-24 13:55:41,036 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:41,036 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:41,038 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:41,039 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. [2018-12-24 13:55:41,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:41,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:41,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:41,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 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 [2018-12-24 13:55:41,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:41,052 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:41,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:41,061 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 [2018-12-24 13:55:41,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,067 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 [2018-12-24 13:55:41,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,072 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 [2018-12-24 13:55:41,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,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, 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 [2018-12-24 13:55:41,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,128 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 [2018-12-24 13:55:41,129 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:41,155 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:41,170 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:41,182 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:41,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:41,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. [2018-12-24 13:55:41,211 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:55:41,235 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,236 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,237 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,240 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,241 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,243 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,249 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 [2018-12-24 13:55:41,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:41,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:55:41,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:41,325 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,330 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,332 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,344 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,348 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,350 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 [2018-12-24 13:55:41,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:41,400 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. [2018-12-24 13:55:41,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2018-12-24 13:55:41,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:41,460 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:55:41,460 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 [2018-12-24 13:55:41,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:41,519 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. [2018-12-24 13:55:41,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:55:41,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:41,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:41,638 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:41,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:41,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:55:41,656 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:41,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:55:41,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:55:41,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:55:41,657 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 10 states. [2018-12-24 13:55:42,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:42,151 INFO L93 Difference]: Finished difference Result 106 states and 409 transitions. [2018-12-24 13:55:42,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:55:42,151 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-24 13:55:42,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:42,153 INFO L225 Difference]: With dead ends: 106 [2018-12-24 13:55:42,153 INFO L226 Difference]: Without dead ends: 105 [2018-12-24 13:55:42,153 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 [2018-12-24 13:55:42,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-24 13:55:42,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 77. [2018-12-24 13:55:42,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-24 13:55:42,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2018-12-24 13:55:42,179 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2018-12-24 13:55:42,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:42,179 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2018-12-24 13:55:42,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:55:42,179 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2018-12-24 13:55:42,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:55:42,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:42,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:55:42,180 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:42,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:42,180 INFO L82 PathProgramCache]: Analyzing trace with hash 904728978, now seen corresponding path program 1 times [2018-12-24 13:55:42,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:42,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:42,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:42,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:42,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:42,353 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:42,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:42,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:42,354 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:55:42,354 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [23] [2018-12-24 13:55:42,356 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:42,356 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:42,359 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:42,359 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. [2018-12-24 13:55:42,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:42,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:42,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:42,360 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 [2018-12-24 13:55:42,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:42,369 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:42,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:42,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 [2018-12-24 13:55:42,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,381 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 [2018-12-24 13:55:42,387 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,390 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 [2018-12-24 13:55:42,392 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,394 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 [2018-12-24 13:55:42,399 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,400 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,404 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 [2018-12-24 13:55:42,404 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:42,432 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:42,447 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:42,458 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:42,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:42,487 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. [2018-12-24 13:55:42,487 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:55:42,512 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,525 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 [2018-12-24 13:55:42,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:42,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. [2018-12-24 13:55:42,568 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:42,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,609 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 [2018-12-24 13:55:42,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:42,676 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. [2018-12-24 13:55:42,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2018-12-24 13:55:42,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,726 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:55:42,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 38 treesize of output 94 [2018-12-24 13:55:42,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:42,798 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. [2018-12-24 13:55:42,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2018-12-24 13:55:42,825 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,826 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,826 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,832 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,838 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:55:42,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:42,840 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 [2018-12-24 13:55:42,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:42,895 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. [2018-12-24 13:55:42,896 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2018-12-24 13:55:42,921 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:42,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:42,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:43,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:43,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2018-12-24 13:55:43,004 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:43,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:55:43,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:55:43,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:55:43,005 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 12 states. [2018-12-24 13:55:43,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:43,803 INFO L93 Difference]: Finished difference Result 131 states and 463 transitions. [2018-12-24 13:55:43,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:55:43,804 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2018-12-24 13:55:43,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:43,805 INFO L225 Difference]: With dead ends: 131 [2018-12-24 13:55:43,806 INFO L226 Difference]: Without dead ends: 130 [2018-12-24 13:55:43,806 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 [2018-12-24 13:55:43,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-24 13:55:43,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 77. [2018-12-24 13:55:43,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-24 13:55:43,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2018-12-24 13:55:43,828 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2018-12-24 13:55:43,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:43,829 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2018-12-24 13:55:43,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:55:43,829 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2018-12-24 13:55:43,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:55:43,829 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:43,830 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:55:43,830 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:43,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:43,830 INFO L82 PathProgramCache]: Analyzing trace with hash 904746776, now seen corresponding path program 1 times [2018-12-24 13:55:43,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:43,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:43,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:43,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:43,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:44,081 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-12-24 13:55:44,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:44,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:44,104 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:44,104 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:55:44,104 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [27] [2018-12-24 13:55:44,105 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:44,105 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:44,108 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:44,108 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. [2018-12-24 13:55:44,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:44,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:44,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:44,109 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 [2018-12-24 13:55:44,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:44,119 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:44,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:44,127 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 [2018-12-24 13:55:44,131 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 [2018-12-24 13:55:44,143 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 [2018-12-24 13:55:44,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:44,151 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 [2018-12-24 13:55:44,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:44,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:44,163 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 [2018-12-24 13:55:44,164 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:44,179 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:44,189 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:44,200 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:44,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:44,223 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. [2018-12-24 13:55:44,223 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2018-12-24 13:55:44,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:44,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:44,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:44,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:44,255 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 [2018-12-24 13:55:44,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:44,271 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. [2018-12-24 13:55:44,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-24 13:55:44,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:44,287 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:44,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:44,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:44,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:44,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:44,291 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 [2018-12-24 13:55:44,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:44,310 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. [2018-12-24 13:55:44,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2018-12-24 13:55:44,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:44,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:44,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:44,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:44,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:55:44,365 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:44,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:55:44,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:55:44,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:55:44,365 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 8 states. [2018-12-24 13:55:44,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:44,595 INFO L93 Difference]: Finished difference Result 93 states and 382 transitions. [2018-12-24 13:55:44,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:55:44,596 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2018-12-24 13:55:44,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:44,597 INFO L225 Difference]: With dead ends: 93 [2018-12-24 13:55:44,598 INFO L226 Difference]: Without dead ends: 92 [2018-12-24 13:55:44,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:55:44,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-24 13:55:44,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2018-12-24 13:55:44,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-24 13:55:44,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2018-12-24 13:55:44,622 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2018-12-24 13:55:44,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:44,623 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2018-12-24 13:55:44,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:55:44,623 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2018-12-24 13:55:44,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:55:44,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:44,623 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:55:44,623 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:44,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:44,624 INFO L82 PathProgramCache]: Analyzing trace with hash 904732946, now seen corresponding path program 1 times [2018-12-24 13:55:44,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:44,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:44,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:44,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:44,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:44,865 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 25 [2018-12-24 13:55:44,969 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:44,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:44,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:44,969 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:55:44,969 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [23] [2018-12-24 13:55:44,970 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:44,970 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:44,973 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:44,974 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. [2018-12-24 13:55:44,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:44,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:44,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:44,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 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 [2018-12-24 13:55:44,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:44,983 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:44,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:44,990 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 [2018-12-24 13:55:44,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:44,993 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 [2018-12-24 13:55:45,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,038 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 [2018-12-24 13:55:45,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,043 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 [2018-12-24 13:55:45,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,050 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 [2018-12-24 13:55:45,050 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:45,078 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:45,093 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:45,104 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:45,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:45,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:45,131 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2018-12-24 13:55:45,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,167 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 [2018-12-24 13:55:45,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:45,207 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. [2018-12-24 13:55:45,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:45,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,295 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,481 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,481 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,481 INFO L303 Elim1Store]: Index analysis took 250 ms [2018-12-24 13:55:45,482 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 [2018-12-24 13:55:45,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:45,525 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. [2018-12-24 13:55:45,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2018-12-24 13:55:45,552 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,558 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,559 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,560 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,561 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,562 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,563 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,564 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:55:45,565 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,566 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 [2018-12-24 13:55:45,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:45,614 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. [2018-12-24 13:55:45,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2018-12-24 13:55:45,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:45,655 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:55:45,656 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 [2018-12-24 13:55:45,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:45,704 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. [2018-12-24 13:55:45,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2018-12-24 13:55:45,761 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:45,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:45,821 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:45,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:45,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2018-12-24 13:55:45,840 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:45,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:55:45,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:55:45,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:55:45,840 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 12 states. [2018-12-24 13:55:46,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:46,827 INFO L93 Difference]: Finished difference Result 117 states and 435 transitions. [2018-12-24 13:55:46,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:55:46,827 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2018-12-24 13:55:46,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:46,829 INFO L225 Difference]: With dead ends: 117 [2018-12-24 13:55:46,829 INFO L226 Difference]: Without dead ends: 115 [2018-12-24 13:55:46,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2018-12-24 13:55:46,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-24 13:55:46,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 74. [2018-12-24 13:55:46,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-24 13:55:46,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 344 transitions. [2018-12-24 13:55:46,859 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 344 transitions. Word has length 6 [2018-12-24 13:55:46,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:46,859 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 344 transitions. [2018-12-24 13:55:46,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:55:46,859 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 344 transitions. [2018-12-24 13:55:46,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:55:46,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:46,860 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:55:46,860 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:46,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:46,860 INFO L82 PathProgramCache]: Analyzing trace with hash 904737102, now seen corresponding path program 1 times [2018-12-24 13:55:46,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:46,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:46,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:46,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:46,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:47,031 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:47,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:47,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:47,032 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:55:47,032 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [25] [2018-12-24 13:55:47,033 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:47,033 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:47,036 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:47,036 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. [2018-12-24 13:55:47,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:47,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:47,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:47,036 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 [2018-12-24 13:55:47,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:47,045 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:47,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:47,053 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 [2018-12-24 13:55:47,057 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 [2018-12-24 13:55:47,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:47,069 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 [2018-12-24 13:55:47,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:47,077 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:47,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 [2018-12-24 13:55:47,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:47,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:47,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:47,090 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 [2018-12-24 13:55:47,090 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:47,110 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:47,121 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:47,132 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:47,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:47,158 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. [2018-12-24 13:55:47,158 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2018-12-24 13:55:47,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:47,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:47,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:47,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:47,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:47,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:47,197 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:47,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, 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 [2018-12-24 13:55:47,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:47,225 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. [2018-12-24 13:55:47,225 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2018-12-24 13:55:47,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:47,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:47,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:47,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:47,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:47,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:47,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:47,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:47,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:47,255 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 [2018-12-24 13:55:47,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:47,283 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. [2018-12-24 13:55:47,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2018-12-24 13:55:47,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:47,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:47,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:47,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:47,311 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:47,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:47,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:47,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:47,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:47,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:47,318 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:55:47,319 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 [2018-12-24 13:55:47,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:47,353 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. [2018-12-24 13:55:47,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2018-12-24 13:55:47,372 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:47,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:47,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:47,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:47,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:55:47,427 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:47,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:55:47,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:55:47,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:55:47,427 INFO L87 Difference]: Start difference. First operand 74 states and 344 transitions. Second operand 10 states. [2018-12-24 13:55:47,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:47,882 INFO L93 Difference]: Finished difference Result 99 states and 372 transitions. [2018-12-24 13:55:47,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:55:47,882 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-24 13:55:47,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:47,883 INFO L225 Difference]: With dead ends: 99 [2018-12-24 13:55:47,884 INFO L226 Difference]: Without dead ends: 98 [2018-12-24 13:55:47,884 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 [2018-12-24 13:55:47,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-24 13:55:47,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 73. [2018-12-24 13:55:47,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-24 13:55:47,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 338 transitions. [2018-12-24 13:55:47,908 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 338 transitions. Word has length 6 [2018-12-24 13:55:47,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:47,908 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 338 transitions. [2018-12-24 13:55:47,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:55:47,908 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 338 transitions. [2018-12-24 13:55:47,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:55:47,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:47,909 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-12-24 13:55:47,909 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:47,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:47,909 INFO L82 PathProgramCache]: Analyzing trace with hash 904323436, now seen corresponding path program 3 times [2018-12-24 13:55:47,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:47,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:47,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:47,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:47,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:48,066 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:55:48,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:48,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:48,067 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:55:48,067 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:55:48,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:48,067 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 [2018-12-24 13:55:48,077 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:55:48,077 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:55:48,083 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:55:48,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:55:48,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:48,090 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 [2018-12-24 13:55:48,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,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, 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 [2018-12-24 13:55:48,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,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, 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 [2018-12-24 13:55:48,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,105 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 [2018-12-24 13:55:48,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,110 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,112 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 [2018-12-24 13:55:48,113 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:48,139 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:48,154 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:48,165 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:48,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:48,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. [2018-12-24 13:55:48,194 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2018-12-24 13:55:48,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,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 36 treesize of output 66 [2018-12-24 13:55:48,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:48,272 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. [2018-12-24 13:55:48,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:48,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,311 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,317 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 [2018-12-24 13:55:48,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:48,362 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. [2018-12-24 13:55:48,362 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2018-12-24 13:55:48,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,392 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,399 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,400 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,407 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 [2018-12-24 13:55:48,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:48,461 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. [2018-12-24 13:55:48,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2018-12-24 13:55:48,485 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,486 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,488 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:48,502 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 [2018-12-24 13:55:48,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:48,556 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. [2018-12-24 13:55:48,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:55:48,585 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:48,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:48,634 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:48,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:48,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2018-12-24 13:55:48,653 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:48,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-24 13:55:48,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-24 13:55:48,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:55:48,654 INFO L87 Difference]: Start difference. First operand 73 states and 338 transitions. Second operand 11 states. [2018-12-24 13:55:49,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:49,387 INFO L93 Difference]: Finished difference Result 132 states and 470 transitions. [2018-12-24 13:55:49,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:55:49,387 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2018-12-24 13:55:49,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:49,389 INFO L225 Difference]: With dead ends: 132 [2018-12-24 13:55:49,389 INFO L226 Difference]: Without dead ends: 130 [2018-12-24 13:55:49,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2018-12-24 13:55:49,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-24 13:55:49,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 74. [2018-12-24 13:55:49,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-24 13:55:49,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 334 transitions. [2018-12-24 13:55:49,422 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 334 transitions. Word has length 6 [2018-12-24 13:55:49,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:49,422 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 334 transitions. [2018-12-24 13:55:49,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-24 13:55:49,422 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 334 transitions. [2018-12-24 13:55:49,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:55:49,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:49,423 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:55:49,423 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:49,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:49,423 INFO L82 PathProgramCache]: Analyzing trace with hash 904329702, now seen corresponding path program 1 times [2018-12-24 13:55:49,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:49,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:49,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:55:49,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:49,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:49,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:49,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:49,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:49,500 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:55:49,500 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [27] [2018-12-24 13:55:49,501 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:49,501 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:49,504 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:49,504 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. [2018-12-24 13:55:49,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:49,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:49,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:49,505 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 [2018-12-24 13:55:49,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:49,521 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:49,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:49,557 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 [2018-12-24 13:55:49,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,586 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 [2018-12-24 13:55:49,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,590 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 [2018-12-24 13:55:49,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,598 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 [2018-12-24 13:55:49,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2018-12-24 13:55:49,609 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:49,636 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:49,652 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:49,664 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:49,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:49,695 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. [2018-12-24 13:55:49,695 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2018-12-24 13:55:49,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,726 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,730 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,733 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 [2018-12-24 13:55:49,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:49,775 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. [2018-12-24 13:55:49,775 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:49,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,822 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,824 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,825 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,826 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,828 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:49,830 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 [2018-12-24 13:55:49,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:49,878 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. [2018-12-24 13:55:49,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:55:49,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:49,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:49,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:49,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:49,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:55:49,940 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:49,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:55:49,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:55:49,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:55:49,941 INFO L87 Difference]: Start difference. First operand 74 states and 334 transitions. Second operand 8 states. [2018-12-24 13:55:50,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:50,292 INFO L93 Difference]: Finished difference Result 87 states and 350 transitions. [2018-12-24 13:55:50,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:55:50,292 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2018-12-24 13:55:50,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:50,293 INFO L225 Difference]: With dead ends: 87 [2018-12-24 13:55:50,293 INFO L226 Difference]: Without dead ends: 86 [2018-12-24 13:55:50,294 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 [2018-12-24 13:55:50,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-24 13:55:50,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2018-12-24 13:55:50,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-24 13:55:50,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 337 transitions. [2018-12-24 13:55:50,330 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 337 transitions. Word has length 6 [2018-12-24 13:55:50,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:50,331 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 337 transitions. [2018-12-24 13:55:50,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:55:50,331 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 337 transitions. [2018-12-24 13:55:50,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:55:50,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:50,331 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:55:50,332 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:50,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:50,332 INFO L82 PathProgramCache]: Analyzing trace with hash 904316184, now seen corresponding path program 1 times [2018-12-24 13:55:50,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:50,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:50,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:50,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:50,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:50,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:55:50,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:50,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:50,467 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:55:50,467 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [25] [2018-12-24 13:55:50,468 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:50,468 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:50,472 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:50,472 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. [2018-12-24 13:55:50,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:50,473 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:50,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:50,473 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 [2018-12-24 13:55:50,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:50,489 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:50,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:50,528 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 [2018-12-24 13:55:50,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,576 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 [2018-12-24 13:55:50,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,601 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 [2018-12-24 13:55:50,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,615 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 [2018-12-24 13:55:50,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2018-12-24 13:55:50,635 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:50,666 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:50,682 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:50,694 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:50,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:50,724 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. [2018-12-24 13:55:50,724 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2018-12-24 13:55:50,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,747 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,748 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,748 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,750 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,755 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,756 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,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, 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 [2018-12-24 13:55:50,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:50,798 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. [2018-12-24 13:55:50,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:50,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,822 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,823 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,824 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,826 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,828 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,832 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,833 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,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 38 treesize of output 88 [2018-12-24 13:55:50,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:50,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. [2018-12-24 13:55:50,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:55:50,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,918 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:55:50,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:50,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 38 treesize of output 97 [2018-12-24 13:55:50,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:50,988 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. [2018-12-24 13:55:50,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2018-12-24 13:55:51,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:51,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:51,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:51,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:51,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-24 13:55:51,075 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:51,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:55:51,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:55:51,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:55:51,076 INFO L87 Difference]: Start difference. First operand 73 states and 337 transitions. Second operand 10 states. [2018-12-24 13:55:51,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:51,536 INFO L93 Difference]: Finished difference Result 106 states and 387 transitions. [2018-12-24 13:55:51,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:55:51,537 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-24 13:55:51,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:51,538 INFO L225 Difference]: With dead ends: 106 [2018-12-24 13:55:51,538 INFO L226 Difference]: Without dead ends: 105 [2018-12-24 13:55:51,538 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 [2018-12-24 13:55:51,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-24 13:55:51,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 75. [2018-12-24 13:55:51,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-24 13:55:51,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 349 transitions. [2018-12-24 13:55:51,577 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 349 transitions. Word has length 6 [2018-12-24 13:55:51,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:51,578 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 349 transitions. [2018-12-24 13:55:51,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:55:51,578 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 349 transitions. [2018-12-24 13:55:51,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:55:51,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:51,578 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:55:51,579 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:51,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:51,579 INFO L82 PathProgramCache]: Analyzing trace with hash 904320028, now seen corresponding path program 1 times [2018-12-24 13:55:51,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:51,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:51,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:51,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:51,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:52,280 WARN L181 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2018-12-24 13:55:52,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:55:52,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:52,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:52,378 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:55:52,378 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [25] [2018-12-24 13:55:52,379 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:52,380 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:52,382 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:52,382 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. [2018-12-24 13:55:52,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:52,383 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:52,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:52,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 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 [2018-12-24 13:55:52,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:52,392 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:52,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:52,405 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 [2018-12-24 13:55:52,411 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,412 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 [2018-12-24 13:55:52,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,416 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 [2018-12-24 13:55:52,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,450 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 [2018-12-24 13:55:52,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,456 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 [2018-12-24 13:55:52,457 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:52,486 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:52,501 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:52,513 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:52,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:52,545 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. [2018-12-24 13:55:52,545 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:55:52,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,581 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,583 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 [2018-12-24 13:55:52,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:52,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. [2018-12-24 13:55:52,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:52,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,662 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 [2018-12-24 13:55:52,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:52,709 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. [2018-12-24 13:55:52,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2018-12-24 13:55:52,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,742 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,743 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,745 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,747 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,748 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:52,749 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:55:52,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 38 treesize of output 104 [2018-12-24 13:55:52,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:52,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. [2018-12-24 13:55:52,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:55:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:52,828 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:52,863 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:52,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:52,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:55:52,883 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:52,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:55:52,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:55:52,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:55:52,884 INFO L87 Difference]: Start difference. First operand 75 states and 349 transitions. Second operand 10 states. [2018-12-24 13:55:53,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:53,410 INFO L93 Difference]: Finished difference Result 102 states and 394 transitions. [2018-12-24 13:55:53,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:55:53,410 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-24 13:55:53,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:53,412 INFO L225 Difference]: With dead ends: 102 [2018-12-24 13:55:53,412 INFO L226 Difference]: Without dead ends: 101 [2018-12-24 13:55:53,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:55:53,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-24 13:55:53,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 78. [2018-12-24 13:55:53,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-24 13:55:53,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 367 transitions. [2018-12-24 13:55:53,445 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 367 transitions. Word has length 6 [2018-12-24 13:55:53,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:53,445 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 367 transitions. [2018-12-24 13:55:53,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:55:53,445 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 367 transitions. [2018-12-24 13:55:53,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:55:53,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:53,446 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:55:53,446 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:53,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:53,446 INFO L82 PathProgramCache]: Analyzing trace with hash 904448866, now seen corresponding path program 1 times [2018-12-24 13:55:53,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:53,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:53,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:53,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:53,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:53,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:53,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:53,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:53,529 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:55:53,530 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [27] [2018-12-24 13:55:53,532 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:53,532 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:53,534 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:53,535 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. [2018-12-24 13:55:53,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:53,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:53,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:53,535 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 [2018-12-24 13:55:53,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:53,545 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:53,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:53,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:53,563 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 [2018-12-24 13:55:53,568 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 [2018-12-24 13:55:53,581 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:53,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, 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 [2018-12-24 13:55:53,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:53,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:53,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, 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 [2018-12-24 13:55:53,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:53,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:53,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:53,599 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 [2018-12-24 13:55:53,599 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:53,619 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:53,631 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:53,641 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:53,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:53,667 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. [2018-12-24 13:55:53,668 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2018-12-24 13:55:53,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:53,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:53,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:53,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:53,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:53,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:53,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:53,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 45 [2018-12-24 13:55:53,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:53,848 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. [2018-12-24 13:55:53,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:55:53,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:53,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:53,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:53,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:53,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:53,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:53,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:53,873 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:55:53,874 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 [2018-12-24 13:55:53,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:53,901 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. [2018-12-24 13:55:53,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2018-12-24 13:55:53,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:53,918 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:53,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:53,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:53,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:55:53,958 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:53,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:55:53,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:55:53,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:55:53,958 INFO L87 Difference]: Start difference. First operand 78 states and 367 transitions. Second operand 8 states. [2018-12-24 13:55:54,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:54,238 INFO L93 Difference]: Finished difference Result 94 states and 387 transitions. [2018-12-24 13:55:54,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:55:54,238 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2018-12-24 13:55:54,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:54,240 INFO L225 Difference]: With dead ends: 94 [2018-12-24 13:55:54,240 INFO L226 Difference]: Without dead ends: 93 [2018-12-24 13:55:54,240 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 [2018-12-24 13:55:54,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-24 13:55:54,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 78. [2018-12-24 13:55:54,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-24 13:55:54,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 367 transitions. [2018-12-24 13:55:54,278 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 367 transitions. Word has length 6 [2018-12-24 13:55:54,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:54,278 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 367 transitions. [2018-12-24 13:55:54,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:55:54,278 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 367 transitions. [2018-12-24 13:55:54,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:55:54,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:54,279 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:55:54,279 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:54,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:54,279 INFO L82 PathProgramCache]: Analyzing trace with hash 904439192, now seen corresponding path program 1 times [2018-12-24 13:55:54,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:54,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:54,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:54,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:54,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55: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. [2018-12-24 13:55:54,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:54,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:54,392 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:55:54,392 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [25] [2018-12-24 13:55:54,394 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:54,394 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:54,396 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:54,396 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. [2018-12-24 13:55:54,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:54,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:54,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:54,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 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 [2018-12-24 13:55:54,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:54,413 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:54,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:54,433 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 [2018-12-24 13:55:54,436 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 [2018-12-24 13:55:54,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:54,509 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 [2018-12-24 13:55:54,532 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:54,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:54,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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 [2018-12-24 13:55:54,544 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:54,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:54,548 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:54,548 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 [2018-12-24 13:55:54,549 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:54,569 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:54,580 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:54,590 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:54,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:54,616 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. [2018-12-24 13:55:54,617 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2018-12-24 13:55:54,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:54,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:54,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:54,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:54,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:54,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:54,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:54,661 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 [2018-12-24 13:55:54,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:54,686 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. [2018-12-24 13:55:54,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:55:54,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:54,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:54,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:54,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:54,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:54,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:54,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:54,715 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:55:54,716 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 [2018-12-24 13:55:54,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:54,743 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. [2018-12-24 13:55:54,744 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2018-12-24 13:55:54,763 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:54,764 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:54,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:54,766 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:54,767 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:54,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:54,770 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:54,771 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:54,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:54,773 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 [2018-12-24 13:55:54,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:54,805 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. [2018-12-24 13:55:54,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2018-12-24 13:55:54,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:54,821 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:54,874 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:54,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:54,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:55:54,893 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:54,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:55:54,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:55:54,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:55:54,894 INFO L87 Difference]: Start difference. First operand 78 states and 367 transitions. Second operand 10 states. [2018-12-24 13:55:55,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:55,284 INFO L93 Difference]: Finished difference Result 116 states and 427 transitions. [2018-12-24 13:55:55,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:55:55,286 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-24 13:55:55,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:55,287 INFO L225 Difference]: With dead ends: 116 [2018-12-24 13:55:55,287 INFO L226 Difference]: Without dead ends: 115 [2018-12-24 13:55:55,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:55:55,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-24 13:55:55,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 79. [2018-12-24 13:55:55,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-24 13:55:55,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 373 transitions. [2018-12-24 13:55:55,336 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 373 transitions. Word has length 6 [2018-12-24 13:55:55,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:55,337 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 373 transitions. [2018-12-24 13:55:55,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:55:55,337 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 373 transitions. [2018-12-24 13:55:55,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:55:55,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:55,338 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:55:55,338 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:55,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:55,338 INFO L82 PathProgramCache]: Analyzing trace with hash 904550232, now seen corresponding path program 1 times [2018-12-24 13:55:55,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:55,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:55,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:55,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:55,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:55,617 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2018-12-24 13:55:55,696 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:55,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:55,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:55,697 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:55:55,697 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [23] [2018-12-24 13:55:55,698 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:55,698 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:55,700 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:55,700 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. [2018-12-24 13:55:55,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:55,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:55,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:55,701 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 [2018-12-24 13:55:55,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:55,716 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:55,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:55,724 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 [2018-12-24 13:55:55,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,728 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 [2018-12-24 13:55:55,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,733 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 [2018-12-24 13:55:55,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,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 [2018-12-24 13:55:55,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,743 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,745 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,746 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 [2018-12-24 13:55:55,746 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:55,774 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:55,789 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:55,801 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:55,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:55,829 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. [2018-12-24 13:55:55,830 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:55:55,892 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,894 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,895 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,896 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,897 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,903 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 [2018-12-24 13:55:55,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:55,943 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. [2018-12-24 13:55:55,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:55,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:55,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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 [2018-12-24 13:55:55,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:56,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. [2018-12-24 13:55:56,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2018-12-24 13:55:56,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:56,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:56,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:56,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:56,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:56,074 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:56,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:56,077 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:56,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:56,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:56,080 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:56,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:56,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:56,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:56,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:56,085 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:55:56,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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 [2018-12-24 13:55:56,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:56,138 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. [2018-12-24 13:55:56,138 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2018-12-24 13:55:56,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:56,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:56,230 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:56,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:56,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:56,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:56,235 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:56,237 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:56,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:56,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:56,241 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:56,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:56,243 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:55:56,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:56,245 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 [2018-12-24 13:55:56,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:56,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-24 13:55:56,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2018-12-24 13:55:56,319 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:56,319 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:56,374 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:56,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:56,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2018-12-24 13:55:56,395 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:56,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:55:56,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:55:56,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:55:56,395 INFO L87 Difference]: Start difference. First operand 79 states and 373 transitions. Second operand 12 states. [2018-12-24 13:55:57,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:57,377 INFO L93 Difference]: Finished difference Result 140 states and 516 transitions. [2018-12-24 13:55:57,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:55:57,378 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2018-12-24 13:55:57,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:57,380 INFO L225 Difference]: With dead ends: 140 [2018-12-24 13:55:57,380 INFO L226 Difference]: Without dead ends: 139 [2018-12-24 13:55:57,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2018-12-24 13:55:57,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-24 13:55:57,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 76. [2018-12-24 13:55:57,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-24 13:55:57,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 355 transitions. [2018-12-24 13:55:57,429 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 355 transitions. Word has length 6 [2018-12-24 13:55:57,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:57,430 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 355 transitions. [2018-12-24 13:55:57,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:55:57,430 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 355 transitions. [2018-12-24 13:55:57,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:55:57,430 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:57,430 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:55:57,431 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:57,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:57,431 INFO L82 PathProgramCache]: Analyzing trace with hash 904568030, now seen corresponding path program 1 times [2018-12-24 13:55:57,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:57,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:57,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:57,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:57,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:57,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:57,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:57,502 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:57,502 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:55:57,503 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [27] [2018-12-24 13:55:57,504 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:55:57,504 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:55:57,506 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:55:57,507 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. [2018-12-24 13:55:57,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:57,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:55:57,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:57,507 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 [2018-12-24 13:55:57,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:57,515 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:57,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:57,524 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 [2018-12-24 13:55:57,528 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 [2018-12-24 13:55:57,543 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 [2018-12-24 13:55:57,559 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:57,559 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 [2018-12-24 13:55:57,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:57,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:57,573 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 [2018-12-24 13:55:57,573 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:57,587 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:57,597 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:57,607 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:57,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:57,632 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. [2018-12-24 13:55:57,632 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2018-12-24 13:55:57,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:57,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:57,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:57,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:57,662 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 [2018-12-24 13:55:57,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:57,677 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. [2018-12-24 13:55:57,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2018-12-24 13:55:57,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:57,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:57,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:57,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:57,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:57,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:57,704 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 [2018-12-24 13:55:57,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:57,725 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. [2018-12-24 13:55:57,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2018-12-24 13:55:57,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:57,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:57,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:57,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:57,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2018-12-24 13:55:57,770 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:57,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:55:57,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:55:57,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:55:57,771 INFO L87 Difference]: Start difference. First operand 76 states and 355 transitions. Second operand 8 states. [2018-12-24 13:55:58,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:58,050 INFO L93 Difference]: Finished difference Result 112 states and 470 transitions. [2018-12-24 13:55:58,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:55:58,051 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2018-12-24 13:55:58,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:58,052 INFO L225 Difference]: With dead ends: 112 [2018-12-24 13:55:58,052 INFO L226 Difference]: Without dead ends: 111 [2018-12-24 13:55:58,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:55:58,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-24 13:55:58,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 80. [2018-12-24 13:55:58,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-24 13:55:58,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 380 transitions. [2018-12-24 13:55:58,093 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 380 transitions. Word has length 6 [2018-12-24 13:55:58,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:58,093 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 380 transitions. [2018-12-24 13:55:58,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:55:58,093 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 380 transitions. [2018-12-24 13:55:58,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:55:58,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:58,094 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:55:58,094 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:58,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:58,094 INFO L82 PathProgramCache]: Analyzing trace with hash 906170478, now seen corresponding path program 2 times [2018-12-24 13:55:58,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:58,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:58,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:58,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:58,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:58,250 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:58,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:58,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:58,250 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:55:58,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:55:58,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:58,251 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 [2018-12-24 13:55:58,263 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:55:58,264 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:55:58,270 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:55:58,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:55:58,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:58,291 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 [2018-12-24 13:55:58,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,297 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 [2018-12-24 13:55:58,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,301 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 [2018-12-24 13:55:58,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,307 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 [2018-12-24 13:55:58,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,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, 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 [2018-12-24 13:55:58,315 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:58,342 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:58,357 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:58,368 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:58,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:58,400 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. [2018-12-24 13:55:58,400 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:55:58,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,431 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,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, 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 [2018-12-24 13:55:58,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:58,492 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. [2018-12-24 13:55:58,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:58,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,526 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,531 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,536 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:55:58,537 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 [2018-12-24 13:55:58,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:58,589 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. [2018-12-24 13:55:58,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:58,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,672 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,673 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 [2018-12-24 13:55:58,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:58,724 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. [2018-12-24 13:55:58,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:55:58,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,755 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,757 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,758 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,759 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,761 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,762 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,763 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,766 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,766 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:55:58,768 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:55:58,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, 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 [2018-12-24 13:55:58,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:58,826 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. [2018-12-24 13:55:58,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2018-12-24 13:55:58,874 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:58,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:58,938 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:58,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:58,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2018-12-24 13:55:58,957 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:58,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:55:58,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:55:58,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:55:58,958 INFO L87 Difference]: Start difference. First operand 80 states and 380 transitions. Second operand 12 states. [2018-12-24 13:55:59,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:59,876 INFO L93 Difference]: Finished difference Result 137 states and 479 transitions. [2018-12-24 13:55:59,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:55:59,876 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2018-12-24 13:55:59,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:59,878 INFO L225 Difference]: With dead ends: 137 [2018-12-24 13:55:59,878 INFO L226 Difference]: Without dead ends: 135 [2018-12-24 13:55:59,879 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 [2018-12-24 13:55:59,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-24 13:55:59,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 77. [2018-12-24 13:55:59,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-24 13:55:59,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 361 transitions. [2018-12-24 13:55:59,932 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 361 transitions. Word has length 6 [2018-12-24 13:55:59,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:59,932 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 361 transitions. [2018-12-24 13:55:59,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:55:59,932 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 361 transitions. [2018-12-24 13:55:59,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:55:59,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:59,933 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:55:59,933 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:59,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:59,933 INFO L82 PathProgramCache]: Analyzing trace with hash 906163226, now seen corresponding path program 1 times [2018-12-24 13:55:59,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:59,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:59,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:55:59,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:59,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:00,098 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2018-12-24 13:56:00,149 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:56:00,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:00,150 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:00,150 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:56:00,150 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [25] [2018-12-24 13:56:00,151 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:56:00,151 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:56:00,154 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:56:00,154 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. [2018-12-24 13:56:00,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:00,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:56:00,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:00,155 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 [2018-12-24 13:56:00,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:00,164 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:56:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:00,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:00,175 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 [2018-12-24 13:56:00,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,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 [2018-12-24 13:56:00,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,183 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 [2018-12-24 13:56:00,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,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 [2018-12-24 13:56:00,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,197 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,199 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 [2018-12-24 13:56:00,199 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:00,226 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:00,241 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:00,253 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:00,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:00,282 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. [2018-12-24 13:56:00,282 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2018-12-24 13:56:00,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,311 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,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 72 [2018-12-24 13:56:00,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:00,359 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. [2018-12-24 13:56:00,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:00,380 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,384 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,387 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,391 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,392 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,418 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,419 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:00,420 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 [2018-12-24 13:56:00,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:00,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. [2018-12-24 13:56:00,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:00,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:00,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 36 treesize of output 86 [2018-12-24 13:56:00,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:00,552 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. [2018-12-24 13:56:00,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:00,573 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:00,574 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:00,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:00,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:00,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-24 13:56:00,615 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:00,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:56:00,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:56:00,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:56:00,616 INFO L87 Difference]: Start difference. First operand 77 states and 361 transitions. Second operand 10 states. [2018-12-24 13:56:01,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:01,097 INFO L93 Difference]: Finished difference Result 124 states and 454 transitions. [2018-12-24 13:56:01,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:56:01,098 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-24 13:56:01,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:01,099 INFO L225 Difference]: With dead ends: 124 [2018-12-24 13:56:01,099 INFO L226 Difference]: Without dead ends: 123 [2018-12-24 13:56:01,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:56:01,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-24 13:56:01,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 84. [2018-12-24 13:56:01,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-24 13:56:01,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 403 transitions. [2018-12-24 13:56:01,147 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 403 transitions. Word has length 6 [2018-12-24 13:56:01,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:01,148 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 403 transitions. [2018-12-24 13:56:01,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:56:01,148 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 403 transitions. [2018-12-24 13:56:01,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:56:01,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:01,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:56:01,149 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:01,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:01,149 INFO L82 PathProgramCache]: Analyzing trace with hash 906167070, now seen corresponding path program 1 times [2018-12-24 13:56:01,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:01,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:01,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:01,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:01,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:01,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:56:01,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:01,293 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:01,293 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:56:01,294 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [25] [2018-12-24 13:56:01,295 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:56:01,295 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:56:01,297 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:56:01,297 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. [2018-12-24 13:56:01,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:01,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:56:01,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:01,298 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 [2018-12-24 13:56:01,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:01,307 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:56:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:01,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:01,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 [2018-12-24 13:56:01,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,317 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 [2018-12-24 13:56:01,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,322 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 [2018-12-24 13:56:01,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,328 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,329 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,329 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 [2018-12-24 13:56:01,331 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,332 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2018-12-24 13:56:01,336 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:01,362 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:01,377 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:01,388 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:01,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:01,415 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. [2018-12-24 13:56:01,416 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:56:01,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,444 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,450 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 [2018-12-24 13:56:01,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:01,490 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. [2018-12-24 13:56:01,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:01,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,526 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,528 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:01,528 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 [2018-12-24 13:56:01,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:01,573 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. [2018-12-24 13:56:01,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:01,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:01,611 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:01,612 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 [2018-12-24 13:56:01,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:01,654 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. [2018-12-24 13:56:01,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:01,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:01,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:01,713 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:01,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:01,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2018-12-24 13:56:01,733 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:01,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-24 13:56:01,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-24 13:56:01,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:56:01,733 INFO L87 Difference]: Start difference. First operand 84 states and 403 transitions. Second operand 9 states. [2018-12-24 13:56:02,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:02,341 INFO L93 Difference]: Finished difference Result 119 states and 475 transitions. [2018-12-24 13:56:02,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:56:02,342 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2018-12-24 13:56:02,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:02,343 INFO L225 Difference]: With dead ends: 119 [2018-12-24 13:56:02,343 INFO L226 Difference]: Without dead ends: 118 [2018-12-24 13:56:02,344 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 [2018-12-24 13:56:02,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-24 13:56:02,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 91. [2018-12-24 13:56:02,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-24 13:56:02,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 445 transitions. [2018-12-24 13:56:02,393 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 445 transitions. Word has length 6 [2018-12-24 13:56:02,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:02,393 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 445 transitions. [2018-12-24 13:56:02,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-24 13:56:02,393 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 445 transitions. [2018-12-24 13:56:02,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:56:02,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:02,394 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:56:02,394 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:02,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:02,395 INFO L82 PathProgramCache]: Analyzing trace with hash 906285674, now seen corresponding path program 1 times [2018-12-24 13:56:02,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:02,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:02,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:02,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:02,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:02,544 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:02,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:02,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:02,545 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:56:02,545 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [23] [2018-12-24 13:56:02,546 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:56:02,546 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:56:02,547 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:56:02,548 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. [2018-12-24 13:56:02,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:02,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:56:02,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:02,548 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 [2018-12-24 13:56:02,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:02,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:56:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:02,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:02,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 [2018-12-24 13:56:02,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,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 [2018-12-24 13:56:02,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,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 [2018-12-24 13:56:02,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,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 [2018-12-24 13:56:02,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,602 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 [2018-12-24 13:56:02,602 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:02,628 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:02,643 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:02,655 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:02,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:02,683 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. [2018-12-24 13:56:02,683 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:56:02,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,720 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 [2018-12-24 13:56:02,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:02,762 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. [2018-12-24 13:56:02,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:02,785 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,798 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 [2018-12-24 13:56:02,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:02,844 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. [2018-12-24 13:56:02,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:02,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,875 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,882 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:02,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 98 [2018-12-24 13:56:02,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:02,933 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. [2018-12-24 13:56:02,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:56:02,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,983 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:02,989 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:02,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, 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 [2018-12-24 13:56:02,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:03,037 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. [2018-12-24 13:56:03,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:56:03,055 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:03,055 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:03,099 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:03,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:03,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2018-12-24 13:56:03,119 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:03,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:56:03,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:56:03,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:56:03,119 INFO L87 Difference]: Start difference. First operand 91 states and 445 transitions. Second operand 12 states. [2018-12-24 13:56:04,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:04,114 INFO L93 Difference]: Finished difference Result 149 states and 594 transitions. [2018-12-24 13:56:04,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:56:04,114 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2018-12-24 13:56:04,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:04,116 INFO L225 Difference]: With dead ends: 149 [2018-12-24 13:56:04,116 INFO L226 Difference]: Without dead ends: 148 [2018-12-24 13:56:04,116 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 [2018-12-24 13:56:04,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-24 13:56:04,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 98. [2018-12-24 13:56:04,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-24 13:56:04,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 487 transitions. [2018-12-24 13:56:04,172 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 487 transitions. Word has length 6 [2018-12-24 13:56:04,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:04,173 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 487 transitions. [2018-12-24 13:56:04,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:56:04,173 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 487 transitions. [2018-12-24 13:56:04,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:56:04,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:04,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:56:04,174 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:04,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:04,174 INFO L82 PathProgramCache]: Analyzing trace with hash 906286234, now seen corresponding path program 1 times [2018-12-24 13:56:04,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:04,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:04,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:04,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:04,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:04,289 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:04,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:04,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:04,290 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:56:04,290 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [25] [2018-12-24 13:56:04,292 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:56:04,292 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:56:04,294 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:56:04,295 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. [2018-12-24 13:56:04,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:04,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:56:04,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:04,295 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 [2018-12-24 13:56:04,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:04,304 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:56:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:04,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:04,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 [2018-12-24 13:56:04,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, 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 [2018-12-24 13:56:04,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:04,326 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 [2018-12-24 13:56:04,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:04,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:04,336 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 [2018-12-24 13:56:04,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:04,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:04,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:04,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, 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 [2018-12-24 13:56:04,358 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:04,377 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:04,388 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:04,398 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:04,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:04,425 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. [2018-12-24 13:56:04,425 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2018-12-24 13:56:04,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:04,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:04,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:04,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:04,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:04,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:04,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:04,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, 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 [2018-12-24 13:56:04,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:04,490 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. [2018-12-24 13:56:04,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:56:04,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:04,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:04,510 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:04,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:04,512 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:04,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:04,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:04,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:04,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:04,518 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 [2018-12-24 13:56:04,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:04,550 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. [2018-12-24 13:56:04,550 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:56:04,571 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:04,571 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:04,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:04,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:04,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:04,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:04,577 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:04,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:04,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:04,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:04,580 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:04,581 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 [2018-12-24 13:56:04,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:04,614 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. [2018-12-24 13:56:04,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2018-12-24 13:56:04,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:04,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:04,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:04,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:04,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:56:04,684 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:04,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:56:04,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:56:04,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:56:04,685 INFO L87 Difference]: Start difference. First operand 98 states and 487 transitions. Second operand 10 states. [2018-12-24 13:56:05,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:05,194 INFO L93 Difference]: Finished difference Result 139 states and 554 transitions. [2018-12-24 13:56:05,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:56:05,194 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-24 13:56:05,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:05,196 INFO L225 Difference]: With dead ends: 139 [2018-12-24 13:56:05,196 INFO L226 Difference]: Without dead ends: 138 [2018-12-24 13:56:05,197 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 [2018-12-24 13:56:05,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-24 13:56:05,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 101. [2018-12-24 13:56:05,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-24 13:56:05,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 505 transitions. [2018-12-24 13:56:05,257 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 505 transitions. Word has length 6 [2018-12-24 13:56:05,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:05,257 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 505 transitions. [2018-12-24 13:56:05,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:56:05,257 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 505 transitions. [2018-12-24 13:56:05,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:56:05,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:05,258 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:56:05,258 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:05,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:05,258 INFO L82 PathProgramCache]: Analyzing trace with hash 906397274, now seen corresponding path program 2 times [2018-12-24 13:56:05,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:05,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:05,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:05,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:05,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:05,461 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2018-12-24 13:56:05,543 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:05,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:05,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:05,543 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:56:05,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:56:05,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:05,544 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 [2018-12-24 13:56:05,553 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:56:05,553 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:56:05,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:56:05,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:56:05,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:05,568 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 [2018-12-24 13:56:05,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,574 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 [2018-12-24 13:56:05,577 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,579 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 [2018-12-24 13:56:05,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,586 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 [2018-12-24 13:56:05,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,594 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 [2018-12-24 13:56:05,594 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:05,622 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:05,636 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:05,648 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:05,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:05,678 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. [2018-12-24 13:56:05,678 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:56:05,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,713 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 [2018-12-24 13:56:05,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:05,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. [2018-12-24 13:56:05,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:05,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,785 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,797 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:05,798 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 [2018-12-24 13:56:05,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:05,840 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. [2018-12-24 13:56:05,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:05,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,882 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:05,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, 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 [2018-12-24 13:56:05,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:05,930 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. [2018-12-24 13:56:05,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:05,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,959 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,961 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,964 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,966 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:05,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 36 treesize of output 86 [2018-12-24 13:56:05,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:06,021 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. [2018-12-24 13:56:06,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:06,046 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:06,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:06,107 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:06,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:06,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2018-12-24 13:56:06,126 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:06,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:56:06,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:56:06,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:56:06,127 INFO L87 Difference]: Start difference. First operand 101 states and 505 transitions. Second operand 12 states. [2018-12-24 13:56:06,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:06,971 INFO L93 Difference]: Finished difference Result 164 states and 623 transitions. [2018-12-24 13:56:06,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:56:06,972 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2018-12-24 13:56:06,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:06,973 INFO L225 Difference]: With dead ends: 164 [2018-12-24 13:56:06,974 INFO L226 Difference]: Without dead ends: 163 [2018-12-24 13:56:06,974 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 [2018-12-24 13:56:06,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-24 13:56:07,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 100. [2018-12-24 13:56:07,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-24 13:56:07,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 499 transitions. [2018-12-24 13:56:07,036 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 499 transitions. Word has length 6 [2018-12-24 13:56:07,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:07,036 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 499 transitions. [2018-12-24 13:56:07,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:56:07,036 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 499 transitions. [2018-12-24 13:56:07,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:56:07,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:07,036 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:56:07,037 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:07,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:07,037 INFO L82 PathProgramCache]: Analyzing trace with hash 893366614, now seen corresponding path program 1 times [2018-12-24 13:56:07,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:07,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:07,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:56:07,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:07,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:07,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:56:07,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:07,172 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:07,172 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:56:07,172 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [27] [2018-12-24 13:56:07,173 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:56:07,173 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:56:07,175 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:56:07,176 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. [2018-12-24 13:56:07,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:07,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:56:07,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:07,176 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 [2018-12-24 13:56:07,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:07,187 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:56:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:07,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:07,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 [2018-12-24 13:56:07,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,202 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 [2018-12-24 13:56:07,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,208 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 [2018-12-24 13:56:07,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,221 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 [2018-12-24 13:56:07,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,235 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,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, 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 [2018-12-24 13:56:07,236 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:07,266 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:07,281 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:07,293 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:07,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:07,321 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. [2018-12-24 13:56:07,321 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2018-12-24 13:56:07,344 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,345 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,348 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,349 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,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, 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 [2018-12-24 13:56:07,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:07,396 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. [2018-12-24 13:56:07,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:07,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,425 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,431 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:07,434 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 [2018-12-24 13:56:07,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:07,482 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. [2018-12-24 13:56:07,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:07,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:07,504 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:07,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:07,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:07,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:56:07,541 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:07,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:56:07,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:56:07,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:56:07,542 INFO L87 Difference]: Start difference. First operand 100 states and 499 transitions. Second operand 8 states. [2018-12-24 13:56:07,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:07,920 INFO L93 Difference]: Finished difference Result 122 states and 529 transitions. [2018-12-24 13:56:07,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:56:07,920 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2018-12-24 13:56:07,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:07,922 INFO L225 Difference]: With dead ends: 122 [2018-12-24 13:56:07,922 INFO L226 Difference]: Without dead ends: 121 [2018-12-24 13:56:07,922 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 [2018-12-24 13:56:07,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-24 13:56:07,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 102. [2018-12-24 13:56:07,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-24 13:56:07,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 511 transitions. [2018-12-24 13:56:07,989 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 511 transitions. Word has length 6 [2018-12-24 13:56:07,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:07,989 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 511 transitions. [2018-12-24 13:56:07,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:56:07,989 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 511 transitions. [2018-12-24 13:56:07,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:56:07,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:07,990 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:56:07,990 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:07,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:07,990 INFO L82 PathProgramCache]: Analyzing trace with hash 893472260, now seen corresponding path program 1 times [2018-12-24 13:56:07,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:07,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:07,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:07,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:07,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:08,280 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2018-12-24 13:56:08,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:56:08,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:08,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:08,326 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:56:08,326 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [25] [2018-12-24 13:56:08,327 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:56:08,327 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:56:08,329 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:56:08,329 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. [2018-12-24 13:56:08,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:08,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:56:08,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:08,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-24 13:56:08,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:08,348 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:56:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:08,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:08,357 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 [2018-12-24 13:56:08,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,360 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 [2018-12-24 13:56:08,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,367 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 [2018-12-24 13:56:08,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,371 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,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, 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 [2018-12-24 13:56:08,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2018-12-24 13:56:08,379 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:08,408 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:08,422 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:08,433 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:08,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:08,462 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. [2018-12-24 13:56:08,462 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2018-12-24 13:56:08,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,485 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,485 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,488 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,497 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 [2018-12-24 13:56:08,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:08,540 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. [2018-12-24 13:56:08,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:08,562 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,563 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,565 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,569 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,570 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,571 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,575 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:08,576 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 [2018-12-24 13:56:08,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:08,620 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. [2018-12-24 13:56:08,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:08,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,663 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:08,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, 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 [2018-12-24 13:56:08,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:08,711 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. [2018-12-24 13:56:08,711 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:08,733 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:08,733 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:08,758 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:08,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:08,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-24 13:56:08,776 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:08,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:56:08,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:56:08,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:56:08,777 INFO L87 Difference]: Start difference. First operand 102 states and 511 transitions. Second operand 10 states. [2018-12-24 13:56:09,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:09,343 INFO L93 Difference]: Finished difference Result 154 states and 624 transitions. [2018-12-24 13:56:09,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:56:09,344 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-24 13:56:09,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:09,345 INFO L225 Difference]: With dead ends: 154 [2018-12-24 13:56:09,346 INFO L226 Difference]: Without dead ends: 153 [2018-12-24 13:56:09,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:56:09,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-24 13:56:09,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 111. [2018-12-24 13:56:09,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-24 13:56:09,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 566 transitions. [2018-12-24 13:56:09,423 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 566 transitions. Word has length 6 [2018-12-24 13:56:09,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:09,423 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 566 transitions. [2018-12-24 13:56:09,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:56:09,423 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 566 transitions. [2018-12-24 13:56:09,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:56:09,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:09,423 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:56:09,424 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:09,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:09,424 INFO L82 PathProgramCache]: Analyzing trace with hash 897358608, now seen corresponding path program 1 times [2018-12-24 13:56:09,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:09,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:09,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:09,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:09,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:09,957 WARN L181 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2018-12-24 13:56:10,214 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2018-12-24 13:56:10,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:56:10,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:10,219 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:10,219 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:56:10,219 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [27] [2018-12-24 13:56:10,219 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:56:10,219 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:56:10,221 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:56:10,221 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. [2018-12-24 13:56:10,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:10,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:56:10,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:10,223 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 [2018-12-24 13:56:10,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:10,233 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:56:10,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:10,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:10,240 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 [2018-12-24 13:56:10,245 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 [2018-12-24 13:56:10,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:10,248 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 [2018-12-24 13:56:10,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:10,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:10,257 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 [2018-12-24 13:56:10,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:10,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:10,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:10,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, 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 [2018-12-24 13:56:10,268 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:10,288 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:10,300 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:10,309 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:10,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:10,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. [2018-12-24 13:56:10,336 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2018-12-24 13:56:10,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:10,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:10,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:10,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:10,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:10,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:10,371 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:10,372 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 [2018-12-24 13:56:10,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:10,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. [2018-12-24 13:56:10,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:56:10,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:10,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:10,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:10,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:10,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:10,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:10,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:10,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:10,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:10,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 33 treesize of output 67 [2018-12-24 13:56:10,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:10,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. [2018-12-24 13:56:10,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2018-12-24 13:56:10,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:10,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:10,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:10,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:10,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:56:10,519 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:10,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:56:10,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:56:10,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:56:10,520 INFO L87 Difference]: Start difference. First operand 111 states and 566 transitions. Second operand 8 states. [2018-12-24 13:56:10,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:10,842 INFO L93 Difference]: Finished difference Result 130 states and 583 transitions. [2018-12-24 13:56:10,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:56:10,842 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2018-12-24 13:56:10,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:10,844 INFO L225 Difference]: With dead ends: 130 [2018-12-24 13:56:10,844 INFO L226 Difference]: Without dead ends: 129 [2018-12-24 13:56:10,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:56:10,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-24 13:56:10,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 111. [2018-12-24 13:56:10,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-24 13:56:10,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 566 transitions. [2018-12-24 13:56:10,918 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 566 transitions. Word has length 6 [2018-12-24 13:56:10,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:10,918 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 566 transitions. [2018-12-24 13:56:10,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:56:10,918 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 566 transitions. [2018-12-24 13:56:10,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:56:10,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:10,919 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:56:10,919 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:10,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:10,919 INFO L82 PathProgramCache]: Analyzing trace with hash 896931860, now seen corresponding path program 2 times [2018-12-24 13:56:10,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:10,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:10,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:10,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:10,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:11,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:56:11,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:11,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:11,035 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:56:11,035 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:56:11,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:11,035 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 [2018-12-24 13:56:11,044 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:56:11,044 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:56:11,050 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:56:11,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:56:11,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:11,056 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 [2018-12-24 13:56:11,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,060 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 [2018-12-24 13:56:11,062 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,064 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 [2018-12-24 13:56:11,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,071 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 [2018-12-24 13:56:11,075 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,075 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,077 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,078 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 [2018-12-24 13:56:11,079 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:11,107 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:11,122 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:11,133 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:11,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:11,161 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. [2018-12-24 13:56:11,161 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2018-12-24 13:56:11,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,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, 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 [2018-12-24 13:56:11,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:11,241 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. [2018-12-24 13:56:11,241 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:11,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,284 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,287 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,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 38 treesize of output 88 [2018-12-24 13:56:11,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:11,351 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. [2018-12-24 13:56:11,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2018-12-24 13:56:11,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,379 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,380 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,384 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,387 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,391 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:11,392 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:11,393 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 [2018-12-24 13:56:11,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:11,439 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. [2018-12-24 13:56:11,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:56:11,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:11,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:11,491 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:11,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:11,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2018-12-24 13:56:11,510 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:11,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-24 13:56:11,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-24 13:56:11,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:56:11,510 INFO L87 Difference]: Start difference. First operand 111 states and 566 transitions. Second operand 9 states. [2018-12-24 13:56:12,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:12,022 INFO L93 Difference]: Finished difference Result 160 states and 682 transitions. [2018-12-24 13:56:12,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:56:12,024 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2018-12-24 13:56:12,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:12,026 INFO L225 Difference]: With dead ends: 160 [2018-12-24 13:56:12,026 INFO L226 Difference]: Without dead ends: 159 [2018-12-24 13:56:12,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-12-24 13:56:12,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-24 13:56:12,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 117. [2018-12-24 13:56:12,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-24 13:56:12,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 603 transitions. [2018-12-24 13:56:12,101 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 603 transitions. Word has length 6 [2018-12-24 13:56:12,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:12,101 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 603 transitions. [2018-12-24 13:56:12,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-24 13:56:12,101 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 603 transitions. [2018-12-24 13:56:12,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:56:12,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:12,102 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:56:12,102 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:12,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:12,102 INFO L82 PathProgramCache]: Analyzing trace with hash 897479758, now seen corresponding path program 1 times [2018-12-24 13:56:12,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:12,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:12,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:56:12,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:12,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:12,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:12,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:12,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:12,228 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:56:12,228 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [26], [28], [29] [2018-12-24 13:56:12,231 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:56:12,231 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:56:12,233 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:56:12,233 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. [2018-12-24 13:56:12,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:12,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:56:12,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:12,234 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 [2018-12-24 13:56:12,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:12,246 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:56:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:12,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:12,255 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 [2018-12-24 13:56:12,262 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 [2018-12-24 13:56:12,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:12,270 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 [2018-12-24 13:56:12,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:12,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:12,285 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 [2018-12-24 13:56:12,294 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:12,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:12,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:12,305 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 [2018-12-24 13:56:12,305 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:12,338 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:12,358 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:12,373 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:12,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:12,402 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. [2018-12-24 13:56:12,402 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2018-12-24 13:56:12,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:12,431 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:12,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:12,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:12,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:12,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:12,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:12,438 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 [2018-12-24 13:56:12,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:12,466 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. [2018-12-24 13:56:12,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2018-12-24 13:56:12,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:12,483 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:12,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:12,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-24 13:56:12,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2018-12-24 13:56:12,512 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:56:12,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 13:56:12,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 13:56:12,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:56:12,512 INFO L87 Difference]: Start difference. First operand 117 states and 603 transitions. Second operand 4 states. [2018-12-24 13:56:12,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:12,615 INFO L93 Difference]: Finished difference Result 121 states and 607 transitions. [2018-12-24 13:56:12,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 13:56:12,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-24 13:56:12,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:12,617 INFO L225 Difference]: With dead ends: 121 [2018-12-24 13:56:12,617 INFO L226 Difference]: Without dead ends: 117 [2018-12-24 13:56:12,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:56:12,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-24 13:56:12,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2018-12-24 13:56:12,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-24 13:56:12,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 599 transitions. [2018-12-24 13:56:12,689 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 599 transitions. Word has length 6 [2018-12-24 13:56:12,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:12,689 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 599 transitions. [2018-12-24 13:56:12,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 13:56:12,690 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 599 transitions. [2018-12-24 13:56:12,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:56:12,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:12,690 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:56:12,690 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:12,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:12,691 INFO L82 PathProgramCache]: Analyzing trace with hash 897162312, now seen corresponding path program 2 times [2018-12-24 13:56:12,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:12,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:12,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:12,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:12,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:12,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:12,890 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 21 [2018-12-24 13:56:12,963 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:12,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:12,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:12,963 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:56:12,963 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:56:12,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:12,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 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 [2018-12-24 13:56:12,975 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:56:12,975 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:56:13,002 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:56:13,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:56:13,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:13,005 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 [2018-12-24 13:56:13,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,014 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 [2018-12-24 13:56:13,017 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,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 [2018-12-24 13:56:13,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,031 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 [2018-12-24 13:56:13,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,043 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 [2018-12-24 13:56:13,044 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:13,073 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:13,089 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:13,102 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:13,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:13,133 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. [2018-12-24 13:56:13,133 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:56:13,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,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 [2018-12-24 13:56:13,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:13,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. [2018-12-24 13:56:13,224 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:13,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,263 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,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, 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 [2018-12-24 13:56:13,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:13,325 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. [2018-12-24 13:56:13,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2018-12-24 13:56:13,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,358 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,366 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:13,366 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 [2018-12-24 13:56:13,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:13,416 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. [2018-12-24 13:56:13,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2018-12-24 13:56:13,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,444 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,559 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:13,592 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:13,592 INFO L303 Elim1Store]: Index analysis took 153 ms [2018-12-24 13:56:13,593 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 [2018-12-24 13:56:13,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:13,778 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. [2018-12-24 13:56:13,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:56:13,803 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:13,803 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:13,856 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:13,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:13,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2018-12-24 13:56:13,876 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:13,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:56:13,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:56:13,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:56:13,876 INFO L87 Difference]: Start difference. First operand 114 states and 599 transitions. Second operand 12 states. [2018-12-24 13:56:14,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:14,804 INFO L93 Difference]: Finished difference Result 186 states and 791 transitions. [2018-12-24 13:56:14,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:56:14,804 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2018-12-24 13:56:14,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:14,807 INFO L225 Difference]: With dead ends: 186 [2018-12-24 13:56:14,807 INFO L226 Difference]: Without dead ends: 184 [2018-12-24 13:56:14,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2018-12-24 13:56:14,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-24 13:56:14,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 121. [2018-12-24 13:56:14,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-24 13:56:14,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 632 transitions. [2018-12-24 13:56:14,909 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 632 transitions. Word has length 6 [2018-12-24 13:56:14,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:14,909 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 632 transitions. [2018-12-24 13:56:14,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:56:14,910 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 632 transitions. [2018-12-24 13:56:14,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:56:14,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:14,910 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:56:14,910 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:14,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:14,911 INFO L82 PathProgramCache]: Analyzing trace with hash 897179862, now seen corresponding path program 1 times [2018-12-24 13:56:14,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:14,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:14,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:56:14,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:14,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:15,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:56:15,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:15,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:15,050 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:56:15,050 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [27] [2018-12-24 13:56:15,051 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:56:15,051 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:56:15,053 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:56:15,053 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. [2018-12-24 13:56:15,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:15,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:56:15,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:15,054 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 [2018-12-24 13:56:15,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:15,062 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:56:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:15,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:15,071 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 [2018-12-24 13:56:15,075 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 [2018-12-24 13:56:15,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:15,082 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 [2018-12-24 13:56:15,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:15,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:15,089 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 [2018-12-24 13:56:15,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:15,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:15,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:15,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, 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 [2018-12-24 13:56:15,100 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:15,119 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:15,130 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:15,141 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:15,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:15,167 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. [2018-12-24 13:56:15,167 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2018-12-24 13:56:15,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:15,197 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:15,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:15,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:15,201 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:15,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:15,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:15,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, 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 [2018-12-24 13:56:15,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:15,231 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. [2018-12-24 13:56:15,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2018-12-24 13:56:15,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:15,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:15,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:15,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:15,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:15,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:15,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:15,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:15,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:15,257 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 [2018-12-24 13:56:15,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:15,290 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. [2018-12-24 13:56:15,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2018-12-24 13:56:15,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:15,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:15,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:15,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:15,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2018-12-24 13:56:15,337 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:15,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:56:15,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:56:15,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:56:15,338 INFO L87 Difference]: Start difference. First operand 121 states and 632 transitions. Second operand 8 states. [2018-12-24 13:56:15,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:15,694 INFO L93 Difference]: Finished difference Result 161 states and 745 transitions. [2018-12-24 13:56:15,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:56:15,694 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2018-12-24 13:56:15,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:15,696 INFO L225 Difference]: With dead ends: 161 [2018-12-24 13:56:15,697 INFO L226 Difference]: Without dead ends: 160 [2018-12-24 13:56:15,697 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 [2018-12-24 13:56:15,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-24 13:56:15,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 133. [2018-12-24 13:56:15,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-24 13:56:15,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 714 transitions. [2018-12-24 13:56:15,817 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 714 transitions. Word has length 6 [2018-12-24 13:56:15,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:15,817 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 714 transitions. [2018-12-24 13:56:15,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:56:15,817 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 714 transitions. [2018-12-24 13:56:15,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:56:15,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:15,818 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:56:15,818 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:15,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:15,818 INFO L82 PathProgramCache]: Analyzing trace with hash 900993110, now seen corresponding path program 2 times [2018-12-24 13:56:15,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:15,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:15,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:15,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:15,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:15,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:15,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:15,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:15,911 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:56:15,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:56:15,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:15,911 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 [2018-12-24 13:56:15,922 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:56:15,922 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:56:15,928 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-24 13:56:15,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:56:15,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:15,934 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 [2018-12-24 13:56:15,938 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 [2018-12-24 13:56:15,946 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 [2018-12-24 13:56:15,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:15,955 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 [2018-12-24 13:56:15,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:15,966 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:15,967 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 [2018-12-24 13:56:15,967 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:15,982 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:15,992 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:16,004 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:16,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:16,028 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. [2018-12-24 13:56:16,028 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2018-12-24 13:56:16,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:16,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:16,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:16,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:16,057 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 [2018-12-24 13:56:16,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:16,072 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. [2018-12-24 13:56:16,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-24 13:56:16,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:16,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:16,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:16,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:16,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:16,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:16,095 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 [2018-12-24 13:56:16,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:16,114 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. [2018-12-24 13:56:16,114 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2018-12-24 13:56:16,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:16,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:16,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:16,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:16,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:56:16,167 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:16,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:56:16,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:56:16,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:56:16,167 INFO L87 Difference]: Start difference. First operand 133 states and 714 transitions. Second operand 8 states. [2018-12-24 13:56:16,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:16,519 INFO L93 Difference]: Finished difference Result 172 states and 801 transitions. [2018-12-24 13:56:16,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:56:16,520 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2018-12-24 13:56:16,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:16,522 INFO L225 Difference]: With dead ends: 172 [2018-12-24 13:56:16,522 INFO L226 Difference]: Without dead ends: 170 [2018-12-24 13:56:16,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:56:16,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-24 13:56:16,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 137. [2018-12-24 13:56:16,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-24 13:56:16,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 738 transitions. [2018-12-24 13:56:16,608 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 738 transitions. Word has length 6 [2018-12-24 13:56:16,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:16,608 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 738 transitions. [2018-12-24 13:56:16,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:56:16,609 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 738 transitions. [2018-12-24 13:56:16,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:56:16,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:16,609 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:56:16,610 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:16,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:16,610 INFO L82 PathProgramCache]: Analyzing trace with hash 900629352, now seen corresponding path program 3 times [2018-12-24 13:56:16,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:16,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:16,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:56:16,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:16,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:16,777 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:16,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:16,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:16,778 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:56:16,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:56:16,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:16,778 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 [2018-12-24 13:56:16,787 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:56:16,788 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:56:16,792 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:56:16,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:56:16,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:16,797 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 [2018-12-24 13:56:16,801 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:16,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 [2018-12-24 13:56:16,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:16,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:16,812 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 [2018-12-24 13:56:16,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:16,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:16,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:16,821 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 [2018-12-24 13:56:16,824 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:16,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:16,828 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:16,828 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:16,829 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 [2018-12-24 13:56:16,829 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:16,856 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:16,870 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:16,882 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:16,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:16,909 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. [2018-12-24 13:56:16,910 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:56:16,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:16,939 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:16,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:16,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:16,943 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:16,945 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:16,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:16,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:16,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:16,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:16,951 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:16,952 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 [2018-12-24 13:56:16,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:16,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. [2018-12-24 13:56:16,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:17,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,035 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:17,036 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 [2018-12-24 13:56:17,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:17,082 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. [2018-12-24 13:56:17,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:17,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,110 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,113 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,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, 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 [2018-12-24 13:56:17,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:17,183 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. [2018-12-24 13:56:17,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:17,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,236 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,241 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,243 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,256 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:17,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:17,259 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 [2018-12-24 13:56:17,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:17,337 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. [2018-12-24 13:56:17,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2018-12-24 13:56:17,384 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:17,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:17,453 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:17,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:17,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2018-12-24 13:56:17,473 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:17,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:56:17,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:56:17,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:56:17,473 INFO L87 Difference]: Start difference. First operand 137 states and 738 transitions. Second operand 12 states. [2018-12-24 13:56:18,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:18,276 INFO L93 Difference]: Finished difference Result 209 states and 906 transitions. [2018-12-24 13:56:18,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:56:18,277 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2018-12-24 13:56:18,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:18,279 INFO L225 Difference]: With dead ends: 209 [2018-12-24 13:56:18,279 INFO L226 Difference]: Without dead ends: 207 [2018-12-24 13:56:18,280 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 [2018-12-24 13:56:18,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-12-24 13:56:18,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 123. [2018-12-24 13:56:18,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-24 13:56:18,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 652 transitions. [2018-12-24 13:56:18,369 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 652 transitions. Word has length 6 [2018-12-24 13:56:18,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:18,369 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 652 transitions. [2018-12-24 13:56:18,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:56:18,370 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 652 transitions. [2018-12-24 13:56:18,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:56:18,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:18,370 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:56:18,370 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:18,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:18,371 INFO L82 PathProgramCache]: Analyzing trace with hash 900750874, now seen corresponding path program 2 times [2018-12-24 13:56:18,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:18,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:18,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:56:18,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:18,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:18,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:18,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:18,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:18,512 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:56:18,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:56:18,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:18,513 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 [2018-12-24 13:56:18,523 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:56:18,523 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:56:18,530 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:56:18,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:56:18,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:18,535 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 [2018-12-24 13:56:18,539 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 [2018-12-24 13:56:18,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:18,549 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 [2018-12-24 13:56:18,557 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:18,558 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:18,559 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 [2018-12-24 13:56:18,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:18,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:18,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:18,569 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 [2018-12-24 13:56:18,569 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:18,588 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:18,599 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:18,609 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:18,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:18,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. [2018-12-24 13:56:18,635 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2018-12-24 13:56:18,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:18,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:18,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:18,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:18,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:18,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:18,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:18,673 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 [2018-12-24 13:56:18,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:18,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. [2018-12-24 13:56:18,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:56:18,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:18,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:18,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:18,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:18,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:18,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:18,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:18,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:18,726 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:18,727 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 [2018-12-24 13:56:18,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:18,758 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. [2018-12-24 13:56:18,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:56:18,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:18,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:18,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:18,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:18,828 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:18,828 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:18,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:18,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:18,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:18,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:18,832 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:18,833 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:18,834 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 [2018-12-24 13:56:18,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:18,867 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. [2018-12-24 13:56:18,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2018-12-24 13:56:18,883 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:18,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:18,949 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:18,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:18,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-24 13:56:18,968 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:18,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:56:18,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:56:18,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:56:18,968 INFO L87 Difference]: Start difference. First operand 123 states and 652 transitions. Second operand 10 states. [2018-12-24 13:56:19,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:19,475 INFO L93 Difference]: Finished difference Result 180 states and 787 transitions. [2018-12-24 13:56:19,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:56:19,476 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-24 13:56:19,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:19,478 INFO L225 Difference]: With dead ends: 180 [2018-12-24 13:56:19,478 INFO L226 Difference]: Without dead ends: 173 [2018-12-24 13:56:19,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2018-12-24 13:56:19,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-24 13:56:19,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 134. [2018-12-24 13:56:19,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-24 13:56:19,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 703 transitions. [2018-12-24 13:56:19,583 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 703 transitions. Word has length 6 [2018-12-24 13:56:19,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:19,583 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 703 transitions. [2018-12-24 13:56:19,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:56:19,583 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 703 transitions. [2018-12-24 13:56:19,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:56:19,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:19,584 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:56:19,584 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:19,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:19,584 INFO L82 PathProgramCache]: Analyzing trace with hash -2018172698, now seen corresponding path program 1 times [2018-12-24 13:56:19,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:19,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:19,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:56:19,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:19,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:20,183 WARN L181 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2018-12-24 13:56:20,286 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:56:20,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:20,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:20,287 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:56:20,287 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [25] [2018-12-24 13:56:20,289 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:56:20,289 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:56:20,292 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:56:20,292 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. [2018-12-24 13:56:20,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:20,292 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:56:20,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:20,293 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 [2018-12-24 13:56:20,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:20,307 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:56:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:20,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:20,315 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 [2018-12-24 13:56:20,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,317 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 [2018-12-24 13:56:20,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,321 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 [2018-12-24 13:56:20,325 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,328 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,328 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 [2018-12-24 13:56:20,332 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,337 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 [2018-12-24 13:56:20,338 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:20,364 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:20,379 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:20,390 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:20,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:20,418 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. [2018-12-24 13:56:20,418 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:56:20,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,452 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 [2018-12-24 13:56:20,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:20,490 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. [2018-12-24 13:56:20,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:20,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,510 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,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, 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 [2018-12-24 13:56:20,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:20,565 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. [2018-12-24 13:56:20,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2018-12-24 13:56:20,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,604 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:20,604 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 [2018-12-24 13:56:20,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:20,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. [2018-12-24 13:56:20,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:56:20,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,677 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,681 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,683 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,689 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:20,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:20,692 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 [2018-12-24 13:56:20,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:20,740 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. [2018-12-24 13:56:20,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2018-12-24 13:56:20,763 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:20,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:20,960 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:20,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:20,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2018-12-24 13:56:20,980 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:20,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:56:20,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:56:20,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:56:20,980 INFO L87 Difference]: Start difference. First operand 134 states and 703 transitions. Second operand 12 states. [2018-12-24 13:56:21,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:21,810 INFO L93 Difference]: Finished difference Result 189 states and 804 transitions. [2018-12-24 13:56:21,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:56:21,810 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2018-12-24 13:56:21,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:21,812 INFO L225 Difference]: With dead ends: 189 [2018-12-24 13:56:21,812 INFO L226 Difference]: Without dead ends: 188 [2018-12-24 13:56:21,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2018-12-24 13:56:21,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-12-24 13:56:21,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 133. [2018-12-24 13:56:21,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-24 13:56:21,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 697 transitions. [2018-12-24 13:56:21,922 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 697 transitions. Word has length 7 [2018-12-24 13:56:21,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:21,923 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 697 transitions. [2018-12-24 13:56:21,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:56:21,923 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 697 transitions. [2018-12-24 13:56:21,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:56:21,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:21,923 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:56:21,923 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:21,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:21,924 INFO L82 PathProgramCache]: Analyzing trace with hash -2018168854, now seen corresponding path program 1 times [2018-12-24 13:56:21,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:21,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:21,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:21,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:21,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:22,134 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:56:22,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:22,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:22,135 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:56:22,135 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [25] [2018-12-24 13:56:22,136 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:56:22,136 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:56:22,139 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:56:22,139 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. [2018-12-24 13:56:22,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:22,139 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:56:22,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:22,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 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 [2018-12-24 13:56:22,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:22,148 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:56:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:22,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:22,156 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 [2018-12-24 13:56:22,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,159 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 [2018-12-24 13:56:22,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,164 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 [2018-12-24 13:56:22,175 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,178 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 [2018-12-24 13:56:22,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,188 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 [2018-12-24 13:56:22,188 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:22,225 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:22,240 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:22,258 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:22,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:22,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:22,294 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2018-12-24 13:56:22,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,344 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,348 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,356 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 [2018-12-24 13:56:22,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:22,409 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. [2018-12-24 13:56:22,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:22,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,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 38 treesize of output 80 [2018-12-24 13:56:22,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:22,528 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. [2018-12-24 13:56:22,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2018-12-24 13:56:22,565 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,569 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,571 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,592 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:22,592 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 [2018-12-24 13:56:22,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:22,651 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. [2018-12-24 13:56:22,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2018-12-24 13:56:22,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,677 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,681 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,683 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:22,690 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:22,691 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 [2018-12-24 13:56:22,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:22,740 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. [2018-12-24 13:56:22,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:56:22,764 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:22,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:22,829 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:22,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:22,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2018-12-24 13:56:22,850 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:22,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-24 13:56:22,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-24 13:56:22,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:56:22,850 INFO L87 Difference]: Start difference. First operand 133 states and 697 transitions. Second operand 11 states. [2018-12-24 13:56:23,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:23,642 INFO L93 Difference]: Finished difference Result 169 states and 746 transitions. [2018-12-24 13:56:23,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:56:23,643 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2018-12-24 13:56:23,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:23,645 INFO L225 Difference]: With dead ends: 169 [2018-12-24 13:56:23,645 INFO L226 Difference]: Without dead ends: 168 [2018-12-24 13:56:23,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=249, Unknown=0, NotChecked=0, Total=380 [2018-12-24 13:56:23,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-12-24 13:56:23,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 132. [2018-12-24 13:56:23,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-24 13:56:23,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 691 transitions. [2018-12-24 13:56:23,746 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 691 transitions. Word has length 7 [2018-12-24 13:56:23,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:23,746 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 691 transitions. [2018-12-24 13:56:23,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-24 13:56:23,746 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 691 transitions. [2018-12-24 13:56:23,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:56:23,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:23,747 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:56:23,747 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:23,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:23,747 INFO L82 PathProgramCache]: Analyzing trace with hash -2017620956, now seen corresponding path program 1 times [2018-12-24 13:56:23,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:23,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:23,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:23,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:23,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:23,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:23,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:23,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:23,835 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:56:23,835 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [29] [2018-12-24 13:56:23,836 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:56:23,836 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:56:23,838 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:56:23,838 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. [2018-12-24 13:56:23,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:23,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:56:23,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:23,839 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 [2018-12-24 13:56:23,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:23,846 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:56:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:23,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:23,854 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 [2018-12-24 13:56:23,858 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 [2018-12-24 13:56:23,866 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 [2018-12-24 13:56:23,874 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 [2018-12-24 13:56:23,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:23,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, 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 [2018-12-24 13:56:23,886 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:23,896 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:23,906 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:23,923 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:23,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:23,945 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. [2018-12-24 13:56:23,945 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:22, output treesize:29 [2018-12-24 13:56:23,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:23,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:23,971 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 [2018-12-24 13:56:23,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:23,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:23,979 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-12-24 13:56:23,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:23,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:23,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:23,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:23,994 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 [2018-12-24 13:56:23,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:24,005 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. [2018-12-24 13:56:24,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2018-12-24 13:56:24,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:24,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:24,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:24,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:24,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:56:24,054 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:24,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:56:24,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:56:24,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:56:24,054 INFO L87 Difference]: Start difference. First operand 132 states and 691 transitions. Second operand 8 states. [2018-12-24 13:56:24,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:24,357 INFO L93 Difference]: Finished difference Result 159 states and 727 transitions. [2018-12-24 13:56:24,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:56:24,357 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-12-24 13:56:24,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:24,359 INFO L225 Difference]: With dead ends: 159 [2018-12-24 13:56:24,359 INFO L226 Difference]: Without dead ends: 158 [2018-12-24 13:56:24,360 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 [2018-12-24 13:56:24,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-24 13:56:24,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 136. [2018-12-24 13:56:24,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-24 13:56:24,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 706 transitions. [2018-12-24 13:56:24,464 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 706 transitions. Word has length 7 [2018-12-24 13:56:24,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:24,464 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 706 transitions. [2018-12-24 13:56:24,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:56:24,464 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 706 transitions. [2018-12-24 13:56:24,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:56:24,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:24,465 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:56:24,465 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:24,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:24,465 INFO L82 PathProgramCache]: Analyzing trace with hash -2018050250, now seen corresponding path program 1 times [2018-12-24 13:56:24,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:24,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:24,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:24,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:24,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:24,682 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:24,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:24,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:24,683 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:56:24,683 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [23] [2018-12-24 13:56:24,683 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:56:24,683 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:56:24,685 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:56:24,685 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. [2018-12-24 13:56:24,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:24,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:56:24,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:24,686 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 [2018-12-24 13:56:24,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:24,698 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:56:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:24,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:24,707 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 [2018-12-24 13:56:24,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,709 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 [2018-12-24 13:56:24,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,748 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,748 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 [2018-12-24 13:56:24,751 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,755 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,755 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 [2018-12-24 13:56:24,763 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,764 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,766 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,766 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 [2018-12-24 13:56:24,766 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:24,795 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:24,810 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:24,821 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:24,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:24,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:24,850 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2018-12-24 13:56:24,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,875 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,885 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 [2018-12-24 13:56:24,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:24,927 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. [2018-12-24 13:56:24,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:24,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,959 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,961 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,962 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,964 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,966 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:24,968 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 [2018-12-24 13:56:24,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:25,013 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. [2018-12-24 13:56:25,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2018-12-24 13:56:25,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,050 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:25,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,052 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 [2018-12-24 13:56:25,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:25,104 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. [2018-12-24 13:56:25,104 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2018-12-24 13:56:25,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,131 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,132 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,133 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,144 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:25,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, 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 [2018-12-24 13:56:25,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:25,191 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. [2018-12-24 13:56:25,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2018-12-24 13:56:25,241 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:25,258 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:25,259 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 [2018-12-24 13:56:25,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:25,309 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. [2018-12-24 13:56:25,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2018-12-24 13:56:25,329 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:25,330 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:25,398 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:25,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:25,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2018-12-24 13:56:25,418 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:25,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-24 13:56:25,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-24 13:56:25,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=212, Unknown=0, NotChecked=0, Total=342 [2018-12-24 13:56:25,418 INFO L87 Difference]: Start difference. First operand 136 states and 706 transitions. Second operand 14 states. [2018-12-24 13:56:26,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:26,732 INFO L93 Difference]: Finished difference Result 199 states and 872 transitions. [2018-12-24 13:56:26,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:56:26,732 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2018-12-24 13:56:26,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:26,735 INFO L225 Difference]: With dead ends: 199 [2018-12-24 13:56:26,735 INFO L226 Difference]: Without dead ends: 198 [2018-12-24 13:56:26,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=320, Unknown=0, NotChecked=0, Total=506 [2018-12-24 13:56:26,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-12-24 13:56:26,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 134. [2018-12-24 13:56:26,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-24 13:56:26,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 693 transitions. [2018-12-24 13:56:26,842 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 693 transitions. Word has length 7 [2018-12-24 13:56:26,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:26,843 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 693 transitions. [2018-12-24 13:56:26,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-24 13:56:26,843 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 693 transitions. [2018-12-24 13:56:26,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:56:26,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:26,843 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:56:26,843 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:26,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:26,844 INFO L82 PathProgramCache]: Analyzing trace with hash -2018049690, now seen corresponding path program 1 times [2018-12-24 13:56:26,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:26,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:26,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:26,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:26,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:26,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:27,020 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2018-12-24 13:56:27,098 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:27,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:27,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:27,099 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:56:27,099 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [25] [2018-12-24 13:56:27,100 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:56:27,100 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:56:27,102 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:56:27,102 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. [2018-12-24 13:56:27,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:27,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:56:27,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:27,103 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 [2018-12-24 13:56:27,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:27,116 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:56:27,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:27,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:27,124 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 [2018-12-24 13:56:27,127 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 [2018-12-24 13:56:27,134 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,135 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 [2018-12-24 13:56:27,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,145 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 [2018-12-24 13:56:27,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,157 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 [2018-12-24 13:56:27,158 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:27,181 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:27,194 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:27,205 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:27,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:27,232 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. [2018-12-24 13:56:27,232 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2018-12-24 13:56:27,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,287 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,294 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 [2018-12-24 13:56:27,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:27,321 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. [2018-12-24 13:56:27,321 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2018-12-24 13:56:27,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,345 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,348 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,349 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,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 33 treesize of output 59 [2018-12-24 13:56:27,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:27,388 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. [2018-12-24 13:56:27,388 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2018-12-24 13:56:27,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,425 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,431 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,437 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:27,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,440 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 [2018-12-24 13:56:27,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:27,482 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. [2018-12-24 13:56:27,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2018-12-24 13:56:27,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,531 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,533 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:27,535 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:27,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, 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 [2018-12-24 13:56:27,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:27,580 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. [2018-12-24 13:56:27,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2018-12-24 13:56:27,611 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:27,611 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:27,737 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:27,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:27,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2018-12-24 13:56:27,754 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:27,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:56:27,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:56:27,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:56:27,755 INFO L87 Difference]: Start difference. First operand 134 states and 693 transitions. Second operand 12 states. [2018-12-24 13:56:28,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:28,461 INFO L93 Difference]: Finished difference Result 181 states and 747 transitions. [2018-12-24 13:56:28,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:56:28,461 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2018-12-24 13:56:28,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:28,463 INFO L225 Difference]: With dead ends: 181 [2018-12-24 13:56:28,463 INFO L226 Difference]: Without dead ends: 180 [2018-12-24 13:56:28,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2018-12-24 13:56:28,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-12-24 13:56:28,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 134. [2018-12-24 13:56:28,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-24 13:56:28,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 693 transitions. [2018-12-24 13:56:28,570 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 693 transitions. Word has length 7 [2018-12-24 13:56:28,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:28,570 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 693 transitions. [2018-12-24 13:56:28,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:56:28,570 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 693 transitions. [2018-12-24 13:56:28,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:56:28,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:28,571 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:56:28,571 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:28,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:28,571 INFO L82 PathProgramCache]: Analyzing trace with hash -2017938650, now seen corresponding path program 2 times [2018-12-24 13:56:28,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:28,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:28,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:28,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:28,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:28,808 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:28,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:28,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:28,809 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:56:28,809 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:56:28,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:28,809 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 [2018-12-24 13:56:28,818 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:56:28,818 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:56:28,826 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-24 13:56:28,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:56:28,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:28,832 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 [2018-12-24 13:56:28,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:28,836 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 [2018-12-24 13:56:28,838 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:28,841 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:28,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-24 13:56:28,846 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:28,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:28,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:28,851 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 [2018-12-24 13:56:28,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:28,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:28,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:28,860 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:28,860 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 [2018-12-24 13:56:28,861 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:28,888 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:28,903 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:28,915 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:28,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:28,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:28,942 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2018-12-24 13:56:28,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:28,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:28,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:28,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:28,973 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:28,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:28,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:28,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:28,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:28,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:28,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:28,981 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 [2018-12-24 13:56:28,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:29,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. [2018-12-24 13:56:29,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:29,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,062 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,074 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,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, 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 [2018-12-24 13:56:29,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:29,121 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. [2018-12-24 13:56:29,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2018-12-24 13:56:29,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,163 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:29,164 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 [2018-12-24 13:56:29,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:29,213 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. [2018-12-24 13:56:29,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2018-12-24 13:56:29,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,257 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:29,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 38 treesize of output 94 [2018-12-24 13:56:29,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:29,308 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. [2018-12-24 13:56:29,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2018-12-24 13:56:29,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,344 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,345 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,346 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:29,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:29,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 38 treesize of output 93 [2018-12-24 13:56:29,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:29,396 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. [2018-12-24 13:56:29,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2018-12-24 13:56:29,421 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:29,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:29,508 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:29,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:29,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2018-12-24 13:56:29,527 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:29,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-24 13:56:29,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-24 13:56:29,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=239, Unknown=0, NotChecked=0, Total=380 [2018-12-24 13:56:29,528 INFO L87 Difference]: Start difference. First operand 134 states and 693 transitions. Second operand 14 states. [2018-12-24 13:56:30,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:30,829 INFO L93 Difference]: Finished difference Result 200 states and 825 transitions. [2018-12-24 13:56:30,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:56:30,830 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2018-12-24 13:56:30,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:30,832 INFO L225 Difference]: With dead ends: 200 [2018-12-24 13:56:30,832 INFO L226 Difference]: Without dead ends: 199 [2018-12-24 13:56:30,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=191, Invalid=361, Unknown=0, NotChecked=0, Total=552 [2018-12-24 13:56:30,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-12-24 13:56:30,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 131. [2018-12-24 13:56:30,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-24 13:56:30,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 674 transitions. [2018-12-24 13:56:30,945 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 674 transitions. Word has length 7 [2018-12-24 13:56:30,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:30,945 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 674 transitions. [2018-12-24 13:56:30,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-24 13:56:30,946 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 674 transitions. [2018-12-24 13:56:30,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:56:30,946 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:30,946 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:56:30,946 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:30,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:30,947 INFO L82 PathProgramCache]: Analyzing trace with hash -2030969310, now seen corresponding path program 1 times [2018-12-24 13:56:30,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:30,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:30,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:56:30,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:30,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:31,097 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:56:31,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:31,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:31,098 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:56:31,098 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [27] [2018-12-24 13:56:31,098 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:56:31,098 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:56:31,100 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:56:31,100 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. [2018-12-24 13:56:31,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:31,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:56:31,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:31,101 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 [2018-12-24 13:56:31,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:31,109 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:56:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:31,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:31,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 [2018-12-24 13:56:31,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,124 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 [2018-12-24 13:56:31,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,128 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 [2018-12-24 13:56:31,132 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,133 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,135 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 [2018-12-24 13:56:31,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,143 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 [2018-12-24 13:56:31,143 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:31,172 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:31,187 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:31,199 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:31,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:31,228 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. [2018-12-24 13:56:31,228 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:56:31,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,260 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,263 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 [2018-12-24 13:56:31,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:31,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. [2018-12-24 13:56:31,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:31,329 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,330 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,331 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,332 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,344 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,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, 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 [2018-12-24 13:56:31,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:31,398 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. [2018-12-24 13:56:31,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2018-12-24 13:56:31,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,425 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,431 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,435 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:31,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:31,437 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 [2018-12-24 13:56:31,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:31,488 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. [2018-12-24 13:56:31,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2018-12-24 13:56:31,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:31,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:31,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:31,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:31,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:56:31,564 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:31,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:56:31,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:56:31,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:56:31,564 INFO L87 Difference]: Start difference. First operand 131 states and 674 transitions. Second operand 10 states. [2018-12-24 13:56:32,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:32,115 INFO L93 Difference]: Finished difference Result 160 states and 731 transitions. [2018-12-24 13:56:32,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:56:32,116 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2018-12-24 13:56:32,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:32,118 INFO L225 Difference]: With dead ends: 160 [2018-12-24 13:56:32,118 INFO L226 Difference]: Without dead ends: 159 [2018-12-24 13:56:32,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:56:32,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-24 13:56:32,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 137. [2018-12-24 13:56:32,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-24 13:56:32,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 710 transitions. [2018-12-24 13:56:32,234 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 710 transitions. Word has length 7 [2018-12-24 13:56:32,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:32,235 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 710 transitions. [2018-12-24 13:56:32,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:56:32,235 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 710 transitions. [2018-12-24 13:56:32,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:56:32,235 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:32,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:56:32,236 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:32,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:32,236 INFO L82 PathProgramCache]: Analyzing trace with hash -2030863664, now seen corresponding path program 1 times [2018-12-24 13:56:32,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:32,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:32,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:32,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:32,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:32,401 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:56:32,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:32,401 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:32,402 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:56:32,402 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [25] [2018-12-24 13:56:32,403 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:56:32,403 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:56:32,405 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:56:32,405 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. [2018-12-24 13:56:32,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:32,405 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:56:32,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:32,405 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 [2018-12-24 13:56:32,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:32,414 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:56:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:32,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:32,425 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 [2018-12-24 13:56:32,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,436 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 [2018-12-24 13:56:32,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,442 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 [2018-12-24 13:56:32,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,448 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 [2018-12-24 13:56:32,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,454 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 [2018-12-24 13:56:32,455 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:32,482 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:32,504 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:32,519 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:32,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:32,558 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. [2018-12-24 13:56:32,558 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:56:32,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,620 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 [2018-12-24 13:56:32,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:32,667 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. [2018-12-24 13:56:32,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:32,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,730 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,737 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 [2018-12-24 13:56:32,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:32,793 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. [2018-12-24 13:56:32,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2018-12-24 13:56:32,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,833 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,846 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,859 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:32,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, 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 [2018-12-24 13:56:32,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:32,920 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. [2018-12-24 13:56:32,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:56:32,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,958 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:32,959 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:32,960 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 [2018-12-24 13:56:32,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:33,019 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. [2018-12-24 13:56:33,019 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2018-12-24 13:56:33,041 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:33,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:33,113 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:33,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:33,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2018-12-24 13:56:33,131 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:33,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-24 13:56:33,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-24 13:56:33,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:56:33,132 INFO L87 Difference]: Start difference. First operand 137 states and 710 transitions. Second operand 11 states. [2018-12-24 13:56:33,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:33,964 INFO L93 Difference]: Finished difference Result 197 states and 846 transitions. [2018-12-24 13:56:33,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:56:33,964 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2018-12-24 13:56:33,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:33,967 INFO L225 Difference]: With dead ends: 197 [2018-12-24 13:56:33,967 INFO L226 Difference]: Without dead ends: 196 [2018-12-24 13:56:33,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2018-12-24 13:56:33,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-24 13:56:34,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 140. [2018-12-24 13:56:34,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-24 13:56:34,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 728 transitions. [2018-12-24 13:56:34,113 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 728 transitions. Word has length 7 [2018-12-24 13:56:34,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:34,113 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 728 transitions. [2018-12-24 13:56:34,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-24 13:56:34,113 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 728 transitions. [2018-12-24 13:56:34,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:56:34,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:34,114 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:56:34,114 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:34,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:34,114 INFO L82 PathProgramCache]: Analyzing trace with hash -2026994678, now seen corresponding path program 2 times [2018-12-24 13:56:34,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:34,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:34,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:34,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:34,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:34,293 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:56:34,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:34,294 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:34,294 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:56:34,294 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:56:34,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:34,294 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-24 13:56:34,303 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:56:34,303 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:56:34,310 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:56:34,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:56:34,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:34,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 [2018-12-24 13:56:34,322 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,322 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 [2018-12-24 13:56:34,329 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,332 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,332 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 [2018-12-24 13:56:34,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,344 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,347 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 [2018-12-24 13:56:34,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,456 INFO L303 Elim1Store]: Index analysis took 107 ms [2018-12-24 13:56:34,457 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 [2018-12-24 13:56:34,457 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:34,497 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:34,513 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:34,525 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:34,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:34,554 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. [2018-12-24 13:56:34,554 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:56:34,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,606 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 [2018-12-24 13:56:34,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:34,647 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. [2018-12-24 13:56:34,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:34,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,672 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,674 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,680 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:34,681 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 [2018-12-24 13:56:34,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:34,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. [2018-12-24 13:56:34,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2018-12-24 13:56:34,756 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,757 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,758 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,759 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,760 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,761 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,763 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,764 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,767 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,768 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,770 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,771 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 [2018-12-24 13:56:34,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:34,814 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. [2018-12-24 13:56:34,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2018-12-24 13:56:34,841 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,845 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,847 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:34,858 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:34,858 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 [2018-12-24 13:56:34,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:34,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. [2018-12-24 13:56:34,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2018-12-24 13:56:34,928 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:34,928 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:34,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:35,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:35,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2018-12-24 13:56:35,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:35,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:56:35,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:56:35,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:56:35,006 INFO L87 Difference]: Start difference. First operand 140 states and 728 transitions. Second operand 12 states. [2018-12-24 13:56:35,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:35,867 INFO L93 Difference]: Finished difference Result 195 states and 830 transitions. [2018-12-24 13:56:35,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:56:35,867 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2018-12-24 13:56:35,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:35,870 INFO L225 Difference]: With dead ends: 195 [2018-12-24 13:56:35,870 INFO L226 Difference]: Without dead ends: 189 [2018-12-24 13:56:35,870 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 [2018-12-24 13:56:35,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-12-24 13:56:36,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 139. [2018-12-24 13:56:36,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-24 13:56:36,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 721 transitions. [2018-12-24 13:56:36,017 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 721 transitions. Word has length 7 [2018-12-24 13:56:36,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:36,017 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 721 transitions. [2018-12-24 13:56:36,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:56:36,017 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 721 transitions. [2018-12-24 13:56:36,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:56:36,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:36,018 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:56:36,018 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:36,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:36,018 INFO L82 PathProgramCache]: Analyzing trace with hash -2026977316, now seen corresponding path program 1 times [2018-12-24 13:56:36,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:36,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:36,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:56:36,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:36,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:36,152 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:56:36,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:36,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:36,153 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:56:36,153 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [27] [2018-12-24 13:56:36,154 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:56:36,154 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:56:36,156 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:56:36,156 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. [2018-12-24 13:56:36,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:36,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:56:36,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:36,157 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 [2018-12-24 13:56:36,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:36,165 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:56:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:36,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:36,173 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 [2018-12-24 13:56:36,176 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 [2018-12-24 13:56:36,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:36,191 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 [2018-12-24 13:56:36,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:36,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:36,200 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 [2018-12-24 13:56:36,204 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:36,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:36,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:36,210 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 [2018-12-24 13:56:36,210 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:36,230 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:36,241 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:36,250 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:36,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:36,276 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. [2018-12-24 13:56:36,276 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2018-12-24 13:56:36,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:36,311 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:36,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:36,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:36,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:36,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:36,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:36,317 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 [2018-12-24 13:56:36,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:36,344 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. [2018-12-24 13:56:36,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2018-12-24 13:56:36,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:36,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:36,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:36,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:36,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:36,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:36,368 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:36,369 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:36,369 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 [2018-12-24 13:56:36,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:36,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. [2018-12-24 13:56:36,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2018-12-24 13:56:36,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:36,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:36,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:36,425 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:36,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:36,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:36,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:36,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:36,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:36,431 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 [2018-12-24 13:56:36,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:36,465 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. [2018-12-24 13:56:36,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2018-12-24 13:56:36,487 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:36,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:36,523 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:36,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:36,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:56:36,542 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:36,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:56:36,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:56:36,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:56:36,543 INFO L87 Difference]: Start difference. First operand 139 states and 721 transitions. Second operand 10 states. [2018-12-24 13:56:37,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:37,064 INFO L93 Difference]: Finished difference Result 157 states and 743 transitions. [2018-12-24 13:56:37,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:56:37,065 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2018-12-24 13:56:37,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:37,067 INFO L225 Difference]: With dead ends: 157 [2018-12-24 13:56:37,067 INFO L226 Difference]: Without dead ends: 156 [2018-12-24 13:56:37,067 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 [2018-12-24 13:56:37,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-12-24 13:56:37,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 137. [2018-12-24 13:56:37,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-24 13:56:37,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 718 transitions. [2018-12-24 13:56:37,187 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 718 transitions. Word has length 7 [2018-12-24 13:56:37,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:37,188 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 718 transitions. [2018-12-24 13:56:37,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:56:37,188 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 718 transitions. [2018-12-24 13:56:37,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:56:37,188 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:37,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:56:37,188 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:37,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:37,189 INFO L82 PathProgramCache]: Analyzing trace with hash -2026986990, now seen corresponding path program 2 times [2018-12-24 13:56:37,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:37,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:37,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:37,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:37,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:37,386 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:37,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:37,386 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:37,387 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:56:37,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:56:37,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:37,387 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 [2018-12-24 13:56:37,397 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:56:37,397 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:56:37,403 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:56:37,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:56:37,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:37,407 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 [2018-12-24 13:56:37,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 [2018-12-24 13:56:37,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,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 [2018-12-24 13:56:37,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,446 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 [2018-12-24 13:56:37,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,457 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 [2018-12-24 13:56:37,458 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:37,477 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:37,488 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:37,498 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:37,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:37,525 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. [2018-12-24 13:56:37,525 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2018-12-24 13:56:37,561 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,562 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,563 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,565 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,566 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,569 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 [2018-12-24 13:56:37,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:37,596 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. [2018-12-24 13:56:37,596 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2018-12-24 13:56:37,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,637 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,648 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:37,648 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 [2018-12-24 13:56:37,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:37,683 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. [2018-12-24 13:56:37,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:30 [2018-12-24 13:56:37,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,726 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,740 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 [2018-12-24 13:56:37,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:37,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. [2018-12-24 13:56:37,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2018-12-24 13:56:37,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,823 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,826 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,832 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,838 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:37,845 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:37,845 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 [2018-12-24 13:56:37,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:37,893 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. [2018-12-24 13:56:37,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2018-12-24 13:56:37,915 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:37,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:38,013 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:38,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:38,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2018-12-24 13:56:38,033 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:38,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:56:38,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:56:38,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:56:38,034 INFO L87 Difference]: Start difference. First operand 137 states and 718 transitions. Second operand 12 states. [2018-12-24 13:56:38,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:38,684 INFO L93 Difference]: Finished difference Result 178 states and 767 transitions. [2018-12-24 13:56:38,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:56:38,684 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2018-12-24 13:56:38,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:38,686 INFO L225 Difference]: With dead ends: 178 [2018-12-24 13:56:38,686 INFO L226 Difference]: Without dead ends: 177 [2018-12-24 13:56:38,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2018-12-24 13:56:38,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-24 13:56:38,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 123. [2018-12-24 13:56:38,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-24 13:56:38,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 634 transitions. [2018-12-24 13:56:38,793 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 634 transitions. Word has length 7 [2018-12-24 13:56:38,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:38,793 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 634 transitions. [2018-12-24 13:56:38,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:56:38,793 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 634 transitions. [2018-12-24 13:56:38,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:56:38,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:38,794 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:56:38,794 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:38,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:38,794 INFO L82 PathProgramCache]: Analyzing trace with hash -2027404064, now seen corresponding path program 2 times [2018-12-24 13:56:38,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:38,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:38,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:56:38,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:38,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:39,018 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:56:39,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:39,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:39,019 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:56:39,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:56:39,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:39,019 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 [2018-12-24 13:56:39,027 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:56:39,027 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:56:39,033 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:56:39,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:56:39,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:39,037 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 [2018-12-24 13:56:39,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,039 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 [2018-12-24 13:56:39,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,043 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 [2018-12-24 13:56:39,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,050 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 [2018-12-24 13:56:39,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,057 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 [2018-12-24 13:56:39,057 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:39,084 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:39,099 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:39,109 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:39,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:39,137 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. [2018-12-24 13:56:39,137 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:56:39,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,175 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 [2018-12-24 13:56:39,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:39,215 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. [2018-12-24 13:56:39,216 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:39,237 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,240 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,243 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,250 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:39,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, 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 [2018-12-24 13:56:39,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:39,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. [2018-12-24 13:56:39,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2018-12-24 13:56:39,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,322 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,323 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,325 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,328 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,329 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,330 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,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 40 treesize of output 90 [2018-12-24 13:56:39,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:39,376 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. [2018-12-24 13:56:39,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2018-12-24 13:56:39,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,411 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,417 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,418 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:39,422 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:39,423 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 [2018-12-24 13:56:39,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:39,475 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. [2018-12-24 13:56:39,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2018-12-24 13:56:39,499 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:39,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:39,554 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:39,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:39,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2018-12-24 13:56:39,573 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:39,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:56:39,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:56:39,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:56:39,574 INFO L87 Difference]: Start difference. First operand 123 states and 634 transitions. Second operand 12 states. [2018-12-24 13:56:40,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:40,522 INFO L93 Difference]: Finished difference Result 204 states and 845 transitions. [2018-12-24 13:56:40,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-24 13:56:40,523 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2018-12-24 13:56:40,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:40,525 INFO L225 Difference]: With dead ends: 204 [2018-12-24 13:56:40,525 INFO L226 Difference]: Without dead ends: 203 [2018-12-24 13:56:40,526 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 [2018-12-24 13:56:40,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-12-24 13:56:40,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 126. [2018-12-24 13:56:40,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-24 13:56:40,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 654 transitions. [2018-12-24 13:56:40,643 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 654 transitions. Word has length 7 [2018-12-24 13:56:40,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:40,643 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 654 transitions. [2018-12-24 13:56:40,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:56:40,644 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 654 transitions. [2018-12-24 13:56:40,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:56:40,644 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:40,644 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:56:40,645 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:40,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:40,645 INFO L82 PathProgramCache]: Analyzing trace with hash -2027156062, now seen corresponding path program 1 times [2018-12-24 13:56:40,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:40,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:40,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:56:40,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:40,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:40,772 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:56:40,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:40,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:40,772 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:56:40,772 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [27] [2018-12-24 13:56:40,773 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:56:40,773 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:56:40,775 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:56:40,775 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. [2018-12-24 13:56:40,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:40,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:56:40,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:40,776 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 [2018-12-24 13:56:40,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:40,785 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:56:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:40,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:40,794 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 [2018-12-24 13:56:40,797 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 [2018-12-24 13:56:40,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:40,803 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 [2018-12-24 13:56:40,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:40,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:40,811 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 [2018-12-24 13:56:40,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:40,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:40,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:40,900 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 [2018-12-24 13:56:40,901 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:40,921 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:40,932 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:40,942 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:40,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:40,968 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. [2018-12-24 13:56:40,969 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2018-12-24 13:56:41,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:41,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:41,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:41,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:41,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:41,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:41,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:41,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, 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 [2018-12-24 13:56:41,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:41,034 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. [2018-12-24 13:56:41,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:56:41,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:41,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:41,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:41,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:41,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:41,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:41,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:41,059 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:41,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 33 treesize of output 60 [2018-12-24 13:56:41,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:41,089 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. [2018-12-24 13:56:41,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2018-12-24 13:56:41,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:41,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:41,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:41,175 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:41,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:41,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:41,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:41,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:41,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:41,182 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 [2018-12-24 13:56:41,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:41,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. [2018-12-24 13:56:41,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2018-12-24 13:56:41,233 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:41,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:41,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:41,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:41,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-24 13:56:41,280 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:41,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:56:41,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:56:41,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:56:41,281 INFO L87 Difference]: Start difference. First operand 126 states and 654 transitions. Second operand 10 states. [2018-12-24 13:56:41,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:41,852 INFO L93 Difference]: Finished difference Result 178 states and 835 transitions. [2018-12-24 13:56:41,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:56:41,852 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2018-12-24 13:56:41,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:41,854 INFO L225 Difference]: With dead ends: 178 [2018-12-24 13:56:41,855 INFO L226 Difference]: Without dead ends: 177 [2018-12-24 13:56:41,855 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 [2018-12-24 13:56:41,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-24 13:56:41,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 108. [2018-12-24 13:56:41,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-24 13:56:41,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 546 transitions. [2018-12-24 13:56:41,959 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 546 transitions. Word has length 7 [2018-12-24 13:56:41,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:41,960 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 546 transitions. [2018-12-24 13:56:41,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:56:41,960 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 546 transitions. [2018-12-24 13:56:41,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:56:41,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:41,960 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:56:41,961 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:41,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:41,961 INFO L82 PathProgramCache]: Analyzing trace with hash -2023162082, now seen corresponding path program 1 times [2018-12-24 13:56:41,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:41,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:41,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:41,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:41,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:42,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:42,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:42,040 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:42,040 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:56:42,041 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [28], [29] [2018-12-24 13:56:42,041 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:56:42,042 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:56:42,045 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:56:42,045 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. [2018-12-24 13:56:42,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:42,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:56:42,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:42,046 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 [2018-12-24 13:56:42,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:42,058 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:56:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:42,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:42,065 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 [2018-12-24 13:56:42,069 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 [2018-12-24 13:56:42,082 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 [2018-12-24 13:56:42,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:42,090 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 [2018-12-24 13:56:42,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:42,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:42,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, 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 [2018-12-24 13:56:42,103 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:42,118 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:42,128 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:42,138 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:42,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:42,163 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. [2018-12-24 13:56:42,163 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2018-12-24 13:56:42,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:42,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:42,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:42,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:42,194 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 [2018-12-24 13:56:42,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:42,209 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. [2018-12-24 13:56:42,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-24 13:56:42,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:42,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:42,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:42,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:42,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:42,230 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:42,231 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 [2018-12-24 13:56:42,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:42,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. [2018-12-24 13:56:42,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2018-12-24 13:56:42,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:42,267 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:42,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:42,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:42,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:56:42,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:42,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:56:42,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:56:42,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:56:42,306 INFO L87 Difference]: Start difference. First operand 108 states and 546 transitions. Second operand 8 states. [2018-12-24 13:56:42,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:42,677 INFO L93 Difference]: Finished difference Result 134 states and 591 transitions. [2018-12-24 13:56:42,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:56:42,678 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-12-24 13:56:42,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:42,679 INFO L225 Difference]: With dead ends: 134 [2018-12-24 13:56:42,679 INFO L226 Difference]: Without dead ends: 133 [2018-12-24 13:56:42,680 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 [2018-12-24 13:56:42,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-24 13:56:42,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 113. [2018-12-24 13:56:42,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-24 13:56:42,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 567 transitions. [2018-12-24 13:56:42,791 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 567 transitions. Word has length 7 [2018-12-24 13:56:42,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:42,791 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 567 transitions. [2018-12-24 13:56:42,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:56:42,791 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 567 transitions. [2018-12-24 13:56:42,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:56:42,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:42,792 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:56:42,792 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:42,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:42,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1962747920, now seen corresponding path program 1 times [2018-12-24 13:56:42,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:42,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:42,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:42,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:42,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:43,016 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:43,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:43,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:43,017 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:56:43,017 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [27] [2018-12-24 13:56:43,017 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:56:43,017 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:56:43,019 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:56:43,019 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. [2018-12-24 13:56:43,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:43,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:56:43,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:43,019 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 [2018-12-24 13:56:43,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:43,028 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:56:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:43,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:43,036 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 [2018-12-24 13:56:43,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,040 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 [2018-12-24 13:56:43,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,048 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 [2018-12-24 13:56:43,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,059 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 [2018-12-24 13:56:43,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,074 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,076 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 [2018-12-24 13:56:43,077 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:43,118 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:43,138 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:43,152 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:43,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:43,182 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. [2018-12-24 13:56:43,182 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:56:43,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,211 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,214 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,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 [2018-12-24 13:56:43,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:43,257 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. [2018-12-24 13:56:43,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:43,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,284 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,294 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,295 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,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 78 [2018-12-24 13:56:43,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:43,343 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. [2018-12-24 13:56:43,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:43,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,368 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,371 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,379 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:43,380 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:43,381 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 [2018-12-24 13:56:43,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:43,431 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. [2018-12-24 13:56:43,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:56:43,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:43,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:43,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:43,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:43,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:56:43,514 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:43,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:56:43,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:56:43,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:56:43,515 INFO L87 Difference]: Start difference. First operand 113 states and 567 transitions. Second operand 10 states. [2018-12-24 13:56:44,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:44,115 INFO L93 Difference]: Finished difference Result 143 states and 604 transitions. [2018-12-24 13:56:44,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:56:44,116 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2018-12-24 13:56:44,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:44,117 INFO L225 Difference]: With dead ends: 143 [2018-12-24 13:56:44,117 INFO L226 Difference]: Without dead ends: 142 [2018-12-24 13:56:44,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:56:44,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-24 13:56:44,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 113. [2018-12-24 13:56:44,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-24 13:56:44,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 567 transitions. [2018-12-24 13:56:44,224 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 567 transitions. Word has length 7 [2018-12-24 13:56:44,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:44,224 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 567 transitions. [2018-12-24 13:56:44,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:56:44,225 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 567 transitions. [2018-12-24 13:56:44,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:56:44,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:44,225 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:56:44,225 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:44,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:44,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1962509592, now seen corresponding path program 1 times [2018-12-24 13:56:44,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:44,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:44,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:44,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:44,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:44,468 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 17 [2018-12-24 13:56:44,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:44,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:44,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:44,499 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:56:44,499 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [27] [2018-12-24 13:56:44,500 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:56:44,501 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:56:44,503 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:56:44,504 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. [2018-12-24 13:56:44,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:44,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:56:44,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:44,504 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 [2018-12-24 13:56:44,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:44,521 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:56:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:44,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:44,556 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 [2018-12-24 13:56:44,592 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 [2018-12-24 13:56:44,679 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 [2018-12-24 13:56:44,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:44,809 INFO L303 Elim1Store]: Index analysis took 129 ms [2018-12-24 13:56:44,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, 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 [2018-12-24 13:56:44,845 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:44,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:44,852 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 [2018-12-24 13:56:44,852 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:44,867 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:44,877 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:44,885 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:44,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:44,909 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. [2018-12-24 13:56:44,909 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2018-12-24 13:56:44,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:44,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:44,939 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:44,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:44,940 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 [2018-12-24 13:56:44,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:44,956 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. [2018-12-24 13:56:44,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-24 13:56:44,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:44,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:44,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:44,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:44,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:44,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:44,981 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 [2018-12-24 13:56:44,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:44,999 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. [2018-12-24 13:56:44,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2018-12-24 13:56:45,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:45,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:45,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:45,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:45,017 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:45,018 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:45,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:45,020 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:45,020 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 [2018-12-24 13:56:45,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:45,042 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. [2018-12-24 13:56:45,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2018-12-24 13:56:45,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:45,056 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:45,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:45,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:45,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-24 13:56:45,099 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:45,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:56:45,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:56:45,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:56:45,100 INFO L87 Difference]: Start difference. First operand 113 states and 567 transitions. Second operand 10 states. [2018-12-24 13:56:45,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:45,599 INFO L93 Difference]: Finished difference Result 151 states and 642 transitions. [2018-12-24 13:56:45,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:56:45,600 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2018-12-24 13:56:45,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:45,602 INFO L225 Difference]: With dead ends: 151 [2018-12-24 13:56:45,602 INFO L226 Difference]: Without dead ends: 150 [2018-12-24 13:56:45,602 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 [2018-12-24 13:56:45,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-12-24 13:56:45,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 121. [2018-12-24 13:56:45,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-24 13:56:45,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 615 transitions. [2018-12-24 13:56:45,719 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 615 transitions. Word has length 7 [2018-12-24 13:56:45,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:45,719 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 615 transitions. [2018-12-24 13:56:45,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:56:45,719 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 615 transitions. [2018-12-24 13:56:45,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:56:45,719 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:45,720 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:56:45,720 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:45,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:45,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1973605362, now seen corresponding path program 1 times [2018-12-24 13:56:45,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:45,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:45,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:45,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:45,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:45,940 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2018-12-24 13:56:46,020 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:56:46,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:46,020 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:46,020 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:56:46,020 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [25] [2018-12-24 13:56:46,021 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:56:46,021 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:56:46,023 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:56:46,023 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. [2018-12-24 13:56:46,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:46,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:56:46,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:46,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 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 [2018-12-24 13:56:46,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:46,031 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:56:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:46,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:46,038 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 [2018-12-24 13:56:46,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,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 [2018-12-24 13:56:46,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,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 [2018-12-24 13:56:46,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,056 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 [2018-12-24 13:56:46,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,167 INFO L303 Elim1Store]: Index analysis took 109 ms [2018-12-24 13:56:46,168 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 [2018-12-24 13:56:46,168 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:46,217 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:46,233 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:46,245 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:46,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:46,272 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. [2018-12-24 13:56:46,272 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:56:46,294 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,297 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,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 72 [2018-12-24 13:56:46,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:46,349 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. [2018-12-24 13:56:46,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:46,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,379 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,380 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,384 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,386 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:46,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, 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 [2018-12-24 13:56:46,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:46,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. [2018-12-24 13:56:46,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:46,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,471 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:46,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, 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 [2018-12-24 13:56:46,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:46,516 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. [2018-12-24 13:56:46,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:46,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,548 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,551 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,552 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:46,556 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 [2018-12-24 13:56:46,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:46,614 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. [2018-12-24 13:56:46,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:46,636 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:46,636 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:46,679 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:46,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:46,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2018-12-24 13:56:46,698 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:46,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:56:46,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:56:46,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:56:46,698 INFO L87 Difference]: Start difference. First operand 121 states and 615 transitions. Second operand 12 states. [2018-12-24 13:56:47,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:47,546 INFO L93 Difference]: Finished difference Result 215 states and 931 transitions. [2018-12-24 13:56:47,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:56:47,547 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2018-12-24 13:56:47,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:47,549 INFO L225 Difference]: With dead ends: 215 [2018-12-24 13:56:47,549 INFO L226 Difference]: Without dead ends: 214 [2018-12-24 13:56:47,550 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 [2018-12-24 13:56:47,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-24 13:56:47,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 142. [2018-12-24 13:56:47,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-24 13:56:47,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 741 transitions. [2018-12-24 13:56:47,692 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 741 transitions. Word has length 7 [2018-12-24 13:56:47,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:47,692 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 741 transitions. [2018-12-24 13:56:47,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:56:47,693 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 741 transitions. [2018-12-24 13:56:47,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:56:47,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:47,693 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:56:47,694 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:47,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:47,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1956607002, now seen corresponding path program 1 times [2018-12-24 13:56:47,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:47,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:47,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:47,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:47,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:47,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:47,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:47,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:47,755 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:56:47,755 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [28], [30], [31] [2018-12-24 13:56:47,757 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:56:47,757 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:56:47,759 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:56:47,759 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. [2018-12-24 13:56:47,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:47,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:56:47,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:47,760 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 [2018-12-24 13:56:47,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:47,774 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:56:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:47,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:47,793 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 [2018-12-24 13:56:47,800 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 [2018-12-24 13:56:47,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 [2018-12-24 13:56:47,816 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 [2018-12-24 13:56:47,848 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 [2018-12-24 13:56:47,849 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:47,864 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:47,878 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:47,893 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:47,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:47,918 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. [2018-12-24 13:56:47,918 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2018-12-24 13:56:48,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:48,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2018-12-24 13:56:48,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:48,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:48,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2018-12-24 13:56:48,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:48,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:48,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:48,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-24 13:56:48,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2018-12-24 13:56:48,041 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:56:48,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 13:56:48,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 13:56:48,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-24 13:56:48,041 INFO L87 Difference]: Start difference. First operand 142 states and 741 transitions. Second operand 4 states. [2018-12-24 13:56:48,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:48,434 INFO L93 Difference]: Finished difference Result 280 states and 1413 transitions. [2018-12-24 13:56:48,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-24 13:56:48,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-12-24 13:56:48,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:48,437 INFO L225 Difference]: With dead ends: 280 [2018-12-24 13:56:48,437 INFO L226 Difference]: Without dead ends: 275 [2018-12-24 13:56:48,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-24 13:56:48,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-12-24 13:56:48,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 252. [2018-12-24 13:56:48,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-12-24 13:56:48,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 1379 transitions. [2018-12-24 13:56:48,730 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 1379 transitions. Word has length 7 [2018-12-24 13:56:48,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:48,730 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 1379 transitions. [2018-12-24 13:56:48,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 13:56:48,730 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 1379 transitions. [2018-12-24 13:56:48,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:56:48,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:48,731 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:56:48,731 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:48,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:48,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1970145762, now seen corresponding path program 2 times [2018-12-24 13:56:48,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:48,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:48,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:48,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:48,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:48,929 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:56:48,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:48,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:48,930 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:56:48,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:56:48,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:48,930 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 [2018-12-24 13:56:48,939 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:56:48,940 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:56:48,946 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:56:48,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:56:48,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:48,952 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 [2018-12-24 13:56:48,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:48,954 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 [2018-12-24 13:56:48,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:48,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:48,960 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 [2018-12-24 13:56:48,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:48,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:48,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:48,969 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 [2018-12-24 13:56:48,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:48,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:48,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:48,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:48,979 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 [2018-12-24 13:56:48,979 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:49,004 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:49,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:49,031 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:49,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:49,060 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. [2018-12-24 13:56:49,061 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:56:49,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,096 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 [2018-12-24 13:56:49,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:49,140 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. [2018-12-24 13:56:49,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:49,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,175 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,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, 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 [2018-12-24 13:56:49,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:49,226 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. [2018-12-24 13:56:49,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:49,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,260 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,263 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,266 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:49,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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 [2018-12-24 13:56:49,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:49,317 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. [2018-12-24 13:56:49,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2018-12-24 13:56:49,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,344 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,345 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,348 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,349 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:49,357 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:49,358 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 [2018-12-24 13:56:49,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:49,406 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. [2018-12-24 13:56:49,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:56:49,431 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:49,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:49,482 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:49,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:49,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2018-12-24 13:56:49,500 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:49,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-24 13:56:49,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-24 13:56:49,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:56:49,501 INFO L87 Difference]: Start difference. First operand 252 states and 1379 transitions. Second operand 11 states. [2018-12-24 13:56:50,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:50,536 INFO L93 Difference]: Finished difference Result 329 states and 1634 transitions. [2018-12-24 13:56:50,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:56:50,536 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2018-12-24 13:56:50,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:50,540 INFO L225 Difference]: With dead ends: 329 [2018-12-24 13:56:50,540 INFO L226 Difference]: Without dead ends: 328 [2018-12-24 13:56:50,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2018-12-24 13:56:50,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-12-24 13:56:50,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 271. [2018-12-24 13:56:50,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-12-24 13:56:50,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 1494 transitions. [2018-12-24 13:56:50,854 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 1494 transitions. Word has length 7 [2018-12-24 13:56:50,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:50,854 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 1494 transitions. [2018-12-24 13:56:50,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-24 13:56:50,854 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 1494 transitions. [2018-12-24 13:56:50,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:56:50,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:50,855 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:56:50,855 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:50,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:50,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1969597864, now seen corresponding path program 1 times [2018-12-24 13:56:50,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:50,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:50,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:56:50,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:50,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:50,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:50,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:50,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:50,938 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:56:50,938 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [29] [2018-12-24 13:56:50,939 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:56:50,940 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:56:50,941 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:56:50,942 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. [2018-12-24 13:56:50,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:50,942 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:56:50,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:50,942 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 [2018-12-24 13:56:50,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:50,950 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:56:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:50,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:50,969 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 [2018-12-24 13:56:50,975 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 [2018-12-24 13:56:50,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:50,982 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 [2018-12-24 13:56:50,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:50,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:50,994 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 [2018-12-24 13:56:51,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:51,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:51,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:51,006 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 [2018-12-24 13:56:51,007 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:51,026 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:51,037 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:51,047 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:51,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:51,074 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. [2018-12-24 13:56:51,074 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2018-12-24 13:56:51,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:51,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:51,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:51,122 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:51,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:51,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:51,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:51,126 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 [2018-12-24 13:56:51,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:51,153 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. [2018-12-24 13:56:51,153 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:56:51,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:51,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:51,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:51,175 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:51,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:51,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:51,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:51,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:51,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:51,181 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 [2018-12-24 13:56:51,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:51,214 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. [2018-12-24 13:56:51,215 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2018-12-24 13:56:51,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:51,232 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:51,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:51,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:51,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:56:51,277 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:51,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:56:51,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:56:51,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:56:51,278 INFO L87 Difference]: Start difference. First operand 271 states and 1494 transitions. Second operand 8 states. [2018-12-24 13:56:51,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:51,895 INFO L93 Difference]: Finished difference Result 290 states and 1522 transitions. [2018-12-24 13:56:51,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:56:51,896 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-12-24 13:56:51,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:51,900 INFO L225 Difference]: With dead ends: 290 [2018-12-24 13:56:51,900 INFO L226 Difference]: Without dead ends: 286 [2018-12-24 13:56:51,900 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 [2018-12-24 13:56:51,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-12-24 13:56:52,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 273. [2018-12-24 13:56:52,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-12-24 13:56:52,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 1505 transitions. [2018-12-24 13:56:52,187 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 1505 transitions. Word has length 7 [2018-12-24 13:56:52,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:52,187 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 1505 transitions. [2018-12-24 13:56:52,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:56:52,187 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 1505 transitions. [2018-12-24 13:56:52,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:56:52,188 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:52,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:56:52,191 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:52,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:52,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1966084512, now seen corresponding path program 2 times [2018-12-24 13:56:52,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:52,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:52,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:52,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:52,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:52,300 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:52,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:52,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:52,300 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:56:52,300 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:56:52,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:52,301 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 [2018-12-24 13:56:52,309 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:56:52,310 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:56:52,316 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:56:52,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:56:52,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:52,319 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 [2018-12-24 13:56:52,326 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 [2018-12-24 13:56:52,333 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 [2018-12-24 13:56:52,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:52,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, 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 [2018-12-24 13:56:52,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:52,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:52,366 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 [2018-12-24 13:56:52,366 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:52,381 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:52,390 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:52,400 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:52,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:52,423 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. [2018-12-24 13:56:52,423 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2018-12-24 13:56:52,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:52,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:52,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:52,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:52,458 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 [2018-12-24 13:56:52,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:52,474 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. [2018-12-24 13:56:52,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-24 13:56:52,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:52,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:52,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:52,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:52,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:52,495 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:52,496 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 [2018-12-24 13:56:52,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:52,512 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. [2018-12-24 13:56:52,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-24 13:56:52,532 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:52,533 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:52,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:52,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:52,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:52,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:52,538 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 [2018-12-24 13:56:52,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:52,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. [2018-12-24 13:56:52,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2018-12-24 13:56:52,572 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:52,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:52,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:52,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:52,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:56:52,624 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:52,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:56:52,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:56:52,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:56:52,625 INFO L87 Difference]: Start difference. First operand 273 states and 1505 transitions. Second operand 10 states. [2018-12-24 13:56:53,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:53,245 INFO L93 Difference]: Finished difference Result 307 states and 1547 transitions. [2018-12-24 13:56:53,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:56:53,245 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2018-12-24 13:56:53,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:53,247 INFO L225 Difference]: With dead ends: 307 [2018-12-24 13:56:53,248 INFO L226 Difference]: Without dead ends: 302 [2018-12-24 13:56:53,248 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 [2018-12-24 13:56:53,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-12-24 13:56:53,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 247. [2018-12-24 13:56:53,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-12-24 13:56:53,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 1348 transitions. [2018-12-24 13:56:53,526 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 1348 transitions. Word has length 7 [2018-12-24 13:56:53,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:53,526 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 1348 transitions. [2018-12-24 13:56:53,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:56:53,526 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 1348 transitions. [2018-12-24 13:56:53,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:56:53,527 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:53,527 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:56:53,527 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:53,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:53,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1966448270, now seen corresponding path program 3 times [2018-12-24 13:56:53,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:53,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:53,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:56:53,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:53,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:53,752 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:53,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:53,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:53,752 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:56:53,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:56:53,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:53,753 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 [2018-12-24 13:56:53,763 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:56:53,763 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:56:53,767 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:56:53,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:56:53,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:53,770 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 [2018-12-24 13:56:53,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:53,773 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 [2018-12-24 13:56:53,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:53,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:53,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, 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 [2018-12-24 13:56:53,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:53,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:53,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:53,781 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 [2018-12-24 13:56:53,785 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:53,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:53,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:53,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:53,790 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 [2018-12-24 13:56:53,791 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:53,818 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:53,833 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:53,844 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:53,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:53,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:53,872 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2018-12-24 13:56:53,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:53,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:53,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:53,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:53,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:53,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:53,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:53,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:53,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:53,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:53,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:53,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, 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 [2018-12-24 13:56:53,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:53,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. [2018-12-24 13:56:53,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:53,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:53,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:53,983 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:53,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:53,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:53,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:53,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:53,989 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:53,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:53,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:53,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:53,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:53,994 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:53,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, 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 [2018-12-24 13:56:53,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:54,038 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. [2018-12-24 13:56:54,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:54,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,074 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,075 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,077 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,080 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,081 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:54,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, 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 [2018-12-24 13:56:54,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:54,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. [2018-12-24 13:56:54,128 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:54,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,168 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 [2018-12-24 13:56:54,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:54,213 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. [2018-12-24 13:56:54,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:54,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,240 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,241 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,243 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,252 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:54,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:54,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 93 [2018-12-24 13:56:54,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:54,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-24 13:56:54,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2018-12-24 13:56:54,335 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:54,335 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:54,422 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:54,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:54,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2018-12-24 13:56:54,441 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:54,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-24 13:56:54,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-24 13:56:54,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2018-12-24 13:56:54,442 INFO L87 Difference]: Start difference. First operand 247 states and 1348 transitions. Second operand 14 states. [2018-12-24 13:56:55,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:55,782 INFO L93 Difference]: Finished difference Result 284 states and 1398 transitions. [2018-12-24 13:56:55,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:56:55,783 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2018-12-24 13:56:55,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:55,786 INFO L225 Difference]: With dead ends: 284 [2018-12-24 13:56:55,786 INFO L226 Difference]: Without dead ends: 279 [2018-12-24 13:56:55,786 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 [2018-12-24 13:56:55,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-12-24 13:56:56,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 195. [2018-12-24 13:56:56,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-12-24 13:56:56,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 1030 transitions. [2018-12-24 13:56:56,051 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 1030 transitions. Word has length 7 [2018-12-24 13:56:56,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:56,052 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 1030 transitions. [2018-12-24 13:56:56,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-24 13:56:56,052 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 1030 transitions. [2018-12-24 13:56:56,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:56:56,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:56,052 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:56:56,052 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:56,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:56,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1931949486, now seen corresponding path program 1 times [2018-12-24 13:56:56,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:56,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:56,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:56:56,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:56,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:56,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:56,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:56,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:56,119 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:56:56,119 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [28], [29] [2018-12-24 13:56:56,120 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:56:56,121 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:56:56,123 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:56:56,123 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. [2018-12-24 13:56:56,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:56,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:56:56,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:56,124 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 [2018-12-24 13:56:56,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:56,137 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:56:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:56,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:56,146 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 [2018-12-24 13:56:56,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,152 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 [2018-12-24 13:56:56,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,158 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 [2018-12-24 13:56:56,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,168 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 [2018-12-24 13:56:56,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,182 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 [2018-12-24 13:56:56,183 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:56,207 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:56,221 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:56,233 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:56,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:56,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. [2018-12-24 13:56:56,262 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2018-12-24 13:56:56,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,284 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,294 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,295 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 [2018-12-24 13:56:56,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:56,335 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. [2018-12-24 13:56:56,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:56,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,358 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,368 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:56,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, 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 [2018-12-24 13:56:56,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:56,415 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. [2018-12-24 13:56:56,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:56,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:56,435 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:56,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:56,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:56,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2018-12-24 13:56:56,465 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:56,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:56:56,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:56:56,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:56:56,465 INFO L87 Difference]: Start difference. First operand 195 states and 1030 transitions. Second operand 8 states. [2018-12-24 13:56:57,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:57,035 INFO L93 Difference]: Finished difference Result 230 states and 1135 transitions. [2018-12-24 13:56:57,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:56:57,035 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-12-24 13:56:57,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:57,038 INFO L225 Difference]: With dead ends: 230 [2018-12-24 13:56:57,038 INFO L226 Difference]: Without dead ends: 223 [2018-12-24 13:56:57,039 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 [2018-12-24 13:56:57,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-12-24 13:56:57,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 209. [2018-12-24 13:56:57,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-12-24 13:56:57,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 1112 transitions. [2018-12-24 13:56:57,323 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 1112 transitions. Word has length 7 [2018-12-24 13:56:57,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:57,323 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 1112 transitions. [2018-12-24 13:56:57,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:56:57,324 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 1112 transitions. [2018-12-24 13:56:57,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:56:57,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:57,324 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:56:57,324 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:57,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:57,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1931649590, now seen corresponding path program 1 times [2018-12-24 13:56:57,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:57,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:57,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:57,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:57,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:57,822 WARN L181 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-12-24 13:56:58,062 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:56:58,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:58,062 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:58,062 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:56:58,063 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [27] [2018-12-24 13:56:58,063 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:56:58,063 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:56:58,067 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:56:58,067 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. [2018-12-24 13:56:58,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:58,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:56:58,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:58,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 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 [2018-12-24 13:56:58,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:58,083 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:56:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:58,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:58,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 [2018-12-24 13:56:58,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,099 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 [2018-12-24 13:56:58,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,104 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 [2018-12-24 13:56:58,110 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,114 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 [2018-12-24 13:56:58,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,127 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 [2018-12-24 13:56:58,128 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:58,168 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:58,187 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:58,202 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:58,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:58,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. [2018-12-24 13:56:58,238 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2018-12-24 13:56:58,263 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,268 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,287 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,289 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 [2018-12-24 13:56:58,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:58,349 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. [2018-12-24 13:56:58,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:58,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,392 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,399 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,411 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,411 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 [2018-12-24 13:56:58,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:58,461 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. [2018-12-24 13:56:58,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:56:58,483 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,485 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,486 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,488 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:58,499 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:56:58,500 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 [2018-12-24 13:56:58,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:58,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. [2018-12-24 13:56:58,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:56:58,573 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:58,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:58,593 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:58,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:58,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2018-12-24 13:56:58,613 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:58,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-24 13:56:58,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-24 13:56:58,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:56:58,614 INFO L87 Difference]: Start difference. First operand 209 states and 1112 transitions. Second operand 9 states. [2018-12-24 13:56:59,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:59,340 INFO L93 Difference]: Finished difference Result 254 states and 1212 transitions. [2018-12-24 13:56:59,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:56:59,340 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2018-12-24 13:56:59,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:59,343 INFO L225 Difference]: With dead ends: 254 [2018-12-24 13:56:59,343 INFO L226 Difference]: Without dead ends: 253 [2018-12-24 13:56:59,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:56:59,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-12-24 13:56:59,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 215. [2018-12-24 13:56:59,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-12-24 13:56:59,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 1148 transitions. [2018-12-24 13:56:59,649 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 1148 transitions. Word has length 7 [2018-12-24 13:56:59,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:59,649 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 1148 transitions. [2018-12-24 13:56:59,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-24 13:56:59,649 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 1148 transitions. [2018-12-24 13:56:59,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:56:59,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:59,650 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:56:59,651 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:59,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:59,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1933796528, now seen corresponding path program 1 times [2018-12-24 13:56:59,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:59,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:59,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:59,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:59,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:59,880 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2018-12-24 13:56:59,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:56:59,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:59,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:59,892 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:56:59,892 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [26], [28], [29] [2018-12-24 13:56:59,893 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:56:59,893 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:56:59,896 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:56:59,897 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. [2018-12-24 13:56:59,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:59,897 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:56:59,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:59,898 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 [2018-12-24 13:56:59,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:59,912 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:56:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:59,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:59,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 [2018-12-24 13:56:59,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:59,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, 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 [2018-12-24 13:56:59,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:59,945 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:59,945 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 [2018-12-24 13:56:59,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:59,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:59,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:59,950 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 [2018-12-24 13:56:59,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:59,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:59,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:59,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:56:59,957 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 [2018-12-24 13:56:59,958 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:59,986 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:00,001 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:00,012 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:00,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:00,041 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. [2018-12-24 13:57:00,042 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2018-12-24 13:57:00,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:00,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:00,062 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:00,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:00,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:00,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:00,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:00,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:00,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:00,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:00,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:00,073 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 [2018-12-24 13:57:00,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:00,118 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. [2018-12-24 13:57:00,118 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:57:00,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:00,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:00,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:00,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:00,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:00,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:00,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:00,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:00,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:00,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:00,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:00,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:00,151 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:57:00,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 80 [2018-12-24 13:57:00,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:00,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. [2018-12-24 13:57:00,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:57:00,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:00,221 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:00,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:00,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:00,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2018-12-24 13:57:00,273 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:00,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-24 13:57:00,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-24 13:57:00,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:57:00,273 INFO L87 Difference]: Start difference. First operand 215 states and 1148 transitions. Second operand 7 states. [2018-12-24 13:57:00,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:00,792 INFO L93 Difference]: Finished difference Result 223 states and 1160 transitions. [2018-12-24 13:57:00,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:57:00,792 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-24 13:57:00,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:00,794 INFO L225 Difference]: With dead ends: 223 [2018-12-24 13:57:00,794 INFO L226 Difference]: Without dead ends: 216 [2018-12-24 13:57:00,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:57:00,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-12-24 13:57:01,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2018-12-24 13:57:01,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-12-24 13:57:01,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 1147 transitions. [2018-12-24 13:57:01,094 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 1147 transitions. Word has length 7 [2018-12-24 13:57:01,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:01,094 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 1147 transitions. [2018-12-24 13:57:01,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-24 13:57:01,094 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 1147 transitions. [2018-12-24 13:57:01,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:57:01,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:01,095 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:57:01,095 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:01,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:01,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1924430494, now seen corresponding path program 3 times [2018-12-24 13:57:01,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:01,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:01,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:01,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:01,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:01,269 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2018-12-24 13:57:01,377 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:57:01,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:01,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:01,378 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:57:01,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:57:01,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:01,378 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 [2018-12-24 13:57:01,386 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:57:01,387 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:57:01,391 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:57:01,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:57:01,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:01,396 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 [2018-12-24 13:57:01,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,398 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 [2018-12-24 13:57:01,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,409 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 [2018-12-24 13:57:01,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,417 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 [2018-12-24 13:57:01,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,424 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 [2018-12-24 13:57:01,425 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:01,452 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:01,466 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:01,478 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:01,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:01,504 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. [2018-12-24 13:57:01,505 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:57:01,531 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,532 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,533 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,543 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 [2018-12-24 13:57:01,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:01,584 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. [2018-12-24 13:57:01,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:57:01,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,621 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 [2018-12-24 13:57:01,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:01,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. [2018-12-24 13:57:01,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:57:01,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,715 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:57:01,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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 [2018-12-24 13:57:01,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:01,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. [2018-12-24 13:57:01,763 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2018-12-24 13:57:01,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,801 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,806 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:01,807 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:57:01,808 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 [2018-12-24 13:57:01,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:01,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. [2018-12-24 13:57:01,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:57:01,885 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:01,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:01,951 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:01,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:01,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2018-12-24 13:57:01,971 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:01,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:57:01,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:57:01,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:57:01,971 INFO L87 Difference]: Start difference. First operand 215 states and 1147 transitions. Second operand 12 states. [2018-12-24 13:57:03,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:03,095 INFO L93 Difference]: Finished difference Result 285 states and 1372 transitions. [2018-12-24 13:57:03,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:57:03,096 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2018-12-24 13:57:03,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:03,100 INFO L225 Difference]: With dead ends: 285 [2018-12-24 13:57:03,100 INFO L226 Difference]: Without dead ends: 279 [2018-12-24 13:57:03,100 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 [2018-12-24 13:57:03,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-12-24 13:57:03,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 186. [2018-12-24 13:57:03,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-12-24 13:57:03,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 973 transitions. [2018-12-24 13:57:03,397 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 973 transitions. Word has length 7 [2018-12-24 13:57:03,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:03,397 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 973 transitions. [2018-12-24 13:57:03,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:57:03,398 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 973 transitions. [2018-12-24 13:57:03,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:57:03,398 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:03,398 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:57:03,398 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:03,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:03,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1928074670, now seen corresponding path program 2 times [2018-12-24 13:57:03,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:03,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:03,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:57:03,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:03,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:03,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:03,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:03,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:03,543 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:57:03,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:57:03,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:03,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 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 [2018-12-24 13:57:03,556 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:57:03,556 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:57:03,567 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:57:03,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:57:03,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:03,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 [2018-12-24 13:57:03,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:03,576 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 [2018-12-24 13:57:03,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:03,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:03,582 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 [2018-12-24 13:57:03,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:03,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:03,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:03,589 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 [2018-12-24 13:57:03,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:03,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:03,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:03,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:03,608 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 [2018-12-24 13:57:03,609 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:03,638 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:03,653 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:03,664 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:03,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:03,692 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. [2018-12-24 13:57:03,692 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2018-12-24 13:57:03,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:03,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:03,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:03,822 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:03,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:03,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:03,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:03,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:03,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:03,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:03,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:03,887 INFO L303 Elim1Store]: Index analysis took 173 ms [2018-12-24 13:57:03,887 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 [2018-12-24 13:57:03,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:03,930 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. [2018-12-24 13:57:03,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:57:03,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:03,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:03,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:03,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:03,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:03,959 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:03,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:03,961 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:03,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:03,964 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:03,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:03,966 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:03,967 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:57:03,968 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 [2018-12-24 13:57:03,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:04,011 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. [2018-12-24 13:57:04,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:57:04,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:04,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:04,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:04,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:04,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:04,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:04,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:04,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:04,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:04,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:04,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:04,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:04,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:04,049 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 [2018-12-24 13:57:04,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:04,095 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. [2018-12-24 13:57:04,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:57:04,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:04,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:04,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:04,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:04,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:57:04,186 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:04,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:57:04,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:57:04,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:57:04,187 INFO L87 Difference]: Start difference. First operand 186 states and 973 transitions. Second operand 10 states. [2018-12-24 13:57:05,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:05,006 INFO L93 Difference]: Finished difference Result 252 states and 1178 transitions. [2018-12-24 13:57:05,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:57:05,007 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2018-12-24 13:57:05,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:05,010 INFO L225 Difference]: With dead ends: 252 [2018-12-24 13:57:05,011 INFO L226 Difference]: Without dead ends: 247 [2018-12-24 13:57:05,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:57:05,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-12-24 13:57:05,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 178. [2018-12-24 13:57:05,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-12-24 13:57:05,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 925 transitions. [2018-12-24 13:57:05,293 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 925 transitions. Word has length 7 [2018-12-24 13:57:05,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:05,293 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 925 transitions. [2018-12-24 13:57:05,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:57:05,293 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 925 transitions. [2018-12-24 13:57:05,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:57:05,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:05,294 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:57:05,294 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:05,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:05,294 INFO L82 PathProgramCache]: Analyzing trace with hash 2035383838, now seen corresponding path program 1 times [2018-12-24 13:57:05,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:05,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:05,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:57:05,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:05,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:05,393 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:57:05,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:05,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:05,393 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:57:05,393 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [29] [2018-12-24 13:57:05,394 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:57:05,394 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:57:05,395 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:57:05,396 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. [2018-12-24 13:57:05,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:05,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:57:05,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:05,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 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 [2018-12-24 13:57:05,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:05,406 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:57:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:05,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:05,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 [2018-12-24 13:57:05,418 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,418 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 [2018-12-24 13:57:05,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,422 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 [2018-12-24 13:57:05,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,430 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 [2018-12-24 13:57:05,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,437 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 [2018-12-24 13:57:05,437 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:05,466 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:05,481 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:05,492 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:05,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:05,521 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. [2018-12-24 13:57:05,522 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2018-12-24 13:57:05,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,548 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,552 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,555 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 [2018-12-24 13:57:05,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:05,596 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. [2018-12-24 13:57:05,596 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:57:05,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:05,631 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 [2018-12-24 13:57:05,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:05,677 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. [2018-12-24 13:57:05,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:57:05,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:05,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:05,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:05,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:05,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2018-12-24 13:57:05,744 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:05,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-24 13:57:05,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-24 13:57:05,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:57:05,744 INFO L87 Difference]: Start difference. First operand 178 states and 925 transitions. Second operand 7 states. [2018-12-24 13:57:06,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:06,261 INFO L93 Difference]: Finished difference Result 194 states and 950 transitions. [2018-12-24 13:57:06,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:57:06,261 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-24 13:57:06,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:06,263 INFO L225 Difference]: With dead ends: 194 [2018-12-24 13:57:06,263 INFO L226 Difference]: Without dead ends: 193 [2018-12-24 13:57:06,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:57:06,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-24 13:57:06,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 179. [2018-12-24 13:57:06,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-12-24 13:57:06,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 931 transitions. [2018-12-24 13:57:06,539 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 931 transitions. Word has length 7 [2018-12-24 13:57:06,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:06,539 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 931 transitions. [2018-12-24 13:57:06,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-24 13:57:06,539 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 931 transitions. [2018-12-24 13:57:06,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:57:06,540 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:06,540 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:57:06,540 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:06,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:06,540 INFO L82 PathProgramCache]: Analyzing trace with hash -2134403662, now seen corresponding path program 2 times [2018-12-24 13:57:06,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:06,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:06,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:06,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:06,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:06,694 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2018-12-24 13:57:06,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:06,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:06,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:06,756 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:57:06,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:57:06,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:06,756 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 [2018-12-24 13:57:06,765 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:57:06,765 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:57:06,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:57:06,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:57:06,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:06,774 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 [2018-12-24 13:57:06,780 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 [2018-12-24 13:57:06,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:06,786 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 [2018-12-24 13:57:06,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:06,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:06,797 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 [2018-12-24 13:57:06,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:06,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:06,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:06,819 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 [2018-12-24 13:57:06,819 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:06,839 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:06,851 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:06,861 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:06,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:06,888 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. [2018-12-24 13:57:06,888 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2018-12-24 13:57:06,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:06,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:06,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:06,928 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:06,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:06,930 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:06,931 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:06,932 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 [2018-12-24 13:57:06,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:06,960 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. [2018-12-24 13:57:06,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2018-12-24 13:57:06,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:06,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:06,983 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:06,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:06,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:06,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:06,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:06,989 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:06,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:06,991 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 [2018-12-24 13:57:06,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:07,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. [2018-12-24 13:57:07,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:57:07,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:07,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:07,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:07,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:07,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:07,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:07,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:07,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:07,052 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:57:07,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:07,054 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 [2018-12-24 13:57:07,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:07,086 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. [2018-12-24 13:57:07,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2018-12-24 13:57:07,106 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:07,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:07,143 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:07,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:07,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:57:07,162 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:07,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:57:07,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:57:07,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:57:07,163 INFO L87 Difference]: Start difference. First operand 179 states and 931 transitions. Second operand 10 states. [2018-12-24 13:57:08,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:08,035 INFO L93 Difference]: Finished difference Result 265 states and 1253 transitions. [2018-12-24 13:57:08,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:57:08,036 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2018-12-24 13:57:08,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:08,037 INFO L225 Difference]: With dead ends: 265 [2018-12-24 13:57:08,037 INFO L226 Difference]: Without dead ends: 264 [2018-12-24 13:57:08,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:57:08,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-12-24 13:57:08,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 202. [2018-12-24 13:57:08,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-24 13:57:08,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1068 transitions. [2018-12-24 13:57:08,409 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1068 transitions. Word has length 7 [2018-12-24 13:57:08,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:08,409 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1068 transitions. [2018-12-24 13:57:08,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:57:08,409 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1068 transitions. [2018-12-24 13:57:08,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:57:08,410 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:08,410 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:57:08,410 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:08,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:08,410 INFO L82 PathProgramCache]: Analyzing trace with hash -2132137560, now seen corresponding path program 1 times [2018-12-24 13:57:08,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:08,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:08,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:57:08,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:08,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:08,808 WARN L181 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-12-24 13:57:08,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:57:08,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:08,817 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:08,817 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:57:08,817 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [26], [28], [29] [2018-12-24 13:57:08,818 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:57:08,818 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:57:08,820 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:57:08,820 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. [2018-12-24 13:57:08,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:08,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:57:08,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:08,821 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 [2018-12-24 13:57:08,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:08,829 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:57:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:08,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:08,837 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 [2018-12-24 13:57:08,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 [2018-12-24 13:57:08,846 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 [2018-12-24 13:57:08,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:08,854 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 [2018-12-24 13:57:08,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:08,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:08,866 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 [2018-12-24 13:57:08,867 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:08,881 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:08,891 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:08,901 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:08,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:08,925 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. [2018-12-24 13:57:08,925 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2018-12-24 13:57:08,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:08,951 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:08,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:08,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:08,953 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 [2018-12-24 13:57:08,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:08,968 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. [2018-12-24 13:57:08,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-24 13:57:08,983 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:08,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:08,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:08,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:08,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:08,987 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:57:08,988 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 [2018-12-24 13:57:08,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:09,004 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. [2018-12-24 13:57:09,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2018-12-24 13:57:09,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:09,022 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:09,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:09,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:09,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2018-12-24 13:57:09,059 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:09,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-24 13:57:09,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-24 13:57:09,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:57:09,060 INFO L87 Difference]: Start difference. First operand 202 states and 1068 transitions. Second operand 7 states. [2018-12-24 13:57:09,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:09,587 INFO L93 Difference]: Finished difference Result 210 states and 1080 transitions. [2018-12-24 13:57:09,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:57:09,587 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-24 13:57:09,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:09,588 INFO L225 Difference]: With dead ends: 210 [2018-12-24 13:57:09,588 INFO L226 Difference]: Without dead ends: 203 [2018-12-24 13:57:09,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:57:09,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-12-24 13:57:09,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2018-12-24 13:57:09,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-24 13:57:09,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1066 transitions. [2018-12-24 13:57:09,935 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1066 transitions. Word has length 7 [2018-12-24 13:57:09,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:09,935 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1066 transitions. [2018-12-24 13:57:09,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-24 13:57:09,935 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1066 transitions. [2018-12-24 13:57:09,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:57:09,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:09,936 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:57:09,936 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:09,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:09,936 INFO L82 PathProgramCache]: Analyzing trace with hash -2141372770, now seen corresponding path program 1 times [2018-12-24 13:57:09,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:09,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:09,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:09,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:09,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:10,085 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-12-24 13:57:10,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:57:10,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:10,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:10,103 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-24 13:57:10,104 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [28], [29] [2018-12-24 13:57:10,104 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:57:10,104 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:57:10,105 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:57:10,105 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. [2018-12-24 13:57:10,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:10,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:57:10,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:10,106 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 [2018-12-24 13:57:10,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:10,114 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:57:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:10,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:10,122 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 [2018-12-24 13:57:10,126 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 [2018-12-24 13:57:10,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:10,139 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 [2018-12-24 13:57:10,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:10,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:10,150 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 [2018-12-24 13:57:10,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:10,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:10,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:10,161 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 [2018-12-24 13:57:10,162 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:10,181 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:10,192 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:10,202 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:10,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:10,228 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. [2018-12-24 13:57:10,228 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2018-12-24 13:57:10,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:10,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:10,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:10,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:10,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:10,268 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:10,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:10,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, 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 [2018-12-24 13:57:10,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:10,298 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. [2018-12-24 13:57:10,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:57:10,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:10,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:10,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:10,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:10,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:10,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:10,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:10,322 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:10,323 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:10,324 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 [2018-12-24 13:57:10,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:10,354 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. [2018-12-24 13:57:10,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2018-12-24 13:57:10,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:10,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:10,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:10,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:10,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2018-12-24 13:57:10,703 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:10,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-24 13:57:10,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-24 13:57:10,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:57:10,704 INFO L87 Difference]: Start difference. First operand 202 states and 1066 transitions. Second operand 7 states. [2018-12-24 13:57:11,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:11,294 INFO L93 Difference]: Finished difference Result 216 states and 1089 transitions. [2018-12-24 13:57:11,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:57:11,295 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-24 13:57:11,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:11,296 INFO L225 Difference]: With dead ends: 216 [2018-12-24 13:57:11,297 INFO L226 Difference]: Without dead ends: 212 [2018-12-24 13:57:11,297 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 [2018-12-24 13:57:11,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-12-24 13:57:11,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 204. [2018-12-24 13:57:11,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-12-24 13:57:11,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 1077 transitions. [2018-12-24 13:57:11,655 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 1077 transitions. Word has length 7 [2018-12-24 13:57:11,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:11,655 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 1077 transitions. [2018-12-24 13:57:11,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-24 13:57:11,655 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 1077 transitions. [2018-12-24 13:57:11,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:57:11,656 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:11,656 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-24 13:57:11,656 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:11,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:11,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1804316618, now seen corresponding path program 2 times [2018-12-24 13:57:11,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:11,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:11,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:11,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:11,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:11,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:11,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:11,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:11,740 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:57:11,740 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:57:11,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:11,740 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 [2018-12-24 13:57:11,750 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:57:11,750 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:57:11,757 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:57:11,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:57:11,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:11,762 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 [2018-12-24 13:57:11,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,765 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 [2018-12-24 13:57:11,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,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, 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 [2018-12-24 13:57:11,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,784 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 [2018-12-24 13:57:11,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,795 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 [2018-12-24 13:57:11,795 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:11,824 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:11,839 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:11,851 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:11,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:11,880 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. [2018-12-24 13:57:11,880 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2018-12-24 13:57:11,896 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,897 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,897 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,908 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 [2018-12-24 13:57:11,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:11,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. [2018-12-24 13:57:11,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:57:11,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,983 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:11,985 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 [2018-12-24 13:57:11,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:12,030 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. [2018-12-24 13:57:12,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2018-12-24 13:57:12,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:12,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:12,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:12,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:12,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:12,058 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:12,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:12,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:12,062 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:12,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:12,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:12,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:12,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:12,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, 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 [2018-12-24 13:57:12,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:12,122 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. [2018-12-24 13:57:12,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:57:12,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:12,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:12,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:12,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:12,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-24 13:57:12,182 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:12,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:57:12,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:57:12,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:57:12,183 INFO L87 Difference]: Start difference. First operand 204 states and 1077 transitions. Second operand 10 states. [2018-12-24 13:57:13,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:13,259 INFO L93 Difference]: Finished difference Result 401 states and 2015 transitions. [2018-12-24 13:57:13,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:57:13,260 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2018-12-24 13:57:13,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:13,262 INFO L225 Difference]: With dead ends: 401 [2018-12-24 13:57:13,263 INFO L226 Difference]: Without dead ends: 397 [2018-12-24 13:57:13,263 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 [2018-12-24 13:57:13,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-12-24 13:57:13,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 342. [2018-12-24 13:57:13,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-12-24 13:57:13,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1889 transitions. [2018-12-24 13:57:13,903 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1889 transitions. Word has length 8 [2018-12-24 13:57:13,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:13,903 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 1889 transitions. [2018-12-24 13:57:13,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:57:13,904 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1889 transitions. [2018-12-24 13:57:13,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:57:13,904 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:13,904 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-24 13:57:13,905 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:13,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:13,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1821001564, now seen corresponding path program 1 times [2018-12-24 13:57:13,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:13,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:13,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:57:13,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:13,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:13,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-24 13:57:13,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 13:57:13,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-24 13:57:13,960 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:57:13,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 13:57:13,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 13:57:13,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-24 13:57:13,960 INFO L87 Difference]: Start difference. First operand 342 states and 1889 transitions. Second operand 4 states. [2018-12-24 13:57:14,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:14,654 INFO L93 Difference]: Finished difference Result 347 states and 1893 transitions. [2018-12-24 13:57:14,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 13:57:14,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-12-24 13:57:14,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:14,656 INFO L225 Difference]: With dead ends: 347 [2018-12-24 13:57:14,656 INFO L226 Difference]: Without dead ends: 342 [2018-12-24 13:57:14,657 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 [2018-12-24 13:57:14,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-12-24 13:57:15,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2018-12-24 13:57:15,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-12-24 13:57:15,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1887 transitions. [2018-12-24 13:57:15,301 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1887 transitions. Word has length 8 [2018-12-24 13:57:15,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:15,301 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 1887 transitions. [2018-12-24 13:57:15,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 13:57:15,301 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1887 transitions. [2018-12-24 13:57:15,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:57:15,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:15,302 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:57:15,302 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:15,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:15,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1861261506, now seen corresponding path program 1 times [2018-12-24 13:57:15,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:15,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:15,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:15,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:15,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:15,571 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 25 [2018-12-24 13:57:15,681 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:57:15,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:15,681 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:15,682 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-24 13:57:15,682 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [25] [2018-12-24 13:57:15,682 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:57:15,683 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:57:15,685 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:57:15,685 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. [2018-12-24 13:57:15,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:15,685 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:57:15,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:15,685 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 [2018-12-24 13:57:15,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:15,694 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:57:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:15,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:15,702 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 [2018-12-24 13:57:15,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:15,706 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 [2018-12-24 13:57:15,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:15,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:15,709 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 [2018-12-24 13:57:15,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:15,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:15,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:15,714 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 [2018-12-24 13:57:15,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:15,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:15,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:15,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:15,721 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 [2018-12-24 13:57:15,722 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:15,834 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:15,848 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:15,860 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:15,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:15,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:15,888 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2018-12-24 13:57:15,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:15,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:15,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:15,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:15,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:15,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:15,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:15,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:15,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:15,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:15,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:15,924 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 [2018-12-24 13:57:15,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:15,964 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. [2018-12-24 13:57:15,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-12-24 13:57:15,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:15,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:15,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:15,989 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:15,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:15,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:15,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:15,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:15,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:15,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:15,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:15,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,001 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 [2018-12-24 13:57:16,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:16,057 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. [2018-12-24 13:57:16,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2018-12-24 13:57:16,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,101 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:57:16,102 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 [2018-12-24 13:57:16,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:16,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. [2018-12-24 13:57:16,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2018-12-24 13:57:16,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,197 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,200 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:57:16,201 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 [2018-12-24 13:57:16,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:16,252 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. [2018-12-24 13:57:16,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:57:16,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,284 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,291 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:57:16,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:16,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 38 treesize of output 93 [2018-12-24 13:57:16,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:16,344 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. [2018-12-24 13:57:16,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2018-12-24 13:57:16,366 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:16,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:16,428 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:16,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:16,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2018-12-24 13:57:16,447 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:16,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-24 13:57:16,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-24 13:57:16,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2018-12-24 13:57:16,448 INFO L87 Difference]: Start difference. First operand 342 states and 1887 transitions. Second operand 13 states. [2018-12-24 13:57:18,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:18,229 INFO L93 Difference]: Finished difference Result 471 states and 2470 transitions. [2018-12-24 13:57:18,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:57:18,230 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-12-24 13:57:18,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:18,232 INFO L225 Difference]: With dead ends: 471 [2018-12-24 13:57:18,232 INFO L226 Difference]: Without dead ends: 470 [2018-12-24 13:57:18,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=161, Invalid=301, Unknown=0, NotChecked=0, Total=462 [2018-12-24 13:57:18,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-12-24 13:57:18,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 359. [2018-12-24 13:57:18,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-12-24 13:57:18,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1989 transitions. [2018-12-24 13:57:18,957 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1989 transitions. Word has length 8 [2018-12-24 13:57:18,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:18,957 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 1989 transitions. [2018-12-24 13:57:18,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-24 13:57:18,957 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1989 transitions. [2018-12-24 13:57:18,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:57:18,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:18,958 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:57:18,958 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:18,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:18,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1864721106, now seen corresponding path program 2 times [2018-12-24 13:57:18,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:18,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:18,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:18,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:18,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:19,097 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 24 [2018-12-24 13:57:19,216 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:57:19,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:19,217 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:19,217 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:57:19,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:57:19,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:19,218 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 [2018-12-24 13:57:19,226 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:57:19,226 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:57:19,233 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-24 13:57:19,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:57:19,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:19,236 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 [2018-12-24 13:57:19,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,239 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 [2018-12-24 13:57:19,240 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,241 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,242 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 [2018-12-24 13:57:19,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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 [2018-12-24 13:57:19,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,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 [2018-12-24 13:57:19,255 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:19,283 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:19,299 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:19,311 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:19,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:19,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:19,340 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2018-12-24 13:57:19,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,368 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,371 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,378 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 [2018-12-24 13:57:19,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:19,417 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. [2018-12-24 13:57:19,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-12-24 13:57:19,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,444 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,458 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 [2018-12-24 13:57:19,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:19,502 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. [2018-12-24 13:57:19,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2018-12-24 13:57:19,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,531 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,532 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,533 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,541 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:57:19,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,543 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 [2018-12-24 13:57:19,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:19,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. [2018-12-24 13:57:19,596 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2018-12-24 13:57:19,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,636 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,637 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,637 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:57:19,638 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 [2018-12-24 13:57:19,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:19,688 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. [2018-12-24 13:57:19,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2018-12-24 13:57:19,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,726 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,730 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:19,734 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:57:19,734 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 [2018-12-24 13:57:19,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:19,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. [2018-12-24 13:57:19,786 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2018-12-24 13:57:19,812 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:19,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:19,896 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:19,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:19,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2018-12-24 13:57:19,916 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:19,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-24 13:57:19,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-24 13:57:19,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2018-12-24 13:57:19,917 INFO L87 Difference]: Start difference. First operand 359 states and 1989 transitions. Second operand 13 states. [2018-12-24 13:57:21,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:21,726 INFO L93 Difference]: Finished difference Result 483 states and 2465 transitions. [2018-12-24 13:57:21,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:57:21,726 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-12-24 13:57:21,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:21,729 INFO L225 Difference]: With dead ends: 483 [2018-12-24 13:57:21,729 INFO L226 Difference]: Without dead ends: 482 [2018-12-24 13:57:21,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2018-12-24 13:57:21,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2018-12-24 13:57:22,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 378. [2018-12-24 13:57:22,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-12-24 13:57:22,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 2103 transitions. [2018-12-24 13:57:22,440 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 2103 transitions. Word has length 8 [2018-12-24 13:57:22,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:22,440 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 2103 transitions. [2018-12-24 13:57:22,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-24 13:57:22,440 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 2103 transitions. [2018-12-24 13:57:22,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:57:22,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:22,441 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:57:22,441 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:22,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:22,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1868963088, now seen corresponding path program 1 times [2018-12-24 13:57:22,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:22,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:22,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:57:22,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:22,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:22,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:22,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:22,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:22,558 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-24 13:57:22,558 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [28], [29] [2018-12-24 13:57:22,559 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:57:22,559 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:57:22,561 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:57:22,561 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. [2018-12-24 13:57:22,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:22,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:57:22,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:22,562 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 [2018-12-24 13:57:22,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:22,572 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:57:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:22,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:22,579 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 [2018-12-24 13:57:22,583 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 [2018-12-24 13:57:22,590 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 [2018-12-24 13:57:22,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:22,608 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 [2018-12-24 13:57:22,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:22,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:22,627 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 [2018-12-24 13:57:22,628 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:22,642 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:22,652 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:22,799 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:22,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:22,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. [2018-12-24 13:57:22,836 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2018-12-24 13:57:22,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:22,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:22,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:22,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:22,867 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 [2018-12-24 13:57:22,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:22,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:22,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:22 [2018-12-24 13:57:22,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:22,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:22,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:22,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:22,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:22,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:22,903 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 [2018-12-24 13:57:22,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:22,922 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. [2018-12-24 13:57:22,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2018-12-24 13:57:22,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:22,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:22,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:22,943 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:22,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:22,945 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:22,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:22,947 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:57:22,947 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 [2018-12-24 13:57:22,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:22,969 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. [2018-12-24 13:57:22,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2018-12-24 13:57:22,988 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:22,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:23,020 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:23,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:23,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:57:23,041 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:23,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:57:23,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:57:23,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:57:23,042 INFO L87 Difference]: Start difference. First operand 378 states and 2103 transitions. Second operand 10 states. [2018-12-24 13:57:24,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:24,047 INFO L93 Difference]: Finished difference Result 400 states and 2126 transitions. [2018-12-24 13:57:24,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:57:24,047 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2018-12-24 13:57:24,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:24,049 INFO L225 Difference]: With dead ends: 400 [2018-12-24 13:57:24,049 INFO L226 Difference]: Without dead ends: 393 [2018-12-24 13:57:24,049 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 [2018-12-24 13:57:24,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-12-24 13:57:24,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 380. [2018-12-24 13:57:24,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-12-24 13:57:24,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 2097 transitions. [2018-12-24 13:57:24,800 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 2097 transitions. Word has length 8 [2018-12-24 13:57:24,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:24,800 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 2097 transitions. [2018-12-24 13:57:24,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:57:24,800 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 2097 transitions. [2018-12-24 13:57:24,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:57:24,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:24,801 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:57:24,802 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:24,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:24,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1473696100, now seen corresponding path program 1 times [2018-12-24 13:57:24,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:24,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:24,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:24,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:24,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:24,927 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:57:24,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:24,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:24,927 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-24 13:57:24,927 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [28], [29] [2018-12-24 13:57:24,928 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:57:24,928 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:57:24,929 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:57:24,929 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. [2018-12-24 13:57:24,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:24,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:57:24,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:24,930 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 [2018-12-24 13:57:24,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:24,940 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:57:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:24,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:24,947 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 [2018-12-24 13:57:24,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:24,956 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 [2018-12-24 13:57:24,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:24,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:24,961 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 [2018-12-24 13:57:24,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:24,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:24,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:24,975 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 [2018-12-24 13:57:24,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:24,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:24,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:24,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:24,983 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 [2018-12-24 13:57:24,983 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:25,012 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:25,025 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:25,036 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:25,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:25,065 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. [2018-12-24 13:57:25,065 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2018-12-24 13:57:25,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,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, 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 [2018-12-24 13:57:25,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:25,142 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. [2018-12-24 13:57:25,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:57:25,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,175 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,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, 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 [2018-12-24 13:57:25,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:25,227 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. [2018-12-24 13:57:25,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2018-12-24 13:57:25,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,260 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:25,269 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:57:25,270 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 [2018-12-24 13:57:25,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:25,319 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. [2018-12-24 13:57:25,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:57:25,343 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:25,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:25,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:25,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:25,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:57:25,395 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:25,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:57:25,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:57:25,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:57:25,395 INFO L87 Difference]: Start difference. First operand 380 states and 2097 transitions. Second operand 10 states. [2018-12-24 13:57:26,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:26,554 INFO L93 Difference]: Finished difference Result 409 states and 2136 transitions. [2018-12-24 13:57:26,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:57:26,554 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2018-12-24 13:57:26,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:26,556 INFO L225 Difference]: With dead ends: 409 [2018-12-24 13:57:26,556 INFO L226 Difference]: Without dead ends: 397 [2018-12-24 13:57:26,556 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 [2018-12-24 13:57:26,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-12-24 13:57:27,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 378. [2018-12-24 13:57:27,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-12-24 13:57:27,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 2077 transitions. [2018-12-24 13:57:27,269 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 2077 transitions. Word has length 8 [2018-12-24 13:57:27,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:27,269 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 2077 transitions. [2018-12-24 13:57:27,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:57:27,269 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 2077 transitions. [2018-12-24 13:57:27,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:57:27,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:27,270 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:57:27,270 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:27,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:27,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1464330066, now seen corresponding path program 3 times [2018-12-24 13:57:27,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:27,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:27,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:27,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:27,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:27,434 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 25 [2018-12-24 13:57:27,586 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:27,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:27,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:27,586 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:57:27,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:57:27,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:27,587 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 [2018-12-24 13:57:27,595 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:57:27,596 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:57:27,601 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:57:27,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:57:27,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:27,605 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 [2018-12-24 13:57:27,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,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 [2018-12-24 13:57:27,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-24 13:57:27,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,619 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 [2018-12-24 13:57:27,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,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 [2018-12-24 13:57:27,629 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:27,669 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:27,684 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:27,696 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:27,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:27,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:27,724 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2018-12-24 13:57:27,751 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,755 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,756 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,757 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,758 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,760 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,761 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,762 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,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 [2018-12-24 13:57:27,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:27,802 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. [2018-12-24 13:57:27,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-12-24 13:57:27,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,833 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,841 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,844 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 [2018-12-24 13:57:27,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:27,892 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. [2018-12-24 13:57:27,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2018-12-24 13:57:27,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,928 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,931 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,934 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,936 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:57:27,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:27,937 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 [2018-12-24 13:57:27,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:27,989 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. [2018-12-24 13:57:27,989 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2018-12-24 13:57:28,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:28,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:28,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:28,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:28,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:28,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:28,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:28,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:28,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:28,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:28,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:28,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:28,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:28,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:28,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:28,035 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:57:28,036 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 [2018-12-24 13:57:28,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:28,086 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. [2018-12-24 13:57:28,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2018-12-24 13:57:28,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:28,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:28,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:28,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:28,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:28,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:28,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:28,122 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:28,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:28,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:28,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:28,126 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:28,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:28,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:28,129 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:57:28,129 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 [2018-12-24 13:57:28,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:28,179 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. [2018-12-24 13:57:28,179 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2018-12-24 13:57:28,207 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:28,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:28,287 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:28,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:28,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2018-12-24 13:57:28,308 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:28,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-24 13:57:28,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-24 13:57:28,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2018-12-24 13:57:28,309 INFO L87 Difference]: Start difference. First operand 378 states and 2077 transitions. Second operand 14 states. [2018-12-24 13:57:30,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:30,364 INFO L93 Difference]: Finished difference Result 542 states and 2749 transitions. [2018-12-24 13:57:30,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:57:30,364 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2018-12-24 13:57:30,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:30,367 INFO L225 Difference]: With dead ends: 542 [2018-12-24 13:57:30,367 INFO L226 Difference]: Without dead ends: 536 [2018-12-24 13:57:30,368 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 [2018-12-24 13:57:30,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-12-24 13:57:31,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 446. [2018-12-24 13:57:31,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-12-24 13:57:31,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 2483 transitions. [2018-12-24 13:57:31,355 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 2483 transitions. Word has length 8 [2018-12-24 13:57:31,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:31,355 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 2483 transitions. [2018-12-24 13:57:31,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-24 13:57:31,355 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 2483 transitions. [2018-12-24 13:57:31,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:57:31,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:31,356 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:57:31,357 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:31,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:31,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1468154974, now seen corresponding path program 1 times [2018-12-24 13:57:31,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:31,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:31,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:57:31,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:31,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:31,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:57:31,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:31,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:31,456 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-24 13:57:31,456 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [28], [29] [2018-12-24 13:57:31,456 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:57:31,456 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:57:31,458 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:57:31,458 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. [2018-12-24 13:57:31,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:31,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:57:31,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:31,459 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 [2018-12-24 13:57:31,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:31,466 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:57:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:31,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:31,476 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 [2018-12-24 13:57:31,483 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,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, 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 [2018-12-24 13:57:31,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,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, 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 [2018-12-24 13:57:31,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,498 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 [2018-12-24 13:57:31,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,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 [2018-12-24 13:57:31,505 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:31,532 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:31,547 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:31,559 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:31,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:31,588 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. [2018-12-24 13:57:31,589 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2018-12-24 13:57:31,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,624 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 [2018-12-24 13:57:31,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:31,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. [2018-12-24 13:57:31,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:57:31,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,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, 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 [2018-12-24 13:57:31,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:31,751 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. [2018-12-24 13:57:31,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2018-12-24 13:57:31,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,783 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:31,790 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:57:31,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 38 treesize of output 104 [2018-12-24 13:57:31,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:31,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. [2018-12-24 13:57:31,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:57:31,863 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:31,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:31,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:31,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:31,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2018-12-24 13:57:31,916 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:31,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-24 13:57:31,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-24 13:57:31,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:57:31,916 INFO L87 Difference]: Start difference. First operand 446 states and 2483 transitions. Second operand 9 states. [2018-12-24 13:57:33,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:33,286 INFO L93 Difference]: Finished difference Result 469 states and 2511 transitions. [2018-12-24 13:57:33,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:57:33,286 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-12-24 13:57:33,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:33,288 INFO L225 Difference]: With dead ends: 469 [2018-12-24 13:57:33,288 INFO L226 Difference]: Without dead ends: 465 [2018-12-24 13:57:33,288 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 [2018-12-24 13:57:33,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2018-12-24 13:57:34,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 443. [2018-12-24 13:57:34,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-12-24 13:57:34,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 2463 transitions. [2018-12-24 13:57:34,230 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 2463 transitions. Word has length 8 [2018-12-24 13:57:34,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:34,230 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 2463 transitions. [2018-12-24 13:57:34,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-24 13:57:34,230 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 2463 transitions. [2018-12-24 13:57:34,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:57:34,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:34,232 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:57:34,232 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:34,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:34,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1587664806, now seen corresponding path program 4 times [2018-12-24 13:57:34,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:34,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:34,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:34,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:34,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:34,425 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 25 [2018-12-24 13:57:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:57:34,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:34,589 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:34,590 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:57:34,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:57:34,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:34,590 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 [2018-12-24 13:57:34,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:34,598 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:57:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:34,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:34,606 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 [2018-12-24 13:57:34,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,608 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 [2018-12-24 13:57:34,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,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 [2018-12-24 13:57:34,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,619 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 [2018-12-24 13:57:34,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,625 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 [2018-12-24 13:57:34,626 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:34,653 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:34,668 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:34,680 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:34,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:34,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:34,709 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2018-12-24 13:57:34,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,742 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,743 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,745 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,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 66 [2018-12-24 13:57:34,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:34,788 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. [2018-12-24 13:57:34,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-12-24 13:57:34,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,816 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,822 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,823 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,825 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,826 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,826 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:57:34,827 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 [2018-12-24 13:57:34,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:34,875 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. [2018-12-24 13:57:34,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:38 [2018-12-24 13:57:34,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,915 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 [2018-12-24 13:57:34,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:34,961 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. [2018-12-24 13:57:34,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2018-12-24 13:57:34,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:34,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:35,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:35,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:35,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:35,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:35,005 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:57:35,006 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 [2018-12-24 13:57:35,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:35,055 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. [2018-12-24 13:57:35,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2018-12-24 13:57:35,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:35,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:35,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:35,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:35,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:35,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:35,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:35,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:35,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:35,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:35,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:35,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:35,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:35,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:35,101 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:57:35,102 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 [2018-12-24 13:57:35,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:35,153 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. [2018-12-24 13:57:35,153 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2018-12-24 13:57:35,179 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:35,180 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:35,279 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:35,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:35,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2018-12-24 13:57:35,297 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:35,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-24 13:57:35,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-24 13:57:35,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2018-12-24 13:57:35,297 INFO L87 Difference]: Start difference. First operand 443 states and 2463 transitions. Second operand 14 states. [2018-12-24 13:57:37,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:37,167 INFO L93 Difference]: Finished difference Result 481 states and 2515 transitions. [2018-12-24 13:57:37,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:57:37,168 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2018-12-24 13:57:37,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:37,171 INFO L225 Difference]: With dead ends: 481 [2018-12-24 13:57:37,171 INFO L226 Difference]: Without dead ends: 480 [2018-12-24 13:57:37,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2018-12-24 13:57:37,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2018-12-24 13:57:37,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 254. [2018-12-24 13:57:37,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-12-24 13:57:37,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 1362 transitions. [2018-12-24 13:57:37,685 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 1362 transitions. Word has length 8 [2018-12-24 13:57:37,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:37,686 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 1362 transitions. [2018-12-24 13:57:37,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-24 13:57:37,686 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 1362 transitions. [2018-12-24 13:57:37,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:57:37,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:37,686 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:57:37,687 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:37,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:37,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1706484960, now seen corresponding path program 1 times [2018-12-24 13:57:37,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:37,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:37,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:37,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:37,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:37,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:57:37,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:37,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:37,780 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-24 13:57:37,780 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [28], [30], [31] [2018-12-24 13:57:37,780 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:57:37,780 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:57:37,782 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:57:37,782 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. [2018-12-24 13:57:37,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:37,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:57:37,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:37,783 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 [2018-12-24 13:57:37,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:37,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:57:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:37,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:37,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 [2018-12-24 13:57:37,812 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 [2018-12-24 13:57:37,820 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 [2018-12-24 13:57:37,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:37,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, 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 [2018-12-24 13:57:37,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:37,841 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:37,841 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 [2018-12-24 13:57:37,842 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:37,857 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:37,867 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:37,877 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:37,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:37,901 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. [2018-12-24 13:57:37,901 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2018-12-24 13:57:37,930 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:37,930 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:37,931 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:37,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:37,933 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 [2018-12-24 13:57:37,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:37,949 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. [2018-12-24 13:57:37,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-24 13:57:37,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:37,964 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:37,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:37,966 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:37,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:37,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:37,969 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 [2018-12-24 13:57:37,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:37,990 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. [2018-12-24 13:57:37,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2018-12-24 13:57:38,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:38,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:38,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:38,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:38,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:57:38,044 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:38,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:57:38,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:57:38,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:57:38,045 INFO L87 Difference]: Start difference. First operand 254 states and 1362 transitions. Second operand 8 states. [2018-12-24 13:57:38,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:38,810 INFO L93 Difference]: Finished difference Result 267 states and 1394 transitions. [2018-12-24 13:57:38,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:57:38,810 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-24 13:57:38,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:38,812 INFO L225 Difference]: With dead ends: 267 [2018-12-24 13:57:38,812 INFO L226 Difference]: Without dead ends: 258 [2018-12-24 13:57:38,813 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 [2018-12-24 13:57:38,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-12-24 13:57:39,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2018-12-24 13:57:39,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-24 13:57:39,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 1374 transitions. [2018-12-24 13:57:39,353 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 1374 transitions. Word has length 8 [2018-12-24 13:57:39,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:39,353 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 1374 transitions. [2018-12-24 13:57:39,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:57:39,353 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 1374 transitions. [2018-12-24 13:57:39,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:57:39,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:39,354 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:57:39,354 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:39,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:39,354 INFO L82 PathProgramCache]: Analyzing trace with hash -716062376, now seen corresponding path program 1 times [2018-12-24 13:57:39,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:39,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:39,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:39,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:39,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:39,573 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:57:39,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:39,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:39,574 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-24 13:57:39,574 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [27] [2018-12-24 13:57:39,574 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:57:39,575 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:57:39,576 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:57:39,576 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. [2018-12-24 13:57:39,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:39,577 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:57:39,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:39,577 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 [2018-12-24 13:57:39,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:39,585 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:57:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:39,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:39,593 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 [2018-12-24 13:57:39,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,598 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 [2018-12-24 13:57:39,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,603 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 [2018-12-24 13:57:39,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,610 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 [2018-12-24 13:57:39,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,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, 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 [2018-12-24 13:57:39,618 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:39,644 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:39,659 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:39,670 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:39,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:39,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:39,699 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2018-12-24 13:57:39,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,726 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,730 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,733 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 [2018-12-24 13:57:39,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:39,773 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. [2018-12-24 13:57:39,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-12-24 13:57:39,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,799 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,801 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,806 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,812 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 [2018-12-24 13:57:39,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:39,856 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. [2018-12-24 13:57:39,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:57:39,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,887 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,890 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,892 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,894 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,895 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,896 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,896 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:57:39,897 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 [2018-12-24 13:57:39,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:39,946 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. [2018-12-24 13:57:39,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2018-12-24 13:57:39,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,973 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,983 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,985 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:57:39,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:39,987 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 [2018-12-24 13:57:39,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:40,037 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. [2018-12-24 13:57:40,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2018-12-24 13:57:40,062 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:40,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:40,138 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:40,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:40,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2018-12-24 13:57:40,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:40,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-24 13:57:40,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-24 13:57:40,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:57:40,157 INFO L87 Difference]: Start difference. First operand 257 states and 1374 transitions. Second operand 11 states. [2018-12-24 13:57:41,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:41,475 INFO L93 Difference]: Finished difference Result 309 states and 1505 transitions. [2018-12-24 13:57:41,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:57:41,476 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2018-12-24 13:57:41,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:41,480 INFO L225 Difference]: With dead ends: 309 [2018-12-24 13:57:41,480 INFO L226 Difference]: Without dead ends: 306 [2018-12-24 13:57:41,480 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 [2018-12-24 13:57:41,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-12-24 13:57:42,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 248. [2018-12-24 13:57:42,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-12-24 13:57:42,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 1322 transitions. [2018-12-24 13:57:42,179 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 1322 transitions. Word has length 8 [2018-12-24 13:57:42,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:42,179 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 1322 transitions. [2018-12-24 13:57:42,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-24 13:57:42,179 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 1322 transitions. [2018-12-24 13:57:42,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:57:42,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:42,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:57:42,180 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:42,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:42,180 INFO L82 PathProgramCache]: Analyzing trace with hash -698958370, now seen corresponding path program 1 times [2018-12-24 13:57:42,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:42,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:42,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:42,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:42,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:42,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:42,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:42,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:42,292 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-24 13:57:42,292 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [30], [31] [2018-12-24 13:57:42,293 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:57:42,293 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:57:42,295 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:57:42,295 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. [2018-12-24 13:57:42,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:42,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:57:42,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:42,295 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 [2018-12-24 13:57:42,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:42,311 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:57:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:42,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:42,318 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 [2018-12-24 13:57:42,325 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 [2018-12-24 13:57:42,337 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 [2018-12-24 13:57:42,351 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 [2018-12-24 13:57:42,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:42,364 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 [2018-12-24 13:57:42,365 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:42,378 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:42,388 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:42,398 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:42,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:42,420 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. [2018-12-24 13:57:42,420 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:22, output treesize:29 [2018-12-24 13:57:42,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:42,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:42,442 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 [2018-12-24 13:57:42,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:42,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:42,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-12-24 13:57:42,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:42,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:42,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:42,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:42,467 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 [2018-12-24 13:57:42,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:42,478 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. [2018-12-24 13:57:42,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2018-12-24 13:57:42,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:42,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:42,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:42,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:42,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2018-12-24 13:57:42,525 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:42,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-24 13:57:42,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-24 13:57:42,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:57:42,526 INFO L87 Difference]: Start difference. First operand 248 states and 1322 transitions. Second operand 9 states. [2018-12-24 13:57:43,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:43,752 INFO L93 Difference]: Finished difference Result 379 states and 1929 transitions. [2018-12-24 13:57:43,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:57:43,753 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-12-24 13:57:43,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:43,755 INFO L225 Difference]: With dead ends: 379 [2018-12-24 13:57:43,755 INFO L226 Difference]: Without dead ends: 366 [2018-12-24 13:57:43,756 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 [2018-12-24 13:57:43,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-12-24 13:57:44,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 243. [2018-12-24 13:57:44,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-12-24 13:57:44,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 1245 transitions. [2018-12-24 13:57:44,531 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 1245 transitions. Word has length 8 [2018-12-24 13:57:44,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:44,531 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 1245 transitions. [2018-12-24 13:57:44,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-24 13:57:44,531 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 1245 transitions. [2018-12-24 13:57:44,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:57:44,532 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:44,532 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:57:44,532 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:44,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:44,532 INFO L82 PathProgramCache]: Analyzing trace with hash -712249128, now seen corresponding path program 1 times [2018-12-24 13:57:44,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:44,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:44,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:44,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:44,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:44,687 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:57:44,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:44,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:44,687 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-24 13:57:44,688 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [27] [2018-12-24 13:57:44,688 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:57:44,688 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:57:44,690 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:57:44,690 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. [2018-12-24 13:57:44,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:44,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:57:44,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:44,691 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 [2018-12-24 13:57:44,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:44,699 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:57:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:44,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:44,708 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 [2018-12-24 13:57:44,712 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 [2018-12-24 13:57:44,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:44,723 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 [2018-12-24 13:57:44,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:44,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:44,737 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 [2018-12-24 13:57:44,742 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:44,747 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:44,748 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:44,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, 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 [2018-12-24 13:57:44,749 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:44,771 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:44,783 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:44,854 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:44,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:44,879 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. [2018-12-24 13:57:44,879 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2018-12-24 13:57:44,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:44,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:44,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:44,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:44,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:44,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:44,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:44,924 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 [2018-12-24 13:57:44,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:44,951 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. [2018-12-24 13:57:44,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2018-12-24 13:57:44,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:44,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:44,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:44,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:44,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:44,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:44,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:44,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:44,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:44,983 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 [2018-12-24 13:57:44,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:45,012 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. [2018-12-24 13:57:45,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:57:45,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:45,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:45,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:45,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:45,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:45,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:45,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:45,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:45,040 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:57:45,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:45,042 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 [2018-12-24 13:57:45,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:45,075 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. [2018-12-24 13:57:45,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2018-12-24 13:57:45,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:45,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:45,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:45,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:45,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:45,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:45,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:45,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:45,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:45,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:45,107 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:57:45,107 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 [2018-12-24 13:57:45,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:45,139 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. [2018-12-24 13:57:45,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2018-12-24 13:57:45,161 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:45,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:45,204 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:45,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:45,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2018-12-24 13:57:45,223 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:45,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:57:45,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:57:45,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:57:45,224 INFO L87 Difference]: Start difference. First operand 243 states and 1245 transitions. Second operand 12 states. [2018-12-24 13:57:47,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:47,040 INFO L93 Difference]: Finished difference Result 371 states and 1813 transitions. [2018-12-24 13:57:47,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:57:47,041 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2018-12-24 13:57:47,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:47,043 INFO L225 Difference]: With dead ends: 371 [2018-12-24 13:57:47,043 INFO L226 Difference]: Without dead ends: 366 [2018-12-24 13:57:47,044 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 [2018-12-24 13:57:47,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-12-24 13:57:47,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 248. [2018-12-24 13:57:47,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-12-24 13:57:47,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 1279 transitions. [2018-12-24 13:57:47,996 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 1279 transitions. Word has length 8 [2018-12-24 13:57:47,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:47,997 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 1279 transitions. [2018-12-24 13:57:47,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:57:47,997 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 1279 transitions. [2018-12-24 13:57:47,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:57:47,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:47,997 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:57:47,997 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:47,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:47,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1048410772, now seen corresponding path program 1 times [2018-12-24 13:57:47,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:47,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:47,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:47,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:47,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:48,128 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:57:48,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:48,128 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:48,128 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-24 13:57:48,129 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [27] [2018-12-24 13:57:48,129 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:57:48,130 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:57:48,132 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:57:48,132 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. [2018-12-24 13:57:48,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:48,132 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:57:48,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:48,133 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 [2018-12-24 13:57:48,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:48,142 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:57:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:48,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:48,150 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 [2018-12-24 13:57:48,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,161 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 [2018-12-24 13:57:48,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,170 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 [2018-12-24 13:57:48,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,180 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 [2018-12-24 13:57:48,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,192 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 [2018-12-24 13:57:48,192 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:48,219 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:48,234 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:48,245 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:48,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:48,272 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. [2018-12-24 13:57:48,273 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:57:48,294 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,295 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,297 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,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 72 [2018-12-24 13:57:48,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:48,346 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. [2018-12-24 13:57:48,346 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:57:48,371 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,379 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,380 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,384 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,384 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:57:48,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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 [2018-12-24 13:57:48,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:48,428 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. [2018-12-24 13:57:48,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:57:48,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,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 36 treesize of output 78 [2018-12-24 13:57:48,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:48,512 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. [2018-12-24 13:57:48,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:57:48,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,544 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,548 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,551 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:48,551 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:57:48,552 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 [2018-12-24 13:57:48,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:48,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. [2018-12-24 13:57:48,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:57:48,623 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:48,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:48,672 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:48,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:48,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2018-12-24 13:57:48,692 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:48,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-24 13:57:48,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-24 13:57:48,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:57:48,692 INFO L87 Difference]: Start difference. First operand 248 states and 1279 transitions. Second operand 11 states. [2018-12-24 13:57:50,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:50,277 INFO L93 Difference]: Finished difference Result 285 states and 1427 transitions. [2018-12-24 13:57:50,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:57:50,277 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2018-12-24 13:57:50,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:50,279 INFO L225 Difference]: With dead ends: 285 [2018-12-24 13:57:50,279 INFO L226 Difference]: Without dead ends: 284 [2018-12-24 13:57:50,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2018-12-24 13:57:50,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-12-24 13:57:51,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 253. [2018-12-24 13:57:51,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-12-24 13:57:51,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 1305 transitions. [2018-12-24 13:57:51,229 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 1305 transitions. Word has length 8 [2018-12-24 13:57:51,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:51,229 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 1305 transitions. [2018-12-24 13:57:51,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-24 13:57:51,229 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 1305 transitions. [2018-12-24 13:57:51,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:57:51,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:51,230 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:57:51,230 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:51,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:51,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1055499044, now seen corresponding path program 1 times [2018-12-24 13:57:51,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:51,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:51,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:51,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:51,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:51,519 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2018-12-24 13:57:51,568 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:57:51,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:51,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:51,568 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-24 13:57:51,568 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [26], [28], [29] [2018-12-24 13:57:51,569 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:57:51,569 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:57:51,570 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:57:51,570 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. [2018-12-24 13:57:51,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:51,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:57:51,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:51,571 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 [2018-12-24 13:57:51,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:51,579 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:57:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:51,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:51,587 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 [2018-12-24 13:57:51,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,591 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 [2018-12-24 13:57:51,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,594 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 [2018-12-24 13:57:51,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,599 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 [2018-12-24 13:57:51,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,606 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 [2018-12-24 13:57:51,607 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:51,635 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:51,650 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:51,661 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:51,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:51,689 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. [2018-12-24 13:57:51,689 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:57:51,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,723 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 [2018-12-24 13:57:51,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:51,765 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. [2018-12-24 13:57:51,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:57:51,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,799 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:57:51,800 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 [2018-12-24 13:57:51,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:51,844 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. [2018-12-24 13:57:51,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:57:51,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,875 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:51,881 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 [2018-12-24 13:57:51,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:51,931 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. [2018-12-24 13:57:51,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:57:51,957 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:51,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:51,991 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:52,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:52,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2018-12-24 13:57:52,010 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:52,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-24 13:57:52,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-24 13:57:52,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:57:52,011 INFO L87 Difference]: Start difference. First operand 253 states and 1305 transitions. Second operand 9 states. [2018-12-24 13:57:53,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:53,448 INFO L93 Difference]: Finished difference Result 281 states and 1396 transitions. [2018-12-24 13:57:53,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:57:53,449 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-12-24 13:57:53,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:53,450 INFO L225 Difference]: With dead ends: 281 [2018-12-24 13:57:53,451 INFO L226 Difference]: Without dead ends: 274 [2018-12-24 13:57:53,451 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 [2018-12-24 13:57:53,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-12-24 13:57:54,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 264. [2018-12-24 13:57:54,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-12-24 13:57:54,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 1366 transitions. [2018-12-24 13:57:54,543 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 1366 transitions. Word has length 8 [2018-12-24 13:57:54,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:54,543 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 1366 transitions. [2018-12-24 13:57:54,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-24 13:57:54,543 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 1366 transitions. [2018-12-24 13:57:54,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:57:54,543 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:54,543 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:57:54,544 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:54,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:54,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1051985692, now seen corresponding path program 2 times [2018-12-24 13:57:54,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:54,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:54,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:54,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:54,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:54,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:57:54,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:54,773 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:54,773 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:57:54,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:57:54,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:54,773 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 [2018-12-24 13:57:54,782 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:57:54,783 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:57:54,789 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:57:54,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:57:54,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:54,791 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 [2018-12-24 13:57:54,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:54,794 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 [2018-12-24 13:57:54,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:54,799 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:54,799 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 [2018-12-24 13:57:54,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:54,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:54,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:54,804 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 [2018-12-24 13:57:54,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:54,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:54,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:54,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:54,811 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 [2018-12-24 13:57:54,812 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:54,838 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:54,853 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:54,864 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:54,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:54,892 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. [2018-12-24 13:57:54,893 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:57:54,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:54,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:54,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:54,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:54,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:54,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:54,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:54,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:54,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:54,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:54,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:54,928 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 [2018-12-24 13:57:54,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:54,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. [2018-12-24 13:57:54,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:57:54,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:54,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,008 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,011 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:57:55,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, 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 [2018-12-24 13:57:55,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:55,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. [2018-12-24 13:57:55,056 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:57:55,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,096 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:57:55,096 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 [2018-12-24 13:57:55,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:55,143 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. [2018-12-24 13:57:55,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:57:55,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:55,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, 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 [2018-12-24 13:57:55,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:55,231 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. [2018-12-24 13:57:55,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:57:55,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:55,258 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:55,325 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:55,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:55,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2018-12-24 13:57:55,343 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:55,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:57:55,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:57:55,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:57:55,344 INFO L87 Difference]: Start difference. First operand 264 states and 1366 transitions. Second operand 12 states. [2018-12-24 13:57:57,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:57,156 INFO L93 Difference]: Finished difference Result 295 states and 1460 transitions. [2018-12-24 13:57:57,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:57:57,157 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2018-12-24 13:57:57,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:57,158 INFO L225 Difference]: With dead ends: 295 [2018-12-24 13:57:57,158 INFO L226 Difference]: Without dead ends: 288 [2018-12-24 13:57:57,159 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 [2018-12-24 13:57:57,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-12-24 13:57:58,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 263. [2018-12-24 13:57:58,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-12-24 13:57:58,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 1359 transitions. [2018-12-24 13:57:58,301 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 1359 transitions. Word has length 8 [2018-12-24 13:57:58,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:58,301 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 1359 transitions. [2018-12-24 13:57:58,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:57:58,301 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 1359 transitions. [2018-12-24 13:57:58,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:57:58,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:58,302 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:57:58,302 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:58,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:58,302 INFO L82 PathProgramCache]: Analyzing trace with hash -937469088, now seen corresponding path program 2 times [2018-12-24 13:57:58,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:58,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:58,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:57:58,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:58,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:58,453 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:58,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:58,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:58,453 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:57:58,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:57:58,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:58,454 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 [2018-12-24 13:57:58,463 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:57:58,463 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:57:58,470 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:57:58,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:57:58,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:58,488 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 [2018-12-24 13:57:58,524 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 [2018-12-24 13:57:58,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,543 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 [2018-12-24 13:57:58,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,551 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,551 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 [2018-12-24 13:57:58,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,560 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,561 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,561 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 [2018-12-24 13:57:58,562 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:58,580 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:58,592 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:58,602 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:58,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:58,627 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. [2018-12-24 13:57:58,627 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2018-12-24 13:57:58,663 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,664 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,670 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 [2018-12-24 13:57:58,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:58,698 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. [2018-12-24 13:57:58,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2018-12-24 13:57:58,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,726 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,728 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 [2018-12-24 13:57:58,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:58,757 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. [2018-12-24 13:57:58,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:57:58,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,783 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,785 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,791 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:57:58,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, 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 [2018-12-24 13:57:58,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:58,823 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. [2018-12-24 13:57:58,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2018-12-24 13:57:58,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,860 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:57:58,862 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:57:58,862 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 [2018-12-24 13:57:58,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:58,896 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. [2018-12-24 13:57:58,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2018-12-24 13:57:58,917 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:58,918 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:58,971 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:58,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:58,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2018-12-24 13:57:58,991 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:58,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:57:58,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:57:58,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:57:58,992 INFO L87 Difference]: Start difference. First operand 263 states and 1359 transitions. Second operand 12 states. [2018-12-24 13:58:01,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:58:01,063 INFO L93 Difference]: Finished difference Result 370 states and 1786 transitions. [2018-12-24 13:58:01,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:58:01,064 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2018-12-24 13:58:01,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:58:01,065 INFO L225 Difference]: With dead ends: 370 [2018-12-24 13:58:01,065 INFO L226 Difference]: Without dead ends: 363 [2018-12-24 13:58:01,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2018-12-24 13:58:01,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-12-24 13:58:02,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 288. [2018-12-24 13:58:02,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-12-24 13:58:02,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 1503 transitions. [2018-12-24 13:58:02,363 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 1503 transitions. Word has length 8 [2018-12-24 13:58:02,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:58:02,363 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 1503 transitions. [2018-12-24 13:58:02,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:58:02,364 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 1503 transitions. [2018-12-24 13:58:02,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:58:02,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:58:02,364 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:58:02,364 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:58:02,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:02,365 INFO L82 PathProgramCache]: Analyzing trace with hash -819496728, now seen corresponding path program 3 times [2018-12-24 13:58:02,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:58:02,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:02,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:58:02,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:02,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:58:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:02,521 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:02,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:02,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:58:02,521 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:58:02,522 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:58:02,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:02,522 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 [2018-12-24 13:58:02,531 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:58:02,531 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:58:02,535 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:58:02,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:58:02,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:58:02,539 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 [2018-12-24 13:58:02,543 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 [2018-12-24 13:58:02,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,554 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 [2018-12-24 13:58:02,559 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,560 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58: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, 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 [2018-12-24 13:58:02,565 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,570 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,571 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,571 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 [2018-12-24 13:58:02,572 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:02,592 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:02,604 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:02,614 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:02,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:02,640 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. [2018-12-24 13:58:02,640 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2018-12-24 13:58:02,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,677 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,682 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 [2018-12-24 13:58:02,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:02,708 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. [2018-12-24 13:58:02,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2018-12-24 13:58:02,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,742 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:58:02,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, 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 [2018-12-24 13:58:02,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:02,773 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. [2018-12-24 13:58:02,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2018-12-24 13:58:02,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,799 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,801 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,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, 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 [2018-12-24 13:58:02,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:02,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. [2018-12-24 13:58:02,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:58:02,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,875 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,877 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:58:02,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:02,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 33 treesize of output 72 [2018-12-24 13:58:02,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:02,911 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. [2018-12-24 13:58:02,912 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2018-12-24 13:58:02,934 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:02,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:58:02,994 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:03,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:58:03,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2018-12-24 13:58:03,013 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:58:03,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:58:03,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:58:03,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:58:03,014 INFO L87 Difference]: Start difference. First operand 288 states and 1503 transitions. Second operand 12 states. [2018-12-24 13:58:04,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:58:04,975 INFO L93 Difference]: Finished difference Result 349 states and 1691 transitions. [2018-12-24 13:58:04,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:58:04,975 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2018-12-24 13:58:04,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:58:04,976 INFO L225 Difference]: With dead ends: 349 [2018-12-24 13:58:04,976 INFO L226 Difference]: Without dead ends: 344 [2018-12-24 13:58:04,977 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 [2018-12-24 13:58:04,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-12-24 13:58:06,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 236. [2018-12-24 13:58:06,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-12-24 13:58:06,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 1210 transitions. [2018-12-24 13:58:06,064 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 1210 transitions. Word has length 8 [2018-12-24 13:58:06,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:58:06,065 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 1210 transitions. [2018-12-24 13:58:06,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:58:06,065 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 1210 transitions. [2018-12-24 13:58:06,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:58:06,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:58:06,065 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:58:06,065 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:58:06,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:06,066 INFO L82 PathProgramCache]: Analyzing trace with hash -826465836, now seen corresponding path program 1 times [2018-12-24 13:58:06,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:58:06,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:06,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:58:06,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:06,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:58:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:06,302 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2018-12-24 13:58:06,355 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:58:06,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:06,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:58:06,355 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-24 13:58:06,355 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [26], [28], [29] [2018-12-24 13:58:06,356 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:58:06,356 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:58:06,357 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:58:06,357 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. [2018-12-24 13:58:06,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:06,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:58:06,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:06,358 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 [2018-12-24 13:58:06,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:06,373 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:58:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:06,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:58:06,408 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 [2018-12-24 13:58:06,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, 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 [2018-12-24 13:58:06,486 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:06,487 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 [2018-12-24 13:58:06,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:06,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:06,493 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 [2018-12-24 13:58:06,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:06,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:06,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:06,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, 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 [2018-12-24 13:58:06,504 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:06,523 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:06,535 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:06,544 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:06,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:06,570 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. [2018-12-24 13:58:06,570 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2018-12-24 13:58:06,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:06,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:06,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:06,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:06,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:06,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:06,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:06,610 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 [2018-12-24 13:58:06,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:06,637 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. [2018-12-24 13:58:06,638 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2018-12-24 13:58:06,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:06,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:06,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:06,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:06,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:06,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:06,664 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:06,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:06,665 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:58:06,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 59 [2018-12-24 13:58:06,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:06,695 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. [2018-12-24 13:58:06,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:58:06,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:06,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:06,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:06,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:06,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:06,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:06,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:06,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:06,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:06,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 31 treesize of output 65 [2018-12-24 13:58:06,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:06,758 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. [2018-12-24 13:58:06,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2018-12-24 13:58:06,777 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:06,777 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:58:06,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:06,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:58:06,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2018-12-24 13:58:06,832 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:58:06,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-24 13:58:06,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-24 13:58:06,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:58:06,833 INFO L87 Difference]: Start difference. First operand 236 states and 1210 transitions. Second operand 9 states. [2018-12-24 13:58:08,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:58:08,366 INFO L93 Difference]: Finished difference Result 257 states and 1260 transitions. [2018-12-24 13:58:08,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:58:08,366 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-12-24 13:58:08,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:58:08,367 INFO L225 Difference]: With dead ends: 257 [2018-12-24 13:58:08,367 INFO L226 Difference]: Without dead ends: 250 [2018-12-24 13:58:08,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:58:08,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-12-24 13:58:09,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 238. [2018-12-24 13:58:09,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-12-24 13:58:09,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 1220 transitions. [2018-12-24 13:58:09,454 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 1220 transitions. Word has length 8 [2018-12-24 13:58:09,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:58:09,454 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 1220 transitions. [2018-12-24 13:58:09,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-24 13:58:09,454 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 1220 transitions. [2018-12-24 13:58:09,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:58:09,455 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:58:09,455 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:58:09,455 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:58:09,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:09,455 INFO L82 PathProgramCache]: Analyzing trace with hash -252398774, now seen corresponding path program 1 times [2018-12-24 13:58:09,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:58:09,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:09,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:09,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:09,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:58:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:09,589 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:58:09,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:09,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:58:09,590 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-24 13:58:09,590 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [27] [2018-12-24 13:58:09,590 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:58:09,590 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:58:09,592 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:58:09,592 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. [2018-12-24 13:58:09,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:09,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:58:09,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:09,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 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 [2018-12-24 13:58:09,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:09,600 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:58:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:09,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:58:09,628 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 [2018-12-24 13:58:09,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,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 [2018-12-24 13:58:09,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,646 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 [2018-12-24 13:58:09,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,657 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 [2018-12-24 13:58:09,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,663 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,664 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,665 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 [2018-12-24 13:58:09,666 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:09,693 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:09,707 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:09,719 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:09,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:09,747 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. [2018-12-24 13:58:09,747 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:58:09,785 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,806 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,812 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 [2018-12-24 13:58:09,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:09,868 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. [2018-12-24 13:58:09,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:58:09,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,931 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,934 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,936 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,943 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,945 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:09,945 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 [2018-12-24 13:58:09,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:10,005 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. [2018-12-24 13:58:10,006 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:58:10,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:10,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:10,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:10,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:10,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:10,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:10,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:10,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:10,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:10,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:10,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:10,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:10,065 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:58:10,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:10,067 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 [2018-12-24 13:58:10,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:10,129 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. [2018-12-24 13:58:10,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2018-12-24 13:58:10,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:10,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:10,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:10,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:10,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:10,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:10,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:10,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:10,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:10,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:10,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:10,175 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:10,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:10,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:10,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:10,179 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:58:10,180 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 [2018-12-24 13:58:10,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:10,231 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. [2018-12-24 13:58:10,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2018-12-24 13:58:10,255 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:10,255 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:58:10,318 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:10,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:58:10,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2018-12-24 13:58:10,337 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:58:10,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-24 13:58:10,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-24 13:58:10,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:58:10,338 INFO L87 Difference]: Start difference. First operand 238 states and 1220 transitions. Second operand 11 states. [2018-12-24 13:58:12,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:58:12,401 INFO L93 Difference]: Finished difference Result 316 states and 1514 transitions. [2018-12-24 13:58:12,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:58:12,402 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2018-12-24 13:58:12,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:58:12,403 INFO L225 Difference]: With dead ends: 316 [2018-12-24 13:58:12,404 INFO L226 Difference]: Without dead ends: 315 [2018-12-24 13:58:12,404 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 [2018-12-24 13:58:12,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-12-24 13:58:13,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 242. [2018-12-24 13:58:13,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-12-24 13:58:13,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 1244 transitions. [2018-12-24 13:58:13,527 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 1244 transitions. Word has length 8 [2018-12-24 13:58:13,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:58:13,527 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 1244 transitions. [2018-12-24 13:58:13,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-24 13:58:13,527 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 1244 transitions. [2018-12-24 13:58:13,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:58:13,528 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:58:13,528 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:58:13,528 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:58:13,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:13,528 INFO L82 PathProgramCache]: Analyzing trace with hash -191146492, now seen corresponding path program 1 times [2018-12-24 13:58:13,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:58:13,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:13,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:13,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:13,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:58:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:13,709 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2018-12-24 13:58:13,758 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:58:13,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:13,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:58:13,759 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-24 13:58:13,759 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [26], [28], [29] [2018-12-24 13:58:13,759 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:58:13,760 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:58:13,762 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:58:13,764 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. [2018-12-24 13:58:13,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:13,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:58:13,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:13,764 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 [2018-12-24 13:58:13,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:13,774 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:58:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:13,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:58:13,782 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 [2018-12-24 13:58:13,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:13,786 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 [2018-12-24 13:58:13,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:13,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:13,791 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 [2018-12-24 13:58:13,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:13,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:13,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:13,798 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 [2018-12-24 13:58:13,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:13,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:13,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:13,816 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:13,816 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 [2018-12-24 13:58:13,816 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:13,843 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:13,858 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:13,870 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:13,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:13,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. [2018-12-24 13:58:13,899 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:58:13,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:13,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:13,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:14,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:14,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:14,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:14,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:14,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:14,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:14,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:14,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:14,160 INFO L303 Elim1Store]: Index analysis took 241 ms [2018-12-24 13:58:14,161 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 [2018-12-24 13:58:14,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:14,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. [2018-12-24 13:58:14,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:58:14,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:14,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:14,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:14,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:14,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:14,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:14,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:14,232 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:14,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:14,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:14,235 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:14,236 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:14,237 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:58:14,238 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 [2018-12-24 13:58:14,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:14,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. [2018-12-24 13:58:14,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:58:14,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:14,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:14,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:14,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:14,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:14,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:14,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:14,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:14,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:14,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:14,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:14,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:14,320 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:58:14,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 36 treesize of output 80 [2018-12-24 13:58:14,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:14,366 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. [2018-12-24 13:58:14,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:58:14,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:14,392 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:58:14,454 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:14,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:58:14,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2018-12-24 13:58:14,474 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:58:14,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-24 13:58:14,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-24 13:58:14,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:58:14,474 INFO L87 Difference]: Start difference. First operand 242 states and 1244 transitions. Second operand 9 states. [2018-12-24 13:58:16,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:58:16,050 INFO L93 Difference]: Finished difference Result 253 states and 1273 transitions. [2018-12-24 13:58:16,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:58:16,050 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-12-24 13:58:16,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:58:16,051 INFO L225 Difference]: With dead ends: 253 [2018-12-24 13:58:16,051 INFO L226 Difference]: Without dead ends: 246 [2018-12-24 13:58:16,051 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 [2018-12-24 13:58:16,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-12-24 13:58:17,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 240. [2018-12-24 13:58:17,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-12-24 13:58:17,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 1234 transitions. [2018-12-24 13:58:17,158 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 1234 transitions. Word has length 8 [2018-12-24 13:58:17,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:58:17,158 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 1234 transitions. [2018-12-24 13:58:17,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-24 13:58:17,158 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 1234 transitions. [2018-12-24 13:58:17,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:58:17,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:58:17,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:58:17,159 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:58:17,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:17,159 INFO L82 PathProgramCache]: Analyzing trace with hash -477618734, now seen corresponding path program 2 times [2018-12-24 13:58:17,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:58:17,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:17,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:17,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:17,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:58:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:17,338 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-24 13:58:17,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:17,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:58:17,338 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:58:17,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:58:17,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:17,339 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 [2018-12-24 13:58:17,348 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:58:17,348 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:58:17,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:58:17,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:58:17,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:58:17,358 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 [2018-12-24 13:58:17,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,365 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 [2018-12-24 13:58:17,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,368 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 [2018-12-24 13:58:17,371 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,374 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 [2018-12-24 13:58:17,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,379 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,380 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,382 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 [2018-12-24 13:58:17,382 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:17,410 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:17,425 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:17,437 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:17,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:17,465 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. [2018-12-24 13:58:17,465 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:58:17,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,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 [2018-12-24 13:58:17,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:17,549 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. [2018-12-24 13:58:17,550 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:58:17,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,581 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,592 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 [2018-12-24 13:58:17,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:17,639 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. [2018-12-24 13:58:17,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:58:17,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,674 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,681 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,683 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:58:17,683 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 [2018-12-24 13:58:17,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:17,731 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. [2018-12-24 13:58:17,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2018-12-24 13:58:17,758 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,759 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,760 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,761 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,763 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,764 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,766 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,768 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,770 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,771 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,774 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:17,775 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:58:17,776 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 [2018-12-24 13:58:17,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:17,827 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. [2018-12-24 13:58:17,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:58:17,866 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:17,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:58:17,949 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:17,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:58:17,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2018-12-24 13:58:17,969 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:58:17,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:58:17,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:58:17,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:58:17,969 INFO L87 Difference]: Start difference. First operand 240 states and 1234 transitions. Second operand 12 states. [2018-12-24 13:58:20,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:58:20,204 INFO L93 Difference]: Finished difference Result 332 states and 1585 transitions. [2018-12-24 13:58:20,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:58:20,204 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2018-12-24 13:58:20,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:58:20,205 INFO L225 Difference]: With dead ends: 332 [2018-12-24 13:58:20,205 INFO L226 Difference]: Without dead ends: 328 [2018-12-24 13:58:20,205 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 [2018-12-24 13:58:20,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-12-24 13:58:21,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 220. [2018-12-24 13:58:21,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-12-24 13:58:21,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 1124 transitions. [2018-12-24 13:58:21,277 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 1124 transitions. Word has length 8 [2018-12-24 13:58:21,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:58:21,278 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 1124 transitions. [2018-12-24 13:58:21,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:58:21,278 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 1124 transitions. [2018-12-24 13:58:21,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:58:21,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:58:21,278 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:58:21,278 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:58:21,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:21,279 INFO L82 PathProgramCache]: Analyzing trace with hash -366615482, now seen corresponding path program 1 times [2018-12-24 13:58:21,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:58:21,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:21,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:58:21,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:21,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:58:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:21,832 WARN L181 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 21 [2018-12-24 13:58:21,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-24 13:58:21,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:21,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:58:21,878 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-24 13:58:21,878 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [29] [2018-12-24 13:58:21,878 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:58:21,878 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:58:21,880 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:58:21,880 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. [2018-12-24 13:58:21,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:21,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:58:21,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:21,880 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 [2018-12-24 13:58:21,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:21,890 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:58:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:21,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:58:21,897 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 [2018-12-24 13:58:21,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:21,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 [2018-12-24 13:58:21,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:21,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:21,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 [2018-12-24 13:58:21,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:21,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:21,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:21,911 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 [2018-12-24 13:58:21,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:21,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:21,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:21,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:21,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 [2018-12-24 13:58:21,919 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:21,947 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:21,962 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:21,974 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:21,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:22,003 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. [2018-12-24 13:58:22,003 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:58:22,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,039 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 [2018-12-24 13:58:22,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:22,086 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. [2018-12-24 13:58:22,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:58:22,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,122 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,124 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:58:22,125 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 [2018-12-24 13:58:22,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:22,169 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. [2018-12-24 13:58:22,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:58:22,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,197 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,201 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,204 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:22,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 36 treesize of output 86 [2018-12-24 13:58:22,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:22,255 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. [2018-12-24 13:58:22,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2018-12-24 13:58:22,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:22,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:58:22,318 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:22,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:58:22,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2018-12-24 13:58:22,336 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:58:22,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-24 13:58:22,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-24 13:58:22,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:58:22,336 INFO L87 Difference]: Start difference. First operand 220 states and 1124 transitions. Second operand 9 states. [2018-12-24 13:58:23,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:58:23,906 INFO L93 Difference]: Finished difference Result 242 states and 1184 transitions. [2018-12-24 13:58:23,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:58:23,907 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-12-24 13:58:23,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:58:23,908 INFO L225 Difference]: With dead ends: 242 [2018-12-24 13:58:23,908 INFO L226 Difference]: Without dead ends: 241 [2018-12-24 13:58:23,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:58:23,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-12-24 13:58:25,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 225. [2018-12-24 13:58:25,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-12-24 13:58:25,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1154 transitions. [2018-12-24 13:58:25,108 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1154 transitions. Word has length 8 [2018-12-24 13:58:25,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:58:25,108 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1154 transitions. [2018-12-24 13:58:25,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-24 13:58:25,108 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1154 transitions. [2018-12-24 13:58:25,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:58:25,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:58:25,109 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:58:25,109 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:58:25,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:25,109 INFO L82 PathProgramCache]: Analyzing trace with hash -987816240, now seen corresponding path program 1 times [2018-12-24 13:58:25,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:58:25,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:25,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:25,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:25,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:58:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:25,271 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:58:25,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:25,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:58:25,272 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-24 13:58:25,272 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [29] [2018-12-24 13:58:25,273 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:58:25,273 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:58:25,274 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:58:25,274 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. [2018-12-24 13:58:25,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:25,275 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:58:25,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:25,275 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 [2018-12-24 13:58:25,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:25,288 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:58:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:25,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:58:25,315 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 [2018-12-24 13:58:25,341 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 [2018-12-24 13:58:25,349 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:25,349 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 [2018-12-24 13:58:25,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:25,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:25,364 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 [2018-12-24 13:58:25,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:25,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:25,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:25,381 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 [2018-12-24 13:58:25,382 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:25,409 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:25,427 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:25,439 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:25,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:25,469 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. [2018-12-24 13:58:25,469 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2018-12-24 13:58:25,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:25,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:25,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:25,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:25,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:25,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:25,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:25,520 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 [2018-12-24 13:58:25,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:25,549 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. [2018-12-24 13:58:25,550 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:58:25,570 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:25,570 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:25,571 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:25,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:25,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:25,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:25,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:25,577 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:25,578 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:58:25,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, 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 [2018-12-24 13:58:25,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:25,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. [2018-12-24 13:58:25,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2018-12-24 13:58:25,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:25,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:25,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:25,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:25,766 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:25,767 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:25,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:25,770 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:25,771 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:25,771 INFO L303 Elim1Store]: Index analysis took 124 ms [2018-12-24 13:58:25,771 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 [2018-12-24 13:58:25,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:25,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. [2018-12-24 13:58:25,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2018-12-24 13:58:25,824 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:25,825 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:58:25,865 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:25,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:58:25,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:58:25,886 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:58:25,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:58:25,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:58:25,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:58:25,887 INFO L87 Difference]: Start difference. First operand 225 states and 1154 transitions. Second operand 10 states. [2018-12-24 13:58:27,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:58:27,550 INFO L93 Difference]: Finished difference Result 254 states and 1190 transitions. [2018-12-24 13:58:27,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:58:27,551 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2018-12-24 13:58:27,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:58:27,552 INFO L225 Difference]: With dead ends: 254 [2018-12-24 13:58:27,552 INFO L226 Difference]: Without dead ends: 245 [2018-12-24 13:58:27,552 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 [2018-12-24 13:58:27,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-12-24 13:58:28,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 226. [2018-12-24 13:58:28,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-12-24 13:58:28,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 1153 transitions. [2018-12-24 13:58:28,684 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 1153 transitions. Word has length 8 [2018-12-24 13:58:28,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:58:28,684 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 1153 transitions. [2018-12-24 13:58:28,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:58:28,684 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 1153 transitions. [2018-12-24 13:58:28,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:58:28,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:58:28,684 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:58:28,684 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:58:28,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:28,685 INFO L82 PathProgramCache]: Analyzing trace with hash -993357366, now seen corresponding path program 1 times [2018-12-24 13:58:28,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:58:28,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:28,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:28,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:28,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:58:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:28,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:28,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:28,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:58:28,812 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-24 13:58:28,812 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [29] [2018-12-24 13:58:28,813 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:58:28,813 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:58:28,815 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:58:28,815 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. [2018-12-24 13:58:28,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:28,815 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:58:28,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:28,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 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 [2018-12-24 13:58:28,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:28,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:58:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:28,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:58:28,834 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 [2018-12-24 13:58:28,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 [2018-12-24 13:58:28,849 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:28,849 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 [2018-12-24 13:58:28,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:28,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:28,862 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 [2018-12-24 13:58:28,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:28,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:28,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:28,872 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 [2018-12-24 13:58:28,872 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:28,892 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:28,903 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:28,913 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:28,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:28,938 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. [2018-12-24 13:58:28,939 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2018-12-24 13:58:28,973 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:28,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:28,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:28,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:28,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:28,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:28,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:28,979 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 [2018-12-24 13:58:28,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:29,004 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. [2018-12-24 13:58:29,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:58:29,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:29,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:29,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:29,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:29,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:29,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:29,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:29,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:29,034 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:58:29,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, 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 [2018-12-24 13:58:29,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:29,062 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. [2018-12-24 13:58:29,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2018-12-24 13:58:29,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:29,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:29,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:29,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:29,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:29,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:29,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:29,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:29,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:29,094 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 [2018-12-24 13:58:29,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:29,125 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. [2018-12-24 13:58:29,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2018-12-24 13:58:29,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:29,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:58:29,180 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:29,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:58:29,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:58:29,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:58:29,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:58:29,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:58:29,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:58:29,200 INFO L87 Difference]: Start difference. First operand 226 states and 1153 transitions. Second operand 10 states. [2018-12-24 13:58:30,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:58:30,810 INFO L93 Difference]: Finished difference Result 249 states and 1194 transitions. [2018-12-24 13:58:30,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:58:30,811 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2018-12-24 13:58:30,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:58:30,812 INFO L225 Difference]: With dead ends: 249 [2018-12-24 13:58:30,812 INFO L226 Difference]: Without dead ends: 248 [2018-12-24 13:58:30,812 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 [2018-12-24 13:58:30,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-12-24 13:58:32,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 229. [2018-12-24 13:58:32,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-12-24 13:58:32,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 1171 transitions. [2018-12-24 13:58:32,029 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 1171 transitions. Word has length 8 [2018-12-24 13:58:32,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:58:32,029 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 1171 transitions. [2018-12-24 13:58:32,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:58:32,030 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 1171 transitions. [2018-12-24 13:58:32,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:58:32,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:58:32,030 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:58:32,030 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:58:32,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:32,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1327610400, now seen corresponding path program 1 times [2018-12-24 13:58:32,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:58:32,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:32,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:32,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:32,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:58:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:32,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:58:32,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:32,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:58:32,131 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-24 13:58:32,132 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [30], [31] [2018-12-24 13:58:32,132 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:58:32,132 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:58:32,134 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:58:32,134 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. [2018-12-24 13:58:32,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:32,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:58:32,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:32,134 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 [2018-12-24 13:58:32,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:32,144 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:58:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:32,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:58:32,151 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 [2018-12-24 13:58:32,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,156 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 [2018-12-24 13:58:32,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,167 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 [2018-12-24 13:58:32,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,171 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 [2018-12-24 13:58:32,175 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,180 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 [2018-12-24 13:58:32,180 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:32,207 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:32,222 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:32,233 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:32,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:32,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. [2018-12-24 13:58:32,261 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2018-12-24 13:58:32,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,287 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,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, 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 [2018-12-24 13:58:32,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:32,338 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. [2018-12-24 13:58:32,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:58:32,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,358 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:32,368 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 [2018-12-24 13:58:32,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:32,414 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. [2018-12-24 13:58:32,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:58:32,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:32,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:58:32,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:32,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:58:32,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2018-12-24 13:58:32,564 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:58:32,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-24 13:58:32,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-24 13:58:32,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:58:32,565 INFO L87 Difference]: Start difference. First operand 229 states and 1171 transitions. Second operand 7 states. [2018-12-24 13:58:34,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:58:34,005 INFO L93 Difference]: Finished difference Result 239 states and 1185 transitions. [2018-12-24 13:58:34,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:58:34,005 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-24 13:58:34,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:58:34,007 INFO L225 Difference]: With dead ends: 239 [2018-12-24 13:58:34,007 INFO L226 Difference]: Without dead ends: 230 [2018-12-24 13:58:34,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:58:34,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-12-24 13:58:35,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2018-12-24 13:58:35,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-12-24 13:58:35,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 1158 transitions. [2018-12-24 13:58:35,176 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 1158 transitions. Word has length 8 [2018-12-24 13:58:35,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:58:35,176 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 1158 transitions. [2018-12-24 13:58:35,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-24 13:58:35,177 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 1158 transitions. [2018-12-24 13:58:35,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:58:35,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:58:35,177 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:58:35,177 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:58:35,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:35,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1098577192, now seen corresponding path program 1 times [2018-12-24 13:58:35,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:58:35,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:35,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:35,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:35,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:58:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:35,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:58:35,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:35,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:58:35,250 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-24 13:58:35,250 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [28], [30], [31] [2018-12-24 13:58:35,251 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:58:35,251 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:58:35,252 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:58:35,252 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. [2018-12-24 13:58:35,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:35,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:58:35,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:35,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 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 [2018-12-24 13:58:35,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:35,261 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:58:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:35,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:58:35,268 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 [2018-12-24 13:58:35,273 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 [2018-12-24 13:58:35,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:35,280 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 [2018-12-24 13:58:35,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:35,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:35,291 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 [2018-12-24 13:58:35,297 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:35,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:35,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:35,309 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 [2018-12-24 13:58:35,309 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:35,333 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:35,344 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:35,354 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:35,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:35,391 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. [2018-12-24 13:58:35,392 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2018-12-24 13:58:35,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:35,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:35,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:35,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:35,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:35,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:35,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:35,448 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 [2018-12-24 13:58:35,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:35,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. [2018-12-24 13:58:35,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:58:35,510 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:35,512 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:35,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:35,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:35,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:35,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:35,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:35,526 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:35,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:35,528 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 [2018-12-24 13:58:35,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:35,570 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. [2018-12-24 13:58:35,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2018-12-24 13:58:35,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:35,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:58:35,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:35,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:58:35,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2018-12-24 13:58:35,639 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:58:35,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-24 13:58:35,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-24 13:58:35,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:58:35,639 INFO L87 Difference]: Start difference. First operand 227 states and 1158 transitions. Second operand 7 states. [2018-12-24 13:58:37,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:58:37,017 INFO L93 Difference]: Finished difference Result 236 states and 1166 transitions. [2018-12-24 13:58:37,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:58:37,017 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-12-24 13:58:37,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:58:37,018 INFO L225 Difference]: With dead ends: 236 [2018-12-24 13:58:37,018 INFO L226 Difference]: Without dead ends: 227 [2018-12-24 13:58:37,018 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 [2018-12-24 13:58:37,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-12-24 13:58:38,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2018-12-24 13:58:38,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-12-24 13:58:38,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 1149 transitions. [2018-12-24 13:58:38,151 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 1149 transitions. Word has length 8 [2018-12-24 13:58:38,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:58:38,151 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 1149 transitions. [2018-12-24 13:58:38,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-24 13:58:38,152 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 1149 transitions. [2018-12-24 13:58:38,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-24 13:58:38,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:58:38,152 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:58:38,152 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:58:38,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:38,152 INFO L82 PathProgramCache]: Analyzing trace with hash 213756976, now seen corresponding path program 1 times [2018-12-24 13:58:38,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:58:38,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:38,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:38,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:38,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:58:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:38,633 WARN L181 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2018-12-24 13:58:38,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-24 13:58:38,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:38,844 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:58:38,844 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2018-12-24 13:58:38,844 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [28], [30], [31] [2018-12-24 13:58:38,845 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:58:38,845 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:58:38,846 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:58:38,846 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. [2018-12-24 13:58:38,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:38,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:58:38,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:38,847 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 [2018-12-24 13:58:38,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:38,855 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:58:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:38,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:58:38,865 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 [2018-12-24 13:58:38,867 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 [2018-12-24 13:58:38,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:38,872 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 [2018-12-24 13:58:38,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:38,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:38,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, 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 [2018-12-24 13:58:38,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:38,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:38,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:38,890 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 [2018-12-24 13:58:38,890 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:38,910 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:38,920 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:38,930 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:38,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:38,956 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. [2018-12-24 13:58:38,956 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2018-12-24 13:58:38,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:38,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:38,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:38,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:38,989 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:38,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:38,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:38,992 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 [2018-12-24 13:58:38,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:39,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. [2018-12-24 13:58:39,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2018-12-24 13:58:39,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:39,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:39,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:39,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:39,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:39,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:39,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:39,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:39,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:39,047 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 [2018-12-24 13:58:39,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:39,077 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. [2018-12-24 13:58:39,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2018-12-24 13:58:39,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:39,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:39,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:39,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:39,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:39,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:39,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:39,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:39,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:39,106 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 [2018-12-24 13:58:39,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:39,137 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. [2018-12-24 13:58:39,137 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2018-12-24 13:58:39,157 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:39,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:58:39,188 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:39,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:58:39,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2018-12-24 13:58:39,208 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:58:39,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-24 13:58:39,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-24 13:58:39,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:58:39,209 INFO L87 Difference]: Start difference. First operand 226 states and 1149 transitions. Second operand 9 states. [2018-12-24 13:58:40,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:58:40,563 INFO L93 Difference]: Finished difference Result 236 states and 1163 transitions. [2018-12-24 13:58:40,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:58:40,563 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-24 13:58:40,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:58:40,564 INFO L225 Difference]: With dead ends: 236 [2018-12-24 13:58:40,564 INFO L226 Difference]: Without dead ends: 227 [2018-12-24 13:58:40,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2018-12-24 13:58:40,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-12-24 13:58:41,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2018-12-24 13:58:41,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-12-24 13:58:41,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 1137 transitions. [2018-12-24 13:58:41,728 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 1137 transitions. Word has length 9 [2018-12-24 13:58:41,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:58:41,728 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 1137 transitions. [2018-12-24 13:58:41,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-24 13:58:41,728 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 1137 transitions. [2018-12-24 13:58:41,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-24 13:58:41,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:58:41,729 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:58:41,729 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:58:41,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:41,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1864950956, now seen corresponding path program 1 times [2018-12-24 13:58:41,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:58:41,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:41,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:41,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:41,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:58:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:41,894 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:58:41,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:41,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:58:41,895 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2018-12-24 13:58:41,895 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [28], [29] [2018-12-24 13:58:41,895 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:58:41,896 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:58:41,897 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:58:41,897 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. [2018-12-24 13:58:41,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:41,897 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:58:41,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:41,898 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 [2018-12-24 13:58:41,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:41,909 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:58:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:41,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:58:41,918 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 [2018-12-24 13:58:41,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:41,921 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 [2018-12-24 13:58:41,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:41,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:41,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 [2018-12-24 13:58:41,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:41,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,012 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 [2018-12-24 13:58:42,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,121 INFO L303 Elim1Store]: Index analysis took 108 ms [2018-12-24 13:58:42,122 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 [2018-12-24 13:58:42,122 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:42,199 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:42,214 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:42,226 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:42,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:42,255 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. [2018-12-24 13:58:42,255 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:58:42,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,284 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,287 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,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, 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 [2018-12-24 13:58:42,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:42,335 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. [2018-12-24 13:58:42,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-12-24 13:58:42,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,368 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,371 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,374 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 [2018-12-24 13:58:42,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:42,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. [2018-12-24 13:58:42,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2018-12-24 13:58:42,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,444 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,458 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:58:42,458 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 [2018-12-24 13:58:42,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:42,510 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. [2018-12-24 13:58:42,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2018-12-24 13:58:42,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,544 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,548 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:42,550 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:58:42,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 38 treesize of output 98 [2018-12-24 13:58:42,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:42,602 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. [2018-12-24 13:58:42,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:58:42,629 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:42,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:58:42,680 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:42,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:58:42,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2018-12-24 13:58:42,699 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:58:42,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-24 13:58:42,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-24 13:58:42,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2018-12-24 13:58:42,699 INFO L87 Difference]: Start difference. First operand 224 states and 1137 transitions. Second operand 11 states. [2018-12-24 13:58:44,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:58:44,899 INFO L93 Difference]: Finished difference Result 326 states and 1545 transitions. [2018-12-24 13:58:44,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:58:44,900 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2018-12-24 13:58:44,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:58:44,901 INFO L225 Difference]: With dead ends: 326 [2018-12-24 13:58:44,901 INFO L226 Difference]: Without dead ends: 316 [2018-12-24 13:58:44,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2018-12-24 13:58:44,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-12-24 13:58:46,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 197. [2018-12-24 13:58:46,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-24 13:58:46,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 997 transitions. [2018-12-24 13:58:46,114 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 997 transitions. Word has length 9 [2018-12-24 13:58:46,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:58:46,114 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 997 transitions. [2018-12-24 13:58:46,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-24 13:58:46,115 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 997 transitions. [2018-12-24 13:58:46,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-24 13:58:46,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:58:46,115 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:58:46,115 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:58:46,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:46,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1989953630, now seen corresponding path program 1 times [2018-12-24 13:58:46,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:58:46,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:46,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:46,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:46,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:58:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:46,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:58:46,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:46,240 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:58:46,240 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2018-12-24 13:58:46,240 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [30], [31] [2018-12-24 13:58:46,241 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:58:46,241 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:58:46,243 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:58:46,243 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. [2018-12-24 13:58:46,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:46,244 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:58:46,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:46,244 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 [2018-12-24 13:58:46,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:46,255 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:58:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:46,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:58:46,264 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 [2018-12-24 13:58:46,271 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 [2018-12-24 13:58:46,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:46,279 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 [2018-12-24 13:58:46,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:46,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:46,289 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 [2018-12-24 13:58:46,294 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:46,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:46,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:46,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, 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 [2018-12-24 13:58:46,302 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:46,321 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:46,333 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:46,343 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:46,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:46,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. [2018-12-24 13:58:46,369 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2018-12-24 13:58:46,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:46,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:46,399 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:46,400 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:46,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:46,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:46,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:46,404 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 [2018-12-24 13:58:46,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:46,431 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. [2018-12-24 13:58:46,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:58:46,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:46,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:46,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:46,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:46,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:46,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:46,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:46,454 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:58:46,454 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 [2018-12-24 13:58:46,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:46,485 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. [2018-12-24 13:58:46,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2018-12-24 13:58:46,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:46,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:46,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:46,526 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:46,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:46,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:46,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:46,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:46,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:46,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, 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 [2018-12-24 13:58:46,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:46,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. [2018-12-24 13:58:46,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2018-12-24 13:58:46,581 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:46,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:58:46,605 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:46,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:58:46,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-24 13:58:46,623 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:58:46,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:58:46,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:58:46,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:58:46,624 INFO L87 Difference]: Start difference. First operand 197 states and 997 transitions. Second operand 10 states. [2018-12-24 13:58:48,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:58:48,677 INFO L93 Difference]: Finished difference Result 288 states and 1415 transitions. [2018-12-24 13:58:48,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:58:48,677 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-12-24 13:58:48,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:58:48,679 INFO L225 Difference]: With dead ends: 288 [2018-12-24 13:58:48,679 INFO L226 Difference]: Without dead ends: 279 [2018-12-24 13:58:48,679 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 [2018-12-24 13:58:48,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-12-24 13:58:50,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 263. [2018-12-24 13:58:50,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-12-24 13:58:50,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 1349 transitions. [2018-12-24 13:58:50,361 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 1349 transitions. Word has length 9 [2018-12-24 13:58:50,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:58:50,361 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 1349 transitions. [2018-12-24 13:58:50,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:58:50,361 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 1349 transitions. [2018-12-24 13:58:50,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-24 13:58:50,362 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:58:50,362 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:58:50,362 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:58:50,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:50,363 INFO L82 PathProgramCache]: Analyzing trace with hash 958709548, now seen corresponding path program 1 times [2018-12-24 13:58:50,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:58:50,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:50,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:50,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:50,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:58:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:50,508 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-24 13:58:50,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:50,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:58:50,509 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2018-12-24 13:58:50,509 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [30], [31] [2018-12-24 13:58:50,510 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:58:50,510 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:58:50,512 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:58:50,512 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. [2018-12-24 13:58:50,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:50,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:58:50,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:50,512 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 [2018-12-24 13:58:50,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:50,521 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:58:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:50,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:58:50,530 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 [2018-12-24 13:58:50,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 [2018-12-24 13:58:50,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:50,546 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 [2018-12-24 13:58:50,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:50,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:50,556 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 [2018-12-24 13:58:50,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:50,566 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:50,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:50,568 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 [2018-12-24 13:58:50,568 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:50,588 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:50,599 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:50,609 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:50,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:50,635 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. [2018-12-24 13:58:50,635 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2018-12-24 13:58:50,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:50,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:50,672 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:50,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:50,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:50,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:50,677 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:50,677 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 [2018-12-24 13:58:50,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:50,703 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. [2018-12-24 13:58:50,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2018-12-24 13:58:50,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:50,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:50,730 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:50,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:50,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:50,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:50,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:50,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:50,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:50,746 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 [2018-12-24 13:58:50,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:50,787 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. [2018-12-24 13:58:50,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2018-12-24 13:58:50,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:50,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:50,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:50,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:50,824 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:50,826 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:50,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:50,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:50,831 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:58:50,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:50,834 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 [2018-12-24 13:58:50,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:50,880 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. [2018-12-24 13:58:50,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2018-12-24 13:58:50,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:50,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:58:50,992 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:51,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:58:51,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2018-12-24 13:58:51,012 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:58:51,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-24 13:58:51,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-24 13:58:51,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:58:51,013 INFO L87 Difference]: Start difference. First operand 263 states and 1349 transitions. Second operand 9 states. [2018-12-24 13:58:53,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:58:53,134 INFO L93 Difference]: Finished difference Result 277 states and 1384 transitions. [2018-12-24 13:58:53,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:58:53,134 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-24 13:58:53,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:58:53,136 INFO L225 Difference]: With dead ends: 277 [2018-12-24 13:58:53,136 INFO L226 Difference]: Without dead ends: 268 [2018-12-24 13:58:53,136 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 [2018-12-24 13:58:53,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-12-24 13:58:54,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2018-12-24 13:58:54,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-12-24 13:58:54,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 1361 transitions. [2018-12-24 13:58:54,857 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 1361 transitions. Word has length 9 [2018-12-24 13:58:54,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:58:54,857 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 1361 transitions. [2018-12-24 13:58:54,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-24 13:58:54,857 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 1361 transitions. [2018-12-24 13:58:54,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-24 13:58:54,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:58:54,858 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:58:54,858 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:58:54,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:54,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1855010516, now seen corresponding path program 1 times [2018-12-24 13:58:54,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:58:54,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:54,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:54,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:54,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:58:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:55,064 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 25 [2018-12-24 13:58:55,182 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:58:55,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:55,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:58:55,183 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2018-12-24 13:58:55,183 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [26], [27] [2018-12-24 13:58:55,183 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:58:55,183 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:58:55,185 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:58:55,185 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. [2018-12-24 13:58:55,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:55,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:58:55,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:55,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-24 13:58:55,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:55,195 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:58:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:55,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:58:55,203 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 [2018-12-24 13:58:55,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,206 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 [2018-12-24 13:58:55,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,211 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,212 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 [2018-12-24 13:58:55,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,218 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 [2018-12-24 13:58:55,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,225 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 [2018-12-24 13:58:55,226 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:55,254 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:55,270 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:55,282 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:55,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:55,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:55,311 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2018-12-24 13:58:55,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,344 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,345 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,347 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 [2018-12-24 13:58:55,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:55,390 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. [2018-12-24 13:58:55,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-12-24 13:58:55,418 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,431 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,432 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:58:55,433 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 [2018-12-24 13:58:55,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:55,480 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. [2018-12-24 13:58:55,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:58:55,510 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,512 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,525 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 [2018-12-24 13:58:55,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:55,573 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. [2018-12-24 13:58:55,573 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:58:55,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,616 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:58:55,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,618 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 [2018-12-24 13:58:55,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:55,666 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. [2018-12-24 13:58:55,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2018-12-24 13:58:55,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:58:55,709 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:58:55,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 40 treesize of output 96 [2018-12-24 13:58:55,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:55,758 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. [2018-12-24 13:58:55,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2018-12-24 13:58:55,782 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:55,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:58:55,875 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:55,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:58:55,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2018-12-24 13:58:55,894 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:58:55,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-24 13:58:55,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-24 13:58:55,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2018-12-24 13:58:55,895 INFO L87 Difference]: Start difference. First operand 266 states and 1361 transitions. Second operand 13 states. [2018-12-24 13:58:59,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:58:59,159 INFO L93 Difference]: Finished difference Result 361 states and 1740 transitions. [2018-12-24 13:58:59,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:58:59,159 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2018-12-24 13:58:59,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:58:59,161 INFO L225 Difference]: With dead ends: 361 [2018-12-24 13:58:59,161 INFO L226 Difference]: Without dead ends: 356 [2018-12-24 13:58:59,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2018-12-24 13:58:59,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-12-24 13:59:00,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 282. [2018-12-24 13:59:00,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-12-24 13:59:00,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 1454 transitions. [2018-12-24 13:59:00,978 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 1454 transitions. Word has length 9 [2018-12-24 13:59:00,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:59:00,978 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 1454 transitions. [2018-12-24 13:59:00,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-24 13:59:00,978 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 1454 transitions. [2018-12-24 13:59:00,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-24 13:59:00,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:59:00,979 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:59:00,979 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:59:00,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:59:00,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1858585436, now seen corresponding path program 2 times [2018-12-24 13:59:00,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:59:00,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:00,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:59:00,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:00,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:59:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:01,252 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-24 13:59:01,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:01,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:59:01,253 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:59:01,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:59:01,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:01,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 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 [2018-12-24 13:59:01,264 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:59:01,265 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:59:01,274 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-24 13:59:01,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:59:01,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:59:01,278 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 [2018-12-24 13:59:01,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:01,283 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 [2018-12-24 13:59:01,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:01,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:01,292 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 [2018-12-24 13:59:01,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:01,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:01,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:01,300 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 [2018-12-24 13:59:01,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:01,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:01,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:01,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:01,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 [2018-12-24 13:59:01,313 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:01,349 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:01,373 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:01,390 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:01,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:01,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:01,423 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2018-12-24 13:59:01,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:01,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:01,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:01,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:01,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:01,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:01,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:01,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:01,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:01,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:01,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:01,460 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 [2018-12-24 13:59:01,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:01,915 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. [2018-12-24 13:59:01,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-12-24 13:59:02,235 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-12-24 13:59:02,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:02,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:02,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:02,348 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:02,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:02,399 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:02,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:02,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:02,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:02,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:02,512 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:02,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:02,543 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:59:02,544 INFO L303 Elim1Store]: Index analysis took 306 ms [2018-12-24 13:59:02,544 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 [2018-12-24 13:59:02,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:03,054 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. [2018-12-24 13:59:03,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:59:03,270 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,271 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,284 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,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 36 treesize of output 78 [2018-12-24 13:59:03,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:03,330 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. [2018-12-24 13:59:03,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:59:03,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,368 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,371 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,376 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:59:03,376 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 [2018-12-24 13:59:03,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:03,428 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. [2018-12-24 13:59:03,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2018-12-24 13:59:03,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,465 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:59:03,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:03,467 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 [2018-12-24 13:59:03,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:03,517 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. [2018-12-24 13:59:03,517 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2018-12-24 13:59:03,543 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:03,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:59:03,621 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:03,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:59:03,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2018-12-24 13:59:03,641 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:59:03,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-24 13:59:03,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-24 13:59:03,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2018-12-24 13:59:03,642 INFO L87 Difference]: Start difference. First operand 282 states and 1454 transitions. Second operand 13 states. [2018-12-24 13:59:06,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:59:06,742 INFO L93 Difference]: Finished difference Result 357 states and 1714 transitions. [2018-12-24 13:59:06,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:59:06,743 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2018-12-24 13:59:06,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:59:06,744 INFO L225 Difference]: With dead ends: 357 [2018-12-24 13:59:06,744 INFO L226 Difference]: Without dead ends: 352 [2018-12-24 13:59:06,745 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 [2018-12-24 13:59:06,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-12-24 13:59:08,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 236. [2018-12-24 13:59:08,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-12-24 13:59:08,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 1192 transitions. [2018-12-24 13:59:08,341 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 1192 transitions. Word has length 9 [2018-12-24 13:59:08,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:59:08,341 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 1192 transitions. [2018-12-24 13:59:08,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-24 13:59:08,341 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 1192 transitions. [2018-12-24 13:59:08,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-24 13:59:08,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:59:08,342 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:59:08,342 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:59:08,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:59:08,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1629790556, now seen corresponding path program 3 times [2018-12-24 13:59:08,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:59:08,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:08,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:59:08,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:08,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:59:08,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:08,583 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:59:08,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:08,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:59:08,584 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:59:08,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:59:08,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:08,585 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 [2018-12-24 13:59:08,614 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:59:08,614 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:59:08,633 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:59:08,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:59:08,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:59:08,636 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 [2018-12-24 13:59:08,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,643 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 [2018-12-24 13:59:08,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,649 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 [2018-12-24 13:59:08,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,656 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 [2018-12-24 13:59:08,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,670 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 [2018-12-24 13:59:08,670 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:08,699 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:08,714 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:08,725 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:08,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:08,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:08,753 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2018-12-24 13:59:08,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,783 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,785 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,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, 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 [2018-12-24 13:59:08,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:08,833 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. [2018-12-24 13:59:08,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-12-24 13:59:08,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,860 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,863 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,871 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:59:08,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 80 [2018-12-24 13:59:08,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:08,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. [2018-12-24 13:59:08,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:59:08,943 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,945 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:08,958 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 [2018-12-24 13:59:08,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:09,006 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. [2018-12-24 13:59:09,006 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:59:09,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:09,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:09,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:09,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:09,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:09,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:09,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:09,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:09,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:09,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:09,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:09,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:09,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:09,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:09,050 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:59:09,051 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 [2018-12-24 13:59:09,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:09,099 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. [2018-12-24 13:59:09,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2018-12-24 13:59:09,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:09,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:09,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:09,131 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:09,132 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:09,133 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:09,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:09,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:09,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:09,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:09,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:09,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:09,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:09,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:09,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:09,145 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:59:09,146 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 [2018-12-24 13:59:09,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:09,195 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. [2018-12-24 13:59:09,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:59:09,221 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:09,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:59:09,325 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:09,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:59:09,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2018-12-24 13:59:09,344 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:59:09,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-24 13:59:09,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-24 13:59:09,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=210, Unknown=0, NotChecked=0, Total=342 [2018-12-24 13:59:09,345 INFO L87 Difference]: Start difference. First operand 236 states and 1192 transitions. Second operand 14 states. [2018-12-24 13:59:11,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:59:11,772 INFO L93 Difference]: Finished difference Result 260 states and 1232 transitions. [2018-12-24 13:59:11,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:59:11,773 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 9 [2018-12-24 13:59:11,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:59:11,773 INFO L225 Difference]: With dead ends: 260 [2018-12-24 13:59:11,773 INFO L226 Difference]: Without dead ends: 253 [2018-12-24 13:59:11,774 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 [2018-12-24 13:59:11,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-12-24 13:59:12,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 152. [2018-12-24 13:59:12,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-24 13:59:12,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 750 transitions. [2018-12-24 13:59:12,888 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 750 transitions. Word has length 9 [2018-12-24 13:59:12,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:59:12,888 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 750 transitions. [2018-12-24 13:59:12,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-24 13:59:12,888 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 750 transitions. [2018-12-24 13:59:12,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-24 13:59:12,888 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:59:12,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:59:12,889 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:59:12,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:59:12,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1114051924, now seen corresponding path program 1 times [2018-12-24 13:59:12,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:59:12,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:12,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:59:12,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:12,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:59:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:13,049 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:13,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:13,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:59:13,050 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2018-12-24 13:59:13,050 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [28], [29] [2018-12-24 13:59:13,051 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:59:13,051 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:59:13,052 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:59:13,052 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. [2018-12-24 13:59:13,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:59:13,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:59:13,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:13,053 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 [2018-12-24 13:59:13,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:59:13,064 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:59:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:13,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:59:13,072 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 [2018-12-24 13:59:13,078 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 [2018-12-24 13:59:13,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,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, 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 [2018-12-24 13:59:13,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,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, 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 [2018-12-24 13:59:13,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,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, 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 [2018-12-24 13:59:13,115 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:13,135 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:13,147 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:13,157 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:13,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:13,183 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. [2018-12-24 13:59:13,183 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2018-12-24 13:59:13,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,225 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 [2018-12-24 13:59:13,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:13,254 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. [2018-12-24 13:59:13,254 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2018-12-24 13:59:13,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,287 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,294 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,296 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 [2018-12-24 13:59:13,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:13,329 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. [2018-12-24 13:59:13,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:59:13,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,366 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:59:13,367 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 [2018-12-24 13:59:13,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:13,402 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. [2018-12-24 13:59:13,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2018-12-24 13:59:13,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,431 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:13,435 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:59:13,436 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 [2018-12-24 13:59:13,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:13,469 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. [2018-12-24 13:59:13,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2018-12-24 13:59:13,492 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:13,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:59:13,547 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:13,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:59:13,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2018-12-24 13:59:13,566 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:59:13,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:59:13,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:59:13,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:59:13,567 INFO L87 Difference]: Start difference. First operand 152 states and 750 transitions. Second operand 12 states. [2018-12-24 13:59:15,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:59:15,561 INFO L93 Difference]: Finished difference Result 202 states and 935 transitions. [2018-12-24 13:59:15,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:59:15,562 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2018-12-24 13:59:15,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:59:15,563 INFO L225 Difference]: With dead ends: 202 [2018-12-24 13:59:15,563 INFO L226 Difference]: Without dead ends: 195 [2018-12-24 13:59:15,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2018-12-24 13:59:15,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-24 13:59:16,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 173. [2018-12-24 13:59:16,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-12-24 13:59:16,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 861 transitions. [2018-12-24 13:59:16,870 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 861 transitions. Word has length 9 [2018-12-24 13:59:16,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:59:16,870 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 861 transitions. [2018-12-24 13:59:16,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:59:16,870 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 861 transitions. [2018-12-24 13:59:16,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-24 13:59:16,870 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:59:16,870 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:59:16,871 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:59:16,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:59:16,871 INFO L82 PathProgramCache]: Analyzing trace with hash 770502112, now seen corresponding path program 1 times [2018-12-24 13:59:16,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:59:16,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:16,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:59:16,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:16,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:59:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:17,054 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-24 13:59:17,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:17,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:59:17,054 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2018-12-24 13:59:17,055 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [26], [28], [29] [2018-12-24 13:59:17,055 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:59:17,055 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:59:17,057 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:59:17,057 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. [2018-12-24 13:59:17,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:59:17,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:59:17,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:17,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 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 [2018-12-24 13:59:17,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:59:17,069 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:59:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:17,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:59:17,106 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 [2018-12-24 13:59:17,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,143 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 [2018-12-24 13:59:17,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,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 [2018-12-24 13:59:17,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,265 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 [2018-12-24 13:59:17,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,322 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,348 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,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 [2018-12-24 13:59:17,349 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:17,378 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:17,392 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:17,404 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:17,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:17,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:17,432 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2018-12-24 13:59:17,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,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, 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 [2018-12-24 13:59:17,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:17,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. [2018-12-24 13:59:17,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-12-24 13:59:17,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,551 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,552 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,553 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 [2018-12-24 13:59:17,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:17,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. [2018-12-24 13:59:17,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:59:17,637 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,652 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:59:17,652 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 [2018-12-24 13:59:17,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:17,699 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. [2018-12-24 13:59:17,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2018-12-24 13:59:17,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,730 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:17,742 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:59:17,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 38 treesize of output 98 [2018-12-24 13:59:17,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:17,790 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. [2018-12-24 13:59:17,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:59:17,818 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:17,818 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:59:17,872 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:17,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:59:17,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2018-12-24 13:59:17,898 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:59:17,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-24 13:59:17,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-24 13:59:17,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:59:17,898 INFO L87 Difference]: Start difference. First operand 173 states and 861 transitions. Second operand 11 states. [2018-12-24 13:59:19,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:59:19,967 INFO L93 Difference]: Finished difference Result 199 states and 939 transitions. [2018-12-24 13:59:19,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:59:19,967 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2018-12-24 13:59:19,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:59:19,968 INFO L225 Difference]: With dead ends: 199 [2018-12-24 13:59:19,968 INFO L226 Difference]: Without dead ends: 192 [2018-12-24 13:59:19,969 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 [2018-12-24 13:59:19,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-12-24 13:59:21,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 162. [2018-12-24 13:59:21,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-12-24 13:59:21,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 801 transitions. [2018-12-24 13:59:21,255 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 801 transitions. Word has length 9 [2018-12-24 13:59:21,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:59:21,255 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 801 transitions. [2018-12-24 13:59:21,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-24 13:59:21,255 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 801 transitions. [2018-12-24 13:59:21,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-24 13:59:21,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:59:21,256 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:59:21,256 INFO L423 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:59:21,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:59:21,256 INFO L82 PathProgramCache]: Analyzing trace with hash 894315494, now seen corresponding path program 1 times [2018-12-24 13:59:21,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:59:21,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:21,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:59:21,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:21,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:59:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:21,410 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2018-12-24 13:59:21,436 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:59:21,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:21,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:59:21,437 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2018-12-24 13:59:21,437 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [30], [31] [2018-12-24 13:59:21,438 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:59:21,438 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:59:21,440 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:59:21,440 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. [2018-12-24 13:59:21,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:59:21,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:59:21,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:21,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 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 [2018-12-24 13:59:21,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:59:21,451 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:59:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:21,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:59:21,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 [2018-12-24 13:59:21,464 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 [2018-12-24 13:59:21,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,474 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 [2018-12-24 13:59:21,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,489 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 [2018-12-24 13:59:21,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,507 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 [2018-12-24 13:59:21,508 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:21,533 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:21,553 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:21,566 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:21,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:21,602 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. [2018-12-24 13:59:21,603 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2018-12-24 13:59:21,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,657 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 [2018-12-24 13:59:21,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:21,695 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. [2018-12-24 13:59:21,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:59:21,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,726 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,730 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,741 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 [2018-12-24 13:59:21,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:21,783 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. [2018-12-24 13:59:21,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 13:59:21,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,806 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,816 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:21,818 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 [2018-12-24 13:59:21,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:21,853 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. [2018-12-24 13:59:21,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2018-12-24 13:59:21,874 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:21,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:59:21,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:21,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:59:21,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2018-12-24 13:59:21,921 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:59:21,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-24 13:59:21,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-24 13:59:21,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:59:21,922 INFO L87 Difference]: Start difference. First operand 162 states and 801 transitions. Second operand 9 states. [2018-12-24 13:59:23,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:59:23,683 INFO L93 Difference]: Finished difference Result 196 states and 942 transitions. [2018-12-24 13:59:23,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:59:23,683 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-24 13:59:23,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:59:23,684 INFO L225 Difference]: With dead ends: 196 [2018-12-24 13:59:23,684 INFO L226 Difference]: Without dead ends: 187 [2018-12-24 13:59:23,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:59:23,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-24 13:59:25,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2018-12-24 13:59:25,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-12-24 13:59:25,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 917 transitions. [2018-12-24 13:59:25,234 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 917 transitions. Word has length 9 [2018-12-24 13:59:25,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:59:25,234 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 917 transitions. [2018-12-24 13:59:25,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-24 13:59:25,234 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 917 transitions. [2018-12-24 13:59:25,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-24 13:59:25,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:59:25,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:59:25,235 INFO L423 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:59:25,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:59:25,235 INFO L82 PathProgramCache]: Analyzing trace with hash 774869436, now seen corresponding path program 1 times [2018-12-24 13:59:25,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:59:25,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:25,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:59:25,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:25,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:59:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:25,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-24 13:59:25,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:25,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:59:25,341 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2018-12-24 13:59:25,341 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [30], [31] [2018-12-24 13:59:25,341 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:59:25,341 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:59:25,342 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:59:25,343 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. [2018-12-24 13:59:25,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:59:25,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:59:25,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:25,343 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 [2018-12-24 13:59:25,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:59:25,353 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:59:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:25,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:59:25,361 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 [2018-12-24 13:59:25,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,370 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 [2018-12-24 13:59:25,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,376 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 [2018-12-24 13:59:25,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,386 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 [2018-12-24 13:59:25,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,391 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,396 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 [2018-12-24 13:59:25,396 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:25,427 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:25,442 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:25,454 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:25,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:25,483 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. [2018-12-24 13:59:25,483 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:59:25,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,510 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,512 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,518 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 [2018-12-24 13:59:25,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:25,562 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. [2018-12-24 13:59:25,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:59:25,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,599 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 [2018-12-24 13:59:25,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:25,645 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. [2018-12-24 13:59:25,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:59:25,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,672 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,674 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,677 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,681 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:59:25,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:25,683 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 [2018-12-24 13:59:25,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:25,734 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. [2018-12-24 13:59:25,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2018-12-24 13:59:25,772 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:25,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:59:25,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:25,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:59:25,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2018-12-24 13:59:25,825 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:59:25,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:59:25,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:59:25,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:59:25,826 INFO L87 Difference]: Start difference. First operand 186 states and 917 transitions. Second operand 8 states. [2018-12-24 13:59:26,409 WARN L181 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2018-12-24 13:59:28,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:59:28,349 INFO L93 Difference]: Finished difference Result 203 states and 968 transitions. [2018-12-24 13:59:28,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:59:28,349 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-24 13:59:28,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:59:28,350 INFO L225 Difference]: With dead ends: 203 [2018-12-24 13:59:28,351 INFO L226 Difference]: Without dead ends: 194 [2018-12-24 13:59:28,351 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 [2018-12-24 13:59:28,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-24 13:59:29,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 189. [2018-12-24 13:59:29,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-24 13:59:29,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 932 transitions. [2018-12-24 13:59:29,942 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 932 transitions. Word has length 9 [2018-12-24 13:59:29,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:59:29,942 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 932 transitions. [2018-12-24 13:59:29,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:59:29,942 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 932 transitions. [2018-12-24 13:59:29,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-24 13:59:29,943 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:59:29,943 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:59:29,943 INFO L423 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:59:29,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:59:29,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1804915160, now seen corresponding path program 1 times [2018-12-24 13:59:29,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:59:29,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:29,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:59:29,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:29,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:59:29,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:30,077 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:59:30,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:30,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:59:30,078 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2018-12-24 13:59:30,078 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [29] [2018-12-24 13:59:30,078 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:59:30,078 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:59:30,080 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:59:30,080 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. [2018-12-24 13:59:30,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:59:30,080 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:59:30,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:30,080 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 [2018-12-24 13:59:30,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:59:30,095 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:59:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:30,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:59:30,105 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 [2018-12-24 13:59:30,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,107 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 [2018-12-24 13:59:30,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,113 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,113 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 [2018-12-24 13:59:30,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,122 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 [2018-12-24 13:59:30,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,131 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,133 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,133 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 [2018-12-24 13:59:30,133 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:30,166 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:30,180 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:30,191 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:30,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:30,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. [2018-12-24 13:59:30,220 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:59:30,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,256 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 [2018-12-24 13:59:30,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:30,298 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. [2018-12-24 13:59:30,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:59:30,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,325 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,329 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,330 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,331 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,332 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,339 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 [2018-12-24 13:59:30,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:30,384 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. [2018-12-24 13:59:30,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:59:30,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,417 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,425 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,430 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:59:30,431 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 [2018-12-24 13:59:30,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:30,480 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. [2018-12-24 13:59:30,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2018-12-24 13:59:30,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,512 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:30,519 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:59: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, 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 [2018-12-24 13:59:30,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:30,571 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. [2018-12-24 13:59:30,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2018-12-24 13:59:30,593 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:30,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:59:30,639 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:30,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:59:30,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2018-12-24 13:59:30,659 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:59:30,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-24 13:59:30,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-24 13:59:30,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:59:30,660 INFO L87 Difference]: Start difference. First operand 189 states and 932 transitions. Second operand 11 states. [2018-12-24 13:59:33,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:59:33,407 INFO L93 Difference]: Finished difference Result 269 states and 1267 transitions. [2018-12-24 13:59:33,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:59:33,408 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2018-12-24 13:59:33,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:59:33,409 INFO L225 Difference]: With dead ends: 269 [2018-12-24 13:59:33,409 INFO L226 Difference]: Without dead ends: 265 [2018-12-24 13:59:33,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2018-12-24 13:59:33,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-12-24 13:59:35,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 212. [2018-12-24 13:59:35,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-12-24 13:59:35,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 1052 transitions. [2018-12-24 13:59:35,331 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 1052 transitions. Word has length 9 [2018-12-24 13:59:35,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:59:35,331 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 1052 transitions. [2018-12-24 13:59:35,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-24 13:59:35,331 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 1052 transitions. [2018-12-24 13:59:35,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-24 13:59:35,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:59:35,331 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:59:35,332 INFO L423 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:59:35,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:59:35,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1810456286, now seen corresponding path program 1 times [2018-12-24 13:59:35,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:59:35,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:35,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:59:35,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:35,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:59:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:35,470 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:59:35,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:35,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:59:35,470 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2018-12-24 13:59:35,470 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [28], [29] [2018-12-24 13:59:35,471 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:59:35,471 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:59:35,473 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:59:35,473 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. [2018-12-24 13:59:35,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:59:35,473 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:59:35,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:35,474 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 [2018-12-24 13:59:35,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:59:35,486 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:59:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:35,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:59:35,494 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 [2018-12-24 13:59:35,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,498 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 [2018-12-24 13:59:35,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,506 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 [2018-12-24 13:59:35,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2018-12-24 13:59:35,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,531 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,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 [2018-12-24 13:59:35,532 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:35,562 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:35,577 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:35,589 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:35,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:35,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. [2018-12-24 13:59:35,617 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:59:35,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,654 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 [2018-12-24 13:59:35,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:35,695 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. [2018-12-24 13:59:35,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:59:35,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,726 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,730 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,737 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 [2018-12-24 13:59:35,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:35,785 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. [2018-12-24 13:59:35,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:59:35,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,816 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,822 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,823 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,824 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,825 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,826 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,828 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:59:35,828 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 [2018-12-24 13:59:35,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:35,880 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. [2018-12-24 13:59:35,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2018-12-24 13:59:35,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:35,922 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:59:35,923 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 [2018-12-24 13:59:35,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:35,975 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. [2018-12-24 13:59:35,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2018-12-24 13:59:35,997 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:35,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:59:36,043 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:36,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:59:36,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2018-12-24 13:59:36,062 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:59:36,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-24 13:59:36,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-24 13:59:36,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:59:36,063 INFO L87 Difference]: Start difference. First operand 212 states and 1052 transitions. Second operand 11 states. [2018-12-24 13:59:38,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:59:38,826 INFO L93 Difference]: Finished difference Result 253 states and 1178 transitions. [2018-12-24 13:59:38,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:59:38,827 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2018-12-24 13:59:38,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:59:38,828 INFO L225 Difference]: With dead ends: 253 [2018-12-24 13:59:38,828 INFO L226 Difference]: Without dead ends: 249 [2018-12-24 13:59:38,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2018-12-24 13:59:38,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-12-24 13:59:40,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 214. [2018-12-24 13:59:40,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-12-24 13:59:40,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 1063 transitions. [2018-12-24 13:59:40,786 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 1063 transitions. Word has length 9 [2018-12-24 13:59:40,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:59:40,786 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 1063 transitions. [2018-12-24 13:59:40,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-24 13:59:40,786 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 1063 transitions. [2018-12-24 13:59:40,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-24 13:59:40,786 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:59:40,786 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:59:40,786 INFO L423 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:59:40,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:59:40,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1915676112, now seen corresponding path program 1 times [2018-12-24 13:59:40,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:59:40,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:40,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:59:40,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:40,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:59:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:40,880 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-24 13:59:40,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:40,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:59:40,881 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2018-12-24 13:59:40,881 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [30], [31] [2018-12-24 13:59:40,882 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:59:40,882 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:59:40,884 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:59:40,884 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. [2018-12-24 13:59:40,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:59:40,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:59:40,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:40,885 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 [2018-12-24 13:59:40,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:59:40,902 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:59:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:40,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:59:40,911 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 [2018-12-24 13:59:40,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:40,917 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 [2018-12-24 13:59:40,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:40,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:40,923 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 [2018-12-24 13:59:40,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:40,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:40,931 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:40,931 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 [2018-12-24 13:59:40,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:40,936 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:40,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:40,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:40,938 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 [2018-12-24 13:59:40,939 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:40,967 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:40,982 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:40,993 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:41,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:41,020 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. [2018-12-24 13:59:41,020 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:59:41,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,053 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 [2018-12-24 13:59:41,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:41,094 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. [2018-12-24 13:59:41,095 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:59:41,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,122 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,131 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 [2018-12-24 13:59:41,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:41,177 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. [2018-12-24 13:59:41,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 13:59:41,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,201 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,211 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:41,213 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:59:41,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 98 [2018-12-24 13:59:41,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:41,261 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. [2018-12-24 13:59:41,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2018-12-24 13:59:41,300 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:41,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:59:41,332 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:41,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:59:41,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2018-12-24 13:59:41,351 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:59:41,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:59:41,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:59:41,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:59:41,351 INFO L87 Difference]: Start difference. First operand 214 states and 1063 transitions. Second operand 8 states. [2018-12-24 13:59:43,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:59:43,704 INFO L93 Difference]: Finished difference Result 226 states and 1087 transitions. [2018-12-24 13:59:43,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:59:43,705 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-24 13:59:43,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:59:43,706 INFO L225 Difference]: With dead ends: 226 [2018-12-24 13:59:43,706 INFO L226 Difference]: Without dead ends: 217 [2018-12-24 13:59:43,706 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 [2018-12-24 13:59:43,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-12-24 13:59:45,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 214. [2018-12-24 13:59:45,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-12-24 13:59:45,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 1059 transitions. [2018-12-24 13:59:45,635 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 1059 transitions. Word has length 9 [2018-12-24 13:59:45,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:59:45,635 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 1059 transitions. [2018-12-24 13:59:45,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:59:45,635 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 1059 transitions. [2018-12-24 13:59:45,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-24 13:59:45,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:59:45,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:59:45,636 INFO L423 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:59:45,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:59:45,636 INFO L82 PathProgramCache]: Analyzing trace with hash -574217252, now seen corresponding path program 2 times [2018-12-24 13:59:45,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:59:45,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:45,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:59:45,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:45,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:59:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:45,819 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-24 13:59:45,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:45,819 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:59:45,819 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:59:45,819 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:59:45,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:45,819 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 [2018-12-24 13:59:45,827 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:59:45,827 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:59:45,834 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:59:45,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:59:45,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:59:45,837 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 [2018-12-24 13:59:45,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:45,844 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 [2018-12-24 13:59:45,847 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:45,849 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:45,850 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 [2018-12-24 13:59:45,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:45,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:45,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:45,858 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 [2018-12-24 13:59:45,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:45,863 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:45,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:45,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:45,868 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 [2018-12-24 13:59:45,868 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:45,896 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:45,911 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:45,923 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:45,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:45,950 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. [2018-12-24 13:59:45,951 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:59:45,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:45,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:45,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:45,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:45,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:45,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:45,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:45,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:45,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:45,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:45,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:45,987 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 [2018-12-24 13:59:45,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:46,027 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. [2018-12-24 13:59:46,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:59:46,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,058 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,062 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,065 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:59:46,066 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 [2018-12-24 13:59:46,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:46,108 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. [2018-12-24 13:59:46,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2018-12-24 13:59:46,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,149 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 [2018-12-24 13:59:46,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:46,195 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. [2018-12-24 13:59:46,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2018-12-24 13:59:46,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,230 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,232 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,236 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:46,236 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:59:46,237 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 [2018-12-24 13:59:46,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:46,284 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. [2018-12-24 13:59:46,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2018-12-24 13:59:46,313 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:46,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:59:46,379 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:46,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:59:46,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2018-12-24 13:59:46,399 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:59:46,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:59:46,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:59:46,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:59:46,399 INFO L87 Difference]: Start difference. First operand 214 states and 1059 transitions. Second operand 12 states. [2018-12-24 13:59:49,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:59:49,237 INFO L93 Difference]: Finished difference Result 258 states and 1213 transitions. [2018-12-24 13:59:49,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:59:49,237 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2018-12-24 13:59:49,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:59:49,239 INFO L225 Difference]: With dead ends: 258 [2018-12-24 13:59:49,239 INFO L226 Difference]: Without dead ends: 251 [2018-12-24 13:59:49,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2018-12-24 13:59:49,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-12-24 13:59:51,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 210. [2018-12-24 13:59:51,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-12-24 13:59:51,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 1036 transitions. [2018-12-24 13:59:51,164 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 1036 transitions. Word has length 9 [2018-12-24 13:59:51,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:59:51,164 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 1036 transitions. [2018-12-24 13:59:51,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:59:51,164 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 1036 transitions. [2018-12-24 13:59:51,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-24 13:59:51,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:59:51,165 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:59:51,165 INFO L423 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:59:51,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:59:51,165 INFO L82 PathProgramCache]: Analyzing trace with hash -566829084, now seen corresponding path program 2 times [2018-12-24 13:59:51,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:59:51,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:51,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:59:51,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:51,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:59:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:51,355 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:51,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:51,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:59:51,355 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:59:51,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:59:51,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:51,356 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 [2018-12-24 13:59:51,363 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:59:51,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:59:51,370 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:59:51,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:59:51,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:59:51,372 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 [2018-12-24 13:59:51,375 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 [2018-12-24 13:59:51,380 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,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, 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 [2018-12-24 13:59:51,387 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,389 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 [2018-12-24 13:59:51,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,399 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,400 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 [2018-12-24 13:59:51,400 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:51,419 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:51,430 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:51,439 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:51,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:51,465 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. [2018-12-24 13:59:51,466 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2018-12-24 13:59:51,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,508 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 [2018-12-24 13:59:51,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:51,535 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. [2018-12-24 13:59:51,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2018-12-24 13:59:51,558 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,560 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,561 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,562 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,563 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,565 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,566 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,567 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:59:51,568 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 [2018-12-24 13:59:51,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:51,598 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. [2018-12-24 13:59:51,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2018-12-24 13:59:51,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,634 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 [2018-12-24 13:59:51,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:51,664 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. [2018-12-24 13:59:51,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2018-12-24 13:59:51,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,693 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:51,696 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:59:51,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, 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 [2018-12-24 13:59:51,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:51,727 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. [2018-12-24 13:59:51,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2018-12-24 13:59:51,750 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:51,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:59:51,808 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:51,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:59:51,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2018-12-24 13:59:51,828 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:59:51,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:59:51,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:59:51,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:59:51,829 INFO L87 Difference]: Start difference. First operand 210 states and 1036 transitions. Second operand 12 states. [2018-12-24 13:59:54,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:59:54,885 INFO L93 Difference]: Finished difference Result 279 states and 1323 transitions. [2018-12-24 13:59:54,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:59:54,885 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2018-12-24 13:59:54,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:59:54,886 INFO L225 Difference]: With dead ends: 279 [2018-12-24 13:59:54,886 INFO L226 Difference]: Without dead ends: 272 [2018-12-24 13:59:54,887 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 [2018-12-24 13:59:54,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-12-24 13:59:57,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 229. [2018-12-24 13:59:57,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-12-24 13:59:57,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 1136 transitions. [2018-12-24 13:59:57,049 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 1136 transitions. Word has length 9 [2018-12-24 13:59:57,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:59:57,049 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 1136 transitions. [2018-12-24 13:59:57,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:59:57,049 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 1136 transitions. [2018-12-24 13:59:57,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-24 13:59:57,050 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:59:57,050 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 13:59:57,050 INFO L423 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:59:57,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:59:57,050 INFO L82 PathProgramCache]: Analyzing trace with hash -967637198, now seen corresponding path program 2 times [2018-12-24 13:59:57,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:59:57,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:57,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:59:57,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:57,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:59:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:57,277 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:59:57,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:57,278 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:59:57,278 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:59:57,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:59:57,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:57,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 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 [2018-12-24 13:59:57,288 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:59:57,288 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:59:57,295 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:59:57,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:59:57,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:59:57,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 [2018-12-24 13:59:57,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,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 [2018-12-24 13:59:57,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,308 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 [2018-12-24 13:59:57,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,316 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 [2018-12-24 13:59:57,323 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,328 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,330 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,330 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 [2018-12-24 13:59:57,331 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:57,366 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:57,389 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:57,406 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:57,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:59:57,443 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. [2018-12-24 13:59:57,443 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2018-12-24 13:59:57,478 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,486 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,488 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,500 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 [2018-12-24 13:59:57,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:57,546 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. [2018-12-24 13:59:57,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 13:59:57,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,612 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:59:57,612 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 [2018-12-24 13:59:57,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:57,666 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. [2018-12-24 13:59:57,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2018-12-24 13:59:57,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,722 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 [2018-12-24 13:59:57,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:57,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. [2018-12-24 13:59:57,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2018-12-24 13:59:57,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,799 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,806 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:59:57,811 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:59:57,812 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 [2018-12-24 13:59:57,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:59:57,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. [2018-12-24 13:59:57,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2018-12-24 13:59:57,890 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:57,890 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:59:57,953 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:57,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:59:57,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2018-12-24 13:59:57,973 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:59:57,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:59:57,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:59:57,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:59:57,974 INFO L87 Difference]: Start difference. First operand 229 states and 1136 transitions. Second operand 12 states. [2018-12-24 14:00:00,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:00:00,964 INFO L93 Difference]: Finished difference Result 256 states and 1217 transitions. [2018-12-24 14:00:00,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 14:00:00,964 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2018-12-24 14:00:00,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:00:00,966 INFO L225 Difference]: With dead ends: 256 [2018-12-24 14:00:00,966 INFO L226 Difference]: Without dead ends: 249 [2018-12-24 14:00:00,966 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 [2018-12-24 14:00:00,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-12-24 14:00:03,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 227. [2018-12-24 14:00:03,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-12-24 14:00:03,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 1126 transitions. [2018-12-24 14:00:03,124 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 1126 transitions. Word has length 9 [2018-12-24 14:00:03,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:00:03,125 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 1126 transitions. [2018-12-24 14:00:03,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 14:00:03,125 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 1126 transitions. [2018-12-24 14:00:03,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-24 14:00:03,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:00:03,126 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 14:00:03,126 INFO L423 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:00:03,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:00:03,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1119435674, now seen corresponding path program 2 times [2018-12-24 14:00:03,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:00:03,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:00:03,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:00:03,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:00:03,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:00:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:00:03,247 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-24 14:00:03,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:00:03,248 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:00:03,248 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:00:03,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:00:03,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:00:03,248 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 [2018-12-24 14:00:03,256 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:00:03,257 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:00:03,263 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 14:00:03,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:00:03,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:00:03,267 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 [2018-12-24 14:00:03,270 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 [2018-12-24 14:00:03,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,278 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 [2018-12-24 14:00:03,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,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, 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 [2018-12-24 14:00:03,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,310 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 [2018-12-24 14:00:03,310 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 14:00:03,329 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:00:03,341 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:00:03,351 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:00:03,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:00:03,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. [2018-12-24 14:00:03,377 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2018-12-24 14:00:03,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,417 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,418 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,420 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 [2018-12-24 14:00:03,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:00:03,447 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. [2018-12-24 14:00:03,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2018-12-24 14:00:03,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,471 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 [2018-12-24 14:00:03,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:00:03,498 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. [2018-12-24 14:00:03,498 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2018-12-24 14:00:03,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,526 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,526 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:00:03,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,528 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 [2018-12-24 14:00:03,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:00:03,563 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. [2018-12-24 14:00:03,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2018-12-24 14:00:03,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:03,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, 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 [2018-12-24 14:00:03,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:00:03,634 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. [2018-12-24 14:00:03,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:32 [2018-12-24 14:00:03,657 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:00:03,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:00:03,703 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:00:03,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:00:03,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2018-12-24 14:00:03,723 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:00:03,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-24 14:00:03,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-24 14:00:03,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2018-12-24 14:00:03,724 INFO L87 Difference]: Start difference. First operand 227 states and 1126 transitions. Second operand 11 states. [2018-12-24 14:00:06,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:00:06,387 INFO L93 Difference]: Finished difference Result 234 states and 1146 transitions. [2018-12-24 14:00:06,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 14:00:06,388 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-12-24 14:00:06,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:00:06,389 INFO L225 Difference]: With dead ends: 234 [2018-12-24 14:00:06,389 INFO L226 Difference]: Without dead ends: 207 [2018-12-24 14:00:06,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-12-24 14:00:06,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-12-24 14:00:06,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 51. [2018-12-24 14:00:06,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-24 14:00:06,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 224 transitions. [2018-12-24 14:00:06,909 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 224 transitions. Word has length 10 [2018-12-24 14:00:06,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:00:06,909 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 224 transitions. [2018-12-24 14:00:06,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-24 14:00:06,909 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 224 transitions. [2018-12-24 14:00:06,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-24 14:00:06,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:00:06,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 14:00:06,910 INFO L423 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:00:06,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:00:06,910 INFO L82 PathProgramCache]: Analyzing trace with hash -905277736, now seen corresponding path program 1 times [2018-12-24 14:00:06,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:00:06,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:00:06,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:00:06,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:00:06,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:00:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:00:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:00:07,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:00:07,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:00:07,153 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2018-12-24 14:00:07,153 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [26], [28], [29] [2018-12-24 14:00:07,154 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 14:00:07,154 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:00:07,155 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 14:00:07,155 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. [2018-12-24 14:00:07,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:00:07,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 14:00:07,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:00:07,156 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 [2018-12-24 14:00:07,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:00:07,166 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:00:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:00:07,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:00:07,175 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 [2018-12-24 14:00:07,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,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 [2018-12-24 14:00:07,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,189 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 [2018-12-24 14:00:07,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,202 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 [2018-12-24 14:00:07,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,211 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,211 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 [2018-12-24 14:00:07,212 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 14:00:07,238 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:00:07,254 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:00:07,266 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:00:07,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:00:07,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:00:07,294 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2018-12-24 14:00:07,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,331 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,332 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,341 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 [2018-12-24 14:00:07,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:00:07,386 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. [2018-12-24 14:00:07,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-12-24 14:00:07,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,417 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,418 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,425 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,429 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:00:07,429 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 [2018-12-24 14:00:07,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:00:07,473 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. [2018-12-24 14:00:07,473 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 14:00:07,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,512 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,519 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 [2018-12-24 14:00:07,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:00:07,584 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. [2018-12-24 14:00:07,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-12-24 14:00:07,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,637 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,654 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:00:07,654 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 [2018-12-24 14:00:07,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:00:07,726 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. [2018-12-24 14:00:07,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2018-12-24 14:00:07,767 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,771 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,773 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:07,800 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:00:07,800 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 [2018-12-24 14:00:07,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:00:07,861 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. [2018-12-24 14:00:07,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2018-12-24 14:00:07,902 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:00:07,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:00:08,018 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:00:08,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:00:08,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2018-12-24 14:00:08,037 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:00:08,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-24 14:00:08,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-24 14:00:08,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2018-12-24 14:00:08,038 INFO L87 Difference]: Start difference. First operand 51 states and 224 transitions. Second operand 14 states. [2018-12-24 14:00:09,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:00:09,498 INFO L93 Difference]: Finished difference Result 76 states and 322 transitions. [2018-12-24 14:00:09,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 14:00:09,498 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-12-24 14:00:09,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:00:09,499 INFO L225 Difference]: With dead ends: 76 [2018-12-24 14:00:09,499 INFO L226 Difference]: Without dead ends: 69 [2018-12-24 14:00:09,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2018-12-24 14:00:09,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-24 14:00:10,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2018-12-24 14:00:10,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-24 14:00:10,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 239 transitions. [2018-12-24 14:00:10,085 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 239 transitions. Word has length 10 [2018-12-24 14:00:10,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:00:10,085 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 239 transitions. [2018-12-24 14:00:10,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-24 14:00:10,085 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 239 transitions. [2018-12-24 14:00:10,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-24 14:00:10,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:00:10,085 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 14:00:10,085 INFO L423 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:00:10,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:00:10,086 INFO L82 PathProgramCache]: Analyzing trace with hash -62458648, now seen corresponding path program 2 times [2018-12-24 14:00:10,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:00:10,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:00:10,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:00:10,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:00:10,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:00:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:00:10,314 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 24 [2018-12-24 14:00:10,454 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:00:10,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:00:10,454 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:00:10,455 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:00:10,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:00:10,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:00:10,455 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 [2018-12-24 14:00:10,462 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:00:10,463 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:00:10,470 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-24 14:00:10,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:00:10,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:00:10,473 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 [2018-12-24 14:00:10,476 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,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 [2018-12-24 14:00:10,479 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,480 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 [2018-12-24 14:00:10,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,485 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,485 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,486 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 [2018-12-24 14:00:10,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,494 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 [2018-12-24 14:00:10,494 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 14:00:10,522 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:00:10,537 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:00:10,549 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:00:10,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:00:10,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:00:10,579 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2018-12-24 14:00:10,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,616 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 [2018-12-24 14:00:10,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:00:10,660 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. [2018-12-24 14:00:10,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-12-24 14:00:10,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,693 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,703 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 [2018-12-24 14:00:10,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:00:10,751 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. [2018-12-24 14:00:10,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 14:00:10,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,783 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,785 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,793 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:00:10,793 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 [2018-12-24 14:00:10,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:00:10,842 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. [2018-12-24 14:00:10,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2018-12-24 14:00:10,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,875 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,883 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:00:10,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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 [2018-12-24 14:00:10,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:00:10,932 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. [2018-12-24 14:00:10,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2018-12-24 14:00:10,962 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,964 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,973 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:10,977 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:00:10,978 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 [2018-12-24 14:00:10,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:00:11,026 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. [2018-12-24 14:00:11,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2018-12-24 14:00:11,062 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:00:11,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:00:11,139 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:00:11,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:00:11,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2018-12-24 14:00:11,158 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:00:11,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-24 14:00:11,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-24 14:00:11,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2018-12-24 14:00:11,159 INFO L87 Difference]: Start difference. First operand 54 states and 239 transitions. Second operand 13 states. [2018-12-24 14:00:12,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:00:12,540 INFO L93 Difference]: Finished difference Result 75 states and 318 transitions. [2018-12-24 14:00:12,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 14:00:12,540 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2018-12-24 14:00:12,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:00:12,541 INFO L225 Difference]: With dead ends: 75 [2018-12-24 14:00:12,541 INFO L226 Difference]: Without dead ends: 68 [2018-12-24 14:00:12,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2018-12-24 14:00:12,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-24 14:00:13,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2018-12-24 14:00:13,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-24 14:00:13,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 206 transitions. [2018-12-24 14:00:13,076 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 206 transitions. Word has length 10 [2018-12-24 14:00:13,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:00:13,076 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 206 transitions. [2018-12-24 14:00:13,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-24 14:00:13,076 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 206 transitions. [2018-12-24 14:00:13,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-24 14:00:13,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:00:13,076 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 14:00:13,076 INFO L423 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:00:13,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:00:13,077 INFO L82 PathProgramCache]: Analyzing trace with hash -127091828, now seen corresponding path program 3 times [2018-12-24 14:00:13,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:00:13,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:00:13,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:00:13,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:00:13,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:00:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:00:13,343 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:00:13,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:00:13,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:00:13,344 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:00:13,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:00:13,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:00:13,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 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 [2018-12-24 14:00:13,351 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 14:00:13,352 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 14:00:13,357 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 14:00:13,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:00:13,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:00:13,360 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 [2018-12-24 14:00:13,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,367 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 [2018-12-24 14:00:13,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,373 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 [2018-12-24 14:00:13,380 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,384 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,384 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 [2018-12-24 14:00:13,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,391 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,392 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,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, 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 [2018-12-24 14:00:13,393 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 14:00:13,421 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:00:13,436 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:00:13,447 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:00:13,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:00:13,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:00:13,476 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2018-12-24 14:00:13,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,512 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,515 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 [2018-12-24 14:00:13,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:00:13,558 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. [2018-12-24 14:00:13,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-12-24 14:00:13,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,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 36 treesize of output 86 [2018-12-24 14:00:13,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:00:13,650 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. [2018-12-24 14:00:13,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-12-24 14:00:13,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,677 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,683 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,692 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:00:13,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, 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 [2018-12-24 14:00:13,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:00:13,747 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. [2018-12-24 14:00:13,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2018-12-24 14:00:13,771 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,774 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,783 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,785 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,790 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:00:13,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 40 treesize of output 96 [2018-12-24 14:00:13,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:00:13,841 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. [2018-12-24 14:00:13,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2018-12-24 14:00:13,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,875 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:13,881 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:00:13,882 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 [2018-12-24 14:00:13,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:00:13,928 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. [2018-12-24 14:00:13,929 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2018-12-24 14:00:13,955 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:00:13,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:00:14,028 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:00:14,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:00:14,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2018-12-24 14:00:14,046 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:00:14,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-24 14:00:14,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-24 14:00:14,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2018-12-24 14:00:14,047 INFO L87 Difference]: Start difference. First operand 47 states and 206 transitions. Second operand 14 states. [2018-12-24 14:00:15,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:00:15,981 INFO L93 Difference]: Finished difference Result 97 states and 409 transitions. [2018-12-24 14:00:15,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-24 14:00:15,982 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-12-24 14:00:15,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:00:15,982 INFO L225 Difference]: With dead ends: 97 [2018-12-24 14:00:15,983 INFO L226 Difference]: Without dead ends: 84 [2018-12-24 14:00:15,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=333, Unknown=0, NotChecked=0, Total=506 [2018-12-24 14:00:15,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-24 14:00:16,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2018-12-24 14:00:16,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-24 14:00:16,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 266 transitions. [2018-12-24 14:00:16,823 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 266 transitions. Word has length 10 [2018-12-24 14:00:16,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:00:16,823 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 266 transitions. [2018-12-24 14:00:16,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-24 14:00:16,823 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 266 transitions. [2018-12-24 14:00:16,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-24 14:00:16,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:00:16,824 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-24 14:00:16,824 INFO L423 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:00:16,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:00:16,824 INFO L82 PathProgramCache]: Analyzing trace with hash 230496124, now seen corresponding path program 4 times [2018-12-24 14:00:16,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:00:16,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:00:16,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 14:00:16,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:00:16,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:00:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:00:17,081 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 14:00:17,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:00:17,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:00:17,082 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:00:17,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:00:17,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:00:17,082 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 [2018-12-24 14:00:17,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:00:17,090 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 14:00:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:00:17,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:00:17,097 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 [2018-12-24 14:00:17,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,107 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 [2018-12-24 14:00:17,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,113 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,113 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 [2018-12-24 14:00:17,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,119 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 [2018-12-24 14:00:17,122 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,126 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 [2018-12-24 14:00:17,127 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-24 14:00:17,153 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:00:17,168 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:00:17,180 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:00:17,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:00:17,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:00:17,209 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2018-12-24 14:00:17,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,240 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,241 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,243 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,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, 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 [2018-12-24 14:00:17,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:00:17,291 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. [2018-12-24 14:00:17,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-12-24 14:00:17,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,323 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,325 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,328 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,329 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,331 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,332 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,334 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:00:17,334 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 [2018-12-24 14:00:17,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:00:17,378 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. [2018-12-24 14:00:17,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2018-12-24 14:00:17,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,461 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 [2018-12-24 14:00:17,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:00:17,507 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. [2018-12-24 14:00:17,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2018-12-24 14:00:17,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,544 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,548 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,550 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:00:17,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 40 treesize of output 96 [2018-12-24 14:00:17,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:00:17,602 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. [2018-12-24 14:00:17,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2018-12-24 14:00:17,637 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:00:17,655 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 14:00:17,656 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 [2018-12-24 14:00:17,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:00:17,705 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. [2018-12-24 14:00:17,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2018-12-24 14:00:17,735 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:00:17,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:00:17,861 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:00:17,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 14:00:17,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2018-12-24 14:00:17,881 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 14:00:17,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-24 14:00:17,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-24 14:00:17,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2018-12-24 14:00:17,882 INFO L87 Difference]: Start difference. First operand 58 states and 266 transitions. Second operand 13 states. [2018-12-24 14:00:19,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:00:19,561 INFO L93 Difference]: Finished difference Result 67 states and 299 transitions. [2018-12-24 14:00:19,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 14:00:19,561 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2018-12-24 14:00:19,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:00:19,561 INFO L225 Difference]: With dead ends: 67 [2018-12-24 14:00:19,561 INFO L226 Difference]: Without dead ends: 0 [2018-12-24 14:00:19,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-12-24 14:00:19,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-24 14:00:19,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-24 14:00:19,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-24 14:00:19,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-24 14:00:19,562 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2018-12-24 14:00:19,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:00:19,562 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-24 14:00:19,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-24 14:00:19,562 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-24 14:00:19,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-24 14:00:19,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-24 14:00:19,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:19,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:19,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:19,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:20,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:20,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:20,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:20,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:21,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:21,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:21,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:21,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:21,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:21,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:21,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:21,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:21,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:21,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:21,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:21,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:21,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:21,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:21,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:21,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:22,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:22,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:22,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:22,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:22,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:23,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:23,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:23,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:23,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:27,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:28,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:29,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:33,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:33,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:33,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:35,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:35,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:39,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:39,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:39,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:39,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:39,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:39,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:40,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:40,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:40,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:40,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:40,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:40,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:40,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:42,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:54,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:54,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:54,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:54,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:54,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:00:54,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:01:00,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:01:12,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:01:19,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:01:20,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:01:20,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:01:20,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:01:27,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:01:28,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:01:28,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:01:28,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:01:28,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:01:28,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:01:36,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:01:36,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:01:39,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:01:39,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:01:39,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:01:39,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:01:39,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:01:39,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:01:46,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:02:25,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:02:37,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:02:38,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:02:38,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:02:54,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:02:54,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:02:54,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 14:02:58,609 WARN L181 SmtUtils]: Spent 2.65 m on a formula simplification. DAG size of input: 5253 DAG size of output: 4236 [2018-12-24 14:06:56,334 WARN L181 SmtUtils]: Spent 3.96 m on a formula simplification. DAG size of input: 3967 DAG size of output: 124 [2018-12-24 14:06:56,338 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2018-12-24 14:06:56,338 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 51) no Hoare annotation was computed. [2018-12-24 14:06:56,338 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 48) no Hoare annotation was computed. [2018-12-24 14:06:56,338 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-12-24 14:06:56,338 INFO L448 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2018-12-24 14:06:56,338 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 49) no Hoare annotation was computed. [2018-12-24 14:06:56,338 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONASSERT(line 52) no Hoare annotation was computed. [2018-12-24 14:06:56,338 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2018-12-24 14:06:56,338 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-12-24 14:06:56,339 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-12-24 14:06:56,339 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 54) no Hoare annotation was computed. [2018-12-24 14:06:56,339 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)))))))) [2018-12-24 14:06:56,339 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 50) no Hoare annotation was computed. [2018-12-24 14:06:56,365 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 02:06:56 BoogieIcfgContainer [2018-12-24 14:06:56,365 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-24 14:06:56,366 INFO L168 Benchmark]: Toolchain (without parser) took 718245.51 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -469.6 MB). Peak memory consumption was 3.5 GB. Max. memory is 7.1 GB. [2018-12-24 14:06:56,367 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 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. [2018-12-24 14:06:56,367 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.53 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. [2018-12-24 14:06:56,367 INFO L168 Benchmark]: Boogie Preprocessor took 28.37 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. [2018-12-24 14:06:56,367 INFO L168 Benchmark]: RCFGBuilder took 385.42 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. [2018-12-24 14:06:56,367 INFO L168 Benchmark]: TraceAbstraction took 717759.80 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -490.8 MB). Peak memory consumption was 3.5 GB. Max. memory is 7.1 GB. [2018-12-24 14:06:56,369 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.22 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.53 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 28.37 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 385.42 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 717759.80 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -490.8 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: 52]: 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 - 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: 50]: 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, 717.6s OverallTime, 146 OverallIterations, 2 TraceHistogramMax, 148.0s AutomataDifference, 0.0s DeadEndRemovalTime, 396.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 710 SDtfs, 3208 SDslu, 1 SDs, 0 SdLazy, 36534 SolverSat, 1932 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 52.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2696 GetRequests, 573 SyntacticMatches, 121 SemanticMatches, 2002 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8683 ImplicationChecksByTransitivity, 62.5s 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: 64.2s AutomataMinimizationTime, 146 MinimizatonAttempts, 5533 StatesRemovedByMinimization, 142 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 77 NumberOfFragments, 517 HoareAnnotationTreeSize, 1 FomulaSimplifications, 6385741493603791 FormulaSimplificationTreeSizeReduction, 159.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 1235314563251 FormulaSimplificationTreeSizeReductionInter, 237.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 101.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:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...