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-b7bd044-m [2019-01-18 17:31:18,210 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-18 17:31:18,212 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-18 17:31:18,229 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-18 17:31:18,229 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-18 17:31:18,230 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-18 17:31:18,232 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-18 17:31:18,235 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-18 17:31:18,236 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-18 17:31:18,238 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-18 17:31:18,239 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-18 17:31:18,240 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-18 17:31:18,242 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-18 17:31:18,245 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-18 17:31:18,246 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-18 17:31:18,247 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-18 17:31:18,254 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-18 17:31:18,256 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-18 17:31:18,258 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-18 17:31:18,260 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-18 17:31:18,261 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-18 17:31:18,262 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-18 17:31:18,264 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-18 17:31:18,264 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-18 17:31:18,265 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-18 17:31:18,265 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-18 17:31:18,266 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-18 17:31:18,267 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-18 17:31:18,268 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-18 17:31:18,269 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-18 17:31:18,269 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-18 17:31:18,270 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-18 17:31:18,270 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-18 17:31:18,270 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-18 17:31:18,271 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-18 17:31:18,272 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-18 17:31:18,272 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-18 17:31:18,284 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-18 17:31:18,285 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-18 17:31:18,285 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-18 17:31:18,286 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-18 17:31:18,286 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-18 17:31:18,286 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-18 17:31:18,286 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-18 17:31:18,287 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-18 17:31:18,287 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-18 17:31:18,287 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-18 17:31:18,287 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-18 17:31:18,287 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-18 17:31:18,287 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-18 17:31:18,288 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-18 17:31:18,288 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-18 17:31:18,288 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-18 17:31:18,289 INFO L133 SettingsManager]: * Use SBE=true [2019-01-18 17:31:18,289 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-18 17:31:18,289 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-18 17:31:18,289 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-18 17:31:18,289 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-18 17:31:18,290 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-18 17:31:18,290 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-18 17:31:18,290 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-18 17:31:18,290 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-18 17:31:18,290 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-18 17:31:18,291 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-18 17:31:18,291 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-18 17:31:18,291 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-18 17:31:18,291 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-18 17:31:18,291 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-18 17:31:18,291 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 17:31:18,292 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-18 17:31:18,292 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-18 17:31:18,292 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-18 17:31:18,292 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-18 17:31:18,292 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-18 17:31:18,293 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-18 17:31:18,293 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-18 17:31:18,293 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-18 17:31:18,326 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-18 17:31:18,337 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-18 17:31:18,340 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-18 17:31:18,342 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-18 17:31:18,342 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-18 17:31:18,343 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-18 17:31:18,343 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl' [2019-01-18 17:31:18,377 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-18 17:31:18,378 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-18 17:31:18,379 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-18 17:31:18,379 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-18 17:31:18,379 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-18 17:31:18,395 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 18.01 05:31:18" (1/1) ... [2019-01-18 17:31:18,408 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 18.01 05:31:18" (1/1) ... [2019-01-18 17:31:18,432 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-18 17:31:18,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-18 17:31:18,434 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-18 17:31:18,434 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-18 17:31:18,445 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 18.01 05:31:18" (1/1) ... [2019-01-18 17:31:18,445 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 18.01 05:31:18" (1/1) ... [2019-01-18 17:31:18,447 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 18.01 05:31:18" (1/1) ... [2019-01-18 17:31:18,447 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 18.01 05:31:18" (1/1) ... [2019-01-18 17:31:18,450 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 18.01 05:31:18" (1/1) ... [2019-01-18 17:31:18,454 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 18.01 05:31:18" (1/1) ... [2019-01-18 17:31:18,455 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 18.01 05:31:18" (1/1) ... [2019-01-18 17:31:18,457 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-18 17:31:18,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-18 17:31:18,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-18 17:31:18,457 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-18 17:31:18,458 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 18.01 05:31:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 17:31:18,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-18 17:31:18,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-18 17:31:18,861 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-18 17:31:18,861 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-18 17:31:18,863 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 05:31:18 BoogieIcfgContainer [2019-01-18 17:31:18,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-18 17:31:18,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-18 17:31:18,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-18 17:31:18,867 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-18 17:31:18,867 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 18.01 05:31:18" (1/2) ... [2019-01-18 17:31:18,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf192db and model type speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 05:31:18, skipping insertion in model container [2019-01-18 17:31:18,869 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 18.01 05:31:18" (2/2) ... [2019-01-18 17:31:18,871 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-limited.bpl [2019-01-18 17:31:18,880 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-18 17:31:18,888 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-18 17:31:18,906 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-18 17:31:18,938 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-18 17:31:18,938 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-18 17:31:18,939 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-18 17:31:18,939 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-18 17:31:18,939 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-18 17:31:18,939 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-18 17:31:18,939 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-18 17:31:18,940 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-18 17:31:18,955 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-01-18 17:31:18,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-18 17:31:18,962 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:18,963 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-18 17:31:18,965 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:18,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:18,972 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-01-18 17:31:18,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:19,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:19,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:19,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:19,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:19,204 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-18 17:31:19,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:31:19,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-18 17:31:19,206 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:31:19,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 17:31:19,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 17:31:19,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 17:31:19,237 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-01-18 17:31:19,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:19,474 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-01-18 17:31:19,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 17:31:19,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-18 17:31:19,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:19,489 INFO L225 Difference]: With dead ends: 21 [2019-01-18 17:31:19,489 INFO L226 Difference]: Without dead ends: 16 [2019-01-18 17:31:19,493 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-18 17:31:19,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-18 17:31:19,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-01-18 17:31:19,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-18 17:31:19,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-01-18 17:31:19,524 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-01-18 17:31:19,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:19,526 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-01-18 17:31:19,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 17:31:19,526 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-01-18 17:31:19,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 17:31:19,527 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:19,527 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 17:31:19,528 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:19,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:19,528 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-01-18 17:31:19,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:19,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:19,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:19,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:19,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:19,641 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-18 17:31:19,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:19,642 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:19,642 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 17:31:19,644 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-01-18 17:31:19,695 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:19,695 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:19,780 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:19,781 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-18 17:31:19,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:19,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:19,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:19,787 INFO 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-18 17:31:19,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:19,797 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:19,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:19,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:31:19,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:19,886 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-18 17:31:19,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:19,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:19,930 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-18 17:31:19,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:19,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:19,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:19,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 17:31:19,958 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:19,996 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:20,139 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:20,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:20,337 INFO L267 ElimStorePlain]: 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-18 17:31:20,337 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-18 17:31:20,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:20,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:20,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:20,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:20,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:20,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:20,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:20,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:31:20,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:20,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:20,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:20,540 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-18 17:31:20,541 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:20,640 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-18 17:31:20,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:20,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-18 17:31:20,661 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:20,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 17:31:20,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 17:31:20,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:31:20,663 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 6 states. [2019-01-18 17:31:21,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:21,043 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2019-01-18 17:31:21,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:31:21,045 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-18 17:31:21,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:21,047 INFO L225 Difference]: With dead ends: 31 [2019-01-18 17:31:21,047 INFO L226 Difference]: Without dead ends: 28 [2019-01-18 17:31:21,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-18 17:31:21,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-18 17:31:21,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 13. [2019-01-18 17:31:21,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-18 17:31:21,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2019-01-18 17:31:21,053 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 25 transitions. Word has length 3 [2019-01-18 17:31:21,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:21,054 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 25 transitions. [2019-01-18 17:31:21,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 17:31:21,054 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 25 transitions. [2019-01-18 17:31:21,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 17:31:21,057 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:21,057 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 17:31:21,057 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:21,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:21,057 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-01-18 17:31:21,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:21,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:21,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:21,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:21,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:21,088 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-18 17:31:21,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:31:21,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-18 17:31:21,089 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:31:21,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 17:31:21,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 17:31:21,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 17:31:21,090 INFO L87 Difference]: Start difference. First operand 13 states and 25 transitions. Second operand 3 states. [2019-01-18 17:31:21,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:21,124 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2019-01-18 17:31:21,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 17:31:21,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-18 17:31:21,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:21,125 INFO L225 Difference]: With dead ends: 15 [2019-01-18 17:31:21,125 INFO L226 Difference]: Without dead ends: 14 [2019-01-18 17:31:21,127 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-18 17:31:21,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-18 17:31:21,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-01-18 17:31:21,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-18 17:31:21,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2019-01-18 17:31:21,133 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 3 [2019-01-18 17:31:21,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:21,133 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 24 transitions. [2019-01-18 17:31:21,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 17:31:21,133 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 24 transitions. [2019-01-18 17:31:21,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 17:31:21,134 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:21,134 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 17:31:21,134 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:21,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:21,134 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-01-18 17:31:21,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:21,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:21,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:21,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:21,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:21,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:21,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:21,204 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:21,205 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 17:31:21,205 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-01-18 17:31:21,209 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:21,209 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:21,217 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:21,218 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-18 17:31:21,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:21,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:21,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:21,218 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:31:21,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:21,227 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:21,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:21,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:31:21,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:21,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-18 17:31:21,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:21,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:21,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-18 17:31:21,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:21,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:21,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:21,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 22 treesize of output 45 [2019-01-18 17:31:21,426 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:21,573 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:21,588 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:21,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:21,618 INFO L267 ElimStorePlain]: 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-18 17:31:21,619 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:25, output treesize:30 [2019-01-18 17:31:21,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:21,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:21,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:21,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:21,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:21,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:21,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:21,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:31:21,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:21,757 INFO L267 ElimStorePlain]: 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-18 17:31:21,757 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:21,772 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-18 17:31:21,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:21,788 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-18 17:31:21,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-18 17:31:21,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-18 17:31:21,808 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:31:21,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 17:31:21,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 17:31:21,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:31:21,809 INFO L87 Difference]: Start difference. First operand 13 states and 24 transitions. Second operand 4 states. [2019-01-18 17:31:21,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:21,862 INFO L93 Difference]: Finished difference Result 18 states and 41 transitions. [2019-01-18 17:31:21,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 17:31:21,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-18 17:31:21,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:21,863 INFO L225 Difference]: With dead ends: 18 [2019-01-18 17:31:21,863 INFO L226 Difference]: Without dead ends: 17 [2019-01-18 17:31:21,864 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-18 17:31:21,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-18 17:31:21,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-01-18 17:31:21,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-18 17:31:21,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2019-01-18 17:31:21,882 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 40 transitions. Word has length 3 [2019-01-18 17:31:21,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:21,882 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 40 transitions. [2019-01-18 17:31:21,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 17:31:21,882 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 40 transitions. [2019-01-18 17:31:21,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 17:31:21,883 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:21,883 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 17:31:21,883 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:21,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:21,884 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-01-18 17:31:21,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:21,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:21,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:21,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:21,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:21,971 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-18 17:31:21,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:21,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:21,971 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 17:31:21,972 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-01-18 17:31:21,976 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:21,976 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:21,982 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:21,983 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-18 17:31:21,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:21,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:21,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:22,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 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-18 17:31:22,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:22,065 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:22,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:22,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:31:22,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:22,085 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-18 17:31:22,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:22,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:22,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-18 17:31:22,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:22,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:22,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:22,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-18 17:31:22,116 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:22,144 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:22,159 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:22,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:22,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:22,188 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-18 17:31:22,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:22,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:22,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:22,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:22,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:22,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:22,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:22,242 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-18 17:31:22,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:22,287 INFO L267 ElimStorePlain]: 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-18 17:31:22,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:22,338 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-18 17:31:22,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:22,358 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-18 17:31:22,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:22,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-18 17:31:22,377 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:22,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 17:31:22,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 17:31:22,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:31:22,379 INFO L87 Difference]: Start difference. First operand 16 states and 40 transitions. Second operand 6 states. [2019-01-18 17:31:22,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:22,574 INFO L93 Difference]: Finished difference Result 32 states and 62 transitions. [2019-01-18 17:31:22,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:31:22,575 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-18 17:31:22,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:22,576 INFO L225 Difference]: With dead ends: 32 [2019-01-18 17:31:22,577 INFO L226 Difference]: Without dead ends: 31 [2019-01-18 17:31:22,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-18 17:31:22,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-18 17:31:22,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2019-01-18 17:31:22,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-18 17:31:22,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2019-01-18 17:31:22,583 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 50 transitions. Word has length 3 [2019-01-18 17:31:22,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:22,584 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 50 transitions. [2019-01-18 17:31:22,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 17:31:22,584 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 50 transitions. [2019-01-18 17:31:22,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:31:22,584 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:22,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:31:22,585 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:22,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:22,585 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2019-01-18 17:31:22,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:22,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:22,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:22,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:22,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:22,666 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-18 17:31:22,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:22,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:22,667 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:31:22,667 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2019-01-18 17:31:22,670 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:22,670 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:22,679 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:22,679 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-18 17:31:22,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:22,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:22,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:22,680 INFO 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-18 17:31:22,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:22,689 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:22,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:22,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:31:22,707 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-18 17:31:22,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:22,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-18 17:31:22,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:22,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:22,734 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-18 17:31:22,734 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:22,776 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:22,812 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:22,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:22,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:22,845 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-01-18 17:31:22,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:22,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:22,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:22,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:22,938 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-18 17:31:22,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:22,963 INFO L267 ElimStorePlain]: 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-18 17:31:22,963 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-18 17:31:22,978 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-18 17:31:22,979 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:23,014 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-18 17:31:23,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-18 17:31:23,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-18 17:31:23,034 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:31:23,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 17:31:23,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 17:31:23,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:31:23,035 INFO L87 Difference]: Start difference. First operand 18 states and 50 transitions. Second operand 4 states. [2019-01-18 17:31:23,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:23,073 INFO L93 Difference]: Finished difference Result 22 states and 58 transitions. [2019-01-18 17:31:23,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 17:31:23,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-18 17:31:23,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:23,074 INFO L225 Difference]: With dead ends: 22 [2019-01-18 17:31:23,074 INFO L226 Difference]: Without dead ends: 21 [2019-01-18 17:31:23,074 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-18 17:31:23,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-18 17:31:23,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-01-18 17:31:23,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-18 17:31:23,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2019-01-18 17:31:23,080 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 57 transitions. Word has length 4 [2019-01-18 17:31:23,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:23,080 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 57 transitions. [2019-01-18 17:31:23,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 17:31:23,080 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 57 transitions. [2019-01-18 17:31:23,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:31:23,081 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:23,081 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:31:23,081 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:23,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:23,082 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2019-01-18 17:31:23,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:23,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:23,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:23,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:23,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:23,188 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-18 17:31:23,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:23,189 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:23,189 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:31:23,189 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2019-01-18 17:31:23,192 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:23,192 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:23,197 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:23,198 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-18 17:31:23,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:23,198 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:23,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:23,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:31:23,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:23,213 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:23,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:23,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:31:23,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:23,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, 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-18 17:31:23,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:23,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:23,259 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-18 17:31:23,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:23,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:23,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:23,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 17:31:23,271 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:23,298 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:23,310 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:23,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:23,337 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-18 17:31:23,338 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-18 17:31:23,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:23,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:23,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:23,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:23,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:23,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:23,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:23,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:31:23,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:23,452 INFO L267 ElimStorePlain]: 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-18 17:31:23,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:23,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:23,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:23,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:23,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:23,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:23,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:23,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:23,485 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:31:23,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:31:23,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:23,548 INFO L267 ElimStorePlain]: 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-18 17:31:23,549 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-18 17:31:23,564 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-18 17:31:23,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:23,672 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-18 17:31:23,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:23,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:31:23,692 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:23,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:31:23,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:31:23,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:31:23,693 INFO L87 Difference]: Start difference. First operand 20 states and 57 transitions. Second operand 8 states. [2019-01-18 17:31:24,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:24,084 INFO L93 Difference]: Finished difference Result 37 states and 74 transitions. [2019-01-18 17:31:24,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:31:24,085 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 17:31:24,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:24,086 INFO L225 Difference]: With dead ends: 37 [2019-01-18 17:31:24,086 INFO L226 Difference]: Without dead ends: 36 [2019-01-18 17:31:24,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:31:24,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-18 17:31:24,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 17. [2019-01-18 17:31:24,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-18 17:31:24,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2019-01-18 17:31:24,093 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 41 transitions. Word has length 4 [2019-01-18 17:31:24,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:24,093 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 41 transitions. [2019-01-18 17:31:24,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:31:24,093 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 41 transitions. [2019-01-18 17:31:24,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:31:24,094 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:24,094 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:31:24,094 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:24,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:24,094 INFO L82 PathProgramCache]: Analyzing trace with hash 939350, now seen corresponding path program 1 times [2019-01-18 17:31:24,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:24,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:24,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:24,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:24,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:24,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:24,202 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-18 17:31:24,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:24,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:24,203 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:31:24,203 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2019-01-18 17:31:24,205 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:24,205 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:24,210 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:24,211 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-18 17:31:24,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:24,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:24,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:24,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 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-18 17:31:24,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:24,222 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:24,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:24,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-18 17:31:24,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:24,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-18 17:31:24,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:24,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:24,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-18 17:31:24,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:24,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:24,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:24,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 17:31:24,278 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:24,301 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:24,311 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:24,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:24,334 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-18 17:31:24,334 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-18 17:31:24,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:24,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:24,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:24,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:24,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:24,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:24,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:24,542 INFO L303 Elim1Store]: Index analysis took 188 ms [2019-01-18 17:31:24,544 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-18 17:31:24,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:24,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:24,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:24,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:24,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:24,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:24,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:24,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:24,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:24,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:24,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:24,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:24,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-18 17:31:24,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:24,835 INFO L267 ElimStorePlain]: 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-18 17:31:24,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-18 17:31:24,851 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-18 17:31:24,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:24,878 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-18 17:31:24,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:24,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:31:24,898 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:24,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:31:24,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:31:24,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:31:24,899 INFO L87 Difference]: Start difference. First operand 17 states and 41 transitions. Second operand 8 states. [2019-01-18 17:31:25,170 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-01-18 17:31:25,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:25,368 INFO L93 Difference]: Finished difference Result 42 states and 89 transitions. [2019-01-18 17:31:25,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:31:25,368 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 17:31:25,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:25,369 INFO L225 Difference]: With dead ends: 42 [2019-01-18 17:31:25,370 INFO L226 Difference]: Without dead ends: 38 [2019-01-18 17:31:25,370 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-18 17:31:25,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-18 17:31:25,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 22. [2019-01-18 17:31:25,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-18 17:31:25,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 65 transitions. [2019-01-18 17:31:25,378 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 65 transitions. Word has length 4 [2019-01-18 17:31:25,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:25,379 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 65 transitions. [2019-01-18 17:31:25,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:31:25,379 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 65 transitions. [2019-01-18 17:31:25,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:31:25,380 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:25,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:31:25,380 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:25,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:25,380 INFO L82 PathProgramCache]: Analyzing trace with hash 929802, now seen corresponding path program 1 times [2019-01-18 17:31:25,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:25,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:25,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:25,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:25,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:25,518 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-18 17:31:25,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:25,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:25,519 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:31:25,519 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2019-01-18 17:31:25,520 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:25,520 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:25,525 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:25,525 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-18 17:31:25,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:25,526 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:25,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:25,526 INFO 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-18 17:31:25,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:25,536 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:25,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:25,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:31:25,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:25,553 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-18 17:31:25,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:25,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:25,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-18 17:31:25,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:25,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:25,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:25,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 17:31:25,571 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:25,590 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:25,600 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:25,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:25,621 INFO L267 ElimStorePlain]: 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-18 17:31:25,621 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-18 17:31:25,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:25,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:25,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:25,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:25,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:25,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:25,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:25,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:31:25,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:25,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:25,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:25,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:25,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:25,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:25,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:25,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:25,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:25,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:25,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:25,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:25,776 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-18 17:31:25,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:25,828 INFO L267 ElimStorePlain]: 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-18 17:31:25,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:25,844 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-18 17:31:25,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:25,881 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-18 17:31:25,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:25,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:31:25,901 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:25,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:31:25,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:31:25,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:31:25,902 INFO L87 Difference]: Start difference. First operand 22 states and 65 transitions. Second operand 8 states. [2019-01-18 17:31:26,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:26,262 INFO L93 Difference]: Finished difference Result 51 states and 112 transitions. [2019-01-18 17:31:26,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:31:26,262 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 17:31:26,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:26,263 INFO L225 Difference]: With dead ends: 51 [2019-01-18 17:31:26,263 INFO L226 Difference]: Without dead ends: 48 [2019-01-18 17:31:26,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:31:26,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-18 17:31:26,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 28. [2019-01-18 17:31:26,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-18 17:31:26,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 88 transitions. [2019-01-18 17:31:26,272 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 88 transitions. Word has length 4 [2019-01-18 17:31:26,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:26,272 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 88 transitions. [2019-01-18 17:31:26,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:31:26,273 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 88 transitions. [2019-01-18 17:31:26,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:31:26,273 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:26,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:31:26,274 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:26,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:26,274 INFO L82 PathProgramCache]: Analyzing trace with hash 929928, now seen corresponding path program 1 times [2019-01-18 17:31:26,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:26,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:26,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:26,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:26,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:26,343 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-18 17:31:26,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:26,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:26,344 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:31:26,344 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [21] [2019-01-18 17:31:26,349 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:26,349 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:26,354 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:26,354 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-18 17:31:26,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:26,355 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:26,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:26,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:31:26,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:26,374 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:26,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:26,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:31:26,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:26,388 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-18 17:31:26,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:26,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:26,400 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-18 17:31:26,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:26,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:26,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:26,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 17:31:26,414 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:26,444 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:26,456 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:26,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:26,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:26,479 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-18 17:31:26,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:26,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:26,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:26,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:26,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:26,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:26,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:26,509 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-18 17:31:26,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:26,541 INFO L267 ElimStorePlain]: 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-18 17:31:26,542 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:26,556 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-18 17:31:26,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:26,599 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-18 17:31:26,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:26,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-18 17:31:26,618 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:26,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 17:31:26,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 17:31:26,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:31:26,619 INFO L87 Difference]: Start difference. First operand 28 states and 88 transitions. Second operand 6 states. [2019-01-18 17:31:26,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:26,833 INFO L93 Difference]: Finished difference Result 36 states and 98 transitions. [2019-01-18 17:31:26,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:31:26,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-18 17:31:26,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:26,835 INFO L225 Difference]: With dead ends: 36 [2019-01-18 17:31:26,835 INFO L226 Difference]: Without dead ends: 35 [2019-01-18 17:31:26,836 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-18 17:31:26,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-18 17:31:26,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-01-18 17:31:26,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-18 17:31:26,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 92 transitions. [2019-01-18 17:31:26,844 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 92 transitions. Word has length 4 [2019-01-18 17:31:26,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:26,844 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 92 transitions. [2019-01-18 17:31:26,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 17:31:26,844 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 92 transitions. [2019-01-18 17:31:26,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:31:26,845 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:26,845 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:31:26,845 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:26,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:26,846 INFO L82 PathProgramCache]: Analyzing trace with hash 929616, now seen corresponding path program 1 times [2019-01-18 17:31:26,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:26,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:26,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:26,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:26,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:26,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:26,920 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-18 17:31:26,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:26,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:26,921 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:31:26,921 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [19] [2019-01-18 17:31:26,922 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:26,922 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:26,927 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:26,928 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-18 17:31:26,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:26,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:26,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:26,928 INFO 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-18 17:31:26,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:26,937 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:26,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:26,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:31:26,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:26,955 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-18 17:31:26,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:26,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:26,962 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-18 17:31:27,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:27,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:27,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:27,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 17:31:27,019 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:27,044 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:27,054 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:27,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:27,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:27,075 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-18 17:31:27,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:27,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:27,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:27,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:27,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:27,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:27,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:27,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:31:27,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:27,132 INFO L267 ElimStorePlain]: 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-18 17:31:27,132 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:27,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:27,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:27,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:27,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:27,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:27,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:27,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:27,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:27,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:27,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:31:27,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:27,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:27,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:27,216 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-18 17:31:27,216 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:27,240 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-18 17:31:27,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:27,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:31:27,260 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:27,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:31:27,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:31:27,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:31:27,261 INFO L87 Difference]: Start difference. First operand 29 states and 92 transitions. Second operand 8 states. [2019-01-18 17:31:27,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:27,691 INFO L93 Difference]: Finished difference Result 55 states and 140 transitions. [2019-01-18 17:31:27,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:31:27,692 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 17:31:27,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:27,693 INFO L225 Difference]: With dead ends: 55 [2019-01-18 17:31:27,694 INFO L226 Difference]: Without dead ends: 54 [2019-01-18 17:31:27,694 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-18 17:31:27,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-18 17:31:27,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 34. [2019-01-18 17:31:27,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-18 17:31:27,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 117 transitions. [2019-01-18 17:31:27,705 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 117 transitions. Word has length 4 [2019-01-18 17:31:27,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:27,705 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 117 transitions. [2019-01-18 17:31:27,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:31:27,706 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 117 transitions. [2019-01-18 17:31:27,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:31:27,706 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:27,706 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:31:27,707 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:27,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:27,707 INFO L82 PathProgramCache]: Analyzing trace with hash 933584, now seen corresponding path program 1 times [2019-01-18 17:31:27,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:27,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:27,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:27,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:27,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:27,861 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-18 17:31:27,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:27,861 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:27,862 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:31:27,862 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [19] [2019-01-18 17:31:27,864 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:27,864 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:27,869 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:27,870 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-18 17:31:27,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:27,870 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:27,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:27,871 INFO 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-18 17:31:27,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:27,882 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:27,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:27,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:31:27,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:27,903 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-18 17:31:27,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:27,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:27,912 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-18 17:31:27,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:27,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:27,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:27,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 17:31:27,929 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:27,946 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:27,956 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:27,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:27,980 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-18 17:31:27,980 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-18 17:31:28,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:28,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:28,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:28,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:28,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:28,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:28,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:28,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-18 17:31:28,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:28,037 INFO L267 ElimStorePlain]: 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-18 17:31:28,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:28,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:28,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:28,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:28,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:28,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:28,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:28,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:28,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:28,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:28,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:31:28,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:28,141 INFO L267 ElimStorePlain]: 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-18 17:31:28,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-18 17:31:28,158 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-18 17:31:28,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:28,178 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-18 17:31:28,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:28,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:31:28,198 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:28,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:31:28,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:31:28,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:31:28,199 INFO L87 Difference]: Start difference. First operand 34 states and 117 transitions. Second operand 8 states. [2019-01-18 17:31:28,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:28,462 INFO L93 Difference]: Finished difference Result 56 states and 150 transitions. [2019-01-18 17:31:28,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:31:28,462 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 17:31:28,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:28,463 INFO L225 Difference]: With dead ends: 56 [2019-01-18 17:31:28,463 INFO L226 Difference]: Without dead ends: 54 [2019-01-18 17:31:28,463 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-18 17:31:28,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-18 17:31:28,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 36. [2019-01-18 17:31:28,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-18 17:31:28,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 127 transitions. [2019-01-18 17:31:28,472 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 127 transitions. Word has length 4 [2019-01-18 17:31:28,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:28,472 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 127 transitions. [2019-01-18 17:31:28,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:31:28,472 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 127 transitions. [2019-01-18 17:31:28,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:31:28,473 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:28,473 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:31:28,473 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:28,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:28,474 INFO L82 PathProgramCache]: Analyzing trace with hash 937616, now seen corresponding path program 1 times [2019-01-18 17:31:28,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:28,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:28,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:28,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:28,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:28,581 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-18 17:31:28,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:28,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:28,582 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:31:28,582 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [21] [2019-01-18 17:31:28,583 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:28,583 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:28,588 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:28,588 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-18 17:31:28,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:28,589 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:28,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:28,589 INFO 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-18 17:31:28,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:28,597 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:28,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:28,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:31:28,616 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-18 17:31:28,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:28,629 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-18 17:31:28,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:28,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:28,644 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-18 17:31:28,645 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:28,662 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:28,676 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:28,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:28,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-18 17:31:28,695 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-01-18 17:31:28,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:28,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:28,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:28,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:28,818 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-18 17:31:28,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:28,866 INFO L267 ElimStorePlain]: 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-18 17:31:28,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-18 17:31:28,877 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-18 17:31:28,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:28,891 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-18 17:31:28,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:28,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-18 17:31:28,910 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:28,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 17:31:28,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 17:31:28,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:31:28,911 INFO L87 Difference]: Start difference. First operand 36 states and 127 transitions. Second operand 6 states. [2019-01-18 17:31:29,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:29,041 INFO L93 Difference]: Finished difference Result 48 states and 142 transitions. [2019-01-18 17:31:29,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:31:29,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-18 17:31:29,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:29,042 INFO L225 Difference]: With dead ends: 48 [2019-01-18 17:31:29,042 INFO L226 Difference]: Without dead ends: 47 [2019-01-18 17:31:29,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-18 17:31:29,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-18 17:31:29,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2019-01-18 17:31:29,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-18 17:31:29,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 127 transitions. [2019-01-18 17:31:29,052 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 127 transitions. Word has length 4 [2019-01-18 17:31:29,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:29,052 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 127 transitions. [2019-01-18 17:31:29,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 17:31:29,053 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 127 transitions. [2019-01-18 17:31:29,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:31:29,053 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:29,053 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:31:29,054 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:29,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:29,054 INFO L82 PathProgramCache]: Analyzing trace with hash 29112214, now seen corresponding path program 1 times [2019-01-18 17:31:29,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:29,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:29,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:29,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:29,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:29,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:29,156 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-18 17:31:29,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:29,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:29,157 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:31:29,157 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [21] [2019-01-18 17:31:29,160 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:29,160 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:29,164 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:29,164 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-18 17:31:29,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:29,164 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:29,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:29,165 INFO 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-18 17:31:29,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:29,178 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:29,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:29,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:31:29,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:29,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-18 17:31:29,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:29,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:29,205 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-18 17:31:29,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:29,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:29,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:29,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-18 17:31:29,218 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:29,246 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:29,255 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:29,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:29,278 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-18 17:31:29,278 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-18 17:31:29,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:29,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:29,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:29,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:29,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:29,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:29,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:29,307 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-18 17:31:29,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:29,332 INFO L267 ElimStorePlain]: 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-18 17:31:29,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:29,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:29,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:29,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:29,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:29,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:29,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:29,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:29,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:29,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:29,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-18 17:31:29,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:29,399 INFO L267 ElimStorePlain]: 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-18 17:31:29,399 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-18 17:31:29,415 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-18 17:31:29,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:29,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:29,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:29,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:31:29,488 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:29,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:31:29,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:31:29,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:31:29,489 INFO L87 Difference]: Start difference. First operand 36 states and 127 transitions. Second operand 8 states. [2019-01-18 17:31:29,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:29,735 INFO L93 Difference]: Finished difference Result 56 states and 161 transitions. [2019-01-18 17:31:29,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:31:29,735 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 17:31:29,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:29,736 INFO L225 Difference]: With dead ends: 56 [2019-01-18 17:31:29,736 INFO L226 Difference]: Without dead ends: 55 [2019-01-18 17:31:29,737 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-18 17:31:29,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-18 17:31:29,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2019-01-18 17:31:29,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-18 17:31:29,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 142 transitions. [2019-01-18 17:31:29,747 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 142 transitions. Word has length 5 [2019-01-18 17:31:29,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:29,747 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 142 transitions. [2019-01-18 17:31:29,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:31:29,752 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 142 transitions. [2019-01-18 17:31:29,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:31:29,753 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:29,753 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:31:29,753 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:29,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:29,756 INFO L82 PathProgramCache]: Analyzing trace with hash 29111902, now seen corresponding path program 1 times [2019-01-18 17:31:29,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:29,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:29,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:29,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:29,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:29,900 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-18 17:31:29,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:29,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:29,900 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:31:29,901 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [19] [2019-01-18 17:31:29,901 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:29,902 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:29,906 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:29,906 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-18 17:31:29,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:29,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:29,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:29,907 INFO 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-18 17:31:29,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:29,920 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:29,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:29,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-18 17:31:29,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:29,946 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-18 17:31:29,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:29,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:29,950 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-18 17:31:29,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:29,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:29,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:29,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 22 treesize of output 45 [2019-01-18 17:31:29,958 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:29,981 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:29,989 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:29,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:30,011 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-18 17:31:30,011 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-18 17:31:30,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:30,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:30,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:30,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:30,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:30,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:30,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:30,073 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-18 17:31:30,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:30,106 INFO L267 ElimStorePlain]: 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-18 17:31:30,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:30,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:30,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:30,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:30,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:30,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:30,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:30,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:30,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:30,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:30,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:31:30,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:30,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-18 17:31:30,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-18 17:31:30,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:30,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:30,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:30,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:30,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:30,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:30,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:30,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:30,263 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:31:30,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:30,266 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-18 17:31:30,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:30,312 INFO L267 ElimStorePlain]: 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-18 17:31:30,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-18 17:31:30,328 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-18 17:31:30,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:30,418 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-18 17:31:30,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:30,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:31:30,437 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:30,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:31:30,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:31:30,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:31:30,439 INFO L87 Difference]: Start difference. First operand 39 states and 142 transitions. Second operand 10 states. [2019-01-18 17:31:30,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:30,981 INFO L93 Difference]: Finished difference Result 76 states and 212 transitions. [2019-01-18 17:31:30,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:31:30,982 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-18 17:31:30,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:30,983 INFO L225 Difference]: With dead ends: 76 [2019-01-18 17:31:30,983 INFO L226 Difference]: Without dead ends: 75 [2019-01-18 17:31:30,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:31:30,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-18 17:31:30,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 41. [2019-01-18 17:31:30,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-18 17:31:30,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-01-18 17:31:30,996 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-01-18 17:31:30,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:30,996 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-01-18 17:31:30,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:31:30,996 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-01-18 17:31:30,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:31:30,997 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:30,997 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:31:30,997 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:30,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:30,997 INFO L82 PathProgramCache]: Analyzing trace with hash 29115870, now seen corresponding path program 1 times [2019-01-18 17:31:30,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:30,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:30,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:30,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:30,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:31,159 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-18 17:31:31,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:31,159 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:31,159 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:31:31,159 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [19] [2019-01-18 17:31:31,161 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:31,161 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:31,165 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:31,165 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-18 17:31:31,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:31,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:31,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:31,166 INFO 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-18 17:31:31,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:31,180 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:31,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:31,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:31:31,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:31,203 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-18 17:31:31,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:31,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:31,210 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-18 17:31:31,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:31,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:31,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:31,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-18 17:31:31,222 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:31,266 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:31,274 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:31,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:31,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:31,298 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-18 17:31:31,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:31,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:31,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:31,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:31,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:31,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:31,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:31,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 45 [2019-01-18 17:31:31,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:31,357 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-18 17:31:31,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:31,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:31,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:31,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:31,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:31,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:31,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:31,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:31,392 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:31:31,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:31:31,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:31,421 INFO L267 ElimStorePlain]: 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-18 17:31:31,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-18 17:31:31,638 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-18 17:31:31,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:31,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:31,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:31,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:31,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:31,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:31,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:31,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:31,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:31,739 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-18 17:31:31,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:31,776 INFO L267 ElimStorePlain]: 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-18 17:31:31,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-18 17:31:31,797 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-18 17:31:31,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:31,836 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-18 17:31:31,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:31,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:31:31,855 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:31,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:31:31,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:31:31,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:31:31,855 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 10 states. [2019-01-18 17:31:32,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:32,403 INFO L93 Difference]: Finished difference Result 67 states and 187 transitions. [2019-01-18 17:31:32,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:31:32,404 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-18 17:31:32,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:32,405 INFO L225 Difference]: With dead ends: 67 [2019-01-18 17:31:32,405 INFO L226 Difference]: Without dead ends: 65 [2019-01-18 17:31:32,406 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-18 17:31:32,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-18 17:31:32,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2019-01-18 17:31:32,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-18 17:31:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 142 transitions. [2019-01-18 17:31:32,416 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 142 transitions. Word has length 5 [2019-01-18 17:31:32,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:32,416 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 142 transitions. [2019-01-18 17:31:32,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:31:32,417 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 142 transitions. [2019-01-18 17:31:32,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:31:32,417 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:32,417 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:31:32,418 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:32,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:32,418 INFO L82 PathProgramCache]: Analyzing trace with hash 29119902, now seen corresponding path program 1 times [2019-01-18 17:31:32,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:32,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:32,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:32,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:32,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:32,534 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-18 17:31:32,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:32,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:32,535 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:31:32,535 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [21] [2019-01-18 17:31:32,537 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:32,537 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:32,541 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:32,541 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-18 17:31:32,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:32,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:32,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:32,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:31:32,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:32,556 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:32,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:32,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:31:32,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 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-18 17:31:32,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:32,631 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-18 17:31:32,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:32,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:32,641 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-18 17:31:32,642 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:32,654 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:32,660 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:32,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:32,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:32,679 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-18 17:31:32,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:32,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:32,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:32,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:32,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-18 17:31:32,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:32,722 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-18 17:31:32,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-18 17:31:32,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:32,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:32,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:32,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:32,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:32,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:32,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 17:31:32,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:32,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:32,766 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-18 17:31:32,780 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-18 17:31:32,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:32,802 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-18 17:31:32,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:32,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:31:32,822 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:32,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:31:32,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:31:32,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:31:32,823 INFO L87 Difference]: Start difference. First operand 39 states and 142 transitions. Second operand 8 states. [2019-01-18 17:31:33,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:33,036 INFO L93 Difference]: Finished difference Result 58 states and 171 transitions. [2019-01-18 17:31:33,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:31:33,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 17:31:33,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:33,038 INFO L225 Difference]: With dead ends: 58 [2019-01-18 17:31:33,038 INFO L226 Difference]: Without dead ends: 57 [2019-01-18 17:31:33,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:31:33,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-18 17:31:33,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2019-01-18 17:31:33,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-18 17:31:33,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-01-18 17:31:33,050 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-01-18 17:31:33,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:33,050 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-01-18 17:31:33,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:31:33,051 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-01-18 17:31:33,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:31:33,051 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:33,051 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:31:33,052 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:33,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:33,052 INFO L82 PathProgramCache]: Analyzing trace with hash 28823602, now seen corresponding path program 2 times [2019-01-18 17:31:33,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:33,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:33,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:33,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:33,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:33,202 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-18 17:31:33,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:33,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:33,202 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:31:33,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:31:33,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:33,203 INFO 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-18 17:31:33,219 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:31:33,219 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:31:33,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:31:33,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:31:33,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:33,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-18 17:31:33,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:33,238 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-18 17:31:33,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:33,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:33,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-18 17:31:33,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:33,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:33,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:33,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, 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-18 17:31:33,264 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:33,281 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:33,297 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:33,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:33,316 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-18 17:31:33,316 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-18 17:31:33,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:33,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:33,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:33,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:33,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:33,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:33,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:33,344 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-18 17:31:33,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:33,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:33,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:33,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:33,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:33,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:33,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:33,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:33,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:33,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:33,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:33,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:33,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 31 treesize of output 57 [2019-01-18 17:31:33,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:33,468 INFO L267 ElimStorePlain]: 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-18 17:31:33,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:33,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:33,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:33,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:33,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:33,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:33,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:33,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:33,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:33,497 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:31:33,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:33,499 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-18 17:31:33,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:33,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:33,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-18 17:31:33,568 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:33,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:33,605 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-18 17:31:33,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:33,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:31:33,624 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:33,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:31:33,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:31:33,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:31:33,625 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 10 states. [2019-01-18 17:31:33,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:33,988 INFO L93 Difference]: Finished difference Result 71 states and 199 transitions. [2019-01-18 17:31:33,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:31:33,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-18 17:31:33,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:33,990 INFO L225 Difference]: With dead ends: 71 [2019-01-18 17:31:33,990 INFO L226 Difference]: Without dead ends: 70 [2019-01-18 17:31:33,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:31:33,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-18 17:31:34,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 30. [2019-01-18 17:31:34,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-18 17:31:34,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2019-01-18 17:31:34,001 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 5 [2019-01-18 17:31:34,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:34,001 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2019-01-18 17:31:34,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:31:34,001 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2019-01-18 17:31:34,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:31:34,002 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:34,002 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:31:34,002 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:34,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:34,002 INFO L82 PathProgramCache]: Analyzing trace with hash 28827822, now seen corresponding path program 1 times [2019-01-18 17:31:34,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:34,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:34,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:31:34,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:34,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:34,227 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-01-18 17:31:34,232 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-18 17:31:34,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:31:34,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-18 17:31:34,233 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:31:34,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 17:31:34,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 17:31:34,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-18 17:31:34,233 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 4 states. [2019-01-18 17:31:34,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:34,439 INFO L93 Difference]: Finished difference Result 36 states and 106 transitions. [2019-01-18 17:31:34,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 17:31:34,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-18 17:31:34,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:34,440 INFO L225 Difference]: With dead ends: 36 [2019-01-18 17:31:34,441 INFO L226 Difference]: Without dead ends: 33 [2019-01-18 17:31:34,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-18 17:31:34,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-18 17:31:34,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2019-01-18 17:31:34,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-18 17:31:34,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 99 transitions. [2019-01-18 17:31:34,455 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 99 transitions. Word has length 5 [2019-01-18 17:31:34,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:34,456 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 99 transitions. [2019-01-18 17:31:34,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 17:31:34,456 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 99 transitions. [2019-01-18 17:31:34,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:31:34,456 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:34,456 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:31:34,457 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:34,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:34,460 INFO L82 PathProgramCache]: Analyzing trace with hash 28818148, now seen corresponding path program 1 times [2019-01-18 17:31:34,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:34,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:34,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:34,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:34,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:34,658 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-18 17:31:34,675 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-18 17:31:34,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:34,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:34,675 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:31:34,676 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [21] [2019-01-18 17:31:34,677 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:34,677 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:34,680 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:34,680 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-18 17:31:34,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:34,681 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:34,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:34,681 INFO 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-18 17:31:34,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:34,692 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:34,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:34,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:31:34,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:34,707 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-18 17:31:34,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:34,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:34,712 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-18 17:31:34,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:34,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:34,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:34,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 17:31:34,727 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:34,751 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:34,764 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:34,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:34,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:34,787 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-18 17:31:34,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:34,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:34,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:34,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:34,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:34,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:34,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:34,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:31:34,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:34,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-18 17:31:34,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:34,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:34,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:34,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:34,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:34,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:34,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:34,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:34,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:34,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:34,884 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-18 17:31:34,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:34,918 INFO L267 ElimStorePlain]: 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-18 17:31:34,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:34,956 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-18 17:31:34,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:34,968 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-18 17:31:34,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:34,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 17:31:34,987 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:34,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:31:34,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:31:34,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:31:34,988 INFO L87 Difference]: Start difference. First operand 29 states and 99 transitions. Second operand 8 states. [2019-01-18 17:31:35,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:35,232 INFO L93 Difference]: Finished difference Result 44 states and 125 transitions. [2019-01-18 17:31:35,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:31:35,232 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 17:31:35,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:35,233 INFO L225 Difference]: With dead ends: 44 [2019-01-18 17:31:35,233 INFO L226 Difference]: Without dead ends: 43 [2019-01-18 17:31:35,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:31:35,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-18 17:31:35,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2019-01-18 17:31:35,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-18 17:31:35,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 114 transitions. [2019-01-18 17:31:35,245 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 114 transitions. Word has length 5 [2019-01-18 17:31:35,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:35,245 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 114 transitions. [2019-01-18 17:31:35,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:31:35,245 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 114 transitions. [2019-01-18 17:31:35,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:31:35,246 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:35,246 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:31:35,246 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:35,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:35,246 INFO L82 PathProgramCache]: Analyzing trace with hash 28821992, now seen corresponding path program 1 times [2019-01-18 17:31:35,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:35,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:35,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:35,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:35,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:35,366 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-18 17:31:35,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:35,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:35,367 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:31:35,367 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [21] [2019-01-18 17:31:35,368 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:35,368 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:35,371 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:35,371 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-18 17:31:35,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:35,371 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:35,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:35,372 INFO 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-18 17:31:35,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:35,383 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:35,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:35,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:31:35,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:35,397 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-18 17:31:35,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:35,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:35,406 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-18 17:31:35,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:35,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:35,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:35,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-18 17:31:35,420 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:35,445 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:35,458 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:35,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:35,484 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-18 17:31:35,484 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-18 17:31:35,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:35,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:35,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:35,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:35,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:35,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:35,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:35,544 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-18 17:31:35,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:35,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:35,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:35,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:35,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:35,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:35,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:35,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:35,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:35,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:35,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:35,640 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:31:35,641 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-18 17:31:35,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:35,671 INFO L267 ElimStorePlain]: 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-18 17:31:35,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:35,691 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-18 17:31:35,691 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:35,714 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-18 17:31:35,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:35,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:31:35,733 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:35,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:31:35,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:31:35,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:31:35,734 INFO L87 Difference]: Start difference. First operand 32 states and 114 transitions. Second operand 8 states. [2019-01-18 17:31:36,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:36,026 INFO L93 Difference]: Finished difference Result 49 states and 142 transitions. [2019-01-18 17:31:36,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:31:36,026 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 17:31:36,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:36,027 INFO L225 Difference]: With dead ends: 49 [2019-01-18 17:31:36,027 INFO L226 Difference]: Without dead ends: 48 [2019-01-18 17:31:36,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:31:36,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-18 17:31:36,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-01-18 17:31:36,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-18 17:31:36,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 124 transitions. [2019-01-18 17:31:36,040 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 124 transitions. Word has length 5 [2019-01-18 17:31:36,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:36,040 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 124 transitions. [2019-01-18 17:31:36,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:31:36,040 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 124 transitions. [2019-01-18 17:31:36,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:31:36,041 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:36,041 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:31:36,041 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:36,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:36,041 INFO L82 PathProgramCache]: Analyzing trace with hash 28933468, now seen corresponding path program 2 times [2019-01-18 17:31:36,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:36,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:36,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:36,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:36,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:36,290 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2019-01-18 17:31:36,301 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-18 17:31:36,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:36,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:36,302 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:31:36,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:31:36,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:36,303 INFO 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-18 17:31:36,312 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:31:36,312 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:31:36,316 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-18 17:31:36,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:31:36,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:36,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-18 17:31:36,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:36,332 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-18 17:31:36,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:36,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:36,339 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-18 17:31:36,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:36,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:36,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:36,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 17:31:36,349 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:36,370 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:36,386 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:36,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:36,409 INFO L267 ElimStorePlain]: 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-18 17:31:36,409 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-18 17:31:36,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:36,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:36,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:36,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:36,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:36,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:36,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:36,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-18 17:31:36,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:36,459 INFO L267 ElimStorePlain]: 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-18 17:31:36,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:36,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:36,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:36,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:36,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:36,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:36,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:36,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:36,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:36,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:36,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:31:36,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:36,519 INFO L267 ElimStorePlain]: 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-18 17:31:36,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-18 17:31:36,570 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-18 17:31:36,571 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:36,589 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-18 17:31:36,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:36,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:31:36,609 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:36,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:31:36,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:31:36,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:31:36,610 INFO L87 Difference]: Start difference. First operand 34 states and 124 transitions. Second operand 8 states. [2019-01-18 17:31:37,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:37,124 INFO L93 Difference]: Finished difference Result 58 states and 161 transitions. [2019-01-18 17:31:37,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:31:37,125 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 17:31:37,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:37,126 INFO L225 Difference]: With dead ends: 58 [2019-01-18 17:31:37,127 INFO L226 Difference]: Without dead ends: 57 [2019-01-18 17:31:37,127 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-18 17:31:37,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-18 17:31:37,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2019-01-18 17:31:37,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-18 17:31:37,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 134 transitions. [2019-01-18 17:31:37,143 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 134 transitions. Word has length 5 [2019-01-18 17:31:37,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:37,143 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 134 transitions. [2019-01-18 17:31:37,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:31:37,143 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 134 transitions. [2019-01-18 17:31:37,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:31:37,144 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:37,144 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:31:37,144 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:37,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:37,144 INFO L82 PathProgramCache]: Analyzing trace with hash 28941156, now seen corresponding path program 1 times [2019-01-18 17:31:37,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:37,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:37,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:31:37,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:37,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:37,234 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-18 17:31:37,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:37,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:37,235 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:31:37,235 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [21] [2019-01-18 17:31:37,237 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:37,237 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:37,240 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:37,240 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-18 17:31:37,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:37,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:37,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:37,241 INFO 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-18 17:31:37,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:37,259 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:37,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:37,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:31:37,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-18 17:31:37,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:37,297 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-18 17:31:37,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:37,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:37,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 17:31:37,313 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:37,333 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:37,345 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:37,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:37,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:37,368 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-01-18 17:31:37,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:37,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:37,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:37,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:37,402 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-18 17:31:37,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:37,421 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-18 17:31:37,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-18 17:31:37,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:37,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:37,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:37,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:37,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:37,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:37,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 17:31:37,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:37,768 INFO L267 ElimStorePlain]: 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-18 17:31:37,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-18 17:31:37,890 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-18 17:31:37,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:37,907 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-18 17:31:37,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:37,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:31:37,926 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:37,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:31:37,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:31:37,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:31:37,926 INFO L87 Difference]: Start difference. First operand 36 states and 134 transitions. Second operand 8 states. [2019-01-18 17:31:38,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:38,187 INFO L93 Difference]: Finished difference Result 59 states and 162 transitions. [2019-01-18 17:31:38,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:31:38,188 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 17:31:38,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:38,189 INFO L225 Difference]: With dead ends: 59 [2019-01-18 17:31:38,189 INFO L226 Difference]: Without dead ends: 58 [2019-01-18 17:31:38,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 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-18 17:31:38,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-18 17:31:38,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 37. [2019-01-18 17:31:38,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-18 17:31:38,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 139 transitions. [2019-01-18 17:31:38,200 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 139 transitions. Word has length 5 [2019-01-18 17:31:38,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:38,201 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 139 transitions. [2019-01-18 17:31:38,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:31:38,201 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 139 transitions. [2019-01-18 17:31:38,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:31:38,201 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:38,202 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:31:38,202 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:38,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:38,202 INFO L82 PathProgramCache]: Analyzing trace with hash 29066150, now seen corresponding path program 1 times [2019-01-18 17:31:38,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:38,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:38,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:38,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:38,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:38,237 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-18 17:31:38,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:38,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:38,238 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:31:38,238 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [22], [23] [2019-01-18 17:31:38,239 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:38,239 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:38,242 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:38,242 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-18 17:31:38,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:38,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:38,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:38,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:31:38,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:38,254 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:38,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:38,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-18 17:31:38,264 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-18 17:31:38,271 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-18 17:31:38,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:38,297 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-18 17:31:38,297 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:38,310 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:38,318 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:38,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:38,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:38,336 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:19, output treesize:24 [2019-01-18 17:31:38,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:38,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:38,353 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-18 17:31:38,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:38,363 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-18 17:31:38,363 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-18 17:31:38,372 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-18 17:31:38,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:38,376 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-18 17:31:38,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-18 17:31:38,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-18 17:31:38,395 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:31:38,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 17:31:38,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 17:31:38,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-18 17:31:38,396 INFO L87 Difference]: Start difference. First operand 37 states and 139 transitions. Second operand 4 states. [2019-01-18 17:31:38,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:38,664 INFO L93 Difference]: Finished difference Result 74 states and 262 transitions. [2019-01-18 17:31:38,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 17:31:38,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-18 17:31:38,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:38,665 INFO L225 Difference]: With dead ends: 74 [2019-01-18 17:31:38,665 INFO L226 Difference]: Without dead ends: 73 [2019-01-18 17:31:38,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-18 17:31:38,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-18 17:31:38,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2019-01-18 17:31:38,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-18 17:31:38,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 250 transitions. [2019-01-18 17:31:38,683 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 250 transitions. Word has length 5 [2019-01-18 17:31:38,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:38,683 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 250 transitions. [2019-01-18 17:31:38,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 17:31:38,683 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 250 transitions. [2019-01-18 17:31:38,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:31:38,684 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:38,684 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:31:38,685 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:38,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:38,685 INFO L82 PathProgramCache]: Analyzing trace with hash 29052506, now seen corresponding path program 1 times [2019-01-18 17:31:38,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:38,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:38,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:38,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:38,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:38,952 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 18 [2019-01-18 17:31:39,002 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-18 17:31:39,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:39,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:39,003 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:31:39,003 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [19] [2019-01-18 17:31:39,004 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:39,004 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:39,007 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:39,007 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-18 17:31:39,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:39,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:39,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:39,008 INFO 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-18 17:31:39,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:39,019 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:39,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:39,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:31:39,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:39,029 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-18 17:31:39,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:39,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:39,033 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-18 17:31:39,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:39,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:39,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:39,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 17:31:39,042 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:39,071 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:39,081 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:39,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:39,103 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-18 17:31:39,104 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-18 17:31:39,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:39,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:39,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:39,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:39,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:39,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:39,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:39,294 INFO L303 Elim1Store]: Index analysis took 174 ms [2019-01-18 17:31:39,295 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-18 17:31:39,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:39,407 INFO L267 ElimStorePlain]: 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-18 17:31:39,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:39,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:39,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:39,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:39,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:39,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:39,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:39,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:39,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:39,434 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:31:39,435 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-18 17:31:39,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:39,465 INFO L267 ElimStorePlain]: 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-18 17:31:39,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:39,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:39,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:39,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:39,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:39,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:39,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:39,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:39,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:39,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:39,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:31:39,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:39,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:39,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:39,540 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-18 17:31:39,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:39,570 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-18 17:31:39,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:39,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 17:31:39,589 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:39,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:31:39,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:31:39,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:31:39,589 INFO L87 Difference]: Start difference. First operand 59 states and 250 transitions. Second operand 10 states. [2019-01-18 17:31:39,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:39,983 INFO L93 Difference]: Finished difference Result 105 states and 359 transitions. [2019-01-18 17:31:39,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:31:39,983 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-18 17:31:39,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:39,984 INFO L225 Difference]: With dead ends: 105 [2019-01-18 17:31:39,985 INFO L226 Difference]: Without dead ends: 97 [2019-01-18 17:31:39,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-01-18 17:31:39,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-18 17:31:40,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 71. [2019-01-18 17:31:40,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-18 17:31:40,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 308 transitions. [2019-01-18 17:31:40,006 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 308 transitions. Word has length 5 [2019-01-18 17:31:40,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:40,006 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 308 transitions. [2019-01-18 17:31:40,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:31:40,006 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 308 transitions. [2019-01-18 17:31:40,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:31:40,007 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:40,007 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-18 17:31:40,007 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:40,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:40,007 INFO L82 PathProgramCache]: Analyzing trace with hash 902776598, now seen corresponding path program 1 times [2019-01-18 17:31:40,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:40,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:40,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:40,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:40,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:40,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:40,128 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-18 17:31:40,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:40,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:40,129 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:31:40,129 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [22], [23] [2019-01-18 17:31:40,132 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:40,132 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:40,142 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:40,142 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-18 17:31:40,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:40,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:40,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:40,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:31:40,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:40,156 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:40,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:40,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:31:40,169 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-18 17:31:40,182 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-18 17:31:40,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:40,216 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-18 17:31:40,216 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:40,230 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:40,236 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:40,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:40,251 INFO L267 ElimStorePlain]: 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-18 17:31:40,252 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-01-18 17:31:40,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:40,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:40,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-18 17:31:40,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:40,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:40,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-18 17:31:40,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:40,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:40,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:40,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:40,674 INFO L303 Elim1Store]: Index analysis took 102 ms [2019-01-18 17:31:40,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-18 17:31:40,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:40,715 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-18 17:31:40,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:14 [2019-01-18 17:31:40,727 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-18 17:31:40,728 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:40,785 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-18 17:31:40,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:40,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-18 17:31:40,803 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:40,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-18 17:31:40,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-18 17:31:40,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:31:40,804 INFO L87 Difference]: Start difference. First operand 71 states and 308 transitions. Second operand 7 states. [2019-01-18 17:31:40,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:40,962 INFO L93 Difference]: Finished difference Result 85 states and 324 transitions. [2019-01-18 17:31:40,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:31:40,963 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-01-18 17:31:40,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:40,964 INFO L225 Difference]: With dead ends: 85 [2019-01-18 17:31:40,964 INFO L226 Difference]: Without dead ends: 80 [2019-01-18 17:31:40,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:31:40,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-18 17:31:40,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2019-01-18 17:31:40,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-18 17:31:40,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2019-01-18 17:31:40,984 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2019-01-18 17:31:40,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:40,984 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2019-01-18 17:31:40,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-18 17:31:40,985 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2019-01-18 17:31:40,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:31:40,985 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:40,985 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:31:40,986 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:40,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:40,986 INFO L82 PathProgramCache]: Analyzing trace with hash 902478688, now seen corresponding path program 1 times [2019-01-18 17:31:40,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:40,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:40,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:40,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:40,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:41,087 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-18 17:31:41,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:41,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:41,087 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:31:41,087 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [23] [2019-01-18 17:31:41,089 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:41,089 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:41,094 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:41,094 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-18 17:31:41,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:41,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:41,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:41,095 INFO 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-18 17:31:41,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:41,111 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:41,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:41,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:31:41,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:41,130 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-18 17:31:41,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:41,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:41,141 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-18 17:31:41,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:41,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:41,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:41,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 17:31:41,159 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:41,229 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:41,243 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:41,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:41,265 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-18 17:31:41,266 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-18 17:31:41,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:41,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:41,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:41,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:41,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:41,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:41,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:41,370 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-18 17:31:41,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:41,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:41,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:41,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:41,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:41,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:41,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:41,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:41,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:41,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:41,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:41,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:41,432 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-18 17:31:41,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:41,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:41,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-18 17:31:41,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-18 17:31:41,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:41,507 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-18 17:31:41,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:41,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:31:41,525 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:41,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:31:41,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:31:41,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:31:41,526 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 8 states. [2019-01-18 17:31:41,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:41,757 INFO L93 Difference]: Finished difference Result 83 states and 322 transitions. [2019-01-18 17:31:41,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:31:41,758 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-18 17:31:41,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:41,759 INFO L225 Difference]: With dead ends: 83 [2019-01-18 17:31:41,759 INFO L226 Difference]: Without dead ends: 82 [2019-01-18 17:31:41,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:31:41,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-18 17:31:41,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 71. [2019-01-18 17:31:41,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-18 17:31:41,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2019-01-18 17:31:41,777 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2019-01-18 17:31:41,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:41,778 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2019-01-18 17:31:41,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:31:41,778 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2019-01-18 17:31:41,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:31:41,778 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:41,778 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:31:41,778 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:41,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:41,779 INFO L82 PathProgramCache]: Analyzing trace with hash 902469014, now seen corresponding path program 1 times [2019-01-18 17:31:41,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:41,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:41,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:41,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:41,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:42,059 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-18 17:31:42,113 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-18 17:31:42,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:42,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:42,114 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:31:42,114 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [21] [2019-01-18 17:31:42,115 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:42,116 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:42,118 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:42,118 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-18 17:31:42,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:42,119 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:42,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:42,119 INFO 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-18 17:31:42,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:42,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:42,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:42,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:31:42,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:42,145 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-18 17:31:42,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:42,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:42,153 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-18 17:31:42,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:42,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:42,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:42,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-18 17:31:42,159 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:42,177 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:42,185 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:42,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:42,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:42,209 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-18 17:31:42,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:42,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:42,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:42,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:42,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:42,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:42,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:42,236 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-18 17:31:42,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:42,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:42,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:42,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:42,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:42,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:42,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:42,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:42,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:42,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:42,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:42,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:42,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:31:42,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:42,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:42,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-18 17:31:42,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:42,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:42,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:42,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:42,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:42,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:42,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:42,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:42,582 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:31:42,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:42,604 INFO L303 Elim1Store]: Index analysis took 241 ms [2019-01-18 17:31:42,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, 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-18 17:31:42,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:43,027 INFO L267 ElimStorePlain]: 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-18 17:31:43,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-18 17:31:43,263 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-18 17:31:43,265 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-18 17:31:43,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:43,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:43,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:43,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 17:31:43,499 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:43,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:31:43,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:31:43,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:31:43,500 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 10 states. [2019-01-18 17:31:43,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:43,880 INFO L93 Difference]: Finished difference Result 97 states and 346 transitions. [2019-01-18 17:31:43,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:31:43,881 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 17:31:43,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:43,882 INFO L225 Difference]: With dead ends: 97 [2019-01-18 17:31:43,882 INFO L226 Difference]: Without dead ends: 96 [2019-01-18 17:31:43,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:31:43,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-18 17:31:43,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2019-01-18 17:31:43,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-18 17:31:43,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2019-01-18 17:31:43,902 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2019-01-18 17:31:43,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:43,902 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2019-01-18 17:31:43,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:31:43,902 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2019-01-18 17:31:43,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:31:43,903 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:43,903 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:31:43,903 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:43,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:43,903 INFO L82 PathProgramCache]: Analyzing trace with hash 902472858, now seen corresponding path program 1 times [2019-01-18 17:31:43,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:43,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:43,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:43,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:43,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:44,090 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-18 17:31:44,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:44,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:44,091 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:31:44,091 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [21] [2019-01-18 17:31:44,092 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:44,093 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:44,095 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:44,095 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-18 17:31:44,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:44,096 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:44,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:44,096 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:31:44,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:44,106 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:44,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:44,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:44,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:31:44,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:44,120 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-18 17:31:44,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:44,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:44,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-18 17:31:44,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:44,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:44,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:44,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 17:31:44,130 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:44,145 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:44,155 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:44,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:44,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:44,177 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-18 17:31:44,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:44,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:44,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:44,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:44,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:44,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:44,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:44,208 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-18 17:31:44,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:44,238 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-18 17:31:44,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:44,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:44,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:44,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:44,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:44,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:44,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:44,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:44,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:44,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:44,277 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-18 17:31:44,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:44,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:44,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-18 17:31:44,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:44,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:44,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:44,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:44,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:44,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:44,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:44,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:44,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:44,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:44,353 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:31:44,354 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-18 17:31:44,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:44,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:44,388 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-18 17:31:44,408 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-18 17:31:44,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:44,451 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-18 17:31:44,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:44,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:31:44,470 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:44,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:31:44,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:31:44,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:31:44,471 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 10 states. [2019-01-18 17:31:44,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:44,880 INFO L93 Difference]: Finished difference Result 102 states and 389 transitions. [2019-01-18 17:31:44,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:31:44,881 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 17:31:44,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:44,882 INFO L225 Difference]: With dead ends: 102 [2019-01-18 17:31:44,882 INFO L226 Difference]: Without dead ends: 101 [2019-01-18 17:31:44,883 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-18 17:31:44,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-18 17:31:44,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2019-01-18 17:31:44,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-18 17:31:44,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 357 transitions. [2019-01-18 17:31:44,912 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 357 transitions. Word has length 6 [2019-01-18 17:31:44,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:44,912 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 357 transitions. [2019-01-18 17:31:44,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:31:44,912 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 357 transitions. [2019-01-18 17:31:44,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:31:44,913 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:44,913 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:31:44,913 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:44,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:44,913 INFO L82 PathProgramCache]: Analyzing trace with hash 902592022, now seen corresponding path program 1 times [2019-01-18 17:31:44,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:44,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:44,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:44,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:44,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:45,175 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-18 17:31:45,219 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-18 17:31:45,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:45,219 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:45,219 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:31:45,220 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [21] [2019-01-18 17:31:45,222 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:45,222 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:45,225 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:45,225 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-18 17:31:45,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:45,226 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:45,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:45,226 INFO 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-18 17:31:45,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:45,236 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:45,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:45,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:45,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:31:45,247 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-18 17:31:45,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:45,251 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-18 17:31:45,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:45,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:45,261 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-18 17:31:45,262 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:45,274 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:45,282 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:45,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:45,301 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-18 17:31:45,301 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-18 17:31:45,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:45,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:45,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:45,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:45,333 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-18 17:31:45,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:45,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:45,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-18 17:31:45,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:45,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:45,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:45,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:45,372 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:31:45,373 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-18 17:31:45,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:45,389 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-18 17:31:45,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:22 [2019-01-18 17:31:45,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:45,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:45,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:45,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:45,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:45,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:45,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 17:31:45,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:45,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:45,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:26 [2019-01-18 17:31:45,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:45,447 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:45,524 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-18 17:31:45,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:45,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:31:45,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:45,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:31:45,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:31:45,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:31:45,544 INFO L87 Difference]: Start difference. First operand 81 states and 357 transitions. Second operand 10 states. [2019-01-18 17:31:46,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:46,040 INFO L93 Difference]: Finished difference Result 108 states and 386 transitions. [2019-01-18 17:31:46,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:31:46,041 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 17:31:46,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:46,043 INFO L225 Difference]: With dead ends: 108 [2019-01-18 17:31:46,043 INFO L226 Difference]: Without dead ends: 107 [2019-01-18 17:31:46,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:31:46,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-18 17:31:46,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 77. [2019-01-18 17:31:46,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-18 17:31:46,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 337 transitions. [2019-01-18 17:31:46,071 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 337 transitions. Word has length 6 [2019-01-18 17:31:46,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:46,071 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 337 transitions. [2019-01-18 17:31:46,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:31:46,071 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 337 transitions. [2019-01-18 17:31:46,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:31:46,072 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:46,072 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:31:46,072 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:46,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:46,073 INFO L82 PathProgramCache]: Analyzing trace with hash 902591586, now seen corresponding path program 1 times [2019-01-18 17:31:46,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:46,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:46,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:46,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:46,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:46,216 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-18 17:31:46,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:46,217 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:46,217 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:31:46,217 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [19] [2019-01-18 17:31:46,218 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:46,218 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:46,221 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:46,221 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-18 17:31:46,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:46,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:46,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:46,222 INFO 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-18 17:31:46,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:46,231 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:46,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:46,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:31:46,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,241 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-18 17:31:46,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,252 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-18 17:31:46,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,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, 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-18 17:31:46,264 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:46,283 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:46,291 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:46,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:46,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:46,313 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-18 17:31:46,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,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, 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-18 17:31:46,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:46,365 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-18 17:31:46,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:46,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,394 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:31:46,395 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-18 17:31:46,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:46,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:46,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-18 17:31:46,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:31:46,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:46,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:46,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-18 17:31:46,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:46,542 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:31:46,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:31:46,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:46,579 INFO L267 ElimStorePlain]: 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-18 17:31:46,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-18 17:31:46,595 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-18 17:31:46,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:46,702 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-18 17:31:46,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:46,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-18 17:31:46,722 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:46,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:31:46,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:31:46,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:31:46,723 INFO L87 Difference]: Start difference. First operand 77 states and 337 transitions. Second operand 12 states. [2019-01-18 17:31:48,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:48,341 INFO L93 Difference]: Finished difference Result 120 states and 459 transitions. [2019-01-18 17:31:48,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:31:48,341 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-18 17:31:48,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:48,342 INFO L225 Difference]: With dead ends: 120 [2019-01-18 17:31:48,342 INFO L226 Difference]: Without dead ends: 119 [2019-01-18 17:31:48,343 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-18 17:31:48,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-18 17:31:48,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 82. [2019-01-18 17:31:48,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-18 17:31:48,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 362 transitions. [2019-01-18 17:31:48,368 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 362 transitions. Word has length 6 [2019-01-18 17:31:48,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:48,368 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 362 transitions. [2019-01-18 17:31:48,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:31:48,368 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 362 transitions. [2019-01-18 17:31:48,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:31:48,369 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:48,369 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:31:48,369 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:48,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:48,369 INFO L82 PathProgramCache]: Analyzing trace with hash 902703186, now seen corresponding path program 2 times [2019-01-18 17:31:48,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:48,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:48,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:48,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:48,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:49,011 WARN L181 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2019-01-18 17:31:49,089 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-18 17:31:49,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:49,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:49,089 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:31:49,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:31:49,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:49,090 INFO 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-18 17:31:49,103 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:31:49,103 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:31:49,118 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:31:49,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:31:49,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:49,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-18 17:31:49,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,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-18 17:31:49,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,133 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-18 17:31:49,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,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, 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-18 17:31:49,138 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:49,154 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:49,164 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:49,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:49,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:49,185 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-18 17:31:49,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,215 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-18 17:31:49,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:49,239 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-18 17:31:49,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:49,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,273 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-18 17:31:49,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:49,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:49,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-18 17:31:49,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,357 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:31:49,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:31:49,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:49,389 INFO L267 ElimStorePlain]: 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-18 17:31:49,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-18 17:31:49,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,418 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:31:49,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:49,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:31:49,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:49,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:49,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-18 17:31:49,473 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-18 17:31:49,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:49,530 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-18 17:31:49,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:49,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-18 17:31:49,551 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:49,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:31:49,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:31:49,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:31:49,551 INFO L87 Difference]: Start difference. First operand 82 states and 362 transitions. Second operand 12 states. [2019-01-18 17:31:50,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:50,137 INFO L93 Difference]: Finished difference Result 146 states and 556 transitions. [2019-01-18 17:31:50,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:31:50,137 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-18 17:31:50,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:50,140 INFO L225 Difference]: With dead ends: 146 [2019-01-18 17:31:50,140 INFO L226 Difference]: Without dead ends: 145 [2019-01-18 17:31:50,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:31:50,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-18 17:31:50,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 98. [2019-01-18 17:31:50,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-18 17:31:50,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 442 transitions. [2019-01-18 17:31:50,163 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 442 transitions. Word has length 6 [2019-01-18 17:31:50,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:50,164 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 442 transitions. [2019-01-18 17:31:50,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:31:50,164 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 442 transitions. [2019-01-18 17:31:50,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:31:50,165 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:50,165 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:31:50,165 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:50,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:50,165 INFO L82 PathProgramCache]: Analyzing trace with hash 893362642, now seen corresponding path program 1 times [2019-01-18 17:31:50,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:50,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:50,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:31:50,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:50,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:50,273 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-18 17:31:50,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:50,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:50,273 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:31:50,274 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [23] [2019-01-18 17:31:50,274 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:50,274 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:50,277 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:50,277 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-18 17:31:50,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:50,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:50,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:50,278 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:31:50,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:50,287 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:50,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:50,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:50,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-18 17:31:50,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:50,301 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-18 17:31:50,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:50,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:50,310 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-18 17:31:50,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:50,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:50,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:50,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 17:31:50,320 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:50,340 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:50,348 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:50,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:50,370 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-18 17:31:50,370 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-18 17:31:50,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:50,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:50,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:50,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:50,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:50,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:50,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:50,399 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-18 17:31:50,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:50,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:50,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:50,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:50,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:50,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:50,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:50,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:50,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:50,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:50,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:50,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:50,452 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-18 17:31:50,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:50,484 INFO L267 ElimStorePlain]: 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-18 17:31:50,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:50,503 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-18 17:31:50,503 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:50,524 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-18 17:31:50,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:50,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-18 17:31:50,544 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:50,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-18 17:31:50,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-18 17:31:50,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:31:50,545 INFO L87 Difference]: Start difference. First operand 98 states and 442 transitions. Second operand 7 states. [2019-01-18 17:31:50,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:50,858 INFO L93 Difference]: Finished difference Result 111 states and 462 transitions. [2019-01-18 17:31:50,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:31:50,858 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-01-18 17:31:50,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:50,860 INFO L225 Difference]: With dead ends: 111 [2019-01-18 17:31:50,860 INFO L226 Difference]: Without dead ends: 110 [2019-01-18 17:31:50,861 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-18 17:31:50,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-18 17:31:50,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2019-01-18 17:31:50,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-18 17:31:50,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 452 transitions. [2019-01-18 17:31:50,887 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 452 transitions. Word has length 6 [2019-01-18 17:31:50,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:50,887 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 452 transitions. [2019-01-18 17:31:50,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-18 17:31:50,888 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 452 transitions. [2019-01-18 17:31:50,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:31:50,888 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:50,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:31:50,889 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:50,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:50,889 INFO L82 PathProgramCache]: Analyzing trace with hash 893472132, now seen corresponding path program 1 times [2019-01-18 17:31:50,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:50,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:50,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:50,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:50,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:51,326 WARN L181 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-18 17:31:51,367 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-18 17:31:51,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:51,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:51,368 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:31:51,368 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [21] [2019-01-18 17:31:51,371 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:51,371 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:51,374 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:51,374 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-18 17:31:51,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:51,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:51,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:51,375 INFO 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-18 17:31:51,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:51,384 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:51,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:51,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:31:51,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:51,396 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-18 17:31:51,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:51,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:51,402 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-18 17:31:51,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:51,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:51,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:51,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 17:31:51,452 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:51,469 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:51,477 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:51,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:51,499 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-18 17:31:51,499 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-18 17:31:51,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:51,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:51,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:51,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:51,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:51,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:51,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:51,527 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-18 17:31:51,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:51,581 INFO L267 ElimStorePlain]: 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-18 17:31:51,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:51,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:51,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:51,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:51,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:51,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:51,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:51,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:51,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:51,613 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:31:51,616 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-18 17:31:51,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:51,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:51,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:51,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:51,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:51,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:51,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:51,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:51,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:51,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:51,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:51,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:51,678 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-18 17:31:51,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:51,756 INFO L267 ElimStorePlain]: 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-18 17:31:51,757 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:51,776 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-18 17:31:51,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:51,866 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-18 17:31:51,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:51,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 17:31:51,885 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:51,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:31:51,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:31:51,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:31:51,886 INFO L87 Difference]: Start difference. First operand 100 states and 452 transitions. Second operand 10 states. [2019-01-18 17:31:52,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:52,290 INFO L93 Difference]: Finished difference Result 153 states and 620 transitions. [2019-01-18 17:31:52,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:31:52,290 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 17:31:52,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:52,293 INFO L225 Difference]: With dead ends: 153 [2019-01-18 17:31:52,293 INFO L226 Difference]: Without dead ends: 152 [2019-01-18 17:31:52,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:31:52,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-01-18 17:31:52,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 127. [2019-01-18 17:31:52,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-18 17:31:52,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 589 transitions. [2019-01-18 17:31:52,331 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 589 transitions. Word has length 6 [2019-01-18 17:31:52,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:52,331 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 589 transitions. [2019-01-18 17:31:52,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:31:52,331 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 589 transitions. [2019-01-18 17:31:52,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:31:52,332 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:52,332 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:31:52,332 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:52,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:52,332 INFO L82 PathProgramCache]: Analyzing trace with hash 897235472, now seen corresponding path program 1 times [2019-01-18 17:31:52,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:52,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:52,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:52,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:52,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:52,435 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-18 17:31:52,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:52,436 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:52,436 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:31:52,436 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [23] [2019-01-18 17:31:52,439 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:52,439 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:52,441 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:52,442 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-18 17:31:52,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:52,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:52,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:52,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:31:52,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:52,451 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:52,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:52,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:31:52,465 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-18 17:31:52,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:52,512 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-18 17:31:52,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:52,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:52,614 INFO L303 Elim1Store]: Index analysis took 101 ms [2019-01-18 17:31:52,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 17:31:52,615 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:52,627 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:52,634 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:52,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:52,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:52,653 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-18 17:31:52,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:52,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:52,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:52,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:52,685 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-18 17:31:52,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:52,702 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-18 17:31:52,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-18 17:31:52,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:52,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:52,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:52,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:52,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:52,721 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:31:52,722 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-18 17:31:52,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:52,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:52,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-18 17:31:52,756 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-18 17:31:52,756 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:52,799 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-18 17:31:52,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:52,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:31:52,817 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:52,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:31:52,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:31:52,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:31:52,818 INFO L87 Difference]: Start difference. First operand 127 states and 589 transitions. Second operand 8 states. [2019-01-18 17:31:53,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:53,049 INFO L93 Difference]: Finished difference Result 143 states and 607 transitions. [2019-01-18 17:31:53,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:31:53,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-18 17:31:53,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:53,051 INFO L225 Difference]: With dead ends: 143 [2019-01-18 17:31:53,051 INFO L226 Difference]: Without dead ends: 138 [2019-01-18 17:31:53,052 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-18 17:31:53,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-18 17:31:53,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 127. [2019-01-18 17:31:53,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-18 17:31:53,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 588 transitions. [2019-01-18 17:31:53,081 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 588 transitions. Word has length 6 [2019-01-18 17:31:53,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:53,081 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 588 transitions. [2019-01-18 17:31:53,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:31:53,081 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 588 transitions. [2019-01-18 17:31:53,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:31:53,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:53,082 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:31:53,082 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:53,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:53,082 INFO L82 PathProgramCache]: Analyzing trace with hash 896931732, now seen corresponding path program 2 times [2019-01-18 17:31:53,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:53,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:53,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:53,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:53,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:53,554 WARN L181 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 13 [2019-01-18 17:31:53,614 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-18 17:31:53,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:53,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:53,614 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:31:53,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:31:53,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:53,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:31:53,623 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:31:53,623 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:31:53,629 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:31:53,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:31:53,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:53,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:31:53,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:53,636 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-18 17:31:53,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:53,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:53,641 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-18 17:31:53,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:53,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:53,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:53,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 17:31:53,647 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:53,664 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:53,673 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:53,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:53,695 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-18 17:31:53,696 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-18 17:31:53,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:53,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:53,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:53,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:53,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:53,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:53,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:53,722 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-18 17:31:53,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:53,756 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-18 17:31:53,757 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:53,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:53,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:53,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:53,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:53,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:53,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:53,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:53,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:53,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:53,784 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-18 17:31:53,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:53,816 INFO L267 ElimStorePlain]: 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-18 17:31:53,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-18 17:31:53,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:53,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:53,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:53,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:53,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:53,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:53,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:53,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:53,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:53,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:53,850 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:31:53,851 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-18 17:31:53,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:53,885 INFO L267 ElimStorePlain]: 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-18 17:31:53,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-18 17:31:53,905 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-18 17:31:53,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:53,936 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-18 17:31:53,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:53,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 17:31:53,956 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:53,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:31:53,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:31:53,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:31:53,956 INFO L87 Difference]: Start difference. First operand 127 states and 588 transitions. Second operand 10 states. [2019-01-18 17:31:54,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:54,364 INFO L93 Difference]: Finished difference Result 196 states and 812 transitions. [2019-01-18 17:31:54,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:31:54,364 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 17:31:54,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:54,366 INFO L225 Difference]: With dead ends: 196 [2019-01-18 17:31:54,366 INFO L226 Difference]: Without dead ends: 195 [2019-01-18 17:31:54,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-18 17:31:54,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-18 17:31:54,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 141. [2019-01-18 17:31:54,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-18 17:31:54,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 664 transitions. [2019-01-18 17:31:54,408 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 664 transitions. Word has length 6 [2019-01-18 17:31:54,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:54,408 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 664 transitions. [2019-01-18 17:31:54,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:31:54,408 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 664 transitions. [2019-01-18 17:31:54,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:31:54,409 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:54,409 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:31:54,409 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:54,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:54,409 INFO L82 PathProgramCache]: Analyzing trace with hash 897162246, now seen corresponding path program 3 times [2019-01-18 17:31:54,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:54,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:54,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:31:54,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:54,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:54,567 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-18 17:31:54,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:54,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:54,567 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:31:54,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:31:54,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:54,568 INFO 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-18 17:31:54,576 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:31:54,576 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:31:54,580 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:31:54,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:31:54,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:54,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:31:54,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,633 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-18 17:31:54,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,640 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-18 17:31:54,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 17:31:54,647 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:54,664 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:54,674 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:54,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:54,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:54,693 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-18 17:31:54,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:31:54,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:54,748 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-18 17:31:54,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:54,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,777 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-18 17:31:54,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:54,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-18 17:31:54,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-18 17:31:54,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,862 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:31:54,863 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-18 17:31:54,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:54,896 INFO L267 ElimStorePlain]: 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-18 17:31:54,896 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-18 17:31:54,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:54,928 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:31:54,929 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-18 17:31:54,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:54,966 INFO L267 ElimStorePlain]: 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-18 17:31:54,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-18 17:31:54,981 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-18 17:31:54,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:55,027 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-18 17:31:55,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:55,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-18 17:31:55,045 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:55,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:31:55,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:31:55,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:31:55,046 INFO L87 Difference]: Start difference. First operand 141 states and 664 transitions. Second operand 12 states. [2019-01-18 17:31:55,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:55,528 INFO L93 Difference]: Finished difference Result 205 states and 871 transitions. [2019-01-18 17:31:55,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:31:55,528 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-18 17:31:55,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:55,531 INFO L225 Difference]: With dead ends: 205 [2019-01-18 17:31:55,531 INFO L226 Difference]: Without dead ends: 197 [2019-01-18 17:31:55,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2019-01-18 17:31:55,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-01-18 17:31:55,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 149. [2019-01-18 17:31:55,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-18 17:31:55,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 702 transitions. [2019-01-18 17:31:55,577 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 702 transitions. Word has length 6 [2019-01-18 17:31:55,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:55,577 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 702 transitions. [2019-01-18 17:31:55,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:31:55,577 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 702 transitions. [2019-01-18 17:31:55,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:31:55,578 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:55,578 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:31:55,578 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:55,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:55,578 INFO L82 PathProgramCache]: Analyzing trace with hash 900929556, now seen corresponding path program 1 times [2019-01-18 17:31:55,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:55,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:55,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:31:55,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:55,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:55,670 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-18 17:31:55,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:55,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:55,671 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:31:55,671 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [23] [2019-01-18 17:31:55,672 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:55,672 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:55,675 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:55,675 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-18 17:31:55,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:55,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:55,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:55,675 INFO 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-18 17:31:55,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:55,684 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:55,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:55,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:31:55,697 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-18 17:31:55,703 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-18 17:31:55,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:55,722 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-18 17:31:55,722 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:55,735 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:55,748 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:55,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:55,772 INFO L267 ElimStorePlain]: 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-18 17:31:55,772 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-01-18 17:31:55,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:55,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:55,811 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-18 17:31:55,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:55,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:55,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-18 17:31:55,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:55,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:55,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:55,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:55,862 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-18 17:31:55,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:55,882 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-18 17:31:55,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-18 17:31:55,914 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-18 17:31:55,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:55,963 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-18 17:31:55,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:55,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:31:55,981 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:55,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:31:55,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:31:55,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:31:55,981 INFO L87 Difference]: Start difference. First operand 149 states and 702 transitions. Second operand 8 states. [2019-01-18 17:31:56,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:56,171 INFO L93 Difference]: Finished difference Result 165 states and 720 transitions. [2019-01-18 17:31:56,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:31:56,172 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-18 17:31:56,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:56,173 INFO L225 Difference]: With dead ends: 165 [2019-01-18 17:31:56,173 INFO L226 Difference]: Without dead ends: 164 [2019-01-18 17:31:56,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:31:56,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-01-18 17:31:56,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 149. [2019-01-18 17:31:56,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-18 17:31:56,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 702 transitions. [2019-01-18 17:31:56,204 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 702 transitions. Word has length 6 [2019-01-18 17:31:56,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:56,204 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 702 transitions. [2019-01-18 17:31:56,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:31:56,204 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 702 transitions. [2019-01-18 17:31:56,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:31:56,205 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:56,205 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:31:56,205 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:56,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:56,205 INFO L82 PathProgramCache]: Analyzing trace with hash 900750810, now seen corresponding path program 1 times [2019-01-18 17:31:56,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:56,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:56,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:56,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:56,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:56,445 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2019-01-18 17:31:56,716 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2019-01-18 17:31:56,726 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-18 17:31:56,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:56,726 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:56,726 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:31:56,726 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [22], [23] [2019-01-18 17:31:56,727 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:56,727 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:56,730 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:56,731 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-18 17:31:56,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:56,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:56,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:56,732 INFO 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-18 17:31:56,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:56,744 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:56,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:56,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:31:56,755 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-18 17:31:56,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:56,761 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-18 17:31:56,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:56,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:56,770 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-18 17:31:56,770 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:56,782 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:56,790 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:56,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:56,810 INFO L267 ElimStorePlain]: 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-18 17:31:56,810 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-01-18 17:31:56,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:56,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:56,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:56,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:56,838 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-18 17:31:56,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:56,854 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-18 17:31:56,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-18 17:31:56,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:56,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:56,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:56,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:56,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:56,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:56,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 17:31:56,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:56,894 INFO L267 ElimStorePlain]: 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-18 17:31:56,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-18 17:31:56,910 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-18 17:31:56,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:56,928 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-18 17:31:56,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:56,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:31:56,947 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:56,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:31:56,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:31:56,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:31:56,947 INFO L87 Difference]: Start difference. First operand 149 states and 702 transitions. Second operand 8 states. [2019-01-18 17:31:57,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:57,182 INFO L93 Difference]: Finished difference Result 174 states and 765 transitions. [2019-01-18 17:31:57,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:31:57,183 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-18 17:31:57,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:57,185 INFO L225 Difference]: With dead ends: 174 [2019-01-18 17:31:57,185 INFO L226 Difference]: Without dead ends: 173 [2019-01-18 17:31:57,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:31:57,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-18 17:31:57,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 158. [2019-01-18 17:31:57,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-18 17:31:57,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 747 transitions. [2019-01-18 17:31:57,234 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 747 transitions. Word has length 6 [2019-01-18 17:31:57,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:57,234 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 747 transitions. [2019-01-18 17:31:57,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:31:57,235 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 747 transitions. [2019-01-18 17:31:57,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:31:57,235 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:57,235 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-18 17:31:57,236 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:57,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:57,236 INFO L82 PathProgramCache]: Analyzing trace with hash -2078696478, now seen corresponding path program 1 times [2019-01-18 17:31:57,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:57,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:57,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:57,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:57,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:57,307 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-18 17:31:57,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:57,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:57,308 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:31:57,308 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [22], [24], [25] [2019-01-18 17:31:57,309 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:57,309 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:57,313 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:57,313 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-18 17:31:57,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:57,313 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:57,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:57,314 INFO 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-18 17:31:57,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:57,323 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:57,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:57,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:31:57,336 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-18 17:31:57,347 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-18 17:31:57,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 17:31:57,365 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:57,374 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:57,381 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:57,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:57,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:57,396 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:15, output treesize:21 [2019-01-18 17:31:57,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:57,401 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-18 17:31:57,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:57,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:57,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-18 17:31:57,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:57,571 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-18 17:31:57,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:57,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:57,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2019-01-18 17:31:57,581 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-18 17:31:57,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:57,596 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-18 17:31:57,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-18 17:31:57,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 8 [2019-01-18 17:31:57,615 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:31:57,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-18 17:31:57,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-18 17:31:57,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:31:57,616 INFO L87 Difference]: Start difference. First operand 158 states and 747 transitions. Second operand 5 states. [2019-01-18 17:31:57,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:57,758 INFO L93 Difference]: Finished difference Result 357 states and 1628 transitions. [2019-01-18 17:31:57,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:31:57,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-18 17:31:57,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:57,762 INFO L225 Difference]: With dead ends: 357 [2019-01-18 17:31:57,762 INFO L226 Difference]: Without dead ends: 353 [2019-01-18 17:31:57,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:31:57,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-01-18 17:31:57,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 329. [2019-01-18 17:31:57,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-01-18 17:31:57,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 1593 transitions. [2019-01-18 17:31:57,892 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 1593 transitions. Word has length 7 [2019-01-18 17:31:57,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:57,893 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 1593 transitions. [2019-01-18 17:31:57,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-18 17:31:57,893 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 1593 transitions. [2019-01-18 17:31:57,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:31:57,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:57,895 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:31:57,895 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:57,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:57,896 INFO L82 PathProgramCache]: Analyzing trace with hash -2087931688, now seen corresponding path program 1 times [2019-01-18 17:31:57,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:57,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:57,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:57,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:57,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:58,172 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-01-18 17:31:58,236 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-18 17:31:58,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:58,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:58,237 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:31:58,237 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [24], [25] [2019-01-18 17:31:58,238 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:58,238 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:58,241 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:58,241 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-18 17:31:58,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:58,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:58,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:58,242 INFO 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-18 17:31:58,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:58,254 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:58,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:58,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:31:58,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:58,315 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-18 17:31:58,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:58,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:58,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-18 17:31:58,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:58,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:58,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:58,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 17:31:58,327 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:58,367 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:58,377 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:58,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:58,398 INFO L267 ElimStorePlain]: 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-18 17:31:58,398 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-18 17:31:58,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:58,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:58,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:58,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:58,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:58,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:58,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:58,422 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-18 17:31:58,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:58,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:58,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:58,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:58,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:58,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:58,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:58,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:58,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:58,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:58,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:58,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:58,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-18 17:31:58,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:58,502 INFO L267 ElimStorePlain]: 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-18 17:31:58,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-18 17:31:58,518 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-18 17:31:58,518 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:58,535 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-18 17:31:58,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:58,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:31:58,556 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:58,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:31:58,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:31:58,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:31:58,556 INFO L87 Difference]: Start difference. First operand 329 states and 1593 transitions. Second operand 8 states. [2019-01-18 17:31:58,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:58,846 INFO L93 Difference]: Finished difference Result 348 states and 1627 transitions. [2019-01-18 17:31:58,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:31:58,847 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-18 17:31:58,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:58,850 INFO L225 Difference]: With dead ends: 348 [2019-01-18 17:31:58,850 INFO L226 Difference]: Without dead ends: 338 [2019-01-18 17:31:58,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 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-18 17:31:58,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-01-18 17:31:58,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 333. [2019-01-18 17:31:58,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-01-18 17:31:58,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 1604 transitions. [2019-01-18 17:31:58,950 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 1604 transitions. Word has length 7 [2019-01-18 17:31:58,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:58,950 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 1604 transitions. [2019-01-18 17:31:58,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:31:58,950 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 1604 transitions. [2019-01-18 17:31:58,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:31:58,951 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:58,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:31:58,951 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:58,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:58,951 INFO L82 PathProgramCache]: Analyzing trace with hash -2088231584, now seen corresponding path program 1 times [2019-01-18 17:31:58,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:58,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:58,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:58,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:58,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:59,126 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-18 17:31:59,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:59,127 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:59,127 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:31:59,127 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [23] [2019-01-18 17:31:59,128 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:31:59,128 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:31:59,130 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:31:59,130 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-18 17:31:59,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:59,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:31:59,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:59,132 INFO 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-18 17:31:59,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:59,140 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:59,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:59,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:31:59,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:59,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-18 17:31:59,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:59,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:59,156 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-18 17:31:59,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:59,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:59,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:59,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 17:31:59,161 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:59,179 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:59,190 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:59,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:59,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:59,213 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-18 17:31:59,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:59,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:59,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:59,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:59,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:59,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:59,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:59,241 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-18 17:31:59,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:59,269 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-18 17:31:59,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-18 17:31:59,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:59,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:59,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:59,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:59,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:59,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:59,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:59,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:59,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:59,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-18 17:31:59,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:59,333 INFO L267 ElimStorePlain]: 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-18 17:31:59,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-18 17:31:59,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:59,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:59,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:59,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:59,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:59,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:59,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:59,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:59,362 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:31:59,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:31:59,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 72 [2019-01-18 17:31:59,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:59,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:31:59,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-18 17:31:59,422 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-18 17:31:59,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:59,461 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-18 17:31:59,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:59,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:31:59,480 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:59,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:31:59,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:31:59,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:31:59,480 INFO L87 Difference]: Start difference. First operand 333 states and 1604 transitions. Second operand 10 states. [2019-01-18 17:31:59,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:59,891 INFO L93 Difference]: Finished difference Result 348 states and 1634 transitions. [2019-01-18 17:31:59,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:31:59,891 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-18 17:31:59,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:59,894 INFO L225 Difference]: With dead ends: 348 [2019-01-18 17:31:59,894 INFO L226 Difference]: Without dead ends: 343 [2019-01-18 17:31:59,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:31:59,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-01-18 17:31:59,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 334. [2019-01-18 17:31:59,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-01-18 17:31:59,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1603 transitions. [2019-01-18 17:31:59,994 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1603 transitions. Word has length 7 [2019-01-18 17:31:59,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:59,995 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 1603 transitions. [2019-01-18 17:31:59,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:31:59,995 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1603 transitions. [2019-01-18 17:31:59,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:31:59,996 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:59,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:31:59,997 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:59,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:59,997 INFO L82 PathProgramCache]: Analyzing trace with hash -2088122094, now seen corresponding path program 1 times [2019-01-18 17:31:59,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:59,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:59,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:59,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:59,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:00,162 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-18 17:32:00,243 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-18 17:32:00,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:00,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:00,243 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:32:00,243 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [21] [2019-01-18 17:32:00,244 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:32:00,244 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:32:00,247 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:32:00,247 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-18 17:32:00,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:00,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:32:00,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:00,247 INFO 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-18 17:32:00,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:00,255 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:32:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:00,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:00,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:32:00,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,268 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-18 17:32:00,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-18 17:32:00,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 17:32:00,280 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:00,417 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:00,435 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:00,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:00,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:00,453 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-18 17:32:00,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,480 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-18 17:32:00,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:00,505 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-18 17:32:00,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-18 17:32:00,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,539 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-18 17:32:00,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:00,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-18 17:32:00,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-18 17:32:00,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,602 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:32:00,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:32:00,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:00,635 INFO L267 ElimStorePlain]: 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-18 17:32:00,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-18 17:32:00,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,666 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:32:00,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:00,668 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-18 17:32:00,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:00,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:32:00,700 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-18 17:32:00,720 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-18 17:32:00,720 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:00,761 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-18 17:32:00,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:00,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-18 17:32:00,781 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:00,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:32:00,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:32:00,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:32:00,781 INFO L87 Difference]: Start difference. First operand 334 states and 1603 transitions. Second operand 12 states. [2019-01-18 17:32:01,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:01,471 INFO L93 Difference]: Finished difference Result 457 states and 2102 transitions. [2019-01-18 17:32:01,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:32:01,471 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-18 17:32:01,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:01,475 INFO L225 Difference]: With dead ends: 457 [2019-01-18 17:32:01,476 INFO L226 Difference]: Without dead ends: 456 [2019-01-18 17:32:01,476 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-18 17:32:01,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-01-18 17:32:01,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 329. [2019-01-18 17:32:01,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-01-18 17:32:01,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 1582 transitions. [2019-01-18 17:32:01,573 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 1582 transitions. Word has length 7 [2019-01-18 17:32:01,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:01,574 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 1582 transitions. [2019-01-18 17:32:01,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:32:01,574 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 1582 transitions. [2019-01-18 17:32:01,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:32:01,575 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:01,575 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:32:01,575 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:32:01,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:01,575 INFO L82 PathProgramCache]: Analyzing trace with hash -2084662494, now seen corresponding path program 2 times [2019-01-18 17:32:01,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:01,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:01,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:01,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:01,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:01,722 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-18 17:32:01,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:01,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:01,723 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:32:01,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:32:01,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:01,724 INFO 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-18 17:32:01,734 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:32:01,734 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:32:01,744 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:32:01,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:32:01,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:01,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:32:01,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:01,755 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-18 17:32:01,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:01,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:01,760 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-18 17:32:01,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:01,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:01,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:01,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 17:32:01,770 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:01,787 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:01,796 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:01,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:01,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:01,816 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-18 17:32:01,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:01,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:01,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:01,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:01,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:01,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:01,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:01,844 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-18 17:32:01,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:01,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:32:01,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-18 17:32:01,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:01,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:01,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:01,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:01,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:01,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:01,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:01,895 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:32:01,896 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-18 17:32:01,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:01,926 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-18 17:32:01,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:30 [2019-01-18 17:32:01,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:01,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:01,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:01,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:01,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:01,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:01,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:01,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:01,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:01,956 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-18 17:32:01,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:01,986 INFO L267 ElimStorePlain]: 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-18 17:32:01,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-01-18 17:32:02,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:02,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:02,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:02,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:02,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:02,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:02,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:02,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:02,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:02,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:02,022 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:32:02,023 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-18 17:32:02,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:02,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:32:02,056 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-18 17:32:02,078 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-18 17:32:02,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:02,131 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-18 17:32:02,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:02,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-18 17:32:02,151 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:02,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:32:02,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:32:02,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:32:02,152 INFO L87 Difference]: Start difference. First operand 329 states and 1582 transitions. Second operand 11 states. [2019-01-18 17:32:02,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:02,692 INFO L93 Difference]: Finished difference Result 346 states and 1608 transitions. [2019-01-18 17:32:02,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:32:02,693 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-18 17:32:02,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:02,697 INFO L225 Difference]: With dead ends: 346 [2019-01-18 17:32:02,697 INFO L226 Difference]: Without dead ends: 345 [2019-01-18 17:32:02,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-01-18 17:32:02,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-01-18 17:32:02,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 213. [2019-01-18 17:32:02,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-18 17:32:02,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 1003 transitions. [2019-01-18 17:32:02,768 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 1003 transitions. Word has length 7 [2019-01-18 17:32:02,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:02,768 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 1003 transitions. [2019-01-18 17:32:02,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:32:02,768 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 1003 transitions. [2019-01-18 17:32:02,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:32:02,769 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:02,769 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:32:02,769 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:32:02,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:02,769 INFO L82 PathProgramCache]: Analyzing trace with hash -2084418336, now seen corresponding path program 1 times [2019-01-18 17:32:02,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:02,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:02,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:32:02,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:02,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:02,895 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-18 17:32:02,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:02,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:02,895 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:32:02,895 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [22], [23] [2019-01-18 17:32:02,896 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:32:02,896 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:32:02,898 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:32:02,898 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-18 17:32:02,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:02,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:32:02,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:02,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:32:02,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:02,912 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:32:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:02,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:02,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:32:02,924 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-18 17:32:02,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:02,939 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-18 17:32:02,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:02,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:02,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 17:32:02,947 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:02,960 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:02,968 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:02,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:02,987 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-18 17:32:02,988 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-18 17:32:03,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:03,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:03,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:03,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:03,016 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-18 17:32:03,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:03,031 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-18 17:32:03,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-18 17:32:03,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:03,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:03,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:03,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:03,049 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:32:03,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 17:32:03,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:03,066 INFO L267 ElimStorePlain]: 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-18 17:32:03,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:22 [2019-01-18 17:32:03,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:03,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:03,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:03,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:03,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:03,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:03,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 30 treesize of output 44 [2019-01-18 17:32:03,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:03,105 INFO L267 ElimStorePlain]: 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-18 17:32:03,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:26 [2019-01-18 17:32:03,122 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-18 17:32:03,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:03,149 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-18 17:32:03,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:03,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 17:32:03,169 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:03,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:32:03,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:32:03,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:32:03,170 INFO L87 Difference]: Start difference. First operand 213 states and 1003 transitions. Second operand 10 states. [2019-01-18 17:32:03,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:03,537 INFO L93 Difference]: Finished difference Result 280 states and 1278 transitions. [2019-01-18 17:32:03,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:32:03,538 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-18 17:32:03,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:03,541 INFO L225 Difference]: With dead ends: 280 [2019-01-18 17:32:03,541 INFO L226 Difference]: Without dead ends: 277 [2019-01-18 17:32:03,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:32:03,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-01-18 17:32:03,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 242. [2019-01-18 17:32:03,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-01-18 17:32:03,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 1141 transitions. [2019-01-18 17:32:03,633 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 1141 transitions. Word has length 7 [2019-01-18 17:32:03,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:03,634 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 1141 transitions. [2019-01-18 17:32:03,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:32:03,634 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 1141 transitions. [2019-01-18 17:32:03,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:32:03,634 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:03,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:32:03,636 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:32:03,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:03,636 INFO L82 PathProgramCache]: Analyzing trace with hash -2080543520, now seen corresponding path program 1 times [2019-01-18 17:32:03,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:03,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:03,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:03,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:03,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:03,729 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-18 17:32:03,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:03,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:03,730 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:32:03,730 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [24], [25] [2019-01-18 17:32:03,731 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:32:03,731 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:32:03,733 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:32:03,733 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-18 17:32:03,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:03,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:32:03,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:03,734 INFO 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-18 17:32:03,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:03,743 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:32:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:03,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:03,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:32:03,755 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-18 17:32:03,766 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-18 17:32:03,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:03,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 17:32:03,781 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:03,789 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:03,797 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:03,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:03,815 INFO L267 ElimStorePlain]: 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-18 17:32:03,815 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-01-18 17:32:03,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:03,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:03,836 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-18 17:32:03,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:03,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:03,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-18 17:32:03,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:03,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:03,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:03,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:03,859 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-18 17:32:03,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:03,870 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-18 17:32:03,870 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-01-18 17:32:03,883 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-18 17:32:03,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:03,898 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-18 17:32:03,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:03,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-18 17:32:03,917 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:03,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 17:32:03,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 17:32:03,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:32:03,918 INFO L87 Difference]: Start difference. First operand 242 states and 1141 transitions. Second operand 9 states. [2019-01-18 17:32:04,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:04,258 INFO L93 Difference]: Finished difference Result 390 states and 1798 transitions. [2019-01-18 17:32:04,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:32:04,259 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-18 17:32:04,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:04,262 INFO L225 Difference]: With dead ends: 390 [2019-01-18 17:32:04,262 INFO L226 Difference]: Without dead ends: 377 [2019-01-18 17:32:04,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:32:04,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-01-18 17:32:04,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 367. [2019-01-18 17:32:04,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-01-18 17:32:04,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1654 transitions. [2019-01-18 17:32:04,384 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1654 transitions. Word has length 7 [2019-01-18 17:32:04,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:04,384 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 1654 transitions. [2019-01-18 17:32:04,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 17:32:04,385 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1654 transitions. [2019-01-18 17:32:04,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:32:04,386 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:04,386 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-18 17:32:04,386 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:32:04,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:04,387 INFO L82 PathProgramCache]: Analyzing trace with hash -2080966800, now seen corresponding path program 4 times [2019-01-18 17:32:04,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:04,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:04,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:04,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:04,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:04,647 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 21 [2019-01-18 17:32:04,738 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-18 17:32:04,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:04,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:04,738 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:32:04,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:32:04,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:04,739 INFO 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-18 17:32:04,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:04,750 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:32:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:04,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:04,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:32:04,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:04,763 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-18 17:32:04,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:04,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:04,766 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-18 17:32:04,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:04,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:04,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:04,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 17:32:04,772 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:04,788 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:04,797 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:04,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:04,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:04,820 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-18 17:32:04,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:04,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:04,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:04,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:04,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:04,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:04,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:04,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, 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-18 17:32:04,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:04,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:04,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:30 [2019-01-18 17:32:04,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:04,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:04,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:04,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:04,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:04,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:04,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:04,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:04,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:04,905 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-18 17:32:04,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:04,936 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-18 17:32:04,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-18 17:32:04,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:04,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:04,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:04,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:04,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:04,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:04,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:04,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:04,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:04,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:04,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:04,969 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:32:04,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-01-18 17:32:04,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:05,004 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-18 17:32:05,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-18 17:32:05,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:05,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:05,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:05,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:05,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:05,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:05,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:05,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:05,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:05,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:05,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:05,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:05,039 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-18 17:32:05,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:05,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:32:05,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-18 17:32:05,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:05,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:05,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:05,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:05,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:05,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:05,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:05,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:05,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:05,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:05,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:05,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:05,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:32:05,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:05,142 INFO L267 ElimStorePlain]: 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-18 17:32:05,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-18 17:32:05,159 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-18 17:32:05,160 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:05,238 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-18 17:32:05,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:05,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-18 17:32:05,257 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:05,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-18 17:32:05,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-18 17:32:05,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=220, Unknown=0, NotChecked=0, Total=342 [2019-01-18 17:32:05,258 INFO L87 Difference]: Start difference. First operand 367 states and 1654 transitions. Second operand 13 states. [2019-01-18 17:32:05,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:05,902 INFO L93 Difference]: Finished difference Result 375 states and 1668 transitions. [2019-01-18 17:32:05,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:32:05,903 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-18 17:32:05,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:05,907 INFO L225 Difference]: With dead ends: 375 [2019-01-18 17:32:05,907 INFO L226 Difference]: Without dead ends: 374 [2019-01-18 17:32:05,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=305, Unknown=0, NotChecked=0, Total=462 [2019-01-18 17:32:05,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-01-18 17:32:06,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 147. [2019-01-18 17:32:06,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-18 17:32:06,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 607 transitions. [2019-01-18 17:32:06,031 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 607 transitions. Word has length 7 [2019-01-18 17:32:06,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:06,031 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 607 transitions. [2019-01-18 17:32:06,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-18 17:32:06,031 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 607 transitions. [2019-01-18 17:32:06,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:32:06,032 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:06,032 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:32:06,032 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:32:06,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:06,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1924438182, now seen corresponding path program 1 times [2019-01-18 17:32:06,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:06,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:06,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:06,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:06,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:06,203 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-18 17:32:06,256 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-18 17:32:06,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:06,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:06,257 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:32:06,257 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [24], [25] [2019-01-18 17:32:06,257 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:32:06,258 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:32:06,260 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:32:06,260 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-18 17:32:06,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:06,260 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:32:06,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:06,261 INFO 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-18 17:32:06,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:06,270 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:32:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:06,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:06,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:32:06,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:06,282 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-18 17:32:06,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:06,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:06,344 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-18 17:32:06,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:06,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:06,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:06,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 17:32:06,373 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:06,389 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:06,398 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:06,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:06,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:32:06,420 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-18 17:32:06,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:06,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:06,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:06,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:06,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:06,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:06,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:06,445 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-18 17:32:06,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:06,491 INFO L267 ElimStorePlain]: 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-18 17:32:06,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:32:06,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:06,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:06,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:06,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:06,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:06,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:06,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:06,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:06,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:06,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-18 17:32:06,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:06,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:32:06,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-18 17:32:06,569 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-18 17:32:06,570 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:06,589 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-18 17:32:06,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:06,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-18 17:32:06,608 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:06,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-18 17:32:06,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-18 17:32:06,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:32:06,609 INFO L87 Difference]: Start difference. First operand 147 states and 607 transitions. Second operand 7 states. [2019-01-18 17:32:06,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:06,898 INFO L93 Difference]: Finished difference Result 157 states and 628 transitions. [2019-01-18 17:32:06,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:32:06,898 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-18 17:32:06,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:06,900 INFO L225 Difference]: With dead ends: 157 [2019-01-18 17:32:06,900 INFO L226 Difference]: Without dead ends: 150 [2019-01-18 17:32:06,901 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-18 17:32:06,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-18 17:32:07,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-01-18 17:32:07,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-18 17:32:07,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 611 transitions. [2019-01-18 17:32:07,025 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 611 transitions. Word has length 7 [2019-01-18 17:32:07,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:07,025 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 611 transitions. [2019-01-18 17:32:07,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-18 17:32:07,026 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 611 transitions. [2019-01-18 17:32:07,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:32:07,026 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:07,027 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:32:07,027 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:32:07,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:07,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1928011116, now seen corresponding path program 1 times [2019-01-18 17:32:07,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:07,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:07,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:07,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:07,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:07,149 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-18 17:32:07,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:07,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:07,149 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 17:32:07,149 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [23] [2019-01-18 17:32:07,150 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:32:07,150 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:32:07,153 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:32:07,153 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-18 17:32:07,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:07,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:32:07,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:07,154 INFO 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-18 17:32:07,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:07,166 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:32:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:07,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:07,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-18 17:32:07,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:07,190 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-18 17:32:07,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:07,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:07,197 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-18 17:32:07,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:07,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:07,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:07,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 22 treesize of output 45 [2019-01-18 17:32:07,209 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:07,222 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:07,232 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:07,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:07,253 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-18 17:32:07,253 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-18 17:32:07,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:07,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:07,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:07,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:07,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:07,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:07,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:07,282 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-18 17:32:07,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:07,309 INFO L267 ElimStorePlain]: 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-18 17:32:07,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:32:07,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:07,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:07,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:07,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:07,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:07,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:07,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:07,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:07,336 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:32:07,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:32:07,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:07,364 INFO L267 ElimStorePlain]: 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-18 17:32:07,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:32:07,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:07,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:07,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:07,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:07,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:07,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:07,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:07,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:07,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:07,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:32:07,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:07,426 INFO L267 ElimStorePlain]: 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-18 17:32:07,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-18 17:32:07,449 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-18 17:32:07,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:07,487 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-18 17:32:07,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:07,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:32:07,506 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:07,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:32:07,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:32:07,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:32:07,507 INFO L87 Difference]: Start difference. First operand 149 states and 611 transitions. Second operand 10 states. [2019-01-18 17:32:08,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:08,020 INFO L93 Difference]: Finished difference Result 206 states and 810 transitions. [2019-01-18 17:32:08,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:32:08,021 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-18 17:32:08,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:08,023 INFO L225 Difference]: With dead ends: 206 [2019-01-18 17:32:08,023 INFO L226 Difference]: Without dead ends: 199 [2019-01-18 17:32:08,024 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-18 17:32:08,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-01-18 17:32:08,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 158. [2019-01-18 17:32:08,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-18 17:32:08,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 646 transitions. [2019-01-18 17:32:08,195 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 646 transitions. Word has length 7 [2019-01-18 17:32:08,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:08,195 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 646 transitions. [2019-01-18 17:32:08,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:32:08,195 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 646 transitions. [2019-01-18 17:32:08,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:32:08,195 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:08,195 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:32:08,196 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:32:08,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:08,196 INFO L82 PathProgramCache]: Analyzing trace with hash 2042527720, now seen corresponding path program 2 times [2019-01-18 17:32:08,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:08,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:08,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:08,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:08,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:08,329 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-18 17:32:08,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:08,330 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:08,330 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:32:08,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:32:08,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:08,330 INFO 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-18 17:32:08,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:32:08,339 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:32:08,359 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:32:08,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:32:08,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:08,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-18 17:32:08,373 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-18 17:32:08,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:08,378 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-18 17:32:08,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:08,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:08,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, 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-18 17:32:08,397 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:08,409 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:08,417 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:08,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:08,435 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-18 17:32:08,436 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-18 17:32:08,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:08,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:08,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:08,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:08,463 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-18 17:32:08,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:08,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:32:08,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-18 17:32:08,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:08,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:08,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:08,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:08,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:08,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:08,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 17:32:08,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:08,519 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-18 17:32:08,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2019-01-18 17:32:08,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:08,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:08,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:08,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:08,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:08,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:08,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:08,543 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:32:08,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 55 [2019-01-18 17:32:08,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:08,564 INFO L267 ElimStorePlain]: 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-18 17:32:08,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-18 17:32:08,582 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-18 17:32:08,583 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:08,612 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-18 17:32:08,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:08,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 17:32:08,632 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:08,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:32:08,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:32:08,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:32:08,633 INFO L87 Difference]: Start difference. First operand 158 states and 646 transitions. Second operand 10 states. [2019-01-18 17:32:09,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:09,066 INFO L93 Difference]: Finished difference Result 161 states and 653 transitions. [2019-01-18 17:32:09,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:32:09,067 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-18 17:32:09,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:09,069 INFO L225 Difference]: With dead ends: 161 [2019-01-18 17:32:09,069 INFO L226 Difference]: Without dead ends: 156 [2019-01-18 17:32:09,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:32:09,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-18 17:32:09,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 33. [2019-01-18 17:32:09,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-18 17:32:09,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 119 transitions. [2019-01-18 17:32:09,135 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 119 transitions. Word has length 7 [2019-01-18 17:32:09,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:09,135 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 119 transitions. [2019-01-18 17:32:09,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:32:09,135 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 119 transitions. [2019-01-18 17:32:09,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:32:09,135 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:09,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:32:09,136 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:32:09,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:09,136 INFO L82 PathProgramCache]: Analyzing trace with hash -305786232, now seen corresponding path program 1 times [2019-01-18 17:32:09,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:09,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:09,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:32:09,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:09,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:09,299 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-18 17:32:09,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:09,299 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:09,299 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 17:32:09,300 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [24], [25] [2019-01-18 17:32:09,300 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:32:09,300 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:32:09,302 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:32:09,303 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-18 17:32:09,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:09,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:32:09,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:09,303 INFO 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-18 17:32:09,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:09,311 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:32:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:09,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:09,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:32:09,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:09,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 17:32:09,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:09,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:09,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-18 17:32:09,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:09,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:09,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:09,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 17:32:09,336 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:09,353 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:09,362 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:09,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:09,385 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-18 17:32:09,386 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-18 17:32:09,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:09,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:09,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:09,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:09,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:09,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:09,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:09,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, 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-18 17:32:09,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:09,440 INFO L267 ElimStorePlain]: 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-18 17:32:09,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:32:09,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:09,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:09,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:09,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:09,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:09,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:09,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:09,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:09,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:09,469 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-18 17:32:09,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:09,500 INFO L267 ElimStorePlain]: 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-18 17:32:09,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:32:09,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:09,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:09,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:09,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:09,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:09,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:09,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:09,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:09,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:09,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:09,530 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:32:09,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:32:09,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:09,563 INFO L267 ElimStorePlain]: 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-18 17:32:09,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-18 17:32:09,583 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-18 17:32:09,583 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:09,626 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-18 17:32:09,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:09,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:32:09,646 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:09,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:32:09,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:32:09,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:32:09,647 INFO L87 Difference]: Start difference. First operand 33 states and 119 transitions. Second operand 10 states. [2019-01-18 17:32:10,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:10,136 INFO L93 Difference]: Finished difference Result 62 states and 209 transitions. [2019-01-18 17:32:10,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:32:10,136 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-18 17:32:10,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:10,138 INFO L225 Difference]: With dead ends: 62 [2019-01-18 17:32:10,138 INFO L226 Difference]: Without dead ends: 52 [2019-01-18 17:32:10,138 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-18 17:32:10,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-18 17:32:10,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2019-01-18 17:32:10,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-18 17:32:10,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 167 transitions. [2019-01-18 17:32:10,239 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 167 transitions. Word has length 8 [2019-01-18 17:32:10,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:10,239 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 167 transitions. [2019-01-18 17:32:10,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:32:10,240 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 167 transitions. [2019-01-18 17:32:10,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:32:10,240 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:10,240 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:32:10,240 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:32:10,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:10,241 INFO L82 PathProgramCache]: Analyzing trace with hash -477561138, now seen corresponding path program 1 times [2019-01-18 17:32:10,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:10,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:10,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:10,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:10,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:10,851 WARN L181 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-01-18 17:32:10,879 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-18 17:32:10,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:10,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:10,880 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 17:32:10,880 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [22], [24], [25] [2019-01-18 17:32:10,880 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:32:10,880 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:32:10,884 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:32:10,884 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-18 17:32:10,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:10,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:32:10,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:10,884 INFO 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-18 17:32:10,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:10,893 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:32:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:10,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:10,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:32:10,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:10,905 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-18 17:32:10,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:10,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:10,909 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-18 17:32:10,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:10,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:10,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:10,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 17:32:10,916 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:10,933 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:10,941 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:10,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:10,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:10,962 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-18 17:32:10,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:10,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:10,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:10,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:10,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:10,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:10,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:10,989 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-18 17:32:10,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:11,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-18 17:32:11,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-18 17:32:11,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:11,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:11,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:11,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:11,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:11,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:11,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:11,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:11,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:11,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, 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-18 17:32:11,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:11,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:32:11,087 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:32:11,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:11,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:11,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:11,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:11,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:11,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:11,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:11,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:11,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:11,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:11,148 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:32:11,149 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-18 17:32:11,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:11,196 INFO L267 ElimStorePlain]: 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-18 17:32:11,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-18 17:32:11,217 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-18 17:32:11,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:11,267 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-18 17:32:11,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:11,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2019-01-18 17:32:11,287 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:11,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:32:11,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:32:11,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:32:11,287 INFO L87 Difference]: Start difference. First operand 45 states and 167 transitions. Second operand 8 states. [2019-01-18 17:32:11,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:11,709 INFO L93 Difference]: Finished difference Result 59 states and 204 transitions. [2019-01-18 17:32:11,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:32:11,709 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-01-18 17:32:11,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:11,709 INFO L225 Difference]: With dead ends: 59 [2019-01-18 17:32:11,710 INFO L226 Difference]: Without dead ends: 52 [2019-01-18 17:32:11,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-01-18 17:32:11,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-18 17:32:11,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2019-01-18 17:32:11,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-18 17:32:11,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 167 transitions. [2019-01-18 17:32:11,834 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 167 transitions. Word has length 8 [2019-01-18 17:32:11,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:11,834 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 167 transitions. [2019-01-18 17:32:11,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:32:11,834 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 167 transitions. [2019-01-18 17:32:11,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:32:11,835 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:11,835 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:32:11,835 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:32:11,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:11,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1160942496, now seen corresponding path program 2 times [2019-01-18 17:32:11,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:11,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:11,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:11,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:11,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:12,138 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 13 [2019-01-18 17:32:12,189 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-18 17:32:12,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:12,189 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:12,189 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:32:12,189 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:32:12,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:12,189 INFO 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-18 17:32:12,199 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:32:12,199 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:32:12,205 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:32:12,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:32:12,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:12,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:32:12,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,217 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-18 17:32:12,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-18 17:32:12,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 17:32:12,237 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:12,287 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:12,297 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:12,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:12,319 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-18 17:32:12,320 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-18 17:32:12,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-18 17:32:12,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:12,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:32:12,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-18 17:32:12,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,402 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-18 17:32:12,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:12,434 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-18 17:32:12,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-18 17:32:12,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:32:12,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:12,516 INFO L267 ElimStorePlain]: 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-18 17:32:12,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-18 17:32:12,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:12,549 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-18 17:32:12,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:12,585 INFO L267 ElimStorePlain]: 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-18 17:32:12,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-18 17:32:12,607 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-18 17:32:12,607 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:12,672 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-18 17:32:12,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:12,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-01-18 17:32:12,692 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:12,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:32:12,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:32:12,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-18 17:32:12,693 INFO L87 Difference]: Start difference. First operand 45 states and 167 transitions. Second operand 10 states. [2019-01-18 17:32:13,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:13,196 INFO L93 Difference]: Finished difference Result 67 states and 237 transitions. [2019-01-18 17:32:13,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:32:13,196 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-18 17:32:13,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:13,197 INFO L225 Difference]: With dead ends: 67 [2019-01-18 17:32:13,197 INFO L226 Difference]: Without dead ends: 32 [2019-01-18 17:32:13,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:32:13,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-18 17:32:13,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-01-18 17:32:13,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-18 17:32:13,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 100 transitions. [2019-01-18 17:32:13,290 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 100 transitions. Word has length 9 [2019-01-18 17:32:13,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:13,290 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 100 transitions. [2019-01-18 17:32:13,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:32:13,290 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 100 transitions. [2019-01-18 17:32:13,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:32:13,291 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:13,291 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:32:13,291 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:32:13,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:13,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1292813016, now seen corresponding path program 1 times [2019-01-18 17:32:13,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:13,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:13,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:32:13,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:13,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:13,385 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-18 17:32:13,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:13,386 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:13,386 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 17:32:13,386 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [24], [25] [2019-01-18 17:32:13,387 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:32:13,387 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:32:13,389 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:32:13,389 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-18 17:32:13,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:13,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:32:13,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:13,389 INFO 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-18 17:32:13,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:13,399 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:32:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:13,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:13,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:32:13,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,416 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-18 17:32:13,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-18 17:32:13,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 17:32:13,428 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:13,446 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:13,456 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:13,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:13,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:32:13,478 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-18 17:32:13,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32: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, 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-18 17:32:13,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:13,534 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-18 17:32:13,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-18 17:32:13,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,564 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-18 17:32:13,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:13,593 INFO L267 ElimStorePlain]: 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-18 17:32:13,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:32:13,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,624 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-18 17:32:13,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:13,655 INFO L267 ElimStorePlain]: 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-18 17:32:13,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-18 17:32:13,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:13,688 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:32:13,689 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-18 17:32:13,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:13,723 INFO L267 ElimStorePlain]: 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-18 17:32:13,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-18 17:32:13,743 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-18 17:32:13,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:13,785 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-18 17:32:13,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:13,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-01-18 17:32:13,803 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:13,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:32:13,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:32:13,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-01-18 17:32:13,804 INFO L87 Difference]: Start difference. First operand 30 states and 100 transitions. Second operand 10 states. [2019-01-18 17:32:14,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:14,178 INFO L93 Difference]: Finished difference Result 47 states and 147 transitions. [2019-01-18 17:32:14,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:32:14,179 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-18 17:32:14,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:14,180 INFO L225 Difference]: With dead ends: 47 [2019-01-18 17:32:14,180 INFO L226 Difference]: Without dead ends: 40 [2019-01-18 17:32:14,180 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-18 17:32:14,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-18 17:32:14,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2019-01-18 17:32:14,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-18 17:32:14,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 122 transitions. [2019-01-18 17:32:14,305 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 122 transitions. Word has length 9 [2019-01-18 17:32:14,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:14,305 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 122 transitions. [2019-01-18 17:32:14,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:32:14,305 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 122 transitions. [2019-01-18 17:32:14,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:32:14,305 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:14,306 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:32:14,306 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:32:14,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:14,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1875225892, now seen corresponding path program 2 times [2019-01-18 17:32:14,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:14,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:14,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:14,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:14,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:14,435 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-18 17:32:14,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:14,436 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:14,436 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:32:14,436 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:32:14,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:14,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 17:32:14,451 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:32:14,451 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:32:14,460 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:32:14,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:32:14,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:14,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-18 17:32:14,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,469 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-18 17:32:14,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,475 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-18 17:32:14,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 17:32:14,483 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:14,499 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:14,507 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:14,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:14,532 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-18 17:32:14,532 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-18 17:32:14,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:32:14,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:14,582 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-18 17:32:14,583 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-18 17:32:14,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,615 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-18 17:32:14,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:14,642 INFO L267 ElimStorePlain]: 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-18 17:32:14,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:32:14,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,701 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:32:14,701 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-18 17:32:14,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:14,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:32:14,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-18 17:32:14,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:14,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:32:14,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:14,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:32:14,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-18 17:32:14,824 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-18 17:32:14,824 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:14,872 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-18 17:32:14,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:14,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-18 17:32:14,892 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:14,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:32:14,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:32:14,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:32:14,893 INFO L87 Difference]: Start difference. First operand 36 states and 122 transitions. Second operand 11 states. [2019-01-18 17:32:15,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:15,337 INFO L93 Difference]: Finished difference Result 52 states and 168 transitions. [2019-01-18 17:32:15,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:32:15,337 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-18 17:32:15,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:15,338 INFO L225 Difference]: With dead ends: 52 [2019-01-18 17:32:15,338 INFO L226 Difference]: Without dead ends: 45 [2019-01-18 17:32:15,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-01-18 17:32:15,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-18 17:32:15,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2019-01-18 17:32:15,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-18 17:32:15,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 138 transitions. [2019-01-18 17:32:15,471 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 138 transitions. Word has length 9 [2019-01-18 17:32:15,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:15,471 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 138 transitions. [2019-01-18 17:32:15,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:32:15,471 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 138 transitions. [2019-01-18 17:32:15,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:32:15,472 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:15,472 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:32:15,472 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:32:15,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:15,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1867837724, now seen corresponding path program 1 times [2019-01-18 17:32:15,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:15,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:15,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:32:15,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:15,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:15,657 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-18 17:32:15,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:15,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:15,657 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 17:32:15,657 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [22], [24], [25] [2019-01-18 17:32:15,658 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:32:15,658 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:32:15,660 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:32:15,661 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-18 17:32:15,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:15,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:32:15,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:15,661 INFO 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-18 17:32:15,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:15,671 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:32:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:15,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:15,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:32:15,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:15,684 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-18 17:32:15,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:15,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:15,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-18 17:32:15,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:15,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:15,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:15,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 17:32:15,709 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:15,726 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:15,736 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:15,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:15,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:15,758 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-18 17:32:15,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:15,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:15,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:15,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:15,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:15,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:15,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:15,785 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-18 17:32:15,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:15,813 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-18 17:32:15,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-18 17:32:15,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:15,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:15,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:15,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:15,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:16,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:16,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:16,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:16,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:16,075 INFO L303 Elim1Store]: Index analysis took 235 ms [2019-01-18 17:32:16,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:32:16,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:16,176 INFO L267 ElimStorePlain]: 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-18 17:32:16,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 17:32:16,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:16,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:16,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:16,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:16,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:16,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:16,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:16,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:16,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:16,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:16,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:16,228 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:32:16,228 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-18 17:32:16,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:16,269 INFO L267 ElimStorePlain]: 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-18 17:32:16,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-18 17:32:16,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:16,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:16,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:16,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:16,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:16,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:16,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:16,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:16,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:16,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:16,342 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:32:16,342 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-18 17:32:16,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:16,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:32:16,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-18 17:32:16,416 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-18 17:32:16,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:16,587 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-18 17:32:16,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:16,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-18 17:32:16,606 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:16,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:32:16,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:32:16,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:32:16,607 INFO L87 Difference]: Start difference. First operand 40 states and 138 transitions. Second operand 12 states. [2019-01-18 17:32:17,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:17,164 INFO L93 Difference]: Finished difference Result 66 states and 218 transitions. [2019-01-18 17:32:17,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:32:17,165 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-18 17:32:17,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:17,165 INFO L225 Difference]: With dead ends: 66 [2019-01-18 17:32:17,166 INFO L226 Difference]: Without dead ends: 56 [2019-01-18 17:32:17,166 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-18 17:32:17,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-18 17:32:17,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2019-01-18 17:32:17,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-18 17:32:17,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 140 transitions. [2019-01-18 17:32:17,319 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 140 transitions. Word has length 9 [2019-01-18 17:32:17,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:17,319 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 140 transitions. [2019-01-18 17:32:17,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:32:17,319 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 140 transitions. [2019-01-18 17:32:17,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-18 17:32:17,319 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:17,319 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 17:32:17,319 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:32:17,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:17,320 INFO L82 PathProgramCache]: Analyzing trace with hash 638911500, now seen corresponding path program 2 times [2019-01-18 17:32:17,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:17,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:17,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:17,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:17,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:17,526 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 19 [2019-01-18 17:32:17,671 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-18 17:32:17,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:17,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:17,671 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:32:17,671 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:32:17,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:17,671 INFO 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-18 17:32:17,681 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:32:17,681 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:32:17,687 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-18 17:32:17,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:32:17,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:17,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 17:32:17,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:17,694 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-18 17:32:17,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:17,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:17,700 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-18 17:32:17,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:17,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:17,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:17,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-18 17:32:17,705 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:17,723 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:17,733 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:17,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:17,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:17,753 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-18 17:32:17,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:17,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:17,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:17,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:17,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:17,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:17,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:17,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:32:17,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:17,808 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-18 17:32:17,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-18 17:32:17,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:17,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:17,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:17,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:17,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:17,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:17,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:17,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:17,908 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:32:17,908 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-18 17:32:17,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:17,937 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-18 17:32:17,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-18 17:32:17,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:17,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:17,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:17,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:17,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:17,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:17,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:17,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:17,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:17,969 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-18 17:32:17,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:17,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:32:17,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:34 [2019-01-18 17:32:18,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:18,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:18,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:18,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:18,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:18,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:18,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:18,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:18,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:18,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:18,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:18,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:18,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 17:32:18,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:18,069 INFO L267 ElimStorePlain]: 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-18 17:32:18,070 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-01-18 17:32:18,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:18,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:18,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:18,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:18,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:18,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:18,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:18,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:18,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:18,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:18,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:18,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:32:18,104 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-18 17:32:18,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:18,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:32:18,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-18 17:32:18,162 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-18 17:32:18,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:18,228 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-18 17:32:18,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:18,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 16 [2019-01-18 17:32:18,248 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:18,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:32:18,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:32:18,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2019-01-18 17:32:18,249 INFO L87 Difference]: Start difference. First operand 40 states and 140 transitions. Second operand 12 states. [2019-01-18 17:32:18,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:18,841 INFO L93 Difference]: Finished difference Result 48 states and 164 transitions. [2019-01-18 17:32:18,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:32:18,841 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2019-01-18 17:32:18,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:18,841 INFO L225 Difference]: With dead ends: 48 [2019-01-18 17:32:18,842 INFO L226 Difference]: Without dead ends: 0 [2019-01-18 17:32:18,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-01-18 17:32:18,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-18 17:32:18,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-18 17:32:18,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-18 17:32:18,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-18 17:32:18,843 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-01-18 17:32:18,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:18,844 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-18 17:32:18,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:32:18,844 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-18 17:32:18,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 17:32:18,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-18 17:32:18,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:18,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:18,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:19,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:19,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:19,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:19,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:19,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:19,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:19,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:19,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:19,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:19,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:19,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:19,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:19,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:19,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:19,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:19,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:19,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:19,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:19,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:19,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:19,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:19,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:20,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:20,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:21,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:21,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:21,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:21,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:21,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:21,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:21,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:21,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:21,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:21,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:21,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:21,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:21,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:21,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:21,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:22,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:22,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:22,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:22,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:22,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:22,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:22,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:23,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:23,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:23,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:23,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:23,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:23,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:23,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:23,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:23,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:23,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:23,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:23,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:23,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:24,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:24,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:24,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:24,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:24,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:24,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:24,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:24,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:25,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:25,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:25,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:25,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:26,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:26,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:26,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:26,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:26,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:26,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:27,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:27,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:27,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:27,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:28,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:28,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:28,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:29,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:32:29,112 WARN L181 SmtUtils]: Spent 10.26 s on a formula simplification. DAG size of input: 1855 DAG size of output: 1101 [2019-01-18 17:32:44,878 WARN L181 SmtUtils]: Spent 15.75 s on a formula simplification. DAG size of input: 1000 DAG size of output: 85 [2019-01-18 17:32:44,881 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-18 17:32:44,881 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 45) no Hoare annotation was computed. [2019-01-18 17:32:44,881 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-18 17:32:44,881 INFO L448 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2019-01-18 17:32:44,881 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 43) no Hoare annotation was computed. [2019-01-18 17:32:44,882 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-18 17:32:44,882 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 46) no Hoare annotation was computed. [2019-01-18 17:32:44,882 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-18 17:32:44,882 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 44) no Hoare annotation was computed. [2019-01-18 17:32:44,882 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 48) no Hoare annotation was computed. [2019-01-18 17:32:44,882 INFO L448 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-01-18 17:32:44,897 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.01 05:32:44 BoogieIcfgContainer [2019-01-18 17:32:44,898 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-18 17:32:44,899 INFO L168 Benchmark]: Toolchain (without parser) took 86521.23 ms. Allocated memory was 141.6 MB in the beginning and 826.3 MB in the end (delta: 684.7 MB). Free memory was 106.7 MB in the beginning and 189.3 MB in the end (delta: -82.6 MB). Peak memory consumption was 676.2 MB. Max. memory is 7.1 GB. [2019-01-18 17:32:44,899 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 141.6 MB. Free memory is still 107.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-18 17:32:44,899 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.94 ms. Allocated memory is still 141.6 MB. Free memory was 106.3 MB in the beginning and 104.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-01-18 17:32:44,900 INFO L168 Benchmark]: Boogie Preprocessor took 23.30 ms. Allocated memory is still 141.6 MB. Free memory was 104.2 MB in the beginning and 102.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-18 17:32:44,900 INFO L168 Benchmark]: RCFGBuilder took 405.77 ms. Allocated memory is still 141.6 MB. Free memory was 102.9 MB in the beginning and 92.5 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2019-01-18 17:32:44,900 INFO L168 Benchmark]: TraceAbstraction took 86033.90 ms. Allocated memory was 141.6 MB in the beginning and 826.3 MB in the end (delta: 684.7 MB). Free memory was 92.5 MB in the beginning and 189.3 MB in the end (delta: -96.9 MB). Peak memory consumption was 661.9 MB. Max. memory is 7.1 GB. [2019-01-18 17:32:44,902 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.18 ms. Allocated memory is still 141.6 MB. Free memory is still 107.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 53.94 ms. Allocated memory is still 141.6 MB. Free memory was 106.3 MB in the beginning and 104.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.30 ms. Allocated memory is still 141.6 MB. Free memory was 104.2 MB in the beginning and 102.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 405.77 ms. Allocated memory is still 141.6 MB. Free memory was 102.9 MB in the beginning and 92.5 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 86033.90 ms. Allocated memory was 141.6 MB in the beginning and 826.3 MB in the end (delta: 684.7 MB). Free memory was 92.5 MB in the beginning and 189.3 MB in the end (delta: -96.9 MB). Peak memory consumption was 661.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 43]: 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.9s OverallTime, 57 OverallIterations, 2 TraceHistogramMax, 21.6s AutomataDifference, 0.0s DeadEndRemovalTime, 26.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 210 SDtfs, 857 SDslu, 1 SDs, 0 SdLazy, 8790 SolverSat, 608 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 875 GetRequests, 174 SyntacticMatches, 38 SemanticMatches, 663 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2487 ImplicationChecksByTransitivity, 20.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.6s AutomataMinimizationTime, 57 MinimizatonAttempts, 1522 StatesRemovedByMinimization, 56 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 64 NumberOfFragments, 342 HoareAnnotationTreeSize, 1 FomulaSimplifications, 181006621 FormulaSimplificationTreeSizeReduction, 10.2s HoareSimplificationTime, 1 FomulaSimplificationsInter, 10044512 FormulaSimplificationTreeSizeReductionInter, 15.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 32.4s 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...