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-4-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 14:20:45,165 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 14:20:45,167 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 14:20:45,183 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 14:20:45,184 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 14:20:45,185 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 14:20:45,186 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 14:20:45,193 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 14:20:45,197 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 14:20:45,198 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 14:20:45,201 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 14:20:45,201 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 14:20:45,202 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 14:20:45,206 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 14:20:45,207 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 14:20:45,209 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 14:20:45,212 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 14:20:45,217 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 14:20:45,221 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 14:20:45,222 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 14:20:45,223 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 14:20:45,226 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 14:20:45,230 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 14:20:45,230 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 14:20:45,230 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 14:20:45,231 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 14:20:45,232 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 14:20:45,233 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 14:20:45,233 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 14:20:45,236 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 14:20:45,237 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 14:20:45,237 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 14:20:45,237 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 14:20:45,238 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 14:20:45,238 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 14:20:45,240 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 14:20:45,240 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-11 14:20:45,261 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 14:20:45,261 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 14:20:45,263 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 14:20:45,263 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 14:20:45,263 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 14:20:45,264 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 14:20:45,264 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 14:20:45,264 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 14:20:45,264 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-11 14:20:45,264 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 14:20:45,264 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-11 14:20:45,268 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-11 14:20:45,269 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 14:20:45,269 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 14:20:45,270 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 14:20:45,270 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 14:20:45,270 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 14:20:45,270 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 14:20:45,271 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 14:20:45,271 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 14:20:45,271 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 14:20:45,271 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 14:20:45,271 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 14:20:45,272 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 14:20:45,272 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 14:20:45,272 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 14:20:45,272 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 14:20:45,273 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 14:20:45,273 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 14:20:45,273 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 14:20:45,273 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 14:20:45,273 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 14:20:45,274 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 14:20:45,274 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 14:20:45,274 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 14:20:45,274 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 14:20:45,274 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 14:20:45,275 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 14:20:45,275 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 14:20:45,275 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 14:20:45,303 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 14:20:45,313 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 14:20:45,317 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 14:20:45,318 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 14:20:45,318 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 14:20:45,319 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl [2019-01-11 14:20:45,319 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl' [2019-01-11 14:20:45,351 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 14:20:45,352 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 14:20:45,353 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 14:20:45,353 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 14:20:45,353 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 14:20:45,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:20:45" (1/1) ... [2019-01-11 14:20:45,387 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:20:45" (1/1) ... [2019-01-11 14:20:45,419 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 14:20:45,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 14:20:45,420 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 14:20:45,420 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 14:20:45,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:20:45" (1/1) ... [2019-01-11 14:20:45,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:20:45" (1/1) ... [2019-01-11 14:20:45,433 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:20:45" (1/1) ... [2019-01-11 14:20:45,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:20:45" (1/1) ... [2019-01-11 14:20:45,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:20:45" (1/1) ... [2019-01-11 14:20:45,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:20:45" (1/1) ... [2019-01-11 14:20:45,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:20:45" (1/1) ... [2019-01-11 14:20:45,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 14:20:45,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 14:20:45,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 14:20:45,458 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 14:20:45,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:20:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 14:20:45,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 14:20:45,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 14:20:45,855 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 14:20:45,855 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-11 14:20:45,857 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:20:45 BoogieIcfgContainer [2019-01-11 14:20:45,857 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 14:20:45,858 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 14:20:45,858 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 14:20:45,861 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 14:20:45,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:20:45" (1/2) ... [2019-01-11 14:20:45,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a238767 and model type speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 02:20:45, skipping insertion in model container [2019-01-11 14:20:45,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:20:45" (2/2) ... [2019-01-11 14:20:45,864 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-limited.bpl [2019-01-11 14:20:45,872 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 14:20:45,879 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-11 14:20:45,892 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-11 14:20:45,922 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 14:20:45,922 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 14:20:45,922 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 14:20:45,922 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 14:20:45,923 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 14:20:45,923 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 14:20:45,923 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 14:20:45,923 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 14:20:45,938 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-01-11 14:20:45,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-11 14:20:45,944 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:45,945 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-11 14:20:45,947 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:45,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:45,954 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-01-11 14:20:45,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:45,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:45,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:45,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:45,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:46,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:46,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:20:46,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 14:20:46,169 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:20:46,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 14:20:46,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 14:20:46,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:20:46,197 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-01-11 14:20:46,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:46,411 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-01-11 14:20:46,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:20:46,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-11 14:20:46,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:46,426 INFO L225 Difference]: With dead ends: 21 [2019-01-11 14:20:46,426 INFO L226 Difference]: Without dead ends: 16 [2019-01-11 14:20:46,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:20:46,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-11 14:20:46,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-01-11 14:20:46,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-11 14:20:46,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-01-11 14:20:46,469 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-01-11 14:20:46,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:46,471 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-01-11 14:20:46,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 14:20:46,478 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-01-11 14:20:46,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 14:20:46,479 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:46,479 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 14:20:46,480 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:46,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:46,480 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-01-11 14:20:46,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:46,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:46,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:46,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:46,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:46,815 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-11 14:20:46,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:46,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:46,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:46,847 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 14:20:46,848 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-01-11 14:20:46,886 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:20:46,886 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:20:46,978 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:20:46,979 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 3. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:20:46,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:46,985 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:20:46,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:46,985 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:20:46,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:46,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:47,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:47,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 15 treesize of output 18 [2019-01-11 14:20:47,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:47,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:20:47,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:47,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:47,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:20:47,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:47,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:47,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:47,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:20:47,120 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:47,249 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:47,299 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:47,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:47,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:47,344 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-11 14:20:47,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:47,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:47,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:47,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:47,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:47,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:47,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:47,600 INFO L303 Elim1Store]: Index analysis took 184 ms [2019-01-11 14:20:47,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:20:47,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:47,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:47,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 14:20:47,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:47,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:47,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:47,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:47,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 14:20:47,942 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:47,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:20:47,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:20:47,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:20:47,944 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 6 states. [2019-01-11 14:20:48,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:48,220 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2019-01-11 14:20:48,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:20:48,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-11 14:20:48,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:48,222 INFO L225 Difference]: With dead ends: 31 [2019-01-11 14:20:48,222 INFO L226 Difference]: Without dead ends: 28 [2019-01-11 14:20:48,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 14:20:48,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-11 14:20:48,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 13. [2019-01-11 14:20:48,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-11 14:20:48,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2019-01-11 14:20:48,233 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 25 transitions. Word has length 3 [2019-01-11 14:20:48,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:48,233 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 25 transitions. [2019-01-11 14:20:48,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:20:48,237 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 25 transitions. [2019-01-11 14:20:48,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 14:20:48,237 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:48,238 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 14:20:48,238 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:48,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:48,239 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-01-11 14:20:48,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:48,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:48,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:48,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:48,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:48,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:48,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:20:48,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 14:20:48,269 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:20:48,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 14:20:48,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 14:20:48,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:20:48,270 INFO L87 Difference]: Start difference. First operand 13 states and 25 transitions. Second operand 3 states. [2019-01-11 14:20:48,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:48,328 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2019-01-11 14:20:48,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:20:48,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-11 14:20:48,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:48,329 INFO L225 Difference]: With dead ends: 15 [2019-01-11 14:20:48,329 INFO L226 Difference]: Without dead ends: 14 [2019-01-11 14:20:48,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:20:48,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-11 14:20:48,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-01-11 14:20:48,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-11 14:20:48,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2019-01-11 14:20:48,334 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 3 [2019-01-11 14:20:48,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:48,334 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 24 transitions. [2019-01-11 14:20:48,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 14:20:48,334 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 24 transitions. [2019-01-11 14:20:48,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 14:20:48,334 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:48,334 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 14:20:48,335 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:48,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:48,335 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-01-11 14:20:48,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:48,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:48,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:48,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:48,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:48,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:48,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:48,394 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:48,394 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 14:20:48,394 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-01-11 14:20:48,397 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:20:48,397 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:20:48,406 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:20:48,406 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 3. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:20:48,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:48,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:20:48,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:48,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:20:48,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:48,417 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:48,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:48,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:20:48,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:48,477 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 18 treesize of output 24 [2019-01-11 14:20:48,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:48,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:48,532 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 20 treesize of output 34 [2019-01-11 14:20:48,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:48,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:48,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:48,617 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 22 treesize of output 45 [2019-01-11 14:20:48,618 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:48,788 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:48,798 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:48,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:48,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:48,831 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:25, output treesize:30 [2019-01-11 14:20:48,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:48,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:48,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:48,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:48,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:48,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:48,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:48,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:20:48,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:48,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:48,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 14:20:48,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:48,964 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:48,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:48,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 14:20:48,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-11 14:20:48,996 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:20:48,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:20:48,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:20:48,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:20:48,997 INFO L87 Difference]: Start difference. First operand 13 states and 24 transitions. Second operand 4 states. [2019-01-11 14:20:49,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:49,056 INFO L93 Difference]: Finished difference Result 18 states and 41 transitions. [2019-01-11 14:20:49,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 14:20:49,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-11 14:20:49,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:49,058 INFO L225 Difference]: With dead ends: 18 [2019-01-11 14:20:49,058 INFO L226 Difference]: Without dead ends: 17 [2019-01-11 14:20:49,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:20:49,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-11 14:20:49,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-01-11 14:20:49,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-11 14:20:49,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2019-01-11 14:20:49,065 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 40 transitions. Word has length 3 [2019-01-11 14:20:49,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:49,065 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 40 transitions. [2019-01-11 14:20:49,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:20:49,066 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 40 transitions. [2019-01-11 14:20:49,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 14:20:49,066 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:49,066 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 14:20:49,067 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:49,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:49,067 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-01-11 14:20:49,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:49,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:49,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:49,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:49,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:49,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:49,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:49,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:49,171 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 14:20:49,171 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-01-11 14:20:49,173 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:20:49,173 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:20:49,227 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:20:49,227 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 3. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:20:49,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:49,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:20:49,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:49,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:20:49,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:49,237 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:49,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:49,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:20:49,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:49,263 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 18 treesize of output 24 [2019-01-11 14:20:49,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:49,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:49,277 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 20 treesize of output 34 [2019-01-11 14:20:49,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:49,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:49,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:49,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:20:49,291 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:49,313 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:49,324 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:49,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:49,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:49,353 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-11 14:20:49,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:49,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:49,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:49,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:49,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:49,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:49,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:49,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:20:49,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:49,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:49,458 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 14:20:49,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:49,516 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:49,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:49,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:49,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 14:20:49,567 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:49,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:20:49,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:20:49,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:20:49,568 INFO L87 Difference]: Start difference. First operand 16 states and 40 transitions. Second operand 6 states. [2019-01-11 14:20:49,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:49,750 INFO L93 Difference]: Finished difference Result 32 states and 62 transitions. [2019-01-11 14:20:49,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:20:49,754 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-11 14:20:49,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:49,755 INFO L225 Difference]: With dead ends: 32 [2019-01-11 14:20:49,755 INFO L226 Difference]: Without dead ends: 31 [2019-01-11 14:20:49,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 14:20:49,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-11 14:20:49,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2019-01-11 14:20:49,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-11 14:20:49,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2019-01-11 14:20:49,761 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 50 transitions. Word has length 3 [2019-01-11 14:20:49,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:49,762 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 50 transitions. [2019-01-11 14:20:49,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:20:49,762 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 50 transitions. [2019-01-11 14:20:49,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:20:49,762 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:49,762 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:20:49,763 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:49,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:49,763 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2019-01-11 14:20:49,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:49,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:49,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:49,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:49,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:49,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:49,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:49,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:49,831 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:20:49,832 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2019-01-11 14:20:49,834 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:20:49,834 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:20:49,845 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:20:49,845 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:20:49,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:49,846 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:20:49,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:49,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:20:49,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:49,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:49,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:49,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 15 treesize of output 18 [2019-01-11 14:20:49,877 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 18 treesize of output 20 [2019-01-11 14:20:49,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:49,890 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 20 treesize of output 26 [2019-01-11 14:20:49,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:49,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:49,906 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-11 14:20:49,907 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:49,935 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:49,945 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:49,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:49,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. [2019-01-11 14:20:49,991 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-01-11 14:20:50,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:50,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:50,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:50,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:50,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, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 14:20:50,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:50,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:50,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-11 14:20:50,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:50,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:50,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:50,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 14:20:50,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-11 14:20:50,188 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:20:50,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:20:50,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:20:50,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:20:50,189 INFO L87 Difference]: Start difference. First operand 18 states and 50 transitions. Second operand 4 states. [2019-01-11 14:20:50,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:50,224 INFO L93 Difference]: Finished difference Result 22 states and 58 transitions. [2019-01-11 14:20:50,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:20:50,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-11 14:20:50,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:50,225 INFO L225 Difference]: With dead ends: 22 [2019-01-11 14:20:50,226 INFO L226 Difference]: Without dead ends: 21 [2019-01-11 14:20:50,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:20:50,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-11 14:20:50,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-01-11 14:20:50,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-11 14:20:50,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2019-01-11 14:20:50,232 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 57 transitions. Word has length 4 [2019-01-11 14:20:50,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:50,233 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 57 transitions. [2019-01-11 14:20:50,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:20:50,233 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 57 transitions. [2019-01-11 14:20:50,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:20:50,233 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:50,234 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:20:50,234 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:50,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:50,234 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2019-01-11 14:20:50,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:50,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:50,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:50,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:50,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:50,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:50,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:50,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:50,353 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:20:50,354 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2019-01-11 14:20:50,355 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:20:50,355 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:20:50,362 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:20:50,362 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:20:50,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:50,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:20:50,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:50,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:20:50,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:50,372 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:50,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:50,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:20:50,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:50,393 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 18 treesize of output 24 [2019-01-11 14:20:50,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:50,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:50,401 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 20 treesize of output 34 [2019-01-11 14:20:50,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:50,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:50,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:50,419 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 22 treesize of output 45 [2019-01-11 14:20:50,420 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:50,450 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:50,461 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:50,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:50,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:50,487 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 14:20:50,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:50,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:50,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:50,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:50,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:50,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:50,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:50,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:20:50,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:50,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:50,631 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:20:50,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:50,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:50,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:50,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:50,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:50,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:50,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:50,658 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:20:50,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-11 14:20:50,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:50,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:50,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-11 14:20:50,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:50,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:50,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:50,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:50,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:20:50,845 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:50,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:20:50,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:20:50,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:20:50,846 INFO L87 Difference]: Start difference. First operand 20 states and 57 transitions. Second operand 8 states. [2019-01-11 14:20:51,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:51,225 INFO L93 Difference]: Finished difference Result 37 states and 74 transitions. [2019-01-11 14:20:51,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:20:51,225 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:20:51,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:51,227 INFO L225 Difference]: With dead ends: 37 [2019-01-11 14:20:51,227 INFO L226 Difference]: Without dead ends: 36 [2019-01-11 14:20:51,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:20:51,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-11 14:20:51,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 17. [2019-01-11 14:20:51,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-11 14:20:51,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2019-01-11 14:20:51,235 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 41 transitions. Word has length 4 [2019-01-11 14:20:51,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:51,235 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 41 transitions. [2019-01-11 14:20:51,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:20:51,235 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 41 transitions. [2019-01-11 14:20:51,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:20:51,236 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:51,236 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:20:51,236 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:51,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:51,237 INFO L82 PathProgramCache]: Analyzing trace with hash 939350, now seen corresponding path program 1 times [2019-01-11 14:20:51,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:51,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:51,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:51,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:51,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:51,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:51,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:51,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:51,385 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:20:51,385 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2019-01-11 14:20:51,388 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:20:51,388 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:20:51,394 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:20:51,394 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:20:51,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:51,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:20:51,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:51,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:20:51,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:51,405 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:51,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:51,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 15 treesize of output 18 [2019-01-11 14:20:51,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:51,417 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 18 treesize of output 24 [2019-01-11 14:20:51,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:51,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:51,423 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 20 treesize of output 34 [2019-01-11 14:20:51,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:51,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:51,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:51,435 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 22 treesize of output 45 [2019-01-11 14:20:51,435 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:51,456 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:51,465 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:51,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:51,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:51,489 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 14:20:51,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:51,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:51,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:51,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:51,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:51,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:51,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:51,622 INFO L303 Elim1Store]: Index analysis took 112 ms [2019-01-11 14:20:51,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:20:51,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:51,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:51,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:20:51,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:51,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:51,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:51,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:51,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:51,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:51,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:51,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:51,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:51,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 14:20:51,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:51,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:51,744 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 14:20:51,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:51,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:51,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:51,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:51,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:20:51,814 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:51,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:20:51,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:20:51,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:20:51,815 INFO L87 Difference]: Start difference. First operand 17 states and 41 transitions. Second operand 8 states. [2019-01-11 14:20:52,078 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-01-11 14:20:52,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:52,246 INFO L93 Difference]: Finished difference Result 42 states and 89 transitions. [2019-01-11 14:20:52,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:20:52,246 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:20:52,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:52,248 INFO L225 Difference]: With dead ends: 42 [2019-01-11 14:20:52,248 INFO L226 Difference]: Without dead ends: 38 [2019-01-11 14:20:52,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:20:52,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-11 14:20:52,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 22. [2019-01-11 14:20:52,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-11 14:20:52,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 65 transitions. [2019-01-11 14:20:52,257 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 65 transitions. Word has length 4 [2019-01-11 14:20:52,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:52,257 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 65 transitions. [2019-01-11 14:20:52,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:20:52,257 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 65 transitions. [2019-01-11 14:20:52,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:20:52,258 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:52,258 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:20:52,258 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:52,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:52,259 INFO L82 PathProgramCache]: Analyzing trace with hash 929802, now seen corresponding path program 1 times [2019-01-11 14:20:52,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:52,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:52,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:52,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:52,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:52,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:52,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:52,342 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:52,342 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:20:52,342 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2019-01-11 14:20:52,343 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:20:52,344 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:20:52,349 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:20:52,349 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:20:52,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:52,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:20:52,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:52,350 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:20:52,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:52,362 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:52,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:52,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 15 treesize of output 18 [2019-01-11 14:20:52,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:52,379 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 18 treesize of output 24 [2019-01-11 14:20:52,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:52,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:52,388 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 20 treesize of output 34 [2019-01-11 14:20:52,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:52,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:52,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:52,396 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 22 treesize of output 45 [2019-01-11 14:20:52,397 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:52,421 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:52,429 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:52,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:52,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:52,451 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-11 14:20:52,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:52,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:52,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:52,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:52,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:52,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:52,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:52,656 INFO L303 Elim1Store]: Index analysis took 190 ms [2019-01-11 14:20:52,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 [2019-01-11 14:20:52,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:52,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:52,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:20:52,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:52,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:52,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:52,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:52,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:52,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:52,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:52,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:52,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:52,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 14:20:52,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:52,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:52,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 14:20:52,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:52,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:53,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:53,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:53,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:20:53,077 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:53,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:20:53,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:20:53,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:20:53,078 INFO L87 Difference]: Start difference. First operand 22 states and 65 transitions. Second operand 8 states. [2019-01-11 14:20:53,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:53,476 INFO L93 Difference]: Finished difference Result 51 states and 112 transitions. [2019-01-11 14:20:53,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:20:53,476 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:20:53,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:53,477 INFO L225 Difference]: With dead ends: 51 [2019-01-11 14:20:53,477 INFO L226 Difference]: Without dead ends: 48 [2019-01-11 14:20:53,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:20:53,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-11 14:20:53,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 28. [2019-01-11 14:20:53,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-11 14:20:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 88 transitions. [2019-01-11 14:20:53,487 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 88 transitions. Word has length 4 [2019-01-11 14:20:53,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:53,488 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 88 transitions. [2019-01-11 14:20:53,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:20:53,488 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 88 transitions. [2019-01-11 14:20:53,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:20:53,489 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:53,489 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:20:53,489 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:53,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:53,489 INFO L82 PathProgramCache]: Analyzing trace with hash 929928, now seen corresponding path program 1 times [2019-01-11 14:20:53,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:53,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:53,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:53,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:53,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:53,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:53,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:53,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:53,559 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:20:53,559 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [21] [2019-01-11 14:20:53,564 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:20:53,564 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:20:53,569 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:20:53,569 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:20:53,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:53,569 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:20:53,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:53,570 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:20:53,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:53,578 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:53,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:53,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:20:53,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:53,604 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 18 treesize of output 24 [2019-01-11 14:20:53,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:53,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:53,609 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 20 treesize of output 34 [2019-01-11 14:20:53,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:53,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:53,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:53,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:20:53,624 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:53,641 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:53,651 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:53,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:53,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:53,671 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-11 14:20:53,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:53,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:53,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:53,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:53,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:53,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:53,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:53,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:20:53,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:53,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:53,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 14:20:53,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:53,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:53,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:53,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:53,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 14:20:53,827 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:53,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:20:53,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:20:53,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:20:53,828 INFO L87 Difference]: Start difference. First operand 28 states and 88 transitions. Second operand 6 states. [2019-01-11 14:20:54,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:54,034 INFO L93 Difference]: Finished difference Result 36 states and 98 transitions. [2019-01-11 14:20:54,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:20:54,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 14:20:54,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:54,036 INFO L225 Difference]: With dead ends: 36 [2019-01-11 14:20:54,036 INFO L226 Difference]: Without dead ends: 35 [2019-01-11 14:20:54,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 14:20:54,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-11 14:20:54,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-01-11 14:20:54,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-11 14:20:54,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 92 transitions. [2019-01-11 14:20:54,045 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 92 transitions. Word has length 4 [2019-01-11 14:20:54,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:54,045 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 92 transitions. [2019-01-11 14:20:54,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:20:54,045 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 92 transitions. [2019-01-11 14:20:54,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:20:54,046 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:54,047 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:20:54,047 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:54,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:54,047 INFO L82 PathProgramCache]: Analyzing trace with hash 929616, now seen corresponding path program 1 times [2019-01-11 14:20:54,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:54,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:54,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:54,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:54,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:54,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:54,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:54,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:54,118 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:20:54,118 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [19] [2019-01-11 14:20:54,120 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:20:54,120 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:20:54,124 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:20:54,124 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:20:54,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:54,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:20:54,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:54,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:20:54,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:54,134 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:54,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:54,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:20:54,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:54,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 18 treesize of output 24 [2019-01-11 14:20:54,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:54,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:54,202 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 20 treesize of output 34 [2019-01-11 14:20:54,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:54,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:54,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:54,214 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 22 treesize of output 45 [2019-01-11 14:20:54,215 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:54,238 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:54,247 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:54,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:54,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:54,267 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-11 14:20:54,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:54,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:54,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:54,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:54,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:54,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:54,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:54,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:20:54,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:54,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:54,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:20:54,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:54,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:54,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:54,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:54,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:54,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:54,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:54,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:54,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:54,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 14:20:54,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:54,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:54,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 14:20:54,393 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:54,393 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:54,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:54,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:54,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:20:54,433 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:54,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:20:54,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:20:54,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:20:54,434 INFO L87 Difference]: Start difference. First operand 29 states and 92 transitions. Second operand 8 states. [2019-01-11 14:20:54,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:54,941 INFO L93 Difference]: Finished difference Result 55 states and 140 transitions. [2019-01-11 14:20:54,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:20:54,942 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:20:54,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:54,944 INFO L225 Difference]: With dead ends: 55 [2019-01-11 14:20:54,945 INFO L226 Difference]: Without dead ends: 54 [2019-01-11 14:20:54,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:20:54,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-11 14:20:54,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 34. [2019-01-11 14:20:54,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-11 14:20:54,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 117 transitions. [2019-01-11 14:20:54,955 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 117 transitions. Word has length 4 [2019-01-11 14:20:54,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:54,955 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 117 transitions. [2019-01-11 14:20:54,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:20:54,955 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 117 transitions. [2019-01-11 14:20:54,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:20:54,956 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:54,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:20:54,956 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:54,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:54,957 INFO L82 PathProgramCache]: Analyzing trace with hash 933584, now seen corresponding path program 1 times [2019-01-11 14:20:54,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:54,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:54,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:54,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:54,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:55,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:55,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:55,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:55,045 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:20:55,045 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [19] [2019-01-11 14:20:55,046 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:20:55,047 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:20:55,050 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:20:55,051 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:20:55,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:55,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:20:55,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:55,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:20:55,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:55,063 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:55,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:55,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:20:55,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,089 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 18 treesize of output 24 [2019-01-11 14:20:55,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:20:55,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,115 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 22 treesize of output 45 [2019-01-11 14:20:55,115 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:55,134 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:55,144 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:55,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:55,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:55,169 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 14:20:55,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:20:55,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:55,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:55,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:20:55,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 14:20:55,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:55,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. [2019-01-11 14:20:55,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 14:20:55,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:55,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:55,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:55,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:55,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:20:55,399 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:55,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:20:55,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:20:55,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:20:55,406 INFO L87 Difference]: Start difference. First operand 34 states and 117 transitions. Second operand 8 states. [2019-01-11 14:20:55,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:55,723 INFO L93 Difference]: Finished difference Result 56 states and 150 transitions. [2019-01-11 14:20:55,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:20:55,724 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:20:55,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:55,725 INFO L225 Difference]: With dead ends: 56 [2019-01-11 14:20:55,725 INFO L226 Difference]: Without dead ends: 54 [2019-01-11 14:20:55,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:20:55,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-11 14:20:55,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 36. [2019-01-11 14:20:55,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-11 14:20:55,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 127 transitions. [2019-01-11 14:20:55,736 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 127 transitions. Word has length 4 [2019-01-11 14:20:55,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:55,736 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 127 transitions. [2019-01-11 14:20:55,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:20:55,736 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 127 transitions. [2019-01-11 14:20:55,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:20:55,737 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:55,737 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:20:55,737 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:55,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:55,738 INFO L82 PathProgramCache]: Analyzing trace with hash 937616, now seen corresponding path program 1 times [2019-01-11 14:20:55,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:55,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:55,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:55,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:55,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:55,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:55,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:55,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:55,789 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:55,789 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:20:55,789 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [21] [2019-01-11 14:20:55,790 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:20:55,791 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:20:55,796 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:20:55,796 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:20:55,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:55,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:20:55,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:55,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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:20:55,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:55,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:55,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:55,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:20:55,820 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 18 treesize of output 20 [2019-01-11 14:20:55,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,830 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 20 treesize of output 26 [2019-01-11 14:20:55,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:55,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-11 14:20:55,846 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:55,864 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:55,876 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:55,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:55,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:55,900 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-01-11 14:20:56,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:56,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:56,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:56,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:56,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 14:20:56,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:56,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:56,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-11 14:20:56,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:56,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:56,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:56,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:56,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 14:20:56,078 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:56,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:20:56,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:20:56,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:20:56,079 INFO L87 Difference]: Start difference. First operand 36 states and 127 transitions. Second operand 6 states. [2019-01-11 14:20:56,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:56,206 INFO L93 Difference]: Finished difference Result 48 states and 142 transitions. [2019-01-11 14:20:56,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:20:56,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 14:20:56,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:56,207 INFO L225 Difference]: With dead ends: 48 [2019-01-11 14:20:56,207 INFO L226 Difference]: Without dead ends: 47 [2019-01-11 14:20:56,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 14:20:56,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-11 14:20:56,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2019-01-11 14:20:56,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-11 14:20:56,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 127 transitions. [2019-01-11 14:20:56,216 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 127 transitions. Word has length 4 [2019-01-11 14:20:56,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:56,216 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 127 transitions. [2019-01-11 14:20:56,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:20:56,217 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 127 transitions. [2019-01-11 14:20:56,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:20:56,217 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:56,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:20:56,218 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:56,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:56,218 INFO L82 PathProgramCache]: Analyzing trace with hash 29112214, now seen corresponding path program 1 times [2019-01-11 14:20:56,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:56,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:56,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:56,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:56,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:56,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:20:56,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:56,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:56,335 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:20:56,335 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [21] [2019-01-11 14:20:56,337 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:20:56,337 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:20:56,341 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:20:56,341 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:20:56,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:56,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:20:56,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:56,341 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:20:56,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:56,352 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:56,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:56,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 15 treesize of output 18 [2019-01-11 14:20:56,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:56,364 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 18 treesize of output 24 [2019-01-11 14:20:56,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:56,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:56,374 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 20 treesize of output 34 [2019-01-11 14:20:56,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:56,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:56,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:56,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:20:56,386 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:56,422 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:56,432 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:56,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:56,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:56,454 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 14:20:56,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:56,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:56,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:56,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:56,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:56,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:56,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:56,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:20:56,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:56,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:56,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:20:56,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:56,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:56,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:56,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:56,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:56,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:56,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:56,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:56,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:56,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:20:56,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:56,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:56,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 14:20:56,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:56,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:56,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:56,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:56,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:20:56,654 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:56,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:20:56,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:20:56,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:20:56,655 INFO L87 Difference]: Start difference. First operand 36 states and 127 transitions. Second operand 8 states. [2019-01-11 14:20:56,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:56,897 INFO L93 Difference]: Finished difference Result 56 states and 161 transitions. [2019-01-11 14:20:56,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:20:56,897 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:20:56,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:56,898 INFO L225 Difference]: With dead ends: 56 [2019-01-11 14:20:56,898 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 14:20:56,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:20:56,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 14:20:56,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2019-01-11 14:20:56,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-11 14:20:56,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 142 transitions. [2019-01-11 14:20:56,907 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 142 transitions. Word has length 5 [2019-01-11 14:20:56,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:56,908 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 142 transitions. [2019-01-11 14:20:56,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:20:56,908 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 142 transitions. [2019-01-11 14:20:56,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:20:56,909 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:56,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:20:56,909 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:56,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:56,909 INFO L82 PathProgramCache]: Analyzing trace with hash 29111902, now seen corresponding path program 1 times [2019-01-11 14:20:56,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:56,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:56,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:56,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:56,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:57,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:57,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:57,022 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:57,023 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:20:57,023 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [19] [2019-01-11 14:20:57,023 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:20:57,024 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:20:57,027 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:20:57,027 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:20:57,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:57,028 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:20:57,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:57,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:20:57,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:57,040 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:57,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:57,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:20:57,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:57,070 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 18 treesize of output 24 [2019-01-11 14:20:57,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:57,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:57,078 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 20 treesize of output 34 [2019-01-11 14:20:57,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:57,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:57,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:57,088 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 22 treesize of output 45 [2019-01-11 14:20:57,089 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:57,116 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:57,124 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:57,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:57,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:57,145 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 14:20:57,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:57,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:57,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:57,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:57,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:57,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:57,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:57,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 45 [2019-01-11 14:20:57,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:57,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:57,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:20:57,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:57,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:57,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:57,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:57,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:57,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:57,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:57,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:57,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:57,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:20:57,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:57,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:57,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 14:20:57,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:57,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:57,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:57,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:57,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:57,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:57,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:57,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:57,346 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:20:57,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:57,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-11 14:20:57,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:57,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:57,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-11 14:20:57,399 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:57,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:57,437 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:57,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:57,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:20:57,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:57,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:20:57,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:20:57,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:20:57,458 INFO L87 Difference]: Start difference. First operand 39 states and 142 transitions. Second operand 10 states. [2019-01-11 14:20:57,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:57,992 INFO L93 Difference]: Finished difference Result 76 states and 212 transitions. [2019-01-11 14:20:57,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:20:57,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:20:57,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:57,994 INFO L225 Difference]: With dead ends: 76 [2019-01-11 14:20:57,994 INFO L226 Difference]: Without dead ends: 75 [2019-01-11 14:20:57,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:20:57,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-11 14:20:58,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 41. [2019-01-11 14:20:58,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-11 14:20:58,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-01-11 14:20:58,006 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-01-11 14:20:58,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:58,006 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-01-11 14:20:58,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:20:58,007 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-01-11 14:20:58,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:20:58,007 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:58,007 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:20:58,008 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:58,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:58,008 INFO L82 PathProgramCache]: Analyzing trace with hash 29115870, now seen corresponding path program 1 times [2019-01-11 14:20:58,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:58,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:58,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:58,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:58,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:58,171 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:58,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:58,172 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:58,172 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:20:58,172 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [19] [2019-01-11 14:20:58,173 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:20:58,173 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:20:58,177 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:20:58,177 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:20:58,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:58,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:20:58,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:58,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:20:58,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:58,187 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:58,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:58,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:20:58,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:58,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 18 treesize of output 24 [2019-01-11 14:20:58,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:58,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:58,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:20:58,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:58,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:58,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:58,215 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 22 treesize of output 45 [2019-01-11 14:20:58,215 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:58,262 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:58,277 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:58,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:58,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:20:58,297 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-11 14:20:58,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:58,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:58,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:58,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:58,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:58,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:58,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:58,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:20:58,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:58,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:58,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 14:20:58,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:58,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:58,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:58,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:58,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:58,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:58,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:58,414 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:20:58,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-11 14:20:58,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:58,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:58,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-11 14:20:58,653 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-11 14:20:58,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:58,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:58,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:58,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:58,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:58,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:58,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:58,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:58,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:20:58,880 INFO L303 Elim1Store]: Index analysis took 223 ms [2019-01-11 14:20:58,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 69 [2019-01-11 14:20:58,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:59,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:20:59,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 14:20:59,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:59,317 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:59,353 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:20:59,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:59,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:20:59,374 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:59,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:20:59,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:20:59,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:20:59,374 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 10 states. [2019-01-11 14:20:59,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:59,954 INFO L93 Difference]: Finished difference Result 67 states and 187 transitions. [2019-01-11 14:20:59,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:20:59,955 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:20:59,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:59,956 INFO L225 Difference]: With dead ends: 67 [2019-01-11 14:20:59,956 INFO L226 Difference]: Without dead ends: 65 [2019-01-11 14:20:59,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:20:59,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-11 14:20:59,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2019-01-11 14:20:59,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-11 14:20:59,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 142 transitions. [2019-01-11 14:20:59,967 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 142 transitions. Word has length 5 [2019-01-11 14:20:59,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:59,967 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 142 transitions. [2019-01-11 14:20:59,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:20:59,968 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 142 transitions. [2019-01-11 14:20:59,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:20:59,968 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:59,968 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:20:59,969 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:59,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:59,969 INFO L82 PathProgramCache]: Analyzing trace with hash 29119902, now seen corresponding path program 1 times [2019-01-11 14:20:59,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:59,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:59,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:59,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:59,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:00,191 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-11 14:21:00,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:00,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:00,215 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:00,215 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:21:00,215 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [21] [2019-01-11 14:21:00,218 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:21:00,218 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:21:00,223 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:21:00,223 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:21:00,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:00,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:21:00,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:00,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:00,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:00,239 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:21:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:00,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:00,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:00,284 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 18 treesize of output 20 [2019-01-11 14:21:00,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:00,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2019-01-11 14:21:00,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:00,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:00,298 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-11 14:21:00,298 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:00,311 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:00,320 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:00,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:00,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:00,339 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-11 14:21:00,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:00,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:00,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:00,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:00,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 14:21:00,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:00,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:00,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 14:21:00,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:00,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:00,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:00,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:00,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:00,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:00,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:21:00,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:00,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. [2019-01-11 14:21:00,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-11 14:21:00,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:00,460 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:00,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:00,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:00,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:21:00,501 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:00,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:21:00,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:21:00,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:21:00,502 INFO L87 Difference]: Start difference. First operand 39 states and 142 transitions. Second operand 8 states. [2019-01-11 14:21:00,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:00,710 INFO L93 Difference]: Finished difference Result 58 states and 171 transitions. [2019-01-11 14:21:00,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:21:00,710 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:21:00,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:00,711 INFO L225 Difference]: With dead ends: 58 [2019-01-11 14:21:00,711 INFO L226 Difference]: Without dead ends: 57 [2019-01-11 14:21:00,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:21:00,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-11 14:21:00,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2019-01-11 14:21:00,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-11 14:21:00,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-01-11 14:21:00,723 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-01-11 14:21:00,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:00,723 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-01-11 14:21:00,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:21:00,723 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-01-11 14:21:00,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:21:00,724 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:00,724 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:21:00,724 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:00,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:00,725 INFO L82 PathProgramCache]: Analyzing trace with hash 28823602, now seen corresponding path program 2 times [2019-01-11 14:21:00,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:00,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:00,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:00,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:00,726 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:00,903 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:00,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:00,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:00,904 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:21:00,904 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:21:00,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:00,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:00,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:21:00,915 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:21:00,920 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:21:00,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:21:00,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:00,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:00,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:00,931 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 18 treesize of output 24 [2019-01-11 14:21:00,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:00,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:00,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:21:00,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:00,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:00,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:00,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:21:00,951 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:00,972 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:00,991 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:01,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:01,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:01,017 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 14:21:01,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:01,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:01,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:01,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:01,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:01,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:01,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:01,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:21:01,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:01,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:01,104 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:01,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:01,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:01,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:01,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:01,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:01,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:01,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:01,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:01,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:01,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 14:21:01,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:01,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:01,203 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:01,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:01,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:01,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:01,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:01,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:01,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:01,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:01,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:01,236 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:21:01,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:01,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-11 14:21:01,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:01,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:01,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-11 14:21:01,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:01,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:01,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:01,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:01,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:21:01,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:01,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:21:01,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:21:01,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:21:01,365 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 10 states. [2019-01-11 14:21:01,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:01,765 INFO L93 Difference]: Finished difference Result 71 states and 199 transitions. [2019-01-11 14:21:01,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:21:01,766 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:21:01,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:01,767 INFO L225 Difference]: With dead ends: 71 [2019-01-11 14:21:01,767 INFO L226 Difference]: Without dead ends: 70 [2019-01-11 14:21:01,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:21:01,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-11 14:21:01,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 30. [2019-01-11 14:21:01,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-11 14:21:01,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2019-01-11 14:21:01,779 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 5 [2019-01-11 14:21:01,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:01,779 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2019-01-11 14:21:01,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:21:01,780 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2019-01-11 14:21:01,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:21:01,780 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:01,780 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:21:01,780 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:01,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:01,781 INFO L82 PathProgramCache]: Analyzing trace with hash 28827822, now seen corresponding path program 1 times [2019-01-11 14:21:01,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:01,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:01,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:21:01,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:01,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:01,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:21:01,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:21:01,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 14:21:01,851 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:21:01,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:21:01,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:21:01,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 14:21:01,852 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 4 states. [2019-01-11 14:21:02,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:02,144 INFO L93 Difference]: Finished difference Result 36 states and 106 transitions. [2019-01-11 14:21:02,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:21:02,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-11 14:21:02,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:02,145 INFO L225 Difference]: With dead ends: 36 [2019-01-11 14:21:02,145 INFO L226 Difference]: Without dead ends: 33 [2019-01-11 14:21:02,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 14:21:02,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-11 14:21:02,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2019-01-11 14:21:02,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-11 14:21:02,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 99 transitions. [2019-01-11 14:21:02,155 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 99 transitions. Word has length 5 [2019-01-11 14:21:02,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:02,156 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 99 transitions. [2019-01-11 14:21:02,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:21:02,156 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 99 transitions. [2019-01-11 14:21:02,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:21:02,156 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:02,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:21:02,157 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:02,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:02,157 INFO L82 PathProgramCache]: Analyzing trace with hash 28818148, now seen corresponding path program 1 times [2019-01-11 14:21:02,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:02,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:02,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:02,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:02,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:02,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:02,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:02,244 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:02,244 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:21:02,244 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [21] [2019-01-11 14:21:02,246 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:21:02,246 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:21:02,249 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:21:02,249 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:21:02,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:02,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:21:02,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:02,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:02,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:02,259 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:21:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:02,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:02,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 15 treesize of output 18 [2019-01-11 14:21:02,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:02,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 18 treesize of output 24 [2019-01-11 14:21:02,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:02,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:02,287 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 20 treesize of output 34 [2019-01-11 14:21:02,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:02,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:02,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:02,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:21:02,300 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:02,323 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:02,335 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:02,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:02,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:02,357 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-11 14:21:02,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:02,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:02,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:02,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:02,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:02,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:02,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:02,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:21:02,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:02,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:02,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:02,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:02,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:02,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:02,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:02,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:02,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:02,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:02,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:02,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:02,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 14:21:02,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:02,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:02,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:02,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:02,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:02,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:02,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:02,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 14:21:02,931 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:02,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:21:02,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:21:02,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:21:02,932 INFO L87 Difference]: Start difference. First operand 29 states and 99 transitions. Second operand 8 states. [2019-01-11 14:21:03,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:03,146 INFO L93 Difference]: Finished difference Result 44 states and 125 transitions. [2019-01-11 14:21:03,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:21:03,147 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:21:03,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:03,147 INFO L225 Difference]: With dead ends: 44 [2019-01-11 14:21:03,147 INFO L226 Difference]: Without dead ends: 43 [2019-01-11 14:21:03,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:21:03,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-11 14:21:03,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2019-01-11 14:21:03,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-11 14:21:03,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 114 transitions. [2019-01-11 14:21:03,158 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 114 transitions. Word has length 5 [2019-01-11 14:21:03,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:03,159 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 114 transitions. [2019-01-11 14:21:03,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:21:03,159 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 114 transitions. [2019-01-11 14:21:03,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:21:03,159 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:03,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:21:03,159 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:03,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:03,160 INFO L82 PathProgramCache]: Analyzing trace with hash 28821992, now seen corresponding path program 1 times [2019-01-11 14:21:03,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:03,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:03,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:03,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:03,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:03,369 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-11 14:21:03,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:21:03,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:03,401 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:03,401 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:21:03,401 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [21] [2019-01-11 14:21:03,403 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:21:03,403 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:21:03,409 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:21:03,409 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:21:03,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:03,409 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:21:03,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:03,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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:03,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:03,419 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:21:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:03,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:03,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:03,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:03,430 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 18 treesize of output 24 [2019-01-11 14:21:03,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:03,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:03,437 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 20 treesize of output 34 [2019-01-11 14:21:03,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:03,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:03,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:03,447 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 22 treesize of output 45 [2019-01-11 14:21:03,447 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:03,477 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:03,486 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:03,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:03,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:03,509 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 14:21:03,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:03,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:03,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:03,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:03,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:03,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:03,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:03,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:21:03,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:03,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:03,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:03,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:03,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:03,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:03,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:03,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:03,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:03,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:03,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:03,620 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:21:03,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-11 14:21:03,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:03,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. [2019-01-11 14:21:03,653 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:03,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:03,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:03,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:03,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:03,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:21:03,713 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:03,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:21:03,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:21:03,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:21:03,714 INFO L87 Difference]: Start difference. First operand 32 states and 114 transitions. Second operand 8 states. [2019-01-11 14:21:04,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:04,015 INFO L93 Difference]: Finished difference Result 49 states and 142 transitions. [2019-01-11 14:21:04,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:21:04,016 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:21:04,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:04,017 INFO L225 Difference]: With dead ends: 49 [2019-01-11 14:21:04,017 INFO L226 Difference]: Without dead ends: 48 [2019-01-11 14:21:04,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:21:04,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-11 14:21:04,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-01-11 14:21:04,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-11 14:21:04,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 124 transitions. [2019-01-11 14:21:04,029 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 124 transitions. Word has length 5 [2019-01-11 14:21:04,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:04,029 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 124 transitions. [2019-01-11 14:21:04,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:21:04,030 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 124 transitions. [2019-01-11 14:21:04,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:21:04,030 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:04,030 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:21:04,030 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:04,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:04,031 INFO L82 PathProgramCache]: Analyzing trace with hash 28933468, now seen corresponding path program 2 times [2019-01-11 14:21:04,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:04,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:04,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:04,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:04,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:04,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:04,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:04,121 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:04,121 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:21:04,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:21:04,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:04,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:04,130 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:21:04,131 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:21:04,136 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-11 14:21:04,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:21:04,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:04,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:04,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:04,151 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 18 treesize of output 24 [2019-01-11 14:21:04,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:04,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:04,157 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 20 treesize of output 34 [2019-01-11 14:21:04,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:04,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:04,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:04,165 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 22 treesize of output 45 [2019-01-11 14:21:04,165 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:04,182 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:04,192 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:04,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:04,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:04,214 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-11 14:21:04,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:04,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:04,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:04,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:04,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:04,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:04,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:04,541 INFO L303 Elim1Store]: Index analysis took 157 ms [2019-01-11 14:21:04,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:21:04,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:04,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:04,903 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:04,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:04,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:04,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:04,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:04,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:04,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:04,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:04,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:04,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:04,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 14:21:04,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:04,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:04,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 14:21:05,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:05,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:05,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:05,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:05,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:21:05,075 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:05,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:21:05,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:21:05,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:21:05,076 INFO L87 Difference]: Start difference. First operand 34 states and 124 transitions. Second operand 8 states. [2019-01-11 14:21:05,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:05,616 INFO L93 Difference]: Finished difference Result 58 states and 161 transitions. [2019-01-11 14:21:05,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:21:05,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:21:05,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:05,619 INFO L225 Difference]: With dead ends: 58 [2019-01-11 14:21:05,620 INFO L226 Difference]: Without dead ends: 57 [2019-01-11 14:21:05,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:21:05,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-11 14:21:05,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2019-01-11 14:21:05,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-11 14:21:05,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 134 transitions. [2019-01-11 14:21:05,635 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 134 transitions. Word has length 5 [2019-01-11 14:21:05,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:05,635 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 134 transitions. [2019-01-11 14:21:05,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:21:05,635 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 134 transitions. [2019-01-11 14:21:05,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:21:05,636 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:05,636 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:21:05,636 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:05,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:05,636 INFO L82 PathProgramCache]: Analyzing trace with hash 28941156, now seen corresponding path program 1 times [2019-01-11 14:21:05,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:05,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:05,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:21:05,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:05,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:05,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:05,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:05,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:05,733 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:21:05,733 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [21] [2019-01-11 14:21:05,734 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:21:05,734 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:21:05,737 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:21:05,737 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:21:05,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:05,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:21:05,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:05,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:05,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:05,758 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:21:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:05,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:05,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:05,784 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 18 treesize of output 20 [2019-01-11 14:21:05,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:05,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 20 treesize of output 26 [2019-01-11 14:21:05,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:05,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:05,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-11 14:21:05,811 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:05,824 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:05,832 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:05,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:05,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:05,850 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-01-11 14:21:05,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:05,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:05,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:05,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:05,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 14:21:05,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:05,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:05,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 14:21:05,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:05,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:05,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:05,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:05,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:05,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:05,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:21:05,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:05,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:05,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-11 14:21:05,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:05,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:06,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:06,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:06,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:21:06,027 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:06,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:21:06,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:21:06,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:21:06,028 INFO L87 Difference]: Start difference. First operand 36 states and 134 transitions. Second operand 8 states. [2019-01-11 14:21:06,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:06,279 INFO L93 Difference]: Finished difference Result 59 states and 162 transitions. [2019-01-11 14:21:06,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:21:06,279 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:21:06,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:06,280 INFO L225 Difference]: With dead ends: 59 [2019-01-11 14:21:06,280 INFO L226 Difference]: Without dead ends: 58 [2019-01-11 14:21:06,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:21:06,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-11 14:21:06,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 37. [2019-01-11 14:21:06,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-11 14:21:06,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 139 transitions. [2019-01-11 14:21:06,292 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 139 transitions. Word has length 5 [2019-01-11 14:21:06,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:06,292 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 139 transitions. [2019-01-11 14:21:06,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:21:06,292 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 139 transitions. [2019-01-11 14:21:06,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:21:06,293 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:06,293 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:21:06,293 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:06,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:06,293 INFO L82 PathProgramCache]: Analyzing trace with hash 29066150, now seen corresponding path program 1 times [2019-01-11 14:21:06,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:06,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:06,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:06,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:06,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:06,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:06,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:06,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:06,417 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:21:06,417 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [22], [23] [2019-01-11 14:21:06,418 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:21:06,418 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:21:06,422 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:21:06,422 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:21:06,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:06,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:21:06,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:06,423 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:06,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:06,440 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:21:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:06,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:06,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 15 treesize of output 18 [2019-01-11 14:21:06,501 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 18 treesize of output 20 [2019-01-11 14:21:06,516 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 20 treesize of output 22 [2019-01-11 14:21:06,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:06,524 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2019-01-11 14:21:06,524 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:06,534 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:06,542 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:06,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:06,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:06,559 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:19, output treesize:24 [2019-01-11 14:21:06,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:06,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:06,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 14:21:06,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:06,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:06,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-11 14:21:06,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:06,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:06,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:06,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 14:21:06,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-11 14:21:06,621 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:21:06,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:21:06,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:21:06,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 14:21:06,622 INFO L87 Difference]: Start difference. First operand 37 states and 139 transitions. Second operand 4 states. [2019-01-11 14:21:06,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:06,880 INFO L93 Difference]: Finished difference Result 74 states and 262 transitions. [2019-01-11 14:21:06,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 14:21:06,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-11 14:21:06,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:06,881 INFO L225 Difference]: With dead ends: 74 [2019-01-11 14:21:06,882 INFO L226 Difference]: Without dead ends: 73 [2019-01-11 14:21:06,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 14:21:06,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-11 14:21:06,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2019-01-11 14:21:06,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-11 14:21:06,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 250 transitions. [2019-01-11 14:21:06,900 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 250 transitions. Word has length 5 [2019-01-11 14:21:06,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:06,900 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 250 transitions. [2019-01-11 14:21:06,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:21:06,900 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 250 transitions. [2019-01-11 14:21:06,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:21:06,901 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:06,901 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:21:06,901 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:06,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:06,901 INFO L82 PathProgramCache]: Analyzing trace with hash 29052506, now seen corresponding path program 1 times [2019-01-11 14:21:06,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:06,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:06,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:06,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:06,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:06,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:07,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:07,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:07,025 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:07,025 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:21:07,026 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [19] [2019-01-11 14:21:07,026 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:21:07,026 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:21:07,030 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:21:07,030 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:21:07,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:07,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:21:07,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:07,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:07,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:07,040 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:21:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:07,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:07,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 15 treesize of output 18 [2019-01-11 14:21:07,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:07,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:21:07,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:07,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:07,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 20 treesize of output 34 [2019-01-11 14:21:07,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:07,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:07,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:07,074 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 22 treesize of output 45 [2019-01-11 14:21:07,074 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:07,100 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:07,107 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:07,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:07,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:07,130 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 14:21:07,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:07,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:07,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:07,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:07,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:07,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:07,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:07,329 INFO L303 Elim1Store]: Index analysis took 183 ms [2019-01-11 14:21:07,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:21:07,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:07,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:07,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:07,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:07,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:07,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:07,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:07,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:07,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:07,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:07,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:07,396 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:21:07,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-11 14:21:07,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:07,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:07,426 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:07,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:07,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:07,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:07,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:07,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:07,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:07,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:07,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:07,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:07,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 14:21:07,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:07,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:07,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:07,504 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:07,504 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:07,532 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:07,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:07,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:21:07,551 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:07,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:21:07,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:21:07,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:21:07,552 INFO L87 Difference]: Start difference. First operand 59 states and 250 transitions. Second operand 10 states. [2019-01-11 14:21:07,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:07,954 INFO L93 Difference]: Finished difference Result 105 states and 359 transitions. [2019-01-11 14:21:07,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:21:07,955 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:21:07,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:07,956 INFO L225 Difference]: With dead ends: 105 [2019-01-11 14:21:07,957 INFO L226 Difference]: Without dead ends: 97 [2019-01-11 14:21:07,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:21:07,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-11 14:21:07,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 71. [2019-01-11 14:21:07,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-11 14:21:07,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 308 transitions. [2019-01-11 14:21:07,978 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 308 transitions. Word has length 5 [2019-01-11 14:21:07,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:07,978 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 308 transitions. [2019-01-11 14:21:07,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:21:07,978 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 308 transitions. [2019-01-11 14:21:07,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:21:07,978 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:07,979 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-11 14:21:07,979 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:07,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:07,979 INFO L82 PathProgramCache]: Analyzing trace with hash 902776598, now seen corresponding path program 1 times [2019-01-11 14:21:07,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:07,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:07,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:07,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:07,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:08,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:21:08,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:08,030 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:08,030 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:21:08,030 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [22], [23] [2019-01-11 14:21:08,032 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:21:08,032 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:21:08,035 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:21:08,035 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:21:08,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:08,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:21:08,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:08,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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-01-11 14:21:08,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:08,057 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:08,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:08,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:08,071 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 18 treesize of output 20 [2019-01-11 14:21:08,080 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 20 treesize of output 22 [2019-01-11 14:21:08,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:08,138 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2019-01-11 14:21:08,139 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:08,147 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:08,153 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:08,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:08,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:08,172 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-01-11 14:21:08,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:08,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:08,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-11 14:21:08,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:08,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:08,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-11 14:21:08,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:08,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:08,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:08,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:08,264 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 27 [2019-01-11 14:21:08,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:08,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:08,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:14 [2019-01-11 14:21:08,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:08,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:08,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:08,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:08,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-11 14:21:08,667 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:08,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 14:21:08,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 14:21:08,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:21:08,668 INFO L87 Difference]: Start difference. First operand 71 states and 308 transitions. Second operand 7 states. [2019-01-11 14:21:08,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:08,875 INFO L93 Difference]: Finished difference Result 85 states and 324 transitions. [2019-01-11 14:21:08,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:21:08,876 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-01-11 14:21:08,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:08,877 INFO L225 Difference]: With dead ends: 85 [2019-01-11 14:21:08,877 INFO L226 Difference]: Without dead ends: 80 [2019-01-11 14:21:08,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:21:08,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-11 14:21:08,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2019-01-11 14:21:08,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-11 14:21:08,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2019-01-11 14:21:08,898 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2019-01-11 14:21:08,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:08,898 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2019-01-11 14:21:08,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 14:21:08,898 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2019-01-11 14:21:08,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:21:08,899 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:08,899 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:21:08,900 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:08,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:08,900 INFO L82 PathProgramCache]: Analyzing trace with hash 902478688, now seen corresponding path program 1 times [2019-01-11 14:21:08,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:08,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:08,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:08,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:08,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:09,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:09,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:09,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:09,005 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:21:09,005 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [23] [2019-01-11 14:21:09,007 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:21:09,007 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:21:09,011 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:21:09,011 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:21:09,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:09,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:21:09,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:09,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:09,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:09,025 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:21:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:09,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:09,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:09,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:09,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 18 treesize of output 24 [2019-01-11 14:21:09,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:09,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:09,049 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 20 treesize of output 34 [2019-01-11 14:21:09,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:09,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:09,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:09,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:21:09,057 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:09,125 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:09,142 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:09,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:09,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:09,166 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 14:21:09,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:09,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:09,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:09,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:09,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:09,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:09,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:09,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:21:09,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:09,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:09,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:09,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:09,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:09,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:09,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:09,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:09,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:09,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:09,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:09,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:09,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:21:09,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:09,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. [2019-01-11 14:21:09,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 14:21:09,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:09,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:09,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:09,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:09,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:21:09,463 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:09,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:21:09,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:21:09,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:21:09,464 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 8 states. [2019-01-11 14:21:09,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:09,700 INFO L93 Difference]: Finished difference Result 83 states and 322 transitions. [2019-01-11 14:21:09,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:21:09,701 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 14:21:09,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:09,702 INFO L225 Difference]: With dead ends: 83 [2019-01-11 14:21:09,703 INFO L226 Difference]: Without dead ends: 82 [2019-01-11 14:21:09,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:21:09,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-11 14:21:09,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 71. [2019-01-11 14:21:09,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-11 14:21:09,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2019-01-11 14:21:09,721 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2019-01-11 14:21:09,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:09,721 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2019-01-11 14:21:09,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:21:09,721 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2019-01-11 14:21:09,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:21:09,722 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:09,722 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:21:09,722 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:09,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:09,722 INFO L82 PathProgramCache]: Analyzing trace with hash 902469014, now seen corresponding path program 1 times [2019-01-11 14:21:09,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:09,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:09,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:09,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:09,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:09,967 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-11 14:21:10,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:21:10,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:10,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:10,065 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:21:10,066 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [21] [2019-01-11 14:21:10,067 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:21:10,067 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:21:10,069 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:21:10,070 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:21:10,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:10,070 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:21:10,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:10,070 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:10,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:10,084 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:21:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:10,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:10,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 15 treesize of output 18 [2019-01-11 14:21:10,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:10,098 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 18 treesize of output 24 [2019-01-11 14:21:10,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:10,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:10,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 20 treesize of output 34 [2019-01-11 14:21:10,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:10,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:10,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:10,116 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 22 treesize of output 45 [2019-01-11 14:21:10,117 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:10,145 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:10,157 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:10,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:10,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:10,185 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 14:21:10,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:10,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:10,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:10,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:10,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:10,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:10,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:10,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:21:10,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:10,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:10,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:10,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:10,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:10,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:10,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:10,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:10,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:10,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:10,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:10,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:10,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:21:10,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:10,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. [2019-01-11 14:21:10,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 14:21:10,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:10,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:10,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:10,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:10,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:10,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:10,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:10,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:10,411 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:21:10,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:10,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-11 14:21:10,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:10,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:10,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-11 14:21:10,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:10,467 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:10,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:10,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:10,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:21:10,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:10,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:21:10,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:21:10,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:21:10,562 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 10 states. [2019-01-11 14:21:10,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:10,937 INFO L93 Difference]: Finished difference Result 97 states and 346 transitions. [2019-01-11 14:21:10,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:21:10,939 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:21:10,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:10,940 INFO L225 Difference]: With dead ends: 97 [2019-01-11 14:21:10,940 INFO L226 Difference]: Without dead ends: 96 [2019-01-11 14:21:10,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:21:10,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-11 14:21:10,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2019-01-11 14:21:10,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-11 14:21:10,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2019-01-11 14:21:10,957 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2019-01-11 14:21:10,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:10,957 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2019-01-11 14:21:10,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:21:10,957 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2019-01-11 14:21:10,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:21:10,958 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:10,958 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:21:10,958 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:10,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:10,958 INFO L82 PathProgramCache]: Analyzing trace with hash 902472858, now seen corresponding path program 1 times [2019-01-11 14:21:10,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:10,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:10,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:10,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:10,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:11,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:21:11,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:11,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:11,155 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:21:11,156 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [21] [2019-01-11 14:21:11,156 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:21:11,156 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:21:11,159 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:21:11,159 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:21:11,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:11,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:21:11,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:11,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:11,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:11,172 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:21:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:11,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:11,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:11,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:11,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 18 treesize of output 24 [2019-01-11 14:21:11,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:11,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:11,206 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 20 treesize of output 34 [2019-01-11 14:21:11,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:11,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:11,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:11,213 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 22 treesize of output 45 [2019-01-11 14:21:11,214 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:11,231 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:11,241 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:11,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:11,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:11,263 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-11 14:21:11,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:11,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:11,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:11,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:11,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:11,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:11,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:11,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:21:11,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:11,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:11,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:11,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:11,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:11,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:11,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:11,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:11,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:11,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:11,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:11,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:11,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:21:11,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:11,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:11,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 14:21:11,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:11,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:11,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:11,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:11,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:11,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:11,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:11,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:11,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:11,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:11,412 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:21:11,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-11 14:21:11,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:11,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:11,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 14:21:11,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:11,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:11,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:11,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:11,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:21:11,531 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:11,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:21:11,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:21:11,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:21:11,532 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 10 states. [2019-01-11 14:21:11,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:11,922 INFO L93 Difference]: Finished difference Result 102 states and 389 transitions. [2019-01-11 14:21:11,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:21:11,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:21:11,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:11,924 INFO L225 Difference]: With dead ends: 102 [2019-01-11 14:21:11,924 INFO L226 Difference]: Without dead ends: 101 [2019-01-11 14:21:11,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:21:11,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-11 14:21:11,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2019-01-11 14:21:11,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-11 14:21:11,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 357 transitions. [2019-01-11 14:21:11,953 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 357 transitions. Word has length 6 [2019-01-11 14:21:11,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:11,953 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 357 transitions. [2019-01-11 14:21:11,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:21:11,953 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 357 transitions. [2019-01-11 14:21:11,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:21:11,954 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:11,954 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:21:11,954 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:11,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:11,954 INFO L82 PathProgramCache]: Analyzing trace with hash 902592022, now seen corresponding path program 1 times [2019-01-11 14:21:11,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:11,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:11,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:11,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:11,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:12,182 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-11 14:21:12,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:12,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:12,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:12,224 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:21:12,224 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [21] [2019-01-11 14:21:12,225 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:21:12,225 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:21:12,228 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:21:12,228 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:21:12,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:12,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:21:12,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:12,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:12,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:12,237 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:21:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:12,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:12,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:12,249 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 18 treesize of output 20 [2019-01-11 14:21:12,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:12,253 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 20 treesize of output 26 [2019-01-11 14:21:12,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:12,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:12,263 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-11 14:21:12,264 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:12,286 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:12,294 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:12,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:12,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:12,315 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-11 14:21:12,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:12,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:12,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:12,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:12,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, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 14:21:12,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:12,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:12,362 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 14:21:12,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:12,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:12,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:12,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:12,383 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:21:12,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, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2019-01-11 14:21:12,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:12,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:12,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:22 [2019-01-11 14:21:12,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:12,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:12,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:12,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:12,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:12,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:12,425 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 30 treesize of output 44 [2019-01-11 14:21:12,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:12,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:12,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:26 [2019-01-11 14:21:12,458 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:12,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:12,491 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:12,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:12,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:21:12,510 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:12,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:21:12,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:21:12,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:21:12,511 INFO L87 Difference]: Start difference. First operand 81 states and 357 transitions. Second operand 10 states. [2019-01-11 14:21:12,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:12,935 INFO L93 Difference]: Finished difference Result 108 states and 386 transitions. [2019-01-11 14:21:12,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:21:12,936 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:21:12,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:12,937 INFO L225 Difference]: With dead ends: 108 [2019-01-11 14:21:12,937 INFO L226 Difference]: Without dead ends: 107 [2019-01-11 14:21:12,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:21:12,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-11 14:21:12,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 77. [2019-01-11 14:21:12,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-11 14:21:12,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 337 transitions. [2019-01-11 14:21:12,964 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 337 transitions. Word has length 6 [2019-01-11 14:21:12,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:12,964 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 337 transitions. [2019-01-11 14:21:12,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:21:12,964 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 337 transitions. [2019-01-11 14:21:12,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:21:12,965 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:12,965 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:21:12,965 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:12,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:12,965 INFO L82 PathProgramCache]: Analyzing trace with hash 902591586, now seen corresponding path program 1 times [2019-01-11 14:21:12,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:12,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:12,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:12,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:12,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:13,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:13,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:13,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:13,113 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:21:13,113 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [19] [2019-01-11 14:21:13,114 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:21:13,114 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:21:13,116 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:21:13,117 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:21:13,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:13,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:21:13,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:13,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:13,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:13,127 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:21:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:13,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:13,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:13,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,140 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 18 treesize of output 24 [2019-01-11 14:21:13,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,147 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 20 treesize of output 34 [2019-01-11 14:21:13,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,159 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 22 treesize of output 45 [2019-01-11 14:21:13,160 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:13,182 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:13,191 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:13,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:13,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:13,212 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-11 14:21:13,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:21:13,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:13,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:13,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:13,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,292 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:21:13,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-11 14:21:13,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:13,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:13,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-11 14:21:13,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 69 [2019-01-11 14:21:13,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:13,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:13,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 14:21:13,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:13,505 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:21:13,505 INFO L303 Elim1Store]: Index analysis took 101 ms [2019-01-11 14:21:13,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-11 14:21:13,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:13,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:13,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 14:21:13,561 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:13,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:13,663 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:13,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:13,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 14:21:13,682 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:13,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:21:13,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:21:13,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:21:13,683 INFO L87 Difference]: Start difference. First operand 77 states and 337 transitions. Second operand 12 states. [2019-01-11 14:21:15,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:15,307 INFO L93 Difference]: Finished difference Result 120 states and 459 transitions. [2019-01-11 14:21:15,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:21:15,308 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 14:21:15,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:15,309 INFO L225 Difference]: With dead ends: 120 [2019-01-11 14:21:15,309 INFO L226 Difference]: Without dead ends: 119 [2019-01-11 14:21:15,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=213, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:21:15,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-11 14:21:15,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 82. [2019-01-11 14:21:15,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-11 14:21:15,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 362 transitions. [2019-01-11 14:21:15,337 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 362 transitions. Word has length 6 [2019-01-11 14:21:15,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:15,337 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 362 transitions. [2019-01-11 14:21:15,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:21:15,337 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 362 transitions. [2019-01-11 14:21:15,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:21:15,338 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:15,338 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:21:15,338 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:15,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:15,339 INFO L82 PathProgramCache]: Analyzing trace with hash 902703186, now seen corresponding path program 2 times [2019-01-11 14:21:15,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:15,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:15,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:15,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:15,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:15,865 WARN L181 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2019-01-11 14:21:15,940 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:15,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:15,940 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:15,940 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:21:15,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:21:15,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:15,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:15,951 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:21:15,951 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:21:15,957 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:21:15,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:21:15,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:15,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:15,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:15,966 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 18 treesize of output 24 [2019-01-11 14:21:15,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:15,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:15,972 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 20 treesize of output 34 [2019-01-11 14:21:15,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:15,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:15,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:15,984 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 22 treesize of output 45 [2019-01-11 14:21:15,984 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:16,002 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:16,011 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:16,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:16,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:16,033 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-11 14:21:16,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:21:16,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:16,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:16,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:16,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 14:21:16,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:16,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:16,156 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 14:21:16,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,189 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:21:16,190 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 73 [2019-01-11 14:21:16,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:16,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:16,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 14:21:16,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,254 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:21:16,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:16,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-11 14:21:16,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:16,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:16,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-11 14:21:16,306 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:16,306 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:16,361 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:16,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:16,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 14:21:16,380 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:16,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:21:16,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:21:16,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:21:16,381 INFO L87 Difference]: Start difference. First operand 82 states and 362 transitions. Second operand 12 states. [2019-01-11 14:21:16,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:16,963 INFO L93 Difference]: Finished difference Result 146 states and 556 transitions. [2019-01-11 14:21:16,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:21:16,964 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 14:21:16,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:16,966 INFO L225 Difference]: With dead ends: 146 [2019-01-11 14:21:16,966 INFO L226 Difference]: Without dead ends: 145 [2019-01-11 14:21:16,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:21:16,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-11 14:21:17,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 98. [2019-01-11 14:21:17,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-11 14:21:17,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 442 transitions. [2019-01-11 14:21:17,002 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 442 transitions. Word has length 6 [2019-01-11 14:21:17,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:17,002 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 442 transitions. [2019-01-11 14:21:17,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:21:17,002 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 442 transitions. [2019-01-11 14:21:17,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:21:17,003 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:17,003 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:21:17,004 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:17,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:17,004 INFO L82 PathProgramCache]: Analyzing trace with hash 893362642, now seen corresponding path program 1 times [2019-01-11 14:21:17,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:17,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:17,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:21:17,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:17,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:17,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:21:17,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:17,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:17,131 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:21:17,131 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [23] [2019-01-11 14:21:17,131 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:21:17,132 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:21:17,134 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:21:17,134 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:21:17,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:17,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:21:17,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:17,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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:17,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:17,148 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:21:17,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:17,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:17,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:17,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:17,162 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 18 treesize of output 24 [2019-01-11 14:21:17,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:17,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:17,169 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 20 treesize of output 34 [2019-01-11 14:21:17,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:17,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:17,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:17,182 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 22 treesize of output 45 [2019-01-11 14:21:17,183 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:17,201 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:17,212 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:17,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:17,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:17,237 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 14:21:17,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:17,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:17,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:17,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:17,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:17,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:17,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:17,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:21:17,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:17,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:17,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:17,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:17,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:17,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:17,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:17,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:17,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:17,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:17,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:17,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:17,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 14:21:17,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:17,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:17,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:17,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:17,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:17,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:17,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:17,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-11 14:21:17,421 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:17,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 14:21:17,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 14:21:17,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:21:17,422 INFO L87 Difference]: Start difference. First operand 98 states and 442 transitions. Second operand 7 states. [2019-01-11 14:21:17,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:17,663 INFO L93 Difference]: Finished difference Result 111 states and 462 transitions. [2019-01-11 14:21:17,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:21:17,664 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-01-11 14:21:17,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:17,665 INFO L225 Difference]: With dead ends: 111 [2019-01-11 14:21:17,665 INFO L226 Difference]: Without dead ends: 110 [2019-01-11 14:21:17,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:21:17,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-11 14:21:17,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2019-01-11 14:21:17,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-11 14:21:17,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 452 transitions. [2019-01-11 14:21:17,689 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 452 transitions. Word has length 6 [2019-01-11 14:21:17,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:17,690 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 452 transitions. [2019-01-11 14:21:17,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 14:21:17,690 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 452 transitions. [2019-01-11 14:21:17,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:21:17,690 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:17,691 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:21:17,691 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:17,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:17,691 INFO L82 PathProgramCache]: Analyzing trace with hash 893472132, now seen corresponding path program 1 times [2019-01-11 14:21:17,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:17,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:17,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:17,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:17,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:17,943 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-11 14:21:17,983 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:21:17,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:17,984 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:17,984 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:21:17,984 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [21] [2019-01-11 14:21:17,985 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:21:17,986 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:21:17,989 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:21:17,989 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:21:17,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:17,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:21:17,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:17,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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:17,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:17,999 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:21:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:18,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:18,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:18,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:18,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:21:18,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:18,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:18,058 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 20 treesize of output 34 [2019-01-11 14:21:18,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:18,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:18,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:18,067 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 22 treesize of output 45 [2019-01-11 14:21:18,068 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:18,085 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:18,094 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:18,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:18,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:18,115 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 14:21:18,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:18,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:18,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:18,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:18,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:18,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:18,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:18,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:21:18,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:18,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:18,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:18,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:18,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:18,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:18,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:18,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:18,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:18,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:18,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:18,223 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:21:18,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-11 14:21:18,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:18,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:18,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:18,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:18,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:18,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:18,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:18,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:18,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:18,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:18,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:18,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:18,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 14:21:18,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:18,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:18,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:18,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:18,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:18,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:18,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:18,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:21:18,428 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:18,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:21:18,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:21:18,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:21:18,429 INFO L87 Difference]: Start difference. First operand 100 states and 452 transitions. Second operand 10 states. [2019-01-11 14:21:18,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:18,843 INFO L93 Difference]: Finished difference Result 153 states and 620 transitions. [2019-01-11 14:21:18,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:21:18,843 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:21:18,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:18,846 INFO L225 Difference]: With dead ends: 153 [2019-01-11 14:21:18,846 INFO L226 Difference]: Without dead ends: 152 [2019-01-11 14:21:18,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:21:18,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-01-11 14:21:18,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 127. [2019-01-11 14:21:18,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-11 14:21:18,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 589 transitions. [2019-01-11 14:21:18,875 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 589 transitions. Word has length 6 [2019-01-11 14:21:18,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:18,876 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 589 transitions. [2019-01-11 14:21:18,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:21:18,876 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 589 transitions. [2019-01-11 14:21:18,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:21:18,876 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:18,876 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:21:18,877 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:18,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:18,877 INFO L82 PathProgramCache]: Analyzing trace with hash 897235472, now seen corresponding path program 1 times [2019-01-11 14:21:18,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:18,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:18,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:18,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:18,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:18,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:21:18,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:18,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:18,963 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:21:18,963 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [23] [2019-01-11 14:21:18,964 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:21:18,964 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:21:18,966 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:21:18,966 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:21:18,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:18,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:21:18,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:18,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:18,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:18,976 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:21:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:18,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:18,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:18,988 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 18 treesize of output 20 [2019-01-11 14:21:18,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,000 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 20 treesize of output 26 [2019-01-11 14:21:19,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,048 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-11 14:21:19,049 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:19,059 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:19,066 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:19,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:19,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:19,084 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-11 14:21:19,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 14:21:19,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:19,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:19,131 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 14:21:19,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,177 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:21:19,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, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2019-01-11 14:21:19,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:19,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:19,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-11 14:21:19,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:19,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:19,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:19,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:19,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:21:19,251 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:19,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:21:19,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:21:19,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:21:19,251 INFO L87 Difference]: Start difference. First operand 127 states and 589 transitions. Second operand 8 states. [2019-01-11 14:21:19,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:19,479 INFO L93 Difference]: Finished difference Result 143 states and 607 transitions. [2019-01-11 14:21:19,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:21:19,479 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 14:21:19,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:19,481 INFO L225 Difference]: With dead ends: 143 [2019-01-11 14:21:19,481 INFO L226 Difference]: Without dead ends: 138 [2019-01-11 14:21:19,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:21:19,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-11 14:21:19,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 127. [2019-01-11 14:21:19,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-11 14:21:19,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 588 transitions. [2019-01-11 14:21:19,516 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 588 transitions. Word has length 6 [2019-01-11 14:21:19,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:19,516 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 588 transitions. [2019-01-11 14:21:19,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:21:19,516 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 588 transitions. [2019-01-11 14:21:19,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:21:19,517 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:19,517 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:21:19,517 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:19,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:19,518 INFO L82 PathProgramCache]: Analyzing trace with hash 896931732, now seen corresponding path program 2 times [2019-01-11 14:21:19,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:19,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:19,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:19,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:19,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:19,667 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:21:19,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:19,668 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:19,668 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:21:19,668 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:21:19,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:19,668 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:19,677 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:21:19,678 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:21:19,683 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:21:19,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:21:19,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:19,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:19,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,695 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 18 treesize of output 24 [2019-01-11 14:21:19,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,705 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 20 treesize of output 34 [2019-01-11 14:21:19,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,713 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 22 treesize of output 45 [2019-01-11 14:21:19,713 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:19,730 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:19,739 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:19,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:19,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:19,762 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 14:21:19,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:21:19,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:19,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:19,817 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:19,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 14:21:19,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:19,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:19,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 14:21:19,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:19,910 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:21:19,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-11 14:21:19,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:19,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:19,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 14:21:19,963 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:19,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:20,043 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:20,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:20,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:21:20,061 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:20,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:21:20,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:21:20,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:21:20,062 INFO L87 Difference]: Start difference. First operand 127 states and 588 transitions. Second operand 10 states. [2019-01-11 14:21:20,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:20,594 INFO L93 Difference]: Finished difference Result 196 states and 812 transitions. [2019-01-11 14:21:20,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:21:20,595 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:21:20,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:20,597 INFO L225 Difference]: With dead ends: 196 [2019-01-11 14:21:20,598 INFO L226 Difference]: Without dead ends: 195 [2019-01-11 14:21:20,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:21:20,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-11 14:21:20,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 141. [2019-01-11 14:21:20,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-11 14:21:20,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 664 transitions. [2019-01-11 14:21:20,640 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 664 transitions. Word has length 6 [2019-01-11 14:21:20,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:20,641 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 664 transitions. [2019-01-11 14:21:20,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:21:20,641 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 664 transitions. [2019-01-11 14:21:20,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:21:20,641 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:20,641 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:21:20,641 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:20,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:20,642 INFO L82 PathProgramCache]: Analyzing trace with hash 897162246, now seen corresponding path program 3 times [2019-01-11 14:21:20,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:20,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:20,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:21:20,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:20,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:20,851 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2019-01-11 14:21:20,924 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:20,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:20,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:20,924 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:21:20,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:21:20,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:20,925 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:20,934 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:21:20,935 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:21:20,939 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:21:20,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:21:20,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:20,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:20,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:20,973 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 18 treesize of output 24 [2019-01-11 14:21:20,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:20,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:20,977 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 20 treesize of output 34 [2019-01-11 14:21:20,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:20,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:20,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:20,984 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 22 treesize of output 45 [2019-01-11 14:21:20,984 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:21,000 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:21,010 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:21,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:21,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:21,032 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-11 14:21:21,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:21:21,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:21,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:21,087 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:21,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 14:21:21,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:21,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:21,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 14:21:21,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,180 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:21:21,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 33 treesize of output 83 [2019-01-11 14:21:21,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:21,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:21,216 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 14:21:21,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:21,247 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:21:21,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-11 14:21:21,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:21,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:21,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 14:21:21,297 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:21,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:21,342 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:21,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:21,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 14:21:21,361 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:21,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:21:21,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:21:21,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:21:21,362 INFO L87 Difference]: Start difference. First operand 141 states and 664 transitions. Second operand 12 states. [2019-01-11 14:21:21,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:21,858 INFO L93 Difference]: Finished difference Result 205 states and 871 transitions. [2019-01-11 14:21:21,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:21:21,858 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 14:21:21,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:21,861 INFO L225 Difference]: With dead ends: 205 [2019-01-11 14:21:21,861 INFO L226 Difference]: Without dead ends: 197 [2019-01-11 14:21:21,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:21:21,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-01-11 14:21:21,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 149. [2019-01-11 14:21:21,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-11 14:21:21,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 702 transitions. [2019-01-11 14:21:21,909 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 702 transitions. Word has length 6 [2019-01-11 14:21:21,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:21,909 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 702 transitions. [2019-01-11 14:21:21,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:21:21,909 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 702 transitions. [2019-01-11 14:21:21,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:21:21,910 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:21,910 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:21:21,910 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:21,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:21,911 INFO L82 PathProgramCache]: Analyzing trace with hash 900929556, now seen corresponding path program 1 times [2019-01-11 14:21:21,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:21,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:21,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:21:21,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:21,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:22,255 WARN L181 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-01-11 14:21:22,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:22,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:22,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:22,296 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:21:22,296 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [23] [2019-01-11 14:21:22,297 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:21:22,297 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:21:22,303 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:21:22,303 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:21:22,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:22,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:21:22,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:22,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:22,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:22,318 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:21:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:22,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:22,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:22,328 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 18 treesize of output 20 [2019-01-11 14:21:22,335 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 20 treesize of output 22 [2019-01-11 14:21:22,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:22,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2019-01-11 14:21:22,350 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:22,359 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:22,366 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:22,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:22,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:22,382 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-01-11 14:21:22,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:22,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:22,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 14:21:22,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:22,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:22,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-11 14:21:22,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:22,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:22,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:22,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:22,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, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:21:22,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:22,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:22,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-11 14:21:22,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:22,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:22,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:22,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:22,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:21:22,486 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:22,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:21:22,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:21:22,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:21:22,487 INFO L87 Difference]: Start difference. First operand 149 states and 702 transitions. Second operand 8 states. [2019-01-11 14:21:22,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:22,658 INFO L93 Difference]: Finished difference Result 165 states and 720 transitions. [2019-01-11 14:21:22,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:21:22,658 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 14:21:22,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:22,659 INFO L225 Difference]: With dead ends: 165 [2019-01-11 14:21:22,659 INFO L226 Difference]: Without dead ends: 164 [2019-01-11 14:21:22,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:21:22,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-01-11 14:21:22,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 149. [2019-01-11 14:21:22,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-11 14:21:22,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 702 transitions. [2019-01-11 14:21:22,706 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 702 transitions. Word has length 6 [2019-01-11 14:21:22,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:22,706 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 702 transitions. [2019-01-11 14:21:22,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:21:22,706 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 702 transitions. [2019-01-11 14:21:22,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:21:22,707 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:22,707 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:21:22,707 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:22,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:22,708 INFO L82 PathProgramCache]: Analyzing trace with hash 900750810, now seen corresponding path program 1 times [2019-01-11 14:21:22,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:22,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:22,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:22,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:22,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:22,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:22,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:22,790 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:22,791 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:21:22,791 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [22], [23] [2019-01-11 14:21:22,792 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:21:22,792 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:21:22,794 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:21:22,794 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:21:22,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:22,795 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:21:22,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:22,795 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:22,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:22,804 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:21:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:22,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:22,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:22,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-11 14:21:22,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:22,825 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 20 treesize of output 26 [2019-01-11 14:21:22,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:22,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:22,832 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-11 14:21:22,833 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:22,845 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:22,852 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:22,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:22,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:22,869 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-01-11 14:21:22,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:22,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:22,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:22,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:22,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 14:21:22,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:22,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. [2019-01-11 14:21:22,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 14:21:22,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:22,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:22,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:22,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:22,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:22,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:22,937 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 48 [2019-01-11 14:21:22,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:22,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. [2019-01-11 14:21:22,958 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-11 14:21:22,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:22,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:22,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:23,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:23,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:21:23,012 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:23,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:21:23,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:21:23,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:21:23,013 INFO L87 Difference]: Start difference. First operand 149 states and 702 transitions. Second operand 8 states. [2019-01-11 14:21:23,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:23,254 INFO L93 Difference]: Finished difference Result 174 states and 765 transitions. [2019-01-11 14:21:23,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:21:23,254 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 14:21:23,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:23,257 INFO L225 Difference]: With dead ends: 174 [2019-01-11 14:21:23,257 INFO L226 Difference]: Without dead ends: 173 [2019-01-11 14:21:23,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:21:23,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-11 14:21:23,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 158. [2019-01-11 14:21:23,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-11 14:21:23,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 747 transitions. [2019-01-11 14:21:23,299 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 747 transitions. Word has length 6 [2019-01-11 14:21:23,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:23,300 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 747 transitions. [2019-01-11 14:21:23,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:21:23,300 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 747 transitions. [2019-01-11 14:21:23,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:21:23,301 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:23,301 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-11 14:21:23,301 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:23,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:23,301 INFO L82 PathProgramCache]: Analyzing trace with hash -2078696478, now seen corresponding path program 1 times [2019-01-11 14:21:23,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:23,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:23,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:23,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:23,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:23,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:23,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:23,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:23,497 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:21:23,497 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [22], [24], [25] [2019-01-11 14:21:23,498 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:21:23,498 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:21:23,500 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:21:23,501 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:21:23,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:23,501 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:21:23,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:23,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:23,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:23,511 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:21:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:23,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:23,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:23,527 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 18 treesize of output 20 [2019-01-11 14:21:23,537 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 20 treesize of output 22 [2019-01-11 14:21:23,552 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-01-11 14:21:23,553 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:23,560 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:23,568 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:23,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:23,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:23,583 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:15, output treesize:21 [2019-01-11 14:21:23,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:23,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-01-11 14:21:23,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:23,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:23,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-11 14:21:23,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:23,599 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 18 treesize of output 5 [2019-01-11 14:21:23,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:23,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:23,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2019-01-11 14:21:23,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:23,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:23,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:23,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 14:21:23,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 8 [2019-01-11 14:21:23,639 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:21:23,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 14:21:23,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 14:21:23,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:21:23,640 INFO L87 Difference]: Start difference. First operand 158 states and 747 transitions. Second operand 5 states. [2019-01-11 14:21:23,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:23,810 INFO L93 Difference]: Finished difference Result 357 states and 1628 transitions. [2019-01-11 14:21:23,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:21:23,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-11 14:21:23,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:23,813 INFO L225 Difference]: With dead ends: 357 [2019-01-11 14:21:23,814 INFO L226 Difference]: Without dead ends: 353 [2019-01-11 14:21:23,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:21:23,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-01-11 14:21:23,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 329. [2019-01-11 14:21:23,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-01-11 14:21:23,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 1593 transitions. [2019-01-11 14:21:23,957 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 1593 transitions. Word has length 7 [2019-01-11 14:21:23,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:23,957 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 1593 transitions. [2019-01-11 14:21:23,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 14:21:23,957 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 1593 transitions. [2019-01-11 14:21:23,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:21:23,958 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:23,958 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:21:23,959 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:23,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:23,959 INFO L82 PathProgramCache]: Analyzing trace with hash -2087931688, now seen corresponding path program 1 times [2019-01-11 14:21:23,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:23,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:23,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:23,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:23,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:24,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:24,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:24,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:24,059 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:21:24,059 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [24], [25] [2019-01-11 14:21:24,060 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:21:24,060 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:21:24,062 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:21:24,063 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:21:24,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:24,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:21:24,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:24,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:24,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:24,079 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:21:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:24,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:24,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:24,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:24,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:21:24,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:24,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:24,160 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 20 treesize of output 34 [2019-01-11 14:21:24,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:24,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:24,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:24,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:21:24,247 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:24,333 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:24,343 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:24,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:24,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:24,363 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-11 14:21:24,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:24,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:24,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:24,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:24,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:24,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:24,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:24,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:21:24,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:24,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:24,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:24,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:24,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:24,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:24,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:24,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:24,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:24,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:24,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:24,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:24,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:21:24,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:24,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:24,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 14:21:24,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:24,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:24,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:24,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:24,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:21:24,640 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:24,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:21:24,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:21:24,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:21:24,640 INFO L87 Difference]: Start difference. First operand 329 states and 1593 transitions. Second operand 8 states. [2019-01-11 14:21:24,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:24,923 INFO L93 Difference]: Finished difference Result 348 states and 1627 transitions. [2019-01-11 14:21:24,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:21:24,924 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 14:21:24,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:24,927 INFO L225 Difference]: With dead ends: 348 [2019-01-11 14:21:24,927 INFO L226 Difference]: Without dead ends: 338 [2019-01-11 14:21:24,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:21:24,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-01-11 14:21:25,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 333. [2019-01-11 14:21:25,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-01-11 14:21:25,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 1604 transitions. [2019-01-11 14:21:25,027 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 1604 transitions. Word has length 7 [2019-01-11 14:21:25,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:25,027 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 1604 transitions. [2019-01-11 14:21:25,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:21:25,027 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 1604 transitions. [2019-01-11 14:21:25,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:21:25,028 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:25,028 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:21:25,028 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:25,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:25,029 INFO L82 PathProgramCache]: Analyzing trace with hash -2088231584, now seen corresponding path program 1 times [2019-01-11 14:21:25,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:25,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:25,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:25,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:25,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:25,625 WARN L181 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-01-11 14:21:25,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:21:25,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:25,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:25,691 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:21:25,691 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [23] [2019-01-11 14:21:25,692 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:21:25,692 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:21:25,695 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:21:25,695 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:21:25,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:25,695 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:21:25,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:25,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:25,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:25,705 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:21:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:25,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:25,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:25,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:25,717 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 18 treesize of output 24 [2019-01-11 14:21:25,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:25,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:25,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:21:25,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:25,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:25,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:25,729 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 22 treesize of output 45 [2019-01-11 14:21:25,730 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:25,746 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:25,755 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:25,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:25,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:25,776 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-11 14:21:25,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:25,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:25,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:25,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:25,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:25,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:25,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:25,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:21:25,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:25,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. [2019-01-11 14:21:25,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:25,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:25,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:25,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:25,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:25,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:25,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:25,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:25,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:25,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:25,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:21:25,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:25,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:25,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 14:21:25,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:25,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:25,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:25,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:25,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:25,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:25,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:25,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:25,919 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:21:25,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:25,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-11 14:21:25,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:25,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:25,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-11 14:21:25,977 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:25,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:26,016 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:26,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:26,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:21:26,036 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:26,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:21:26,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:21:26,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:21:26,037 INFO L87 Difference]: Start difference. First operand 333 states and 1604 transitions. Second operand 10 states. [2019-01-11 14:21:26,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:26,447 INFO L93 Difference]: Finished difference Result 348 states and 1634 transitions. [2019-01-11 14:21:26,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:21:26,448 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 14:21:26,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:26,450 INFO L225 Difference]: With dead ends: 348 [2019-01-11 14:21:26,451 INFO L226 Difference]: Without dead ends: 343 [2019-01-11 14:21:26,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:21:26,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-01-11 14:21:26,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 334. [2019-01-11 14:21:26,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-01-11 14:21:26,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1603 transitions. [2019-01-11 14:21:26,535 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1603 transitions. Word has length 7 [2019-01-11 14:21:26,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:26,535 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 1603 transitions. [2019-01-11 14:21:26,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:21:26,536 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1603 transitions. [2019-01-11 14:21:26,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:21:26,537 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:26,537 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:21:26,537 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:26,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:26,537 INFO L82 PathProgramCache]: Analyzing trace with hash -2088122094, now seen corresponding path program 1 times [2019-01-11 14:21:26,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:26,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:26,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:26,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:26,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:26,703 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-11 14:21:26,784 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:21:26,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:26,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:26,785 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:21:26,785 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [21] [2019-01-11 14:21:26,786 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:21:26,786 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:21:26,788 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:21:26,788 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:21:26,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:26,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:21:26,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:26,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:26,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:26,797 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:21:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:26,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:26,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:26,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:26,808 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 18 treesize of output 24 [2019-01-11 14:21:26,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:26,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:26,816 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 20 treesize of output 34 [2019-01-11 14:21:26,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:26,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:26,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:26,822 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 22 treesize of output 45 [2019-01-11 14:21:26,822 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:26,844 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:26,852 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:26,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:26,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:26,873 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-11 14:21:26,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:26,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:26,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:26,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:26,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:26,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:26,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:26,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:21:26,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:26,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. [2019-01-11 14:21:26,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:26,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:26,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:26,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:26,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:26,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:26,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:26,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:26,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:26,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:26,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:21:26,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:27,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:27,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 14:21:27,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:27,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:27,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:27,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:27,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:27,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:27,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:27,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:27,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:27,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:27,143 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:21:27,143 INFO L303 Elim1Store]: Index analysis took 113 ms [2019-01-11 14:21:27,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-11 14:21:27,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:27,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:27,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 14:21:27,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:27,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:27,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:27,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:27,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:27,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:27,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:27,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:27,219 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:21:27,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:27,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-11 14:21:27,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:27,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:27,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-11 14:21:27,277 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:27,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:27,322 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:27,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:27,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 14:21:27,341 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:27,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:21:27,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:21:27,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:21:27,342 INFO L87 Difference]: Start difference. First operand 334 states and 1603 transitions. Second operand 12 states. [2019-01-11 14:21:27,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:27,938 INFO L93 Difference]: Finished difference Result 457 states and 2102 transitions. [2019-01-11 14:21:27,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:21:27,938 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 14:21:27,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:27,943 INFO L225 Difference]: With dead ends: 457 [2019-01-11 14:21:27,943 INFO L226 Difference]: Without dead ends: 456 [2019-01-11 14:21:27,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:21:27,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-01-11 14:21:28,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 329. [2019-01-11 14:21:28,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-01-11 14:21:28,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 1582 transitions. [2019-01-11 14:21:28,045 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 1582 transitions. Word has length 7 [2019-01-11 14:21:28,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:28,046 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 1582 transitions. [2019-01-11 14:21:28,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:21:28,046 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 1582 transitions. [2019-01-11 14:21:28,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:21:28,047 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:28,047 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:21:28,047 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:28,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:28,047 INFO L82 PathProgramCache]: Analyzing trace with hash -2084662494, now seen corresponding path program 2 times [2019-01-11 14:21:28,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:28,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:28,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:28,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:28,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:28,210 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:21:28,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:28,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:28,211 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:21:28,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:21:28,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:28,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:28,221 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:21:28,221 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:21:28,230 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:21:28,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:21:28,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:28,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:28,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,237 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 18 treesize of output 24 [2019-01-11 14:21:28,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:21:28,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,254 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 22 treesize of output 45 [2019-01-11 14:21:28,254 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:28,271 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:28,281 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:28,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:28,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:28,301 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-11 14:21:28,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:21:28,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:28,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:28,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:28,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,386 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:21:28,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-11 14:21:28,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:28,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. [2019-01-11 14:21:28,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:30 [2019-01-11 14:21:28,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-11 14:21:28,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:28,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:28,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-01-11 14:21:28,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:28,514 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:21:28,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-11 14:21:28,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:28,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:28,550 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 14:21:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:28,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:28,623 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:28,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:28,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 14:21:28,642 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:28,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:21:28,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:21:28,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:21:28,643 INFO L87 Difference]: Start difference. First operand 329 states and 1582 transitions. Second operand 11 states. [2019-01-11 14:21:29,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:29,155 INFO L93 Difference]: Finished difference Result 346 states and 1608 transitions. [2019-01-11 14:21:29,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:21:29,155 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-11 14:21:29,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:29,159 INFO L225 Difference]: With dead ends: 346 [2019-01-11 14:21:29,160 INFO L226 Difference]: Without dead ends: 345 [2019-01-11 14:21:29,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:21:29,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-01-11 14:21:29,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 213. [2019-01-11 14:21:29,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-11 14:21:29,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 1003 transitions. [2019-01-11 14:21:29,231 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 1003 transitions. Word has length 7 [2019-01-11 14:21:29,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:29,231 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 1003 transitions. [2019-01-11 14:21:29,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:21:29,231 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 1003 transitions. [2019-01-11 14:21:29,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:21:29,232 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:29,232 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:21:29,232 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:29,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:29,232 INFO L82 PathProgramCache]: Analyzing trace with hash -2084418336, now seen corresponding path program 1 times [2019-01-11 14:21:29,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:29,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:29,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:21:29,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:29,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:29,372 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:21:29,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:29,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:29,373 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:21:29,373 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [22], [23] [2019-01-11 14:21:29,374 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:21:29,375 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:21:29,377 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:21:29,377 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:21:29,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:29,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:21:29,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:29,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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:29,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:29,388 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:21:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:29,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:29,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:29,403 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 18 treesize of output 20 [2019-01-11 14:21:29,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:29,413 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 20 treesize of output 26 [2019-01-11 14:21:29,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:29,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:29,427 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-11 14:21:29,428 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:29,439 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:29,447 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:29,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:29,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:29,468 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-11 14:21:29,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:29,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:29,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:29,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:29,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 14:21:29,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:29,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:29,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 14:21:29,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:29,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:29,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:29,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:29,531 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:21:29,532 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 28 treesize of output 41 [2019-01-11 14:21:29,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:29,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. [2019-01-11 14:21:29,550 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:22 [2019-01-11 14:21:29,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:29,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:29,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:29,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:29,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:29,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:29,574 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 30 treesize of output 44 [2019-01-11 14:21:29,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:29,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. [2019-01-11 14:21:29,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:26 [2019-01-11 14:21:29,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:29,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:29,635 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:29,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:29,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:21:29,654 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:29,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:21:29,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:21:29,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:21:29,655 INFO L87 Difference]: Start difference. First operand 213 states and 1003 transitions. Second operand 10 states. [2019-01-11 14:21:30,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:30,057 INFO L93 Difference]: Finished difference Result 280 states and 1278 transitions. [2019-01-11 14:21:30,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:21:30,057 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 14:21:30,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:30,059 INFO L225 Difference]: With dead ends: 280 [2019-01-11 14:21:30,059 INFO L226 Difference]: Without dead ends: 277 [2019-01-11 14:21:30,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:21:30,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-01-11 14:21:30,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 242. [2019-01-11 14:21:30,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-01-11 14:21:30,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 1141 transitions. [2019-01-11 14:21:30,150 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 1141 transitions. Word has length 7 [2019-01-11 14:21:30,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:30,150 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 1141 transitions. [2019-01-11 14:21:30,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:21:30,150 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 1141 transitions. [2019-01-11 14:21:30,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:21:30,151 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:30,151 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:21:30,151 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:30,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:30,151 INFO L82 PathProgramCache]: Analyzing trace with hash -2080543520, now seen corresponding path program 1 times [2019-01-11 14:21:30,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:30,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:30,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:30,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:30,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:30,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:30,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:30,278 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:30,278 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:21:30,279 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [24], [25] [2019-01-11 14:21:30,280 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:21:30,280 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:21:30,283 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:21:30,283 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:21:30,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:30,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:21:30,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:30,283 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:30,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:30,293 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:21:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:30,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:30,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:30,304 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 18 treesize of output 20 [2019-01-11 14:21:30,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-01-11 14:21:30,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:30,326 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2019-01-11 14:21:30,326 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:30,335 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:30,343 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:30,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:30,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:30,360 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-01-11 14:21:30,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:30,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:30,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-11 14:21:30,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:30,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:30,388 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-11 14:21:30,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:30,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:30,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:30,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:30,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 14:21:30,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:30,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:30,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-01-11 14:21:30,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:30,447 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:30,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:30,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:30,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-11 14:21:30,480 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:30,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:21:30,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:21:30,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:21:30,481 INFO L87 Difference]: Start difference. First operand 242 states and 1141 transitions. Second operand 9 states. [2019-01-11 14:21:30,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:30,844 INFO L93 Difference]: Finished difference Result 390 states and 1798 transitions. [2019-01-11 14:21:30,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:21:30,844 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-11 14:21:30,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:30,848 INFO L225 Difference]: With dead ends: 390 [2019-01-11 14:21:30,848 INFO L226 Difference]: Without dead ends: 377 [2019-01-11 14:21:30,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:21:30,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-01-11 14:21:31,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 367. [2019-01-11 14:21:31,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-01-11 14:21:31,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1654 transitions. [2019-01-11 14:21:31,034 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1654 transitions. Word has length 7 [2019-01-11 14:21:31,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:31,035 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 1654 transitions. [2019-01-11 14:21:31,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:21:31,035 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1654 transitions. [2019-01-11 14:21:31,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:21:31,036 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:31,036 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-11 14:21:31,036 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:31,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:31,037 INFO L82 PathProgramCache]: Analyzing trace with hash -2080966800, now seen corresponding path program 4 times [2019-01-11 14:21:31,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:31,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:31,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:31,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:31,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:31,265 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 21 [2019-01-11 14:21:31,355 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:21:31,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:31,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:31,356 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:21:31,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:21:31,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:31,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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:31,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:31,365 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:21:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:31,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:31,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:31,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,378 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 18 treesize of output 24 [2019-01-11 14:21:31,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,382 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 20 treesize of output 34 [2019-01-11 14:21:31,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:21:31,389 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:31,406 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:31,416 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:31,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:31,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:31,438 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-11 14:21:31,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:21:31,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:31,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:31,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:31,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 14:21:31,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:31,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:31,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-11 14:21:31,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,591 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:21:31,592 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 73 [2019-01-11 14:21:31,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:31,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:31,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-11 14:21:31,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,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, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-11 14:21:31,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:31,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:31,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-11 14:21:31,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:31,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, 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 79 [2019-01-11 14:21:31,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:31,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:31,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 14:21:31,784 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:31,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:31,860 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:31,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:31,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-11 14:21:31,879 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:31,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 14:21:31,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 14:21:31,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=220, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:21:31,880 INFO L87 Difference]: Start difference. First operand 367 states and 1654 transitions. Second operand 13 states. [2019-01-11 14:21:32,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:32,480 INFO L93 Difference]: Finished difference Result 375 states and 1668 transitions. [2019-01-11 14:21:32,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:21:32,481 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-11 14:21:32,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:32,484 INFO L225 Difference]: With dead ends: 375 [2019-01-11 14:21:32,485 INFO L226 Difference]: Without dead ends: 374 [2019-01-11 14:21:32,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=305, Unknown=0, NotChecked=0, Total=462 [2019-01-11 14:21:32,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-01-11 14:21:32,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 147. [2019-01-11 14:21:32,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-11 14:21:32,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 607 transitions. [2019-01-11 14:21:32,613 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 607 transitions. Word has length 7 [2019-01-11 14:21:32,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:32,614 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 607 transitions. [2019-01-11 14:21:32,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 14:21:32,614 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 607 transitions. [2019-01-11 14:21:32,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:21:32,615 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:32,615 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:21:32,615 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:32,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:32,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1924438182, now seen corresponding path program 1 times [2019-01-11 14:21:32,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:32,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:32,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:32,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:32,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:32,766 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-11 14:21:32,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:21:32,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:32,817 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:32,817 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:21:32,817 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [24], [25] [2019-01-11 14:21:32,818 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:21:32,818 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:21:32,820 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:21:32,820 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:21:32,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:32,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:21:32,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:32,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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:32,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:32,830 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:21:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:32,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:32,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:32,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:32,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 18 treesize of output 24 [2019-01-11 14:21:32,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:32,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:32,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 20 treesize of output 34 [2019-01-11 14:21:32,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:32,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:32,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:32,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:21:32,933 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:32,950 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:32,959 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:32,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:32,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:32,979 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 14:21:32,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:32,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:32,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:21:33,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:33,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:33,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:33,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 14:21:33,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:33,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:33,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:33,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:33,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:33,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:33,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:33,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-11 14:21:33,149 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:33,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 14:21:33,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 14:21:33,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:21:33,150 INFO L87 Difference]: Start difference. First operand 147 states and 607 transitions. Second operand 7 states. [2019-01-11 14:21:33,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:33,436 INFO L93 Difference]: Finished difference Result 157 states and 628 transitions. [2019-01-11 14:21:33,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:21:33,436 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-11 14:21:33,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:33,438 INFO L225 Difference]: With dead ends: 157 [2019-01-11 14:21:33,438 INFO L226 Difference]: Without dead ends: 150 [2019-01-11 14:21:33,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:21:33,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-11 14:21:33,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-01-11 14:21:33,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-11 14:21:33,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 611 transitions. [2019-01-11 14:21:33,566 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 611 transitions. Word has length 7 [2019-01-11 14:21:33,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:33,566 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 611 transitions. [2019-01-11 14:21:33,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 14:21:33,566 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 611 transitions. [2019-01-11 14:21:33,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:21:33,567 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:33,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:21:33,567 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:33,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:33,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1928011116, now seen corresponding path program 1 times [2019-01-11 14:21:33,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:33,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:33,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:33,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:33,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:33,747 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:21:33,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:33,747 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:33,747 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:21:33,747 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [23] [2019-01-11 14:21:33,748 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:21:33,749 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:21:33,751 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:21:33,751 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:21:33,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:33,752 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:21:33,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:33,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:33,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:33,763 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:21:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:33,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:33,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:33,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,781 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 18 treesize of output 24 [2019-01-11 14:21:33,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,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 20 treesize of output 34 [2019-01-11 14:21:33,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:21:33,798 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:33,815 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:33,824 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:33,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:33,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:33,847 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 14:21:33,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,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 31 treesize of output 51 [2019-01-11 14:21:33,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:33,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:33,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:33,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,930 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:21:33,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-11 14:21:33,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:33,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:33,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:33,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:33,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 14:21:33,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:34,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:34,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:34,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:34,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:34,085 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:34,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:34,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:21:34,105 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:34,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:21:34,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:21:34,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:21:34,105 INFO L87 Difference]: Start difference. First operand 149 states and 611 transitions. Second operand 10 states. [2019-01-11 14:21:34,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:34,608 INFO L93 Difference]: Finished difference Result 206 states and 810 transitions. [2019-01-11 14:21:34,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:21:34,609 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 14:21:34,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:34,611 INFO L225 Difference]: With dead ends: 206 [2019-01-11 14:21:34,611 INFO L226 Difference]: Without dead ends: 199 [2019-01-11 14:21:34,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:21:34,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-01-11 14:21:34,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 158. [2019-01-11 14:21:34,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-11 14:21:34,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 646 transitions. [2019-01-11 14:21:34,796 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 646 transitions. Word has length 7 [2019-01-11 14:21:34,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:34,796 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 646 transitions. [2019-01-11 14:21:34,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:21:34,796 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 646 transitions. [2019-01-11 14:21:34,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:21:34,796 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:34,797 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:21:34,797 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:34,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:34,797 INFO L82 PathProgramCache]: Analyzing trace with hash 2042527720, now seen corresponding path program 2 times [2019-01-11 14:21:34,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:34,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:34,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:34,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:34,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:34,997 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 17 [2019-01-11 14:21:35,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:21:35,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:35,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:35,055 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:21:35,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:21:35,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:35,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:35,064 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:21:35,065 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:21:35,071 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:21:35,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:21:35,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:35,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:35,087 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 18 treesize of output 20 [2019-01-11 14:21:35,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:35,092 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 20 treesize of output 26 [2019-01-11 14:21:35,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:35,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:35,101 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-11 14:21:35,101 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:35,113 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:35,121 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:35,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:35,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:35,139 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-11 14:21:35,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:35,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:35,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:35,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:35,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 14:21:35,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:35,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:35,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 14:21:35,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:35,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:35,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:35,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:35,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:35,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:35,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:21:35,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:35,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. [2019-01-11 14:21:35,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2019-01-11 14:21:35,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:35,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:35,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:35,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:35,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:35,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:35,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:35,255 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:21:35,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, 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 55 [2019-01-11 14:21:35,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:35,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:35,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-11 14:21:35,300 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:35,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:35,337 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:35,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:35,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:21:35,355 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:35,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:21:35,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:21:35,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:21:35,356 INFO L87 Difference]: Start difference. First operand 158 states and 646 transitions. Second operand 10 states. [2019-01-11 14:21:35,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:35,814 INFO L93 Difference]: Finished difference Result 161 states and 653 transitions. [2019-01-11 14:21:35,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:21:35,814 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 14:21:35,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:35,815 INFO L225 Difference]: With dead ends: 161 [2019-01-11 14:21:35,816 INFO L226 Difference]: Without dead ends: 156 [2019-01-11 14:21:35,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:21:35,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-11 14:21:35,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 33. [2019-01-11 14:21:35,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-11 14:21:35,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 119 transitions. [2019-01-11 14:21:35,881 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 119 transitions. Word has length 7 [2019-01-11 14:21:35,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:35,881 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 119 transitions. [2019-01-11 14:21:35,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:21:35,881 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 119 transitions. [2019-01-11 14:21:35,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:21:35,881 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:35,881 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:21:35,881 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:35,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:35,882 INFO L82 PathProgramCache]: Analyzing trace with hash -305786232, now seen corresponding path program 1 times [2019-01-11 14:21:35,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:35,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:35,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:21:35,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:35,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:36,050 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:36,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:36,051 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:36,051 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 14:21:36,051 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [24], [25] [2019-01-11 14:21:36,052 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:21:36,052 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:21:36,054 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:21:36,055 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 3. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:21:36,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:36,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:21:36,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:36,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:36,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:36,066 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:21:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:36,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:36,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:36,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:36,076 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 18 treesize of output 24 [2019-01-11 14:21:36,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:36,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:36,081 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 20 treesize of output 34 [2019-01-11 14:21:36,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:36,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:36,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:36,088 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 22 treesize of output 45 [2019-01-11 14:21:36,088 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:36,104 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:36,112 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:36,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:36,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:36,134 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 14:21:36,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:36,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:36,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:36,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:36,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:36,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:36,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:36,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:21:36,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:36,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:36,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:36,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:36,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:36,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:36,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:36,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:36,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:36,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:36,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:36,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:36,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 14:21:36,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:36,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:36,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:36,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:36,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:36,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:36,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:36,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:36,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:36,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:36,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:36,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:36,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:36,288 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:21:36,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-11 14:21:36,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:36,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:36,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 14:21:36,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:36,340 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:36,371 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:36,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:36,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:21:36,390 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:36,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:21:36,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:21:36,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:21:36,391 INFO L87 Difference]: Start difference. First operand 33 states and 119 transitions. Second operand 10 states. [2019-01-11 14:21:36,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:36,757 INFO L93 Difference]: Finished difference Result 62 states and 209 transitions. [2019-01-11 14:21:36,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:21:36,757 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-11 14:21:36,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:36,758 INFO L225 Difference]: With dead ends: 62 [2019-01-11 14:21:36,758 INFO L226 Difference]: Without dead ends: 52 [2019-01-11 14:21:36,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:21:36,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-11 14:21:36,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2019-01-11 14:21:36,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-11 14:21:36,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 167 transitions. [2019-01-11 14:21:36,859 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 167 transitions. Word has length 8 [2019-01-11 14:21:36,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:36,859 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 167 transitions. [2019-01-11 14:21:36,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:21:36,860 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 167 transitions. [2019-01-11 14:21:36,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:21:36,860 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:36,860 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:21:36,860 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:36,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:36,861 INFO L82 PathProgramCache]: Analyzing trace with hash -477561138, now seen corresponding path program 1 times [2019-01-11 14:21:36,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:36,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:36,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:36,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:36,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:37,408 WARN L181 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-01-11 14:21:37,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 14:21:37,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:37,436 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:37,436 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 14:21:37,436 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [22], [24], [25] [2019-01-11 14:21:37,436 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:21:37,437 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:21:37,440 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:21:37,440 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 3. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:21:37,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:37,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:21:37,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:37,441 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:37,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:37,449 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:21:37,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:37,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:37,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:37,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:37,462 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 18 treesize of output 24 [2019-01-11 14:21:37,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:37,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:37,466 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 20 treesize of output 34 [2019-01-11 14:21:37,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:37,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:37,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:37,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:21:37,473 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:37,489 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:37,498 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:37,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:37,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:37,519 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-11 14:21:37,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:37,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:37,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:37,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:37,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:37,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:37,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:37,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:21:37,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:37,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:37,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:37,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:37,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:37,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:37,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:37,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:37,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:37,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:37,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:37,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:37,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 14:21:37,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:37,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:37,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:37,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:37,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:37,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:37,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:37,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:37,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:37,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:37,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:37,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:37,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:37,668 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:21:37,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-11 14:21:37,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:37,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. [2019-01-11 14:21:37,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 14:21:37,720 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:37,720 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:37,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:37,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:37,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2019-01-11 14:21:37,771 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:37,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:21:37,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:21:37,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:21:37,772 INFO L87 Difference]: Start difference. First operand 45 states and 167 transitions. Second operand 8 states. [2019-01-11 14:21:38,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:38,164 INFO L93 Difference]: Finished difference Result 59 states and 204 transitions. [2019-01-11 14:21:38,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:21:38,165 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-01-11 14:21:38,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:38,165 INFO L225 Difference]: With dead ends: 59 [2019-01-11 14:21:38,166 INFO L226 Difference]: Without dead ends: 52 [2019-01-11 14:21:38,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:21:38,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-11 14:21:38,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2019-01-11 14:21:38,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-11 14:21:38,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 167 transitions. [2019-01-11 14:21:38,292 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 167 transitions. Word has length 8 [2019-01-11 14:21:38,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:38,292 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 167 transitions. [2019-01-11 14:21:38,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:21:38,292 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 167 transitions. [2019-01-11 14:21:38,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:21:38,293 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:38,293 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:21:38,293 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:38,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:38,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1160942496, now seen corresponding path program 2 times [2019-01-11 14:21:38,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:38,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:38,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:38,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:38,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:38,437 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 14:21:38,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:38,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:38,437 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:21:38,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:21:38,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:38,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:38,452 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:21:38,452 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:21:38,458 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:21:38,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:21:38,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:38,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:38,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:21:38,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,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 20 treesize of output 34 [2019-01-11 14:21:38,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:21:38,486 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:38,531 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:38,540 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:38,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:38,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:38,562 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 14:21:38,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:21:38,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:38,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:38,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:38,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:21:38,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:38,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:38,673 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-11 14:21:38,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 79 [2019-01-11 14:21:38,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:38,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:38,743 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 14:21:38,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:38,775 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 89 [2019-01-11 14:21:38,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:38,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:38,815 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 14:21:38,838 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:38,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:38,903 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:38,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:38,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-01-11 14:21:38,922 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:38,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:21:38,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:21:38,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:21:38,923 INFO L87 Difference]: Start difference. First operand 45 states and 167 transitions. Second operand 10 states. [2019-01-11 14:21:39,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:39,411 INFO L93 Difference]: Finished difference Result 67 states and 237 transitions. [2019-01-11 14:21:39,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:21:39,412 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-11 14:21:39,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:39,412 INFO L225 Difference]: With dead ends: 67 [2019-01-11 14:21:39,412 INFO L226 Difference]: Without dead ends: 32 [2019-01-11 14:21:39,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:21:39,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-11 14:21:39,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-01-11 14:21:39,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-11 14:21:39,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 100 transitions. [2019-01-11 14:21:39,504 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 100 transitions. Word has length 9 [2019-01-11 14:21:39,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:39,504 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 100 transitions. [2019-01-11 14:21:39,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:21:39,504 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 100 transitions. [2019-01-11 14:21:39,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:21:39,505 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:39,505 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:21:39,505 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:39,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:39,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1292813016, now seen corresponding path program 1 times [2019-01-11 14:21:39,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:39,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:39,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:21:39,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:39,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:39,596 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 14:21:39,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:39,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:39,597 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 14:21:39,597 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [24], [25] [2019-01-11 14:21:39,598 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:21:39,598 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:21:39,601 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:21:39,601 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 3. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:21:39,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:39,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:21:39,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:39,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:39,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:39,610 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:21:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:39,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:39,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:39,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,622 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 18 treesize of output 24 [2019-01-11 14:21:39,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,635 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 20 treesize of output 34 [2019-01-11 14:21:39,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:21:39,643 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:39,660 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:39,668 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:39,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:39,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. [2019-01-11 14:21:39,689 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 14:21:39,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:21:39,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:39,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:39,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:39,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 14:21:39,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:39,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:39,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:39,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 14:21:39,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:39,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:39,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:39,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:39,902 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:21:39,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-11 14:21:39,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:39,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:39,938 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 14:21:39,956 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:39,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:39,996 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:40,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:40,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-01-11 14:21:40,015 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:40,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:21:40,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:21:40,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:21:40,016 INFO L87 Difference]: Start difference. First operand 30 states and 100 transitions. Second operand 10 states. [2019-01-11 14:21:40,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:40,392 INFO L93 Difference]: Finished difference Result 47 states and 147 transitions. [2019-01-11 14:21:40,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:21:40,393 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-11 14:21:40,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:40,394 INFO L225 Difference]: With dead ends: 47 [2019-01-11 14:21:40,394 INFO L226 Difference]: Without dead ends: 40 [2019-01-11 14:21:40,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:21:40,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-11 14:21:40,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2019-01-11 14:21:40,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-11 14:21:40,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 122 transitions. [2019-01-11 14:21:40,536 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 122 transitions. Word has length 9 [2019-01-11 14:21:40,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:40,536 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 122 transitions. [2019-01-11 14:21:40,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:21:40,536 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 122 transitions. [2019-01-11 14:21:40,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:21:40,536 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:40,537 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:21:40,537 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:40,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:40,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1875225892, now seen corresponding path program 2 times [2019-01-11 14:21:40,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:40,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:40,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:40,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:40,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:40,703 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-11 14:21:40,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:40,704 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:40,704 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:21:40,704 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:21:40,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:40,704 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:40,713 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:21:40,713 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:21:40,718 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:21:40,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:21:40,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:40,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:40,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:40,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 18 treesize of output 24 [2019-01-11 14:21:40,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:40,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:40,736 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 20 treesize of output 34 [2019-01-11 14:21:40,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:40,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:40,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:40,745 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 22 treesize of output 45 [2019-01-11 14:21:40,746 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:40,770 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:40,783 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:40,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:40,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:40,812 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-11 14:21:40,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:40,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:40,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:40,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:40,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:40,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:40,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:40,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:21:40,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:40,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:40,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:40,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:40,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:40,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:40,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:40,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:40,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:40,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:40,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:40,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:40,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 14:21:40,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:40,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:40,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:41,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:41,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:41,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:41,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:41,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:41,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:41,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:41,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:41,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:41,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:41,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:41,070 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:21:41,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-11 14:21:41,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:41,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:41,104 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 14:21:41,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:41,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:41,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:41,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:41,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:41,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:41,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:41,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:41,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:41,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:41,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:41,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:41,136 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 81 [2019-01-11 14:21:41,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:41,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:41,175 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 14:21:41,192 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:41,193 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:41,239 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:41,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:41,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 14:21:41,258 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:41,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:21:41,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:21:41,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:21:41,259 INFO L87 Difference]: Start difference. First operand 36 states and 122 transitions. Second operand 11 states. [2019-01-11 14:21:41,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:41,716 INFO L93 Difference]: Finished difference Result 52 states and 168 transitions. [2019-01-11 14:21:41,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:21:41,718 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-11 14:21:41,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:41,719 INFO L225 Difference]: With dead ends: 52 [2019-01-11 14:21:41,719 INFO L226 Difference]: Without dead ends: 45 [2019-01-11 14:21:41,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:21:41,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-11 14:21:41,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2019-01-11 14:21:41,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-11 14:21:41,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 138 transitions. [2019-01-11 14:21:41,851 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 138 transitions. Word has length 9 [2019-01-11 14:21:41,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:41,851 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 138 transitions. [2019-01-11 14:21:41,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:21:41,851 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 138 transitions. [2019-01-11 14:21:41,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:21:41,851 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:41,851 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:21:41,852 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:41,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:41,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1867837724, now seen corresponding path program 1 times [2019-01-11 14:21:41,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:41,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:41,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:21:41,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:41,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:42,037 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:21:42,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:42,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:42,037 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 14:21:42,037 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [22], [24], [25] [2019-01-11 14:21:42,038 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:21:42,039 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:21:42,041 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:21:42,041 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 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 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:21:42,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:42,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:21:42,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:42,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:42,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:42,051 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:21:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:42,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:42,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:42,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,068 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 18 treesize of output 24 [2019-01-11 14:21:42,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,075 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 20 treesize of output 34 [2019-01-11 14:21:42,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:21:42,084 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:42,104 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:42,113 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:42,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:42,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:42,133 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-11 14:21:42,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:21:42,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:42,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:42,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:42,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,482 INFO L303 Elim1Store]: Index analysis took 225 ms [2019-01-11 14:21:42,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 14:21:42,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:42,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:42,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:42,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,566 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:21:42,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-11 14:21:42,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:42,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:42,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 14:21:42,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:42,631 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:21:42,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-11 14:21:42,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:42,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:42,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 14:21:42,683 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:42,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:42,886 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:42,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:42,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 14:21:42,905 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:42,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:21:42,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:21:42,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:21:42,906 INFO L87 Difference]: Start difference. First operand 40 states and 138 transitions. Second operand 12 states. [2019-01-11 14:21:43,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:43,452 INFO L93 Difference]: Finished difference Result 66 states and 218 transitions. [2019-01-11 14:21:43,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:21:43,452 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-11 14:21:43,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:43,453 INFO L225 Difference]: With dead ends: 66 [2019-01-11 14:21:43,453 INFO L226 Difference]: Without dead ends: 56 [2019-01-11 14:21:43,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:21:43,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-11 14:21:43,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2019-01-11 14:21:43,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-11 14:21:43,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 140 transitions. [2019-01-11 14:21:43,608 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 140 transitions. Word has length 9 [2019-01-11 14:21:43,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:43,608 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 140 transitions. [2019-01-11 14:21:43,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:21:43,609 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 140 transitions. [2019-01-11 14:21:43,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-11 14:21:43,609 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:43,609 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:21:43,609 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:43,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:43,609 INFO L82 PathProgramCache]: Analyzing trace with hash 638911500, now seen corresponding path program 2 times [2019-01-11 14:21:43,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:43,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:43,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:43,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:43,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:43,795 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 19 [2019-01-11 14:21:43,940 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 14:21:43,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:43,940 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:43,940 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:21:43,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:21:43,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:43,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:21:43,949 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:21:43,949 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:21:43,957 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-11 14:21:43,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:21:43,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:43,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:21:43,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:43,963 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 18 treesize of output 24 [2019-01-11 14:21:43,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:43,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:43,968 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 20 treesize of output 34 [2019-01-11 14:21:43,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:43,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:43,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:43,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:21:43,975 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:43,992 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:44,000 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:44,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:44,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:21:44,021 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-11 14:21:44,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:21:44,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:44,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:44,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 14:21:44,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,131 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:21:44,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 58 [2019-01-11 14:21:44,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:44,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:44,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-11 14:21:44,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-11 14:21:44,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:44,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:44,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:34 [2019-01-11 14:21:44,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 81 [2019-01-11 14:21:44,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:44,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:44,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-01-11 14:21:44,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:21:44,332 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 81 [2019-01-11 14:21:44,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:44,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:21:44,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 14:21:44,390 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:44,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:44,457 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:21:44,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:44,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 16 [2019-01-11 14:21:44,476 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:44,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:21:44,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:21:44,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:21:44,477 INFO L87 Difference]: Start difference. First operand 40 states and 140 transitions. Second operand 12 states. [2019-01-11 14:21:45,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:45,082 INFO L93 Difference]: Finished difference Result 48 states and 164 transitions. [2019-01-11 14:21:45,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:21:45,082 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2019-01-11 14:21:45,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:45,082 INFO L225 Difference]: With dead ends: 48 [2019-01-11 14:21:45,083 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 14:21:45,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-01-11 14:21:45,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 14:21:45,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 14:21:45,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 14:21:45,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 14:21:45,084 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-01-11 14:21:45,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:45,085 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 14:21:45,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:21:45,085 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 14:21:45,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 14:21:45,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 14:21:45,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:45,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:45,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:45,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:45,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:45,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:45,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:45,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:45,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:45,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:45,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:45,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:45,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:45,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:45,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:45,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:45,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:45,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:45,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:45,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:46,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:46,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:46,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:46,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:46,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:47,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:47,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:47,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:47,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:47,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:47,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:47,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:47,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:47,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:47,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:47,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:47,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:48,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:48,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:48,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:48,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:48,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:48,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:48,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:48,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:49,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:49,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:49,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:49,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:49,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:49,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:49,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:49,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:49,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:49,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:49,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:50,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:50,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:50,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:50,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:50,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:50,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:50,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:50,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:50,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:50,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:50,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:51,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:51,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:51,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:51,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:51,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:51,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:52,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:52,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:52,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:52,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:53,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:53,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:53,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:53,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:53,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:53,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:53,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:54,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:54,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:54,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:55,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:21:55,582 WARN L181 SmtUtils]: Spent 10.49 s on a formula simplification. DAG size of input: 1855 DAG size of output: 1101 [2019-01-11 14:22:11,198 WARN L181 SmtUtils]: Spent 15.60 s on a formula simplification. DAG size of input: 1000 DAG size of output: 85 [2019-01-11 14:22:11,201 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-11 14:22:11,201 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 45) no Hoare annotation was computed. [2019-01-11 14:22:11,201 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 44) no Hoare annotation was computed. [2019-01-11 14:22:11,201 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-11 14:22:11,201 INFO L448 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2019-01-11 14:22:11,202 INFO L444 ceAbstractionStarter]: At program point L36-1(lines 31 41) the Hoare annotation is: (let ((.cse18 (select |#memory_int| ULTIMATE.start_main_p4)) (.cse8 (select |#memory_int| ULTIMATE.start_main_p2))) (let ((.cse10 (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse8 (- 1)))) (.cse6 (select |#memory_int| ULTIMATE.start_main_p1)) (.cse17 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse18 (- 1)))) (.cse19 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse7 (= .cse18 0)) (.cse5 (<= 0 .cse19)) (.cse2 (select .cse17 ULTIMATE.start_main_p3)) (.cse4 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse6 1))) (.cse0 (<= (+ ULTIMATE.start_main_p1 3) ULTIMATE.start_main_p4)) (.cse3 (= 0 (select .cse10 ULTIMATE.start_main_p1))) (.cse1 (= 0 (select .cse17 ULTIMATE.start_main_p2))) (.cse13 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (.cse9 (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse19 1)))) (or (and (and (and .cse0 .cse1) (<= 1 .cse2) .cse3) (<= (+ (select .cse4 ULTIMATE.start_main_p4) 1) 0)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) .cse5 (<= 0 .cse6) .cse7 (<= .cse8 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (let ((.cse11 (select .cse4 ULTIMATE.start_main_p2))) (let ((.cse14 (<= .cse18 0)) (.cse15 (<= (+ .cse11 1) 0)) (.cse12 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))) (or (and (= 0 (select .cse9 ULTIMATE.start_main_p1)) (<= 1 (select .cse10 ULTIMATE.start_main_p3)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (= 0 .cse11) .cse0 .cse7) (and (and .cse12 .cse13 .cse14 .cse5 .cse15 .cse3) (not (= ULTIMATE.start_main_p4 ULTIMATE.start_main_p3))) (and (and .cse14 (let ((.cse16 (and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 1 (select .cse17 ULTIMATE.start_main_p1)) .cse12))) (or (and .cse1 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) .cse16) (and .cse15 .cse16)))) (<= 0 .cse2))))) (and .cse0 .cse3 .cse1 (= .cse19 0) .cse13 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (<= (+ (select .cse9 ULTIMATE.start_main_p4) 1) 0)))))) [2019-01-11 14:22:11,202 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-11 14:22:11,202 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 43) no Hoare annotation was computed. [2019-01-11 14:22:11,202 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 48) no Hoare annotation was computed. [2019-01-11 14:22:11,202 INFO L448 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-01-11 14:22:11,202 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 46) no Hoare annotation was computed. [2019-01-11 14:22:11,218 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 02:22:11 BoogieIcfgContainer [2019-01-11 14:22:11,218 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 14:22:11,219 INFO L168 Benchmark]: Toolchain (without parser) took 85867.31 ms. Allocated memory was 133.2 MB in the beginning and 1.0 GB in the end (delta: 876.6 MB). Free memory was 107.1 MB in the beginning and 470.7 MB in the end (delta: -363.6 MB). Peak memory consumption was 946.5 MB. Max. memory is 7.1 GB. [2019-01-11 14:22:11,219 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.12 ms. Allocated memory is still 133.2 MB. Free memory is still 108.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-11 14:22:11,220 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.09 ms. Allocated memory is still 133.2 MB. Free memory was 106.9 MB in the beginning and 104.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-01-11 14:22:11,220 INFO L168 Benchmark]: Boogie Preprocessor took 33.14 ms. Allocated memory is still 133.2 MB. Free memory was 104.6 MB in the beginning and 103.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-01-11 14:22:11,220 INFO L168 Benchmark]: RCFGBuilder took 399.88 ms. Allocated memory is still 133.2 MB. Free memory was 103.5 MB in the beginning and 93.0 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2019-01-11 14:22:11,220 INFO L168 Benchmark]: TraceAbstraction took 85360.11 ms. Allocated memory was 133.2 MB in the beginning and 1.0 GB in the end (delta: 876.6 MB). Free memory was 92.8 MB in the beginning and 470.7 MB in the end (delta: -377.9 MB). Peak memory consumption was 932.2 MB. Max. memory is 7.1 GB. [2019-01-11 14:22:11,222 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.12 ms. Allocated memory is still 133.2 MB. Free memory is still 108.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.09 ms. Allocated memory is still 133.2 MB. Free memory was 106.9 MB in the beginning and 104.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.14 ms. Allocated memory is still 133.2 MB. Free memory was 104.6 MB in the beginning and 103.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 399.88 ms. Allocated memory is still 133.2 MB. Free memory was 103.5 MB in the beginning and 93.0 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 85360.11 ms. Allocated memory was 133.2 MB in the beginning and 1.0 GB in the end (delta: 876.6 MB). Free memory was 92.8 MB in the beginning and 470.7 MB in the end (delta: -377.9 MB). Peak memory consumption was 932.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 46]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 44]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 45]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((((((p1 + 3 <= p4 && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0) || ((((((p3 < p4 && p2 < p3) && 0 <= #memory_int[p3]) && 0 <= #memory_int[p1]) && #memory_int[p4] == 0) && #memory_int[p2] <= 0) && p1 < p2)) || ((((((0 == #memory_int[p3 := #memory_int[p3] + 1][p1] && 1 <= #memory_int[p2 := #memory_int[p2] + -1][p3]) && !(p2 == p4)) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) && p1 + 3 <= p4) && #memory_int[p4] == 0) || ((((((!(p1 == p4) && !(p1 == p3)) && #memory_int[p4] <= 0) && 0 <= #memory_int[p3]) && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && !(p4 == p3))) || ((#memory_int[p4] <= 0 && (((0 == #memory_int[p4 := #memory_int[p4] + -1][p2] && !(p2 == p3)) && (!(p1 == p2) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p4)) || (#memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0 && (!(p1 == p2) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p4)))) && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p3])) || ((((((p1 + 3 <= p4 && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && #memory_int[p3] == 0) && !(p1 == p3)) && !(p3 == p2)) && #memory_int[p3 := #memory_int[p3] + 1][p4] + 1 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 4 error locations. SAFE Result, 85.2s OverallTime, 57 OverallIterations, 2 TraceHistogramMax, 21.5s AutomataDifference, 0.0s DeadEndRemovalTime, 26.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 210 SDtfs, 857 SDslu, 1 SDs, 0 SdLazy, 8790 SolverSat, 608 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 875 GetRequests, 174 SyntacticMatches, 38 SemanticMatches, 663 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2487 ImplicationChecksByTransitivity, 19.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=367occurred in iteration=46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 43 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 57 MinimizatonAttempts, 1522 StatesRemovedByMinimization, 56 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 64 NumberOfFragments, 342 HoareAnnotationTreeSize, 1 FomulaSimplifications, 181006621 FormulaSimplificationTreeSizeReduction, 10.4s HoareSimplificationTime, 1 FomulaSimplificationsInter, 10044512 FormulaSimplificationTreeSizeReductionInter, 15.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 31.7s InterpolantComputationTime, 648 NumberOfCodeBlocks, 648 NumberOfCodeBlocksAsserted, 129 NumberOfCheckSat, 802 ConstructedInterpolants, 235 QuantifiedInterpolants, 90984 SizeOfPredicates, 162 NumberOfNonLiveVariables, 1237 ConjunctsInSsa, 390 ConjunctsInUnsatCore, 165 InterpolantComputations, 7 PerfectInterpolantSequences, 158/841 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...