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-f57a05f [2019-01-08 14:02:29,119 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-08 14:02:29,121 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-08 14:02:29,135 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-08 14:02:29,135 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-08 14:02:29,136 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-08 14:02:29,137 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-08 14:02:29,139 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-08 14:02:29,141 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-08 14:02:29,142 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-08 14:02:29,143 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-08 14:02:29,143 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-08 14:02:29,144 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-08 14:02:29,145 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-08 14:02:29,151 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-08 14:02:29,151 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-08 14:02:29,152 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-08 14:02:29,157 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-08 14:02:29,159 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-08 14:02:29,161 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-08 14:02:29,162 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-08 14:02:29,163 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-08 14:02:29,165 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-08 14:02:29,165 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-08 14:02:29,166 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-08 14:02:29,167 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-08 14:02:29,167 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-08 14:02:29,168 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-08 14:02:29,169 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-08 14:02:29,170 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-08 14:02:29,170 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-08 14:02:29,171 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-08 14:02:29,171 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-08 14:02:29,171 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-08 14:02:29,172 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-08 14:02:29,173 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-08 14:02:29,173 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-08 14:02:29,188 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-08 14:02:29,188 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-08 14:02:29,189 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-08 14:02:29,189 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-08 14:02:29,190 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-08 14:02:29,190 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-08 14:02:29,190 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-08 14:02:29,190 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-08 14:02:29,191 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-08 14:02:29,191 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-08 14:02:29,191 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-08 14:02:29,191 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-08 14:02:29,191 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-08 14:02:29,191 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-08 14:02:29,192 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-08 14:02:29,192 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-08 14:02:29,193 INFO L133 SettingsManager]: * Use SBE=true [2019-01-08 14:02:29,193 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-08 14:02:29,193 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-08 14:02:29,193 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-08 14:02:29,194 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-08 14:02:29,194 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-08 14:02:29,194 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-08 14:02:29,194 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-08 14:02:29,194 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-08 14:02:29,195 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-08 14:02:29,195 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-08 14:02:29,195 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-08 14:02:29,195 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-08 14:02:29,196 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-08 14:02:29,196 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-08 14:02:29,196 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-08 14:02:29,196 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-08 14:02:29,196 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-08 14:02:29,197 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-08 14:02:29,197 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-08 14:02:29,197 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-08 14:02:29,197 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-08 14:02:29,197 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-08 14:02:29,198 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-08 14:02:29,235 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-08 14:02:29,248 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-08 14:02:29,252 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-08 14:02:29,254 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-08 14:02:29,255 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-08 14:02:29,255 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-08 14:02:29,256 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl' [2019-01-08 14:02:29,302 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-08 14:02:29,304 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-08 14:02:29,305 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-08 14:02:29,305 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-08 14:02:29,305 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-08 14:02:29,323 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 08.01 02:02:29" (1/1) ... [2019-01-08 14:02:29,336 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 08.01 02:02:29" (1/1) ... [2019-01-08 14:02:29,362 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-08 14:02:29,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-08 14:02:29,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-08 14:02:29,363 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-08 14:02:29,376 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 08.01 02:02:29" (1/1) ... [2019-01-08 14:02:29,376 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 08.01 02:02:29" (1/1) ... [2019-01-08 14:02:29,378 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 08.01 02:02:29" (1/1) ... [2019-01-08 14:02:29,378 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 08.01 02:02:29" (1/1) ... [2019-01-08 14:02:29,382 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 08.01 02:02:29" (1/1) ... [2019-01-08 14:02:29,386 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 08.01 02:02:29" (1/1) ... [2019-01-08 14:02:29,387 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 08.01 02:02:29" (1/1) ... [2019-01-08 14:02:29,389 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-08 14:02:29,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-08 14:02:29,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-08 14:02:29,390 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-08 14:02:29,391 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 08.01 02:02:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-08 14:02:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-08 14:02:29,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-08 14:02:29,691 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-08 14:02:29,692 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-08 14:02:29,693 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 02:02:29 BoogieIcfgContainer [2019-01-08 14:02:29,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-08 14:02:29,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-08 14:02:29,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-08 14:02:29,698 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-08 14:02:29,698 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 08.01 02:02:29" (1/2) ... [2019-01-08 14:02:29,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f31b9ad and model type speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 02:02:29, skipping insertion in model container [2019-01-08 14:02:29,699 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 08.01 02:02:29" (2/2) ... [2019-01-08 14:02:29,702 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-limited.bpl [2019-01-08 14:02:29,712 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-08 14:02:29,721 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-08 14:02:29,739 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-08 14:02:29,775 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-08 14:02:29,775 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-08 14:02:29,775 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-08 14:02:29,775 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-08 14:02:29,776 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-08 14:02:29,776 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-08 14:02:29,776 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-08 14:02:29,776 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-08 14:02:29,796 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-01-08 14:02:29,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-08 14:02:29,806 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:29,809 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-08 14:02:29,812 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:29,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:29,821 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-01-08 14:02:29,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:29,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:29,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:29,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:29,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:30,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:30,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:02:30,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-08 14:02:30,061 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:02:30,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-08 14:02:30,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-08 14:02:30,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 14:02:30,098 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-01-08 14:02:30,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:30,289 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-01-08 14:02:30,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:02:30,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-08 14:02:30,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:30,306 INFO L225 Difference]: With dead ends: 21 [2019-01-08 14:02:30,306 INFO L226 Difference]: Without dead ends: 16 [2019-01-08 14:02:30,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 14:02:30,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-08 14:02:30,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-01-08 14:02:30,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-08 14:02:30,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-01-08 14:02:30,348 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-01-08 14:02:30,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:30,349 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-01-08 14:02:30,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-08 14:02:30,350 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-01-08 14:02:30,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:02:30,350 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:30,350 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:02:30,351 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:30,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:30,351 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-01-08 14:02:30,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:30,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:30,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:30,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:30,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:30,518 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-08 14:02:30,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:30,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:30,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:30,533 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-08 14:02:30,535 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-01-08 14:02:30,575 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:30,575 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:30,647 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:30,648 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-08 14:02:30,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:30,655 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:30,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:30,655 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:30,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:30,672 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:30,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:30,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:02:30,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:30,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-08 14:02:30,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:30,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:30,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:02:30,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:30,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:30,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:30,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-08 14:02:30,795 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:30,924 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:31,048 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:31,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:31,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:31,202 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-08 14:02:31,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:31,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:31,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:31,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:31,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:31,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:31,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:31,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:02:31,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:31,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:31,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-08 14:02:31,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:31,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:31,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:31,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:31,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:02:31,589 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:31,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:02:31,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:02:31,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:02:31,591 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 6 states. [2019-01-08 14:02:31,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:31,960 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2019-01-08 14:02:31,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:02:31,962 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-08 14:02:31,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:31,963 INFO L225 Difference]: With dead ends: 31 [2019-01-08 14:02:31,963 INFO L226 Difference]: Without dead ends: 28 [2019-01-08 14:02:31,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-08 14:02:31,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-08 14:02:31,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 13. [2019-01-08 14:02:31,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-08 14:02:31,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2019-01-08 14:02:31,970 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 25 transitions. Word has length 3 [2019-01-08 14:02:31,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:31,971 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 25 transitions. [2019-01-08 14:02:31,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:02:31,972 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 25 transitions. [2019-01-08 14:02:31,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:02:31,973 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:31,973 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:02:31,973 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:31,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:31,974 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-01-08 14:02:31,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:31,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:31,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:31,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:31,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:32,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:32,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:02:32,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-08 14:02:32,042 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:02:32,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-08 14:02:32,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-08 14:02:32,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 14:02:32,043 INFO L87 Difference]: Start difference. First operand 13 states and 25 transitions. Second operand 3 states. [2019-01-08 14:02:32,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:32,106 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2019-01-08 14:02:32,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:02:32,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-08 14:02:32,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:32,108 INFO L225 Difference]: With dead ends: 15 [2019-01-08 14:02:32,108 INFO L226 Difference]: Without dead ends: 14 [2019-01-08 14:02:32,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 14:02:32,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-08 14:02:32,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-01-08 14:02:32,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-08 14:02:32,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2019-01-08 14:02:32,114 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 3 [2019-01-08 14:02:32,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:32,114 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 24 transitions. [2019-01-08 14:02:32,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-08 14:02:32,114 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 24 transitions. [2019-01-08 14:02:32,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:02:32,115 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:32,115 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:02:32,115 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:32,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:32,116 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-01-08 14:02:32,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:32,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:32,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:32,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:32,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:32,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:32,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:32,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:32,184 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-08 14:02:32,184 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-01-08 14:02:32,186 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:32,186 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:32,195 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:32,196 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-08 14:02:32,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:32,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:32,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:32,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:32,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:32,208 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:32,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:32,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:02:32,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:32,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-08 14:02:32,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:32,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:32,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:02:32,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:32,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:32,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:32,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:02:32,443 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:32,621 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:32,633 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:32,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:32,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:32,674 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:25, output treesize:30 [2019-01-08 14:02:32,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:32,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:32,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:32,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:32,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:32,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:32,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:32,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:02:32,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:32,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:32,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-08 14:02:32,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:32,818 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:32,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:32,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-08 14:02:32,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-08 14:02:32,857 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:02:32,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:02:32,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:02:32,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:02:32,859 INFO L87 Difference]: Start difference. First operand 13 states and 24 transitions. Second operand 4 states. [2019-01-08 14:02:32,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:32,931 INFO L93 Difference]: Finished difference Result 18 states and 41 transitions. [2019-01-08 14:02:32,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-08 14:02:32,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-08 14:02:32,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:32,933 INFO L225 Difference]: With dead ends: 18 [2019-01-08 14:02:32,933 INFO L226 Difference]: Without dead ends: 17 [2019-01-08 14:02:32,934 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-08 14:02:32,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-08 14:02:32,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-01-08 14:02:32,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-08 14:02:32,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2019-01-08 14:02:32,940 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 40 transitions. Word has length 3 [2019-01-08 14:02:32,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:32,940 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 40 transitions. [2019-01-08 14:02:32,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:02:32,941 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 40 transitions. [2019-01-08 14:02:32,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:02:32,941 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:32,942 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:02:32,942 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:32,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:32,942 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-01-08 14:02:32,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:32,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:32,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:32,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:32,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:33,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:33,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:33,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:33,011 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-08 14:02:33,011 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-01-08 14:02:33,013 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:33,014 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:33,021 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:33,021 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-08 14:02:33,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:33,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:33,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:33,022 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:33,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:33,104 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:33,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:33,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:02:33,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:33,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-08 14:02:33,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:33,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:33,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:02:33,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:33,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:33,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:33,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-08 14:02:33,162 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:33,216 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:33,233 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:33,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:33,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:33,272 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-08 14:02:33,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:33,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:33,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:33,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:33,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:33,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:33,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:33,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:02:33,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:33,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:33,436 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-08 14:02:33,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:33,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:33,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:33,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:33,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:02:33,538 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:33,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:02:33,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:02:33,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:02:33,539 INFO L87 Difference]: Start difference. First operand 16 states and 40 transitions. Second operand 6 states. [2019-01-08 14:02:33,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:33,715 INFO L93 Difference]: Finished difference Result 32 states and 62 transitions. [2019-01-08 14:02:33,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:02:33,717 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-08 14:02:33,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:33,718 INFO L225 Difference]: With dead ends: 32 [2019-01-08 14:02:33,718 INFO L226 Difference]: Without dead ends: 31 [2019-01-08 14:02:33,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-08 14:02:33,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-08 14:02:33,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2019-01-08 14:02:33,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-08 14:02:33,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2019-01-08 14:02:33,726 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 50 transitions. Word has length 3 [2019-01-08 14:02:33,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:33,726 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 50 transitions. [2019-01-08 14:02:33,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:02:33,727 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 50 transitions. [2019-01-08 14:02:33,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:02:33,727 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:33,727 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:02:33,728 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:33,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:33,728 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2019-01-08 14:02:33,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:33,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:33,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:33,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:33,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:33,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:33,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:33,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:33,798 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:02:33,799 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2019-01-08 14:02:33,801 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:33,802 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:33,812 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:33,812 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-08 14:02:33,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:33,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:33,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:33,813 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:33,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:33,828 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:33,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:33,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:02:33,852 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-08 14:02:33,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:33,864 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-08 14:02:33,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:33,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:33,883 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-08 14:02:33,884 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:33,914 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:33,925 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:33,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:33,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:33,978 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-01-08 14:02:34,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:34,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:34,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:34,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:34,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-08 14:02:34,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:34,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:34,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-08 14:02:34,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:34,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:34,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:34,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-08 14:02:34,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-08 14:02:34,178 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:02:34,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:02:34,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:02:34,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:02:34,179 INFO L87 Difference]: Start difference. First operand 18 states and 50 transitions. Second operand 4 states. [2019-01-08 14:02:34,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:34,224 INFO L93 Difference]: Finished difference Result 22 states and 58 transitions. [2019-01-08 14:02:34,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:02:34,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-08 14:02:34,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:34,226 INFO L225 Difference]: With dead ends: 22 [2019-01-08 14:02:34,226 INFO L226 Difference]: Without dead ends: 21 [2019-01-08 14:02:34,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:02:34,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-08 14:02:34,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-01-08 14:02:34,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-08 14:02:34,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2019-01-08 14:02:34,233 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 57 transitions. Word has length 4 [2019-01-08 14:02:34,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:34,233 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 57 transitions. [2019-01-08 14:02:34,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:02:34,233 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 57 transitions. [2019-01-08 14:02:34,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:02:34,234 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:34,234 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:02:34,234 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:34,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:34,235 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2019-01-08 14:02:34,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:34,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:34,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:34,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:34,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:34,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:34,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:34,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:34,367 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:02:34,367 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2019-01-08 14:02:34,370 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:34,370 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:34,376 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:34,376 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-08 14:02:34,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:34,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:34,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:34,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:34,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:34,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:34,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:34,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-08 14:02:34,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:34,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:02:34,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:34,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:34,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:02:34,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:34,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:34,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:34,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-08 14:02:34,449 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:34,476 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:34,487 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:34,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:34,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:34,518 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-08 14:02:34,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:34,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:34,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:34,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:34,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:34,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:34,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:34,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:02:34,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:34,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:34,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:02:34,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:34,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:34,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:34,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:34,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:34,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:34,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:34,661 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:02:34,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-08 14:02:34,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:34,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:34,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-08 14:02:34,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:34,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:34,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:34,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:34,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:02:34,856 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:34,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:02:34,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:02:34,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:02:34,857 INFO L87 Difference]: Start difference. First operand 20 states and 57 transitions. Second operand 8 states. [2019-01-08 14:02:35,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:35,174 INFO L93 Difference]: Finished difference Result 37 states and 74 transitions. [2019-01-08 14:02:35,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:02:35,175 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:02:35,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:35,176 INFO L225 Difference]: With dead ends: 37 [2019-01-08 14:02:35,176 INFO L226 Difference]: Without dead ends: 36 [2019-01-08 14:02:35,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:02:35,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-08 14:02:35,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 17. [2019-01-08 14:02:35,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-08 14:02:35,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2019-01-08 14:02:35,183 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 41 transitions. Word has length 4 [2019-01-08 14:02:35,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:35,184 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 41 transitions. [2019-01-08 14:02:35,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:02:35,184 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 41 transitions. [2019-01-08 14:02:35,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:02:35,184 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:35,185 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:02:35,185 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:35,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:35,185 INFO L82 PathProgramCache]: Analyzing trace with hash 939350, now seen corresponding path program 1 times [2019-01-08 14:02:35,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:35,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:35,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:35,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:35,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:35,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:35,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:35,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:35,343 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:02:35,344 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2019-01-08 14:02:35,347 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:35,347 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:35,354 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:35,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 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 14:02:35,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:35,355 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:35,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:35,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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:35,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:35,368 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:35,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:35,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:02:35,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:35,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-08 14:02:35,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:35,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:35,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:02:35,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:35,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:35,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:35,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:02:35,411 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:35,437 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:35,457 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:35,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:35,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:35,488 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-08 14:02:35,694 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-08 14:02:35,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:35,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:35,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:35,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:35,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:35,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:35,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:35,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:02:35,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:35,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:35,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:02:35,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:35,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:35,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:35,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:35,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:35,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:35,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:35,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:35,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:35,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-08 14:02:35,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:35,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:35,939 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-08 14:02:35,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-08 14:02:35,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:36,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:36,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:36,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:02:36,047 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:36,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:02:36,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:02:36,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:02:36,048 INFO L87 Difference]: Start difference. First operand 17 states and 41 transitions. Second operand 8 states. [2019-01-08 14:02:36,317 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-01-08 14:02:36,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:36,508 INFO L93 Difference]: Finished difference Result 42 states and 89 transitions. [2019-01-08 14:02:36,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:02:36,509 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:02:36,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:36,511 INFO L225 Difference]: With dead ends: 42 [2019-01-08 14:02:36,511 INFO L226 Difference]: Without dead ends: 38 [2019-01-08 14:02:36,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:02:36,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-08 14:02:36,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 22. [2019-01-08 14:02:36,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-08 14:02:36,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 65 transitions. [2019-01-08 14:02:36,521 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 65 transitions. Word has length 4 [2019-01-08 14:02:36,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:36,522 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 65 transitions. [2019-01-08 14:02:36,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:02:36,522 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 65 transitions. [2019-01-08 14:02:36,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:02:36,522 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:36,523 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:02:36,523 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:36,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:36,523 INFO L82 PathProgramCache]: Analyzing trace with hash 929802, now seen corresponding path program 1 times [2019-01-08 14:02:36,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:36,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:36,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:36,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:36,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:36,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:36,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:36,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:36,685 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:02:36,685 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2019-01-08 14:02:36,687 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:36,687 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:36,692 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:36,692 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-08 14:02:36,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:36,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:36,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:36,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:36,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:36,705 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:36,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:36,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:02:36,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:36,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-08 14:02:36,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:36,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:36,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-08 14:02:36,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:36,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:36,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:36,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:02:36,742 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:36,768 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:36,780 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:36,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:36,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:36,811 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-08 14:02:36,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:36,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:36,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:36,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:36,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:36,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:36,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:36,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:02:36,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:36,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:36,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:02:36,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:36,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:36,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:36,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:36,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:36,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:36,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:36,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:36,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:36,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-08 14:02:36,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:37,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:37,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-08 14:02:37,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:37,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:37,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:37,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:37,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:02:37,140 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:37,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:02:37,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:02:37,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:02:37,141 INFO L87 Difference]: Start difference. First operand 22 states and 65 transitions. Second operand 8 states. [2019-01-08 14:02:37,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:37,561 INFO L93 Difference]: Finished difference Result 51 states and 112 transitions. [2019-01-08 14:02:37,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:02:37,562 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:02:37,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:37,564 INFO L225 Difference]: With dead ends: 51 [2019-01-08 14:02:37,564 INFO L226 Difference]: Without dead ends: 48 [2019-01-08 14:02:37,565 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-08 14:02:37,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-08 14:02:37,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 28. [2019-01-08 14:02:37,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-08 14:02:37,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 88 transitions. [2019-01-08 14:02:37,575 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 88 transitions. Word has length 4 [2019-01-08 14:02:37,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:37,575 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 88 transitions. [2019-01-08 14:02:37,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:02:37,575 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 88 transitions. [2019-01-08 14:02:37,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:02:37,576 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:37,576 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:02:37,577 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:37,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:37,577 INFO L82 PathProgramCache]: Analyzing trace with hash 929928, now seen corresponding path program 1 times [2019-01-08 14:02:37,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:37,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:37,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:37,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:37,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:37,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:37,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:37,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:37,662 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:02:37,662 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [21] [2019-01-08 14:02:37,667 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:37,667 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:37,674 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:37,675 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-08 14:02:37,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:37,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:37,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:37,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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:37,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:37,684 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:37,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:37,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:02:37,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:37,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-08 14:02:37,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:37,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:37,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:02:37,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:37,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:37,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:37,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, 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-08 14:02:37,735 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:37,767 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:37,788 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:37,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:37,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:37,827 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-08 14:02:37,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:37,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:37,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:37,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:37,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:37,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:37,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:37,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:02:37,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:37,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:37,920 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-08 14:02:37,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:37,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:38,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:38,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:38,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:02:38,037 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:38,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:02:38,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:02:38,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:02:38,038 INFO L87 Difference]: Start difference. First operand 28 states and 88 transitions. Second operand 6 states. [2019-01-08 14:02:38,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:38,269 INFO L93 Difference]: Finished difference Result 36 states and 98 transitions. [2019-01-08 14:02:38,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:02:38,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-08 14:02:38,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:38,271 INFO L225 Difference]: With dead ends: 36 [2019-01-08 14:02:38,271 INFO L226 Difference]: Without dead ends: 35 [2019-01-08 14:02:38,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-08 14:02:38,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-08 14:02:38,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-01-08 14:02:38,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-08 14:02:38,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 92 transitions. [2019-01-08 14:02:38,281 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 92 transitions. Word has length 4 [2019-01-08 14:02:38,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:38,282 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 92 transitions. [2019-01-08 14:02:38,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:02:38,282 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 92 transitions. [2019-01-08 14:02:38,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:02:38,283 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:38,283 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:02:38,283 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:38,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:38,284 INFO L82 PathProgramCache]: Analyzing trace with hash 929616, now seen corresponding path program 1 times [2019-01-08 14:02:38,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:38,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:38,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:38,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:38,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:38,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:38,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:38,384 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:38,385 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:02:38,385 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [19] [2019-01-08 14:02:38,386 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:38,386 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:38,390 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:38,391 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-08 14:02:38,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:38,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:38,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:38,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:38,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:38,403 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:38,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:38,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:38,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:02:38,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:38,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-08 14:02:38,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:38,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:38,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:02:38,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:38,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:38,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:38,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-08 14:02:38,480 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:38,518 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:38,530 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:38,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:38,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:38,561 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-08 14:02:38,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:38,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:38,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:38,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:38,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:38,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:38,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:38,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:02:38,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:38,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:38,676 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:02:38,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:38,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:38,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:38,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:38,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:38,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:38,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:38,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:38,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:38,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-08 14:02:38,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:38,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:38,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-08 14:02:38,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:38,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:38,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:38,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:38,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:02:38,837 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:38,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:02:38,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:02:38,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:02:38,838 INFO L87 Difference]: Start difference. First operand 29 states and 92 transitions. Second operand 8 states. [2019-01-08 14:02:39,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:39,270 INFO L93 Difference]: Finished difference Result 55 states and 140 transitions. [2019-01-08 14:02:39,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:02:39,271 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:02:39,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:39,272 INFO L225 Difference]: With dead ends: 55 [2019-01-08 14:02:39,272 INFO L226 Difference]: Without dead ends: 54 [2019-01-08 14:02:39,273 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-08 14:02:39,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-08 14:02:39,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 34. [2019-01-08 14:02:39,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-08 14:02:39,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 117 transitions. [2019-01-08 14:02:39,284 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 117 transitions. Word has length 4 [2019-01-08 14:02:39,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:39,284 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 117 transitions. [2019-01-08 14:02:39,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:02:39,284 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 117 transitions. [2019-01-08 14:02:39,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:02:39,285 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:39,285 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:02:39,285 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:39,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:39,286 INFO L82 PathProgramCache]: Analyzing trace with hash 933584, now seen corresponding path program 1 times [2019-01-08 14:02:39,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:39,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:39,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:39,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:39,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:39,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:39,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:39,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:39,429 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:02:39,429 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [19] [2019-01-08 14:02:39,432 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:39,432 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:39,438 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:39,438 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-08 14:02:39,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:39,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:39,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:39,439 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:39,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:39,453 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:39,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:39,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:02:39,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:39,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-08 14:02:39,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:39,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:39,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-08 14:02:39,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:39,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:39,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:39,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:02:39,490 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:39,525 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:39,539 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:39,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:39,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:39,570 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-08 14:02:39,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:39,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:39,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:39,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:39,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:39,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:39,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:39,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:02:39,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:39,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:39,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:02:39,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:39,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:39,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:39,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:39,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:39,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:39,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:39,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:39,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:39,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-08 14:02:39,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:39,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:39,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-08 14:02:39,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:39,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:39,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:39,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:39,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:02:39,839 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:39,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:02:39,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:02:39,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:02:39,840 INFO L87 Difference]: Start difference. First operand 34 states and 117 transitions. Second operand 8 states. [2019-01-08 14:02:40,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:40,234 INFO L93 Difference]: Finished difference Result 56 states and 150 transitions. [2019-01-08 14:02:40,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:02:40,235 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:02:40,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:40,235 INFO L225 Difference]: With dead ends: 56 [2019-01-08 14:02:40,236 INFO L226 Difference]: Without dead ends: 54 [2019-01-08 14:02:40,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:02:40,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-08 14:02:40,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 36. [2019-01-08 14:02:40,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-08 14:02:40,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 127 transitions. [2019-01-08 14:02:40,245 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 127 transitions. Word has length 4 [2019-01-08 14:02:40,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:40,246 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 127 transitions. [2019-01-08 14:02:40,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:02:40,246 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 127 transitions. [2019-01-08 14:02:40,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:02:40,246 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:40,247 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:02:40,247 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:40,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:40,247 INFO L82 PathProgramCache]: Analyzing trace with hash 937616, now seen corresponding path program 1 times [2019-01-08 14:02:40,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:40,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:40,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:40,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:40,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:40,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:40,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:40,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:40,329 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:02:40,329 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [21] [2019-01-08 14:02:40,330 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:40,330 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:40,334 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:40,335 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-08 14:02:40,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:40,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:40,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:40,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:40,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:40,344 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:40,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:40,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:02:40,356 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-08 14:02:40,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:40,363 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-08 14:02:40,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:40,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:40,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, 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-08 14:02:40,374 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:40,400 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:40,410 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:40,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:40,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:40,435 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-01-08 14:02:40,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:40,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:40,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:40,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:40,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-08 14:02:40,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:40,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:40,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-08 14:02:40,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:40,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:40,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:40,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:40,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:02:40,551 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:40,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:02:40,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:02:40,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:02:40,552 INFO L87 Difference]: Start difference. First operand 36 states and 127 transitions. Second operand 6 states. [2019-01-08 14:02:40,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:40,755 INFO L93 Difference]: Finished difference Result 48 states and 142 transitions. [2019-01-08 14:02:40,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:02:40,756 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-08 14:02:40,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:40,757 INFO L225 Difference]: With dead ends: 48 [2019-01-08 14:02:40,757 INFO L226 Difference]: Without dead ends: 47 [2019-01-08 14:02:40,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-08 14:02:40,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-08 14:02:40,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2019-01-08 14:02:40,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-08 14:02:40,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 127 transitions. [2019-01-08 14:02:40,767 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 127 transitions. Word has length 4 [2019-01-08 14:02:40,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:40,768 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 127 transitions. [2019-01-08 14:02:40,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:02:40,768 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 127 transitions. [2019-01-08 14:02:40,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:02:40,768 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:40,769 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:02:40,769 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:40,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:40,769 INFO L82 PathProgramCache]: Analyzing trace with hash 29112214, now seen corresponding path program 1 times [2019-01-08 14:02:40,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:40,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:40,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:40,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:40,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:40,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:02:40,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:40,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:40,877 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:02:40,877 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [21] [2019-01-08 14:02:40,880 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:40,880 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:40,884 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:40,885 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-08 14:02:40,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:40,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:40,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:40,885 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:40,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:40,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:40,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:40,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:02:40,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:40,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-08 14:02:40,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:40,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:40,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:02:40,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:40,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:40,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:40,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:02:40,954 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:40,990 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:41,003 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:41,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:41,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:41,032 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-08 14:02:41,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:41,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:41,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:41,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:41,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:41,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:41,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:41,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:02:41,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:41,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-08 14:02:41,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:02:41,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:41,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:41,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:41,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:41,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:41,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:41,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:41,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:41,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:41,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-08 14:02:41,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:41,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:41,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-08 14:02:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:41,212 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:41,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:41,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:41,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:02:41,382 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:41,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:02:41,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:02:41,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:02:41,383 INFO L87 Difference]: Start difference. First operand 36 states and 127 transitions. Second operand 8 states. [2019-01-08 14:02:41,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:41,733 INFO L93 Difference]: Finished difference Result 56 states and 161 transitions. [2019-01-08 14:02:41,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:02:41,733 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:02:41,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:41,734 INFO L225 Difference]: With dead ends: 56 [2019-01-08 14:02:41,735 INFO L226 Difference]: Without dead ends: 55 [2019-01-08 14:02:41,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:02:41,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-08 14:02:41,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2019-01-08 14:02:41,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-08 14:02:41,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 142 transitions. [2019-01-08 14:02:41,745 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 142 transitions. Word has length 5 [2019-01-08 14:02:41,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:41,745 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 142 transitions. [2019-01-08 14:02:41,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:02:41,745 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 142 transitions. [2019-01-08 14:02:41,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:02:41,746 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:41,746 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:02:41,747 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:41,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:41,747 INFO L82 PathProgramCache]: Analyzing trace with hash 29111902, now seen corresponding path program 1 times [2019-01-08 14:02:41,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:41,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:41,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:41,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:41,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:41,888 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:41,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:41,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:41,889 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:02:41,889 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [19] [2019-01-08 14:02:41,890 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:41,890 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:41,894 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:41,894 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-08 14:02:41,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:41,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:41,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:41,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:41,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:41,913 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:41,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:41,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:02:41,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:41,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:02:41,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:41,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:41,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:02:41,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:41,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:41,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:41,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-08 14:02:41,957 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:41,978 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:41,989 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:41,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:42,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:42,017 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-08 14:02:42,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:42,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:42,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:42,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:42,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:42,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:42,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:42,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:02:42,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:42,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:42,116 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:02:42,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:42,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:42,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:42,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:42,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:42,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:42,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:42,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:42,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:42,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-08 14:02:42,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:42,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:42,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-08 14:02:42,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:42,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:42,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:42,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:42,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:42,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:42,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:42,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:42,241 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:02:42,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:42,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-08 14:02:42,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:42,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:42,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-08 14:02:42,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:42,305 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:42,356 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:42,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:42,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:02:42,376 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:42,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:02:42,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:02:42,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:02:42,377 INFO L87 Difference]: Start difference. First operand 39 states and 142 transitions. Second operand 10 states. [2019-01-08 14:02:42,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:42,957 INFO L93 Difference]: Finished difference Result 76 states and 212 transitions. [2019-01-08 14:02:42,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:02:42,957 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:02:42,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:42,958 INFO L225 Difference]: With dead ends: 76 [2019-01-08 14:02:42,959 INFO L226 Difference]: Without dead ends: 75 [2019-01-08 14:02:42,959 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-08 14:02:42,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-08 14:02:42,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 41. [2019-01-08 14:02:42,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-08 14:02:42,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-01-08 14:02:42,970 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-01-08 14:02:42,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:42,971 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-01-08 14:02:42,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:02:42,971 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-01-08 14:02:42,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:02:42,971 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:42,972 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:02:42,972 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:42,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:42,972 INFO L82 PathProgramCache]: Analyzing trace with hash 29115870, now seen corresponding path program 1 times [2019-01-08 14:02:42,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:42,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:42,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:42,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:42,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:43,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:43,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:43,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:43,167 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:02:43,167 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [19] [2019-01-08 14:02:43,169 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:43,169 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:43,174 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:43,174 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-08 14:02:43,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:43,175 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:43,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:43,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:43,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:43,185 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:43,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:43,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-08 14:02:43,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:43,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-08 14:02:43,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:43,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:43,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:02:43,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:43,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:43,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:43,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:02:43,225 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:43,273 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:43,293 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:43,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:43,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:43,333 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-08 14:02:43,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:43,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:43,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:43,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:43,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:43,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:43,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:43,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:02:43,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:43,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:43,476 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-08 14:02:43,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:43,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:43,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:43,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:43,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:43,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:43,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:43,525 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:02:43,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-08 14:02:43,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:43,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:43,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-08 14:02:43,790 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-08 14:02:43,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:43,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:43,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:43,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:43,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:43,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:43,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:43,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:43,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:43,915 INFO L303 Elim1Store]: Index analysis took 121 ms [2019-01-08 14:02:43,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 69 [2019-01-08 14:02:43,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:43,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:43,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-08 14:02:43,986 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:43,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:44,050 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:44,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:44,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:02:44,069 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:44,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:02:44,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:02:44,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:02:44,070 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 10 states. [2019-01-08 14:02:44,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:44,668 INFO L93 Difference]: Finished difference Result 67 states and 187 transitions. [2019-01-08 14:02:44,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:02:44,668 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:02:44,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:44,670 INFO L225 Difference]: With dead ends: 67 [2019-01-08 14:02:44,670 INFO L226 Difference]: Without dead ends: 65 [2019-01-08 14:02:44,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:02:44,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-08 14:02:44,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2019-01-08 14:02:44,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-08 14:02:44,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 142 transitions. [2019-01-08 14:02:44,681 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 142 transitions. Word has length 5 [2019-01-08 14:02:44,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:44,681 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 142 transitions. [2019-01-08 14:02:44,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:02:44,681 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 142 transitions. [2019-01-08 14:02:44,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:02:44,682 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:44,682 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:02:44,682 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:44,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:44,683 INFO L82 PathProgramCache]: Analyzing trace with hash 29119902, now seen corresponding path program 1 times [2019-01-08 14:02:44,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:44,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:44,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:44,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:44,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:44,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:44,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:44,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:44,784 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:02:44,784 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [21] [2019-01-08 14:02:44,786 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:44,786 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:44,790 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:44,790 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-08 14:02:44,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:44,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:44,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:44,791 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:44,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:44,799 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:44,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:44,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-08 14:02:44,849 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-08 14:02:44,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:44,873 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-08 14:02:44,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:44,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:44,884 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-08 14:02:44,885 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:44,899 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:44,909 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:44,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:44,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-08 14:02:44,937 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-08 14:02:44,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:44,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:44,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:44,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:44,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-08 14:02:44,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:44,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:44,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-08 14:02:45,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-08 14:02:45,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:45,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:45,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-08 14:02:45,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:45,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:45,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:45,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:45,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:02:45,119 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:45,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:02:45,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:02:45,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:02:45,120 INFO L87 Difference]: Start difference. First operand 39 states and 142 transitions. Second operand 8 states. [2019-01-08 14:02:45,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:45,365 INFO L93 Difference]: Finished difference Result 58 states and 171 transitions. [2019-01-08 14:02:45,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:02:45,365 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:02:45,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:45,366 INFO L225 Difference]: With dead ends: 58 [2019-01-08 14:02:45,366 INFO L226 Difference]: Without dead ends: 57 [2019-01-08 14:02:45,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:02:45,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-08 14:02:45,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2019-01-08 14:02:45,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-08 14:02:45,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-01-08 14:02:45,379 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-01-08 14:02:45,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:45,379 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-01-08 14:02:45,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:02:45,379 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-01-08 14:02:45,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:02:45,380 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:45,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:02:45,380 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:45,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:45,381 INFO L82 PathProgramCache]: Analyzing trace with hash 28823602, now seen corresponding path program 2 times [2019-01-08 14:02:45,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:45,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:45,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:45,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:45,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:45,524 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:45,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:45,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:45,524 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:02:45,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:02:45,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:45,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:45,536 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:02:45,536 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:02:45,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:02:45,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:02:45,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:45,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:02:45,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-08 14:02:45,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:02:45,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:02:45,572 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:45,603 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:45,617 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:45,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:45,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:45,646 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-08 14:02:45,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:02:45,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:45,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:45,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-08 14:02:45,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-08 14:02:45,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:45,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:45,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:02:45,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,883 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:02:45,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:45,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-08 14:02:45,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:45,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:45,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-08 14:02:45,969 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:45,969 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:46,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:46,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:46,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:02:46,042 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:46,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:02:46,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:02:46,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:02:46,043 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 10 states. [2019-01-08 14:02:46,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:46,494 INFO L93 Difference]: Finished difference Result 71 states and 199 transitions. [2019-01-08 14:02:46,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:02:46,494 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:02:46,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:46,496 INFO L225 Difference]: With dead ends: 71 [2019-01-08 14:02:46,496 INFO L226 Difference]: Without dead ends: 70 [2019-01-08 14:02:46,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:02:46,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-08 14:02:46,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 30. [2019-01-08 14:02:46,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-08 14:02:46,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2019-01-08 14:02:46,508 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 5 [2019-01-08 14:02:46,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:46,509 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2019-01-08 14:02:46,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:02:46,509 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2019-01-08 14:02:46,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:02:46,509 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:46,510 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:02:46,510 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:46,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:46,510 INFO L82 PathProgramCache]: Analyzing trace with hash 28827822, now seen corresponding path program 1 times [2019-01-08 14:02:46,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:46,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:46,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:02:46,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:46,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:46,765 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-01-08 14:02:46,773 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-08 14:02:46,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:02:46,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-08 14:02:46,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:02:46,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:02:46,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:02:46,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-08 14:02:46,775 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 4 states. [2019-01-08 14:02:47,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:47,063 INFO L93 Difference]: Finished difference Result 36 states and 106 transitions. [2019-01-08 14:02:47,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:02:47,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-08 14:02:47,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:47,064 INFO L225 Difference]: With dead ends: 36 [2019-01-08 14:02:47,065 INFO L226 Difference]: Without dead ends: 33 [2019-01-08 14:02:47,065 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-08 14:02:47,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-08 14:02:47,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2019-01-08 14:02:47,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-08 14:02:47,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 99 transitions. [2019-01-08 14:02:47,080 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 99 transitions. Word has length 5 [2019-01-08 14:02:47,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:47,080 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 99 transitions. [2019-01-08 14:02:47,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:02:47,080 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 99 transitions. [2019-01-08 14:02:47,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:02:47,085 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:47,085 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:02:47,085 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:47,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:47,086 INFO L82 PathProgramCache]: Analyzing trace with hash 28818148, now seen corresponding path program 1 times [2019-01-08 14:02:47,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:47,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:47,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:47,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:47,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:47,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:47,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:47,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:47,198 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:02:47,198 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [21] [2019-01-08 14:02:47,199 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:47,199 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:47,202 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:47,202 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-08 14:02:47,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:47,203 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:47,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:47,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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:47,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:47,212 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:47,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:47,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:47,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:02:47,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:47,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:02:47,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:47,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:47,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-08 14:02:47,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:47,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:47,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:47,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-08 14:02:47,256 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:47,286 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:47,300 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:47,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:47,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:47,331 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-08 14:02:47,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:47,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:47,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:47,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:47,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:47,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:47,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:47,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:02:47,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:47,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:47,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-08 14:02:47,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:47,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:47,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:47,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:47,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:47,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:47,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:47,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:47,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:47,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-08 14:02:47,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:47,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:47,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-08 14:02:47,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:47,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:47,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:47,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:47,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-08 14:02:47,979 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:47,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:02:47,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:02:47,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:02:47,980 INFO L87 Difference]: Start difference. First operand 29 states and 99 transitions. Second operand 8 states. [2019-01-08 14:02:48,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:48,196 INFO L93 Difference]: Finished difference Result 44 states and 125 transitions. [2019-01-08 14:02:48,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:02:48,197 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:02:48,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:48,198 INFO L225 Difference]: With dead ends: 44 [2019-01-08 14:02:48,198 INFO L226 Difference]: Without dead ends: 43 [2019-01-08 14:02:48,199 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-08 14:02:48,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-08 14:02:48,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2019-01-08 14:02:48,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-08 14:02:48,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 114 transitions. [2019-01-08 14:02:48,214 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 114 transitions. Word has length 5 [2019-01-08 14:02:48,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:48,214 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 114 transitions. [2019-01-08 14:02:48,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:02:48,215 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 114 transitions. [2019-01-08 14:02:48,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:02:48,215 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:48,215 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:02:48,216 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:48,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:48,216 INFO L82 PathProgramCache]: Analyzing trace with hash 28821992, now seen corresponding path program 1 times [2019-01-08 14:02:48,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:48,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:48,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:48,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:48,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:48,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:02:48,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:48,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:48,415 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:02:48,415 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [21] [2019-01-08 14:02:48,417 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:48,417 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:48,422 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:48,422 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 14:02:48,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:48,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:48,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:48,423 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:48,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:48,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:48,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:48,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:02:48,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:48,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-08 14:02:48,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:48,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:48,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:02:48,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:48,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:48,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:48,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:02:48,487 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:48,546 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:48,573 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:48,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:48,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:48,603 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-08 14:02:48,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:48,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:48,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:48,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:48,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:48,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:48,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:48,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:02:48,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:48,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:48,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:02:48,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:48,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:48,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:48,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:48,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:48,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:48,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:48,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:48,748 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:02:48,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-08 14:02:48,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:48,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:48,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-08 14:02:48,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:48,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:48,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:48,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:48,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:02:48,857 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:48,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:02:48,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:02:48,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:02:48,858 INFO L87 Difference]: Start difference. First operand 32 states and 114 transitions. Second operand 8 states. [2019-01-08 14:02:49,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:49,190 INFO L93 Difference]: Finished difference Result 49 states and 142 transitions. [2019-01-08 14:02:49,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:02:49,190 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:02:49,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:49,191 INFO L225 Difference]: With dead ends: 49 [2019-01-08 14:02:49,191 INFO L226 Difference]: Without dead ends: 48 [2019-01-08 14:02:49,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:02:49,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-08 14:02:49,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-01-08 14:02:49,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-08 14:02:49,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 124 transitions. [2019-01-08 14:02:49,206 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 124 transitions. Word has length 5 [2019-01-08 14:02:49,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:49,206 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 124 transitions. [2019-01-08 14:02:49,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:02:49,206 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 124 transitions. [2019-01-08 14:02:49,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:02:49,207 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:49,207 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:02:49,207 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:49,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:49,208 INFO L82 PathProgramCache]: Analyzing trace with hash 28933468, now seen corresponding path program 2 times [2019-01-08 14:02:49,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:49,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:49,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:49,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:49,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:49,478 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2019-01-08 14:02:49,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:49,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:49,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:49,492 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:02:49,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:02:49,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:49,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:49,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:02:49,501 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:02:49,505 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-08 14:02:49,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:02:49,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:49,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:02:49,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:49,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-08 14:02:49,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:49,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:49,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:02:49,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:49,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:49,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:49,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:02:49,532 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:49,553 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:49,565 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:49,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:49,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:49,592 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-08 14:02:49,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:49,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:49,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:49,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:49,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:49,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:49,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:49,785 INFO L303 Elim1Store]: Index analysis took 174 ms [2019-01-08 14:02:49,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:02:49,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:50,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:50,137 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:02:50,340 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-08 14:02:50,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:50,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:50,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:50,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:50,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:50,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:50,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:50,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:50,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:50,557 INFO L303 Elim1Store]: Index analysis took 214 ms [2019-01-08 14:02:50,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-08 14:02:50,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:50,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:50,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-08 14:02:50,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:50,882 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:50,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:50,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:50,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:02:50,927 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:50,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:02:50,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:02:50,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:02:50,928 INFO L87 Difference]: Start difference. First operand 34 states and 124 transitions. Second operand 8 states. [2019-01-08 14:02:51,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:51,533 INFO L93 Difference]: Finished difference Result 58 states and 161 transitions. [2019-01-08 14:02:51,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:02:51,536 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:02:51,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:51,536 INFO L225 Difference]: With dead ends: 58 [2019-01-08 14:02:51,537 INFO L226 Difference]: Without dead ends: 57 [2019-01-08 14:02:51,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 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-08 14:02:51,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-08 14:02:51,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2019-01-08 14:02:51,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-08 14:02:51,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 134 transitions. [2019-01-08 14:02:51,552 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 134 transitions. Word has length 5 [2019-01-08 14:02:51,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:51,552 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 134 transitions. [2019-01-08 14:02:51,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:02:51,553 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 134 transitions. [2019-01-08 14:02:51,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:02:51,553 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:51,553 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:02:51,553 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:51,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:51,554 INFO L82 PathProgramCache]: Analyzing trace with hash 28941156, now seen corresponding path program 1 times [2019-01-08 14:02:51,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:51,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:51,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:02:51,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:51,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:51,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:51,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:51,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:51,694 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:02:51,694 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [21] [2019-01-08 14:02:51,696 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:51,696 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:51,701 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:51,702 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-08 14:02:51,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:51,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:51,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:51,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:51,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:51,710 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:51,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:51,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:02:51,722 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-08 14:02:51,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:51,732 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-08 14:02:51,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:51,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:51,741 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-08 14:02:51,742 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:51,759 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:51,769 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:51,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:51,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:51,792 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-01-08 14:02:51,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:51,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:51,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:51,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:51,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-08 14:02:51,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:51,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:51,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-08 14:02:51,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:51,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:51,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:51,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:52,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:52,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:52,033 INFO L303 Elim1Store]: Index analysis took 153 ms [2019-01-08 14:02:52,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-08 14:02:52,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:52,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:52,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-08 14:02:52,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:52,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:52,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:52,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:52,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:02:52,925 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:52,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:02:52,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:02:52,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:02:52,926 INFO L87 Difference]: Start difference. First operand 36 states and 134 transitions. Second operand 8 states. [2019-01-08 14:02:53,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:53,506 INFO L93 Difference]: Finished difference Result 59 states and 162 transitions. [2019-01-08 14:02:53,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:02:53,507 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:02:53,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:53,508 INFO L225 Difference]: With dead ends: 59 [2019-01-08 14:02:53,508 INFO L226 Difference]: Without dead ends: 58 [2019-01-08 14:02:53,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:02:53,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-08 14:02:53,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 37. [2019-01-08 14:02:53,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-08 14:02:53,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 139 transitions. [2019-01-08 14:02:53,520 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 139 transitions. Word has length 5 [2019-01-08 14:02:53,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:53,520 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 139 transitions. [2019-01-08 14:02:53,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:02:53,520 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 139 transitions. [2019-01-08 14:02:53,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:02:53,521 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:53,521 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:02:53,521 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:53,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:53,522 INFO L82 PathProgramCache]: Analyzing trace with hash 29066150, now seen corresponding path program 1 times [2019-01-08 14:02:53,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:53,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:53,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:53,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:53,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:53,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:53,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:53,559 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:53,559 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:02:53,560 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [22], [23] [2019-01-08 14:02:53,561 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:53,561 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:53,564 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:53,565 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-08 14:02:53,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:53,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:53,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:53,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:53,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:53,575 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:53,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:53,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:02:53,660 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-08 14:02:53,758 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-08 14:02:53,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:53,790 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-08 14:02:53,790 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:53,801 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:53,811 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:53,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:53,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:53,834 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:19, output treesize:24 [2019-01-08 14:02:53,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:53,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:53,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-08 14:02:53,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:53,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-08 14:02:53,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-08 14:02:53,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:53,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:53,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:53,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-08 14:02:53,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-08 14:02:53,904 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:02:53,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:02:53,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:02:53,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-08 14:02:53,905 INFO L87 Difference]: Start difference. First operand 37 states and 139 transitions. Second operand 4 states. [2019-01-08 14:02:54,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:54,188 INFO L93 Difference]: Finished difference Result 74 states and 262 transitions. [2019-01-08 14:02:54,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-08 14:02:54,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-08 14:02:54,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:54,190 INFO L225 Difference]: With dead ends: 74 [2019-01-08 14:02:54,190 INFO L226 Difference]: Without dead ends: 73 [2019-01-08 14:02:54,191 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-08 14:02:54,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-08 14:02:54,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2019-01-08 14:02:54,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-08 14:02:54,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 250 transitions. [2019-01-08 14:02:54,214 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 250 transitions. Word has length 5 [2019-01-08 14:02:54,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:54,214 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 250 transitions. [2019-01-08 14:02:54,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:02:54,214 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 250 transitions. [2019-01-08 14:02:54,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:02:54,215 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:54,215 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:02:54,215 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:54,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:54,215 INFO L82 PathProgramCache]: Analyzing trace with hash 29052506, now seen corresponding path program 1 times [2019-01-08 14:02:54,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:54,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:54,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:54,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:54,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:54,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:54,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:54,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:54,367 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:02:54,367 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [19] [2019-01-08 14:02:54,369 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:54,369 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:54,373 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:54,374 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-08 14:02:54,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:54,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:54,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:54,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:54,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:54,388 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:54,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:54,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-08 14:02:54,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:54,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-08 14:02:54,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:54,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:54,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-08 14:02:54,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:54,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:54,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:54,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:02:54,418 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:54,455 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:54,469 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:54,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:54,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:54,496 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-08 14:02:54,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:54,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:54,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:54,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:54,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:54,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:54,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:54,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-08 14:02:54,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:54,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:54,561 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:02:54,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:54,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:54,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:54,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:54,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:54,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:54,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:54,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:54,773 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:02:54,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-08 14:02:54,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:54,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:54,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:02:54,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:54,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:54,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:54,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:54,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:54,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:54,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:54,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:54,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:54,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-08 14:02:54,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:54,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:54,883 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-08 14:02:54,920 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:54,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:54,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:54,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:54,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:02:54,992 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:54,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:02:54,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:02:54,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:02:54,993 INFO L87 Difference]: Start difference. First operand 59 states and 250 transitions. Second operand 10 states. [2019-01-08 14:02:55,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:55,480 INFO L93 Difference]: Finished difference Result 105 states and 359 transitions. [2019-01-08 14:02:55,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:02:55,481 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:02:55,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:55,482 INFO L225 Difference]: With dead ends: 105 [2019-01-08 14:02:55,482 INFO L226 Difference]: Without dead ends: 97 [2019-01-08 14:02:55,483 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-08 14:02:55,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-08 14:02:55,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 71. [2019-01-08 14:02:55,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-08 14:02:55,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 308 transitions. [2019-01-08 14:02:55,503 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 308 transitions. Word has length 5 [2019-01-08 14:02:55,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:55,503 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 308 transitions. [2019-01-08 14:02:55,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:02:55,503 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 308 transitions. [2019-01-08 14:02:55,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:02:55,503 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:55,503 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-08 14:02:55,504 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:55,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:55,504 INFO L82 PathProgramCache]: Analyzing trace with hash 902776598, now seen corresponding path program 1 times [2019-01-08 14:02:55,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:55,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:55,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:55,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:55,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:55,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:02:55,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:55,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:55,598 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:02:55,598 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [22], [23] [2019-01-08 14:02:55,604 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:55,604 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:55,607 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:55,607 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-08 14:02:55,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:55,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:55,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:55,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:55,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:55,620 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:55,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:55,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:55,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-08 14:02:55,632 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-08 14:02:55,648 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-08 14:02:55,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:55,693 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-08 14:02:55,693 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:55,705 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:55,713 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:55,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:55,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:55,736 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-01-08 14:02:55,994 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2019-01-08 14:02:56,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:56,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:56,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-08 14:02:56,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:56,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:56,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-08 14:02:56,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:56,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:56,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:56,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:56,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:02:56,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:56,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:56,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:14 [2019-01-08 14:02:56,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:56,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:56,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:56,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:56,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-08 14:02:56,231 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:56,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-08 14:02:56,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-08 14:02:56,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:02:56,232 INFO L87 Difference]: Start difference. First operand 71 states and 308 transitions. Second operand 7 states. [2019-01-08 14:02:56,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:56,407 INFO L93 Difference]: Finished difference Result 85 states and 324 transitions. [2019-01-08 14:02:56,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:02:56,407 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-01-08 14:02:56,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:56,408 INFO L225 Difference]: With dead ends: 85 [2019-01-08 14:02:56,408 INFO L226 Difference]: Without dead ends: 80 [2019-01-08 14:02:56,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:02:56,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-08 14:02:56,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2019-01-08 14:02:56,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-08 14:02:56,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2019-01-08 14:02:56,431 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2019-01-08 14:02:56,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:56,431 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2019-01-08 14:02:56,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-08 14:02:56,431 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2019-01-08 14:02:56,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:02:56,432 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:56,432 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:02:56,432 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:56,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:56,432 INFO L82 PathProgramCache]: Analyzing trace with hash 902478688, now seen corresponding path program 1 times [2019-01-08 14:02:56,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:56,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:56,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:56,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:56,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:56,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:56,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:56,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:56,551 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:02:56,551 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [23] [2019-01-08 14:02:56,552 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:56,553 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:56,556 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:56,558 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-08 14:02:56,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:56,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:56,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:56,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:56,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:56,569 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:56,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:56,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:02:56,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:56,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-08 14:02:56,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:56,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:56,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-08 14:02:56,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:56,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:56,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:56,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:02:56,598 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:56,664 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:56,686 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:56,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:56,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:56,713 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-08 14:02:56,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:56,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:56,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:56,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:56,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:56,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:56,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:56,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:02:56,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:56,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:56,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:02:56,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:56,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:56,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:56,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:56,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:56,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:56,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:56,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:56,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:56,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-08 14:02:56,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:56,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:56,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-08 14:02:56,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:56,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:56,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:56,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:56,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:02:56,999 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:56,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:02:56,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:02:56,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:02:56,999 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 8 states. [2019-01-08 14:02:57,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:57,257 INFO L93 Difference]: Finished difference Result 83 states and 322 transitions. [2019-01-08 14:02:57,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:02:57,258 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-08 14:02:57,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:57,259 INFO L225 Difference]: With dead ends: 83 [2019-01-08 14:02:57,259 INFO L226 Difference]: Without dead ends: 82 [2019-01-08 14:02:57,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:02:57,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-08 14:02:57,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 71. [2019-01-08 14:02:57,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-08 14:02:57,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2019-01-08 14:02:57,279 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2019-01-08 14:02:57,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:57,279 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2019-01-08 14:02:57,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:02:57,279 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2019-01-08 14:02:57,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:02:57,279 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:57,279 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:02:57,280 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:57,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:57,280 INFO L82 PathProgramCache]: Analyzing trace with hash 902469014, now seen corresponding path program 1 times [2019-01-08 14:02:57,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:57,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:57,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:57,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:57,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:57,504 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-08 14:02:57,572 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:02:57,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:57,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:57,573 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:02:57,573 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [21] [2019-01-08 14:02:57,575 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:57,575 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:57,578 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:57,578 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-08 14:02:57,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:57,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:57,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:57,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:57,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:57,596 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:57,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:57,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:02:57,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:57,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-08 14:02:57,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:57,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:57,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-08 14:02:57,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:57,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:57,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:57,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:02:57,637 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:57,658 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:57,669 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:57,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:57,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-08 14:02:57,696 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-08 14:02:57,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:57,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:57,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:57,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:57,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:57,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:57,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:57,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:02:57,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:57,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:57,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:02:57,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:57,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:57,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:57,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:57,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:57,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:57,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:57,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:57,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:57,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-08 14:02:57,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:57,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:57,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-08 14:02:57,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:57,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:57,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:57,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:57,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:57,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:57,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:57,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:57,890 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:02:57,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:57,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-08 14:02:57,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:57,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:57,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-08 14:02:57,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:57,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:58,051 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:58,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:58,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:02:58,072 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:58,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:02:58,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:02:58,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:02:58,072 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 10 states. [2019-01-08 14:02:58,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:58,528 INFO L93 Difference]: Finished difference Result 97 states and 346 transitions. [2019-01-08 14:02:58,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:02:58,529 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-08 14:02:58,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:58,530 INFO L225 Difference]: With dead ends: 97 [2019-01-08 14:02:58,530 INFO L226 Difference]: Without dead ends: 96 [2019-01-08 14:02:58,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:02:58,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-08 14:02:58,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2019-01-08 14:02:58,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-08 14:02:58,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2019-01-08 14:02:58,556 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2019-01-08 14:02:58,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:58,557 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2019-01-08 14:02:58,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:02:58,557 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2019-01-08 14:02:58,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:02:58,557 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:58,558 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:02:58,558 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:58,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:58,558 INFO L82 PathProgramCache]: Analyzing trace with hash 902472858, now seen corresponding path program 1 times [2019-01-08 14:02:58,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:58,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:58,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:58,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:58,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:58,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:02:58,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:58,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:58,834 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:02:58,834 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [21] [2019-01-08 14:02:58,835 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:02:58,835 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:02:58,838 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:02:58,838 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-08 14:02:58,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:58,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:02:58,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:58,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:58,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:58,849 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:58,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:58,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:02:58,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:58,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-08 14:02:58,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:58,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:58,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:02:58,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:58,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:58,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:58,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-08 14:02:58,881 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:58,912 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:58,929 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:58,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:58,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:58,963 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-08 14:02:58,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:58,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:58,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:59,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:59,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:59,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:59,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:59,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:02:59,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:59,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:59,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-08 14:02:59,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:59,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:59,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:59,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:59,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:59,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:59,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:59,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:59,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:59,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-08 14:02:59,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:59,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:59,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-08 14:02:59,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:59,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:59,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:59,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:59,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:59,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:59,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:59,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:59,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:59,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:02:59,179 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:02:59,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-08 14:02:59,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:59,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:02:59,230 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-08 14:02:59,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-08 14:02:59,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:59,321 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:59,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:59,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:02:59,341 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:59,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:02:59,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:02:59,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:02:59,341 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 10 states. [2019-01-08 14:02:59,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:59,770 INFO L93 Difference]: Finished difference Result 102 states and 389 transitions. [2019-01-08 14:02:59,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:02:59,770 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-08 14:02:59,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:59,772 INFO L225 Difference]: With dead ends: 102 [2019-01-08 14:02:59,772 INFO L226 Difference]: Without dead ends: 101 [2019-01-08 14:02:59,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:02:59,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-08 14:02:59,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2019-01-08 14:02:59,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-08 14:02:59,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 357 transitions. [2019-01-08 14:02:59,801 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 357 transitions. Word has length 6 [2019-01-08 14:02:59,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:59,802 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 357 transitions. [2019-01-08 14:02:59,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:02:59,802 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 357 transitions. [2019-01-08 14:02:59,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:02:59,803 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:59,803 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:02:59,803 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:59,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:59,803 INFO L82 PathProgramCache]: Analyzing trace with hash 902592022, now seen corresponding path program 1 times [2019-01-08 14:02:59,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:59,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:59,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:59,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:59,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:00,057 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-08 14:03:00,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:00,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:00,115 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:00,115 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:03:00,116 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [21] [2019-01-08 14:03:00,118 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:03:00,119 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:03:00,121 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:03:00,122 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-08 14:03:00,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:00,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:03:00,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:00,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:00,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:00,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:03:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:00,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:00,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:03:00,144 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-08 14:03:00,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:00,151 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-08 14:03:00,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:00,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:00,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, 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-08 14:03:00,162 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:00,176 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:00,185 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:00,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:00,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:00,212 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-08 14:03:00,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:00,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:00,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:00,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:00,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-08 14:03:00,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:00,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:00,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-08 14:03:00,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:00,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:00,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:00,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:00,301 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:03:00,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:03:00,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:00,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:00,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:22 [2019-01-08 14:03:00,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:00,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:00,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:00,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:00,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:00,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:00,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:03:00,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:00,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:00,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:26 [2019-01-08 14:03:00,396 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:00,396 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:00,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:00,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:00,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:03:00,466 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:00,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:03:00,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:03:00,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:03:00,467 INFO L87 Difference]: Start difference. First operand 81 states and 357 transitions. Second operand 10 states. [2019-01-08 14:03:00,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:00,940 INFO L93 Difference]: Finished difference Result 108 states and 386 transitions. [2019-01-08 14:03:00,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:03:00,940 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-08 14:03:00,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:00,942 INFO L225 Difference]: With dead ends: 108 [2019-01-08 14:03:00,942 INFO L226 Difference]: Without dead ends: 107 [2019-01-08 14:03:00,942 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-08 14:03:00,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-08 14:03:00,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 77. [2019-01-08 14:03:00,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-08 14:03:00,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 337 transitions. [2019-01-08 14:03:00,965 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 337 transitions. Word has length 6 [2019-01-08 14:03:00,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:00,965 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 337 transitions. [2019-01-08 14:03:00,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:03:00,965 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 337 transitions. [2019-01-08 14:03:00,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:03:00,966 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:00,966 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:03:00,966 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:00,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:00,966 INFO L82 PathProgramCache]: Analyzing trace with hash 902591586, now seen corresponding path program 1 times [2019-01-08 14:03:00,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:00,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:00,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:00,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:00,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:01,139 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:01,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:01,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:01,140 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:03:01,140 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [19] [2019-01-08 14:03:01,141 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:03:01,141 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:03:01,143 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:03:01,143 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-08 14:03:01,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:01,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:03:01,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:01,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:01,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:01,153 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:03:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:01,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:01,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-08 14:03:01,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,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, 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-08 14:03:01,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:03:01,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:03:01,185 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:01,207 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:01,218 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:01,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:01,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:01,245 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-08 14:03:01,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:03:01,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:01,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-08 14:03:01,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-08 14:03:01,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,350 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:03:01,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-08 14:03:01,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:01,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:01,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-08 14:03:01,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 69 [2019-01-08 14:03:01,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:01,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:01,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-08 14:03:01,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:01,588 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:03:01,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-08 14:03:01,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:01,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:01,638 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-08 14:03:01,657 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:01,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:01,771 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-08 14:03:01,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:01,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-08 14:03:01,790 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:01,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:03:01,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:03:01,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:03:01,791 INFO L87 Difference]: Start difference. First operand 77 states and 337 transitions. Second operand 12 states. [2019-01-08 14:03:03,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:03,356 INFO L93 Difference]: Finished difference Result 120 states and 459 transitions. [2019-01-08 14:03:03,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:03:03,357 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-08 14:03:03,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:03,358 INFO L225 Difference]: With dead ends: 120 [2019-01-08 14:03:03,359 INFO L226 Difference]: Without dead ends: 119 [2019-01-08 14:03:03,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=213, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:03:03,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-08 14:03:03,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 82. [2019-01-08 14:03:03,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-08 14:03:03,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 362 transitions. [2019-01-08 14:03:03,385 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 362 transitions. Word has length 6 [2019-01-08 14:03:03,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:03,385 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 362 transitions. [2019-01-08 14:03:03,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:03:03,386 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 362 transitions. [2019-01-08 14:03:03,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:03:03,386 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:03,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:03:03,387 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:03,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:03,387 INFO L82 PathProgramCache]: Analyzing trace with hash 902703186, now seen corresponding path program 2 times [2019-01-08 14:03:03,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:03,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:03,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:03,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:03,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:03,624 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2019-01-08 14:03:03,767 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:03,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:03,768 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:03,768 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:03:03,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:03:03,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:03,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:03,778 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:03:03,778 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:03:03,792 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:03:03,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:03:03,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:03,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:03:03,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:03,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-08 14:03:03,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:03,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:03,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-08 14:03:03,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:03,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:03,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:03,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-08 14:03:03,822 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:03,858 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:03,879 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:03,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:03,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:03,918 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-08 14:03:03,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:03,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:03,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:03,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:03,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:03,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:03,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:03,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:03:03,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:04,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-08 14:03:04,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-08 14:03:04,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:04,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:04,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:04,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:04,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:04,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:04,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:04,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:04,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:04,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-08 14:03:04,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:04,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:04,116 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-08 14:03:04,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:04,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:04,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:04,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:04,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:04,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:04,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:04,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:04,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:04,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:04,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:04,154 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:03:04,155 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-08 14:03:04,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:04,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:04,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-08 14:03:04,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:04,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:04,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:04,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:04,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:04,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:04,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:04,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:04,232 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:03:04,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:04,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-08 14:03:04,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:04,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:04,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-08 14:03:04,294 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:04,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:04,367 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:04,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:04,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-08 14:03:04,386 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:04,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:03:04,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:03:04,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:03:04,387 INFO L87 Difference]: Start difference. First operand 82 states and 362 transitions. Second operand 12 states. [2019-01-08 14:03:05,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:05,030 INFO L93 Difference]: Finished difference Result 146 states and 556 transitions. [2019-01-08 14:03:05,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:03:05,030 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-08 14:03:05,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:05,032 INFO L225 Difference]: With dead ends: 146 [2019-01-08 14:03:05,032 INFO L226 Difference]: Without dead ends: 145 [2019-01-08 14:03:05,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:03:05,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-08 14:03:05,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 98. [2019-01-08 14:03:05,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-08 14:03:05,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 442 transitions. [2019-01-08 14:03:05,058 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 442 transitions. Word has length 6 [2019-01-08 14:03:05,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:05,059 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 442 transitions. [2019-01-08 14:03:05,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:03:05,059 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 442 transitions. [2019-01-08 14:03:05,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:03:05,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:05,059 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:03:05,060 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:05,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:05,060 INFO L82 PathProgramCache]: Analyzing trace with hash 893362642, now seen corresponding path program 1 times [2019-01-08 14:03:05,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:05,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:05,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:03:05,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:05,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:05,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:03:05,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:05,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:05,163 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:03:05,163 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [23] [2019-01-08 14:03:05,165 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:03:05,165 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:03:05,168 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:03:05,168 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-08 14:03:05,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:05,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:03:05,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:05,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:05,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:05,180 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:03:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:05,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:05,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:03:05,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:05,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-08 14:03:05,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:05,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:05,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-08 14:03:05,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:05,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:05,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:05,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-08 14:03:05,209 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:05,232 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:05,245 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:05,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:05,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:05,272 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-08 14:03:05,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:05,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:05,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:05,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:05,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:05,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:05,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:05,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:03:05,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:05,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:05,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:03:05,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:05,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:05,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:05,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:05,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:05,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:05,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:05,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:05,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:05,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-08 14:03:05,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:05,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:05,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-08 14:03:05,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:05,428 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:05,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:05,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:05,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-08 14:03:05,470 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:05,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-08 14:03:05,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-08 14:03:05,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:03:05,471 INFO L87 Difference]: Start difference. First operand 98 states and 442 transitions. Second operand 7 states. [2019-01-08 14:03:05,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:05,749 INFO L93 Difference]: Finished difference Result 111 states and 462 transitions. [2019-01-08 14:03:05,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:03:05,750 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-01-08 14:03:05,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:05,751 INFO L225 Difference]: With dead ends: 111 [2019-01-08 14:03:05,752 INFO L226 Difference]: Without dead ends: 110 [2019-01-08 14:03:05,752 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-08 14:03:05,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-08 14:03:05,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2019-01-08 14:03:05,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-08 14:03:05,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 452 transitions. [2019-01-08 14:03:05,779 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 452 transitions. Word has length 6 [2019-01-08 14:03:05,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:05,779 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 452 transitions. [2019-01-08 14:03:05,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-08 14:03:05,779 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 452 transitions. [2019-01-08 14:03:05,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:03:05,780 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:05,780 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:03:05,780 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:05,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:05,781 INFO L82 PathProgramCache]: Analyzing trace with hash 893472132, now seen corresponding path program 1 times [2019-01-08 14:03:05,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:05,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:05,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:05,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:05,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:06,079 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-08 14:03:06,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:03:06,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:06,132 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:06,132 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:03:06,132 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [21] [2019-01-08 14:03:06,134 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:03:06,134 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:03:06,136 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:03:06,137 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-08 14:03:06,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:06,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:03:06,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:06,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:06,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:06,146 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:03:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:06,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:06,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:03:06,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:06,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-08 14:03:06,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:06,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:06,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:03:06,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:06,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:06,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:06,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:03:06,223 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:06,244 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:06,256 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:06,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:06,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:06,284 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-08 14:03:06,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:06,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:06,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:06,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:06,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:06,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:06,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:06,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:03:06,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:06,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:06,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:03:06,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:06,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:06,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:06,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:06,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:06,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:06,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:06,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:06,406 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:03:06,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-08 14:03:06,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:06,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:06,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-08 14:03:06,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:06,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:06,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:06,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:06,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:06,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:06,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:06,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:06,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:06,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-08 14:03:06,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:06,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:06,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-08 14:03:06,593 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:06,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:06,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:06,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:06,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:03:06,652 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:06,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:03:06,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:03:06,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:03:06,653 INFO L87 Difference]: Start difference. First operand 100 states and 452 transitions. Second operand 10 states. [2019-01-08 14:03:07,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:07,112 INFO L93 Difference]: Finished difference Result 153 states and 620 transitions. [2019-01-08 14:03:07,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:03:07,112 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-08 14:03:07,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:07,114 INFO L225 Difference]: With dead ends: 153 [2019-01-08 14:03:07,115 INFO L226 Difference]: Without dead ends: 152 [2019-01-08 14:03:07,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:03:07,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-01-08 14:03:07,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 127. [2019-01-08 14:03:07,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-08 14:03:07,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 589 transitions. [2019-01-08 14:03:07,148 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 589 transitions. Word has length 6 [2019-01-08 14:03:07,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:07,148 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 589 transitions. [2019-01-08 14:03:07,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:03:07,149 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 589 transitions. [2019-01-08 14:03:07,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:03:07,149 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:07,149 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:03:07,149 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:07,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:07,150 INFO L82 PathProgramCache]: Analyzing trace with hash 897235472, now seen corresponding path program 1 times [2019-01-08 14:03:07,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:07,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:07,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:07,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:07,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:07,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:03:07,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:07,278 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:07,278 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:03:07,278 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [23] [2019-01-08 14:03:07,280 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:03:07,280 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:03:07,283 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:03:07,283 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-08 14:03:07,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:07,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:03:07,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:07,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:07,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:07,293 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:03:07,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:07,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:07,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:03:07,334 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-08 14:03:07,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:07,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, 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-08 14:03:07,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:07,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:07,353 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-08 14:03:07,353 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:07,367 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:07,376 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:07,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:07,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:07,401 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-08 14:03:07,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:07,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:07,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:07,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:07,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-08 14:03:07,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:07,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:07,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-08 14:03:07,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:07,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:07,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:07,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:07,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:07,509 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:03:07,509 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-08 14:03:07,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:07,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:07,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-08 14:03:07,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:07,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:07,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:07,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:07,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:03:07,597 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:07,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:03:07,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:03:07,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:03:07,597 INFO L87 Difference]: Start difference. First operand 127 states and 589 transitions. Second operand 8 states. [2019-01-08 14:03:07,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:07,866 INFO L93 Difference]: Finished difference Result 143 states and 607 transitions. [2019-01-08 14:03:07,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:03:07,866 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-08 14:03:07,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:07,868 INFO L225 Difference]: With dead ends: 143 [2019-01-08 14:03:07,868 INFO L226 Difference]: Without dead ends: 138 [2019-01-08 14:03:07,869 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-08 14:03:07,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-08 14:03:07,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 127. [2019-01-08 14:03:07,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-08 14:03:07,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 588 transitions. [2019-01-08 14:03:07,904 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 588 transitions. Word has length 6 [2019-01-08 14:03:07,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:07,904 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 588 transitions. [2019-01-08 14:03:07,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:03:07,904 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 588 transitions. [2019-01-08 14:03:07,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:03:07,905 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:07,905 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:03:07,905 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:07,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:07,905 INFO L82 PathProgramCache]: Analyzing trace with hash 896931732, now seen corresponding path program 2 times [2019-01-08 14:03:07,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:07,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:07,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:07,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:07,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:08,185 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 13 [2019-01-08 14:03:08,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:03:08,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:08,259 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:08,260 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:03:08,260 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:03:08,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:08,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:08,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:03:08,271 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:03:08,276 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:03:08,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:03:08,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:08,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:03:08,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:08,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-08 14:03:08,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:08,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:08,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:03:08,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:08,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:08,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:08,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:03:08,293 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:08,314 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:08,325 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:08,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:08,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:08,351 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-08 14:03:08,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:08,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:08,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:08,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:08,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:08,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:08,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:08,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:03:08,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:08,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-08 14:03:08,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-08 14:03:08,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:08,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:08,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:08,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:08,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:08,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:08,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:08,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:08,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:08,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-08 14:03:08,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:08,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:08,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-08 14:03:08,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:08,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:08,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:08,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:08,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:08,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:08,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:08,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:08,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:08,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:08,536 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:03:08,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-08 14:03:08,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:08,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:08,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-08 14:03:08,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:08,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:08,679 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:08,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:08,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:03:08,698 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:08,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:03:08,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:03:08,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:03:08,698 INFO L87 Difference]: Start difference. First operand 127 states and 588 transitions. Second operand 10 states. [2019-01-08 14:03:09,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:09,237 INFO L93 Difference]: Finished difference Result 196 states and 812 transitions. [2019-01-08 14:03:09,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:03:09,238 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-08 14:03:09,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:09,240 INFO L225 Difference]: With dead ends: 196 [2019-01-08 14:03:09,240 INFO L226 Difference]: Without dead ends: 195 [2019-01-08 14:03:09,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:03:09,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-08 14:03:09,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 141. [2019-01-08 14:03:09,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-08 14:03:09,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 664 transitions. [2019-01-08 14:03:09,274 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 664 transitions. Word has length 6 [2019-01-08 14:03:09,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:09,274 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 664 transitions. [2019-01-08 14:03:09,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:03:09,274 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 664 transitions. [2019-01-08 14:03:09,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:03:09,275 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:09,275 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:03:09,275 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:09,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:09,275 INFO L82 PathProgramCache]: Analyzing trace with hash 897162246, now seen corresponding path program 3 times [2019-01-08 14:03:09,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:09,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:09,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:03:09,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:09,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:09,978 WARN L181 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2019-01-08 14:03:10,073 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:10,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:10,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:10,074 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:03:10,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:03:10,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:10,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:10,084 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:03:10,084 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:03:10,088 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:03:10,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:03:10,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:10,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:03:10,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-08 14:03:10,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:03:10,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-08 14:03:10,117 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:10,139 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:10,151 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:10,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:10,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:10,177 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-08 14:03:10,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:03:10,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:10,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:10,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-08 14:03:10,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-08 14:03:10,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:10,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:10,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-08 14:03:10,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,359 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:03:10,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 83 [2019-01-08 14:03:10,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:10,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:10,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-08 14:03:10,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:10,442 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:03:10,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-08 14:03:10,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:10,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:10,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-08 14:03:10,510 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:10,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:10,576 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:10,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:10,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-08 14:03:10,594 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:10,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:03:10,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:03:10,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:03:10,595 INFO L87 Difference]: Start difference. First operand 141 states and 664 transitions. Second operand 12 states. [2019-01-08 14:03:11,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:11,153 INFO L93 Difference]: Finished difference Result 205 states and 871 transitions. [2019-01-08 14:03:11,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:03:11,154 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-08 14:03:11,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:11,157 INFO L225 Difference]: With dead ends: 205 [2019-01-08 14:03:11,157 INFO L226 Difference]: Without dead ends: 197 [2019-01-08 14:03:11,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:03:11,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-01-08 14:03:11,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 149. [2019-01-08 14:03:11,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-08 14:03:11,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 702 transitions. [2019-01-08 14:03:11,196 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 702 transitions. Word has length 6 [2019-01-08 14:03:11,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:11,196 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 702 transitions. [2019-01-08 14:03:11,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:03:11,196 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 702 transitions. [2019-01-08 14:03:11,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:03:11,197 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:11,197 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:03:11,197 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:11,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:11,198 INFO L82 PathProgramCache]: Analyzing trace with hash 900929556, now seen corresponding path program 1 times [2019-01-08 14:03:11,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:11,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:11,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:03:11,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:11,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:11,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:11,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:11,283 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:11,283 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:03:11,283 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [23] [2019-01-08 14:03:11,284 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:03:11,284 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:03:11,287 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:03:11,288 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-08 14:03:11,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:11,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:03:11,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:11,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:11,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:11,304 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:03:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:11,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:11,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:03:11,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, 0 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-08 14:03:11,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:03:11,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:11,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:03:11,341 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:11,353 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:11,363 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:11,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:11,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:11,386 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-01-08 14:03:11,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:11,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:11,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-08 14:03:11,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:11,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:11,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-08 14:03:11,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:11,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:11,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:11,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:11,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-08 14:03:11,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:11,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:11,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-08 14:03:11,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:11,480 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:11,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:11,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:11,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:03:11,526 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:11,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:03:11,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:03:11,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:03:11,527 INFO L87 Difference]: Start difference. First operand 149 states and 702 transitions. Second operand 8 states. [2019-01-08 14:03:11,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:11,723 INFO L93 Difference]: Finished difference Result 165 states and 720 transitions. [2019-01-08 14:03:11,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:03:11,723 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-08 14:03:11,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:11,724 INFO L225 Difference]: With dead ends: 165 [2019-01-08 14:03:11,724 INFO L226 Difference]: Without dead ends: 164 [2019-01-08 14:03:11,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:03:11,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-01-08 14:03:11,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 149. [2019-01-08 14:03:11,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-08 14:03:11,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 702 transitions. [2019-01-08 14:03:11,773 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 702 transitions. Word has length 6 [2019-01-08 14:03:11,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:11,773 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 702 transitions. [2019-01-08 14:03:11,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:03:11,773 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 702 transitions. [2019-01-08 14:03:11,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:03:11,774 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:11,774 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:03:11,774 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:11,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:11,775 INFO L82 PathProgramCache]: Analyzing trace with hash 900750810, now seen corresponding path program 1 times [2019-01-08 14:03:11,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:11,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:11,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:11,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:11,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:11,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:11,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:11,863 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:11,863 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:03:11,864 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [22], [23] [2019-01-08 14:03:11,865 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:03:11,865 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:03:11,867 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:03:11,868 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-08 14:03:11,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:11,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:03:11,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:11,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:11,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:11,878 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:03:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:11,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:11,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:03:11,890 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-08 14:03:11,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:11,904 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-08 14:03:11,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:11,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:11,919 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-08 14:03:11,920 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:11,939 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:11,948 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:11,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:11,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:11,973 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-01-08 14:03:12,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:12,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:12,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:12,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:12,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-08 14:03:12,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:12,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:12,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-08 14:03:12,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:12,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:12,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:12,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:12,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:12,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:12,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:03:12,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:12,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:12,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-08 14:03:12,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:12,099 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:12,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:12,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:12,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:03:12,148 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:12,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:03:12,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:03:12,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:03:12,149 INFO L87 Difference]: Start difference. First operand 149 states and 702 transitions. Second operand 8 states. [2019-01-08 14:03:12,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:12,419 INFO L93 Difference]: Finished difference Result 174 states and 765 transitions. [2019-01-08 14:03:12,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:03:12,419 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-08 14:03:12,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:12,421 INFO L225 Difference]: With dead ends: 174 [2019-01-08 14:03:12,422 INFO L226 Difference]: Without dead ends: 173 [2019-01-08 14:03:12,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:03:12,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-08 14:03:12,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 158. [2019-01-08 14:03:12,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-08 14:03:12,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 747 transitions. [2019-01-08 14:03:12,473 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 747 transitions. Word has length 6 [2019-01-08 14:03:12,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:12,473 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 747 transitions. [2019-01-08 14:03:12,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:03:12,474 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 747 transitions. [2019-01-08 14:03:12,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:03:12,475 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:12,476 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-08 14:03:12,476 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:12,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:12,476 INFO L82 PathProgramCache]: Analyzing trace with hash -2078696478, now seen corresponding path program 1 times [2019-01-08 14:03:12,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:12,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:12,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:12,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:12,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:12,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:12,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:12,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:12,542 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:03:12,542 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [22], [24], [25] [2019-01-08 14:03:12,543 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:03:12,543 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:03:12,547 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:03:12,547 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-08 14:03:12,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:12,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:03:12,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:12,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:12,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:12,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:03:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:12,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:12,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-08 14:03:12,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 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-08 14:03:12,585 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-08 14:03:12,607 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-08 14:03:12,607 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:12,615 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:12,624 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:12,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:12,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:12,644 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:15, output treesize:21 [2019-01-08 14:03:12,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:12,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-01-08 14:03:12,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:12,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:12,711 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-08 14:03:12,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:12,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:03:12,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:12,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:12,763 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2019-01-08 14:03:12,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:12,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:12,793 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-08 14:03:12,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-08 14:03:12,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 8 [2019-01-08 14:03:12,813 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:03:12,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-08 14:03:12,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-08 14:03:12,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:03:12,814 INFO L87 Difference]: Start difference. First operand 158 states and 747 transitions. Second operand 5 states. [2019-01-08 14:03:12,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:12,982 INFO L93 Difference]: Finished difference Result 357 states and 1628 transitions. [2019-01-08 14:03:12,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:03:12,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-08 14:03:12,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:12,985 INFO L225 Difference]: With dead ends: 357 [2019-01-08 14:03:12,985 INFO L226 Difference]: Without dead ends: 353 [2019-01-08 14:03:12,985 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-08 14:03:12,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-01-08 14:03:13,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 329. [2019-01-08 14:03:13,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-01-08 14:03:13,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 1593 transitions. [2019-01-08 14:03:13,117 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 1593 transitions. Word has length 7 [2019-01-08 14:03:13,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:13,118 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 1593 transitions. [2019-01-08 14:03:13,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-08 14:03:13,118 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 1593 transitions. [2019-01-08 14:03:13,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:03:13,119 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:13,119 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:03:13,119 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:13,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:13,120 INFO L82 PathProgramCache]: Analyzing trace with hash -2087931688, now seen corresponding path program 1 times [2019-01-08 14:03:13,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:13,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:13,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:13,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:13,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:13,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:13,416 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-01-08 14:03:13,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:13,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:13,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:13,511 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:03:13,511 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [24], [25] [2019-01-08 14:03:13,513 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:03:13,513 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:03:13,516 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:03:13,516 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-08 14:03:13,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:13,516 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:03:13,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:13,516 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:13,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:13,531 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:03:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:13,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:13,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:03:13,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:13,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-08 14:03:13,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:13,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:13,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:03:13,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:13,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:13,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:13,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:03:13,666 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:13,752 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:13,763 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:13,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:13,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:13,790 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-08 14:03:13,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:13,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:13,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:13,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:13,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:13,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:13,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:13,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:03:13,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:13,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:13,852 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:03:13,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:13,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:13,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:13,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:13,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:13,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:13,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:13,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:13,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:13,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-08 14:03:13,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:13,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:13,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-08 14:03:13,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:13,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:14,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:14,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:14,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:03:14,160 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:14,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:03:14,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:03:14,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:03:14,160 INFO L87 Difference]: Start difference. First operand 329 states and 1593 transitions. Second operand 8 states. [2019-01-08 14:03:14,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:14,500 INFO L93 Difference]: Finished difference Result 348 states and 1627 transitions. [2019-01-08 14:03:14,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:03:14,510 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-08 14:03:14,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:14,513 INFO L225 Difference]: With dead ends: 348 [2019-01-08 14:03:14,514 INFO L226 Difference]: Without dead ends: 338 [2019-01-08 14:03:14,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:03:14,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-01-08 14:03:14,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 333. [2019-01-08 14:03:14,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-01-08 14:03:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 1604 transitions. [2019-01-08 14:03:14,639 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 1604 transitions. Word has length 7 [2019-01-08 14:03:14,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:14,639 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 1604 transitions. [2019-01-08 14:03:14,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:03:14,639 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 1604 transitions. [2019-01-08 14:03:14,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:03:14,640 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:14,640 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:03:14,641 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:14,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:14,641 INFO L82 PathProgramCache]: Analyzing trace with hash -2088231584, now seen corresponding path program 1 times [2019-01-08 14:03:14,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:14,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:14,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:14,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:14,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:15,241 WARN L181 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-01-08 14:03:15,333 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:03:15,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:15,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:15,334 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:03:15,334 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [23] [2019-01-08 14:03:15,335 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:03:15,335 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:03:15,338 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:03:15,338 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-08 14:03:15,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:15,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:03:15,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:15,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:15,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:15,349 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:03:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:15,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:15,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-08 14:03:15,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:15,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-08 14:03:15,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:15,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:15,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:03:15,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:15,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:15,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:15,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-08 14:03:15,377 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:15,401 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:15,415 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:15,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:15,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:15,444 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-08 14:03:15,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:15,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:15,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:15,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:15,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:15,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:15,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:15,597 INFO L303 Elim1Store]: Index analysis took 127 ms [2019-01-08 14:03:15,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:03:15,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:15,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:15,628 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-08 14:03:15,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:15,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:15,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:15,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:15,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:15,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:15,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:15,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:15,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:15,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-08 14:03:15,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:15,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:15,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-08 14:03:15,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:15,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:15,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:15,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:15,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:15,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:15,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:15,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:15,740 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:03:15,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:15,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-08 14:03:15,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:15,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:15,786 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-08 14:03:15,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:15,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:15,864 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:15,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:15,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:03:15,883 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:15,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:03:15,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:03:15,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:03:15,883 INFO L87 Difference]: Start difference. First operand 333 states and 1604 transitions. Second operand 10 states. [2019-01-08 14:03:16,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:16,348 INFO L93 Difference]: Finished difference Result 348 states and 1634 transitions. [2019-01-08 14:03:16,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:03:16,348 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-08 14:03:16,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:16,351 INFO L225 Difference]: With dead ends: 348 [2019-01-08 14:03:16,351 INFO L226 Difference]: Without dead ends: 343 [2019-01-08 14:03:16,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:03:16,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-01-08 14:03:16,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 334. [2019-01-08 14:03:16,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-01-08 14:03:16,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1603 transitions. [2019-01-08 14:03:16,472 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1603 transitions. Word has length 7 [2019-01-08 14:03:16,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:16,472 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 1603 transitions. [2019-01-08 14:03:16,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:03:16,472 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1603 transitions. [2019-01-08 14:03:16,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:03:16,473 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:16,474 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:03:16,474 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:16,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:16,474 INFO L82 PathProgramCache]: Analyzing trace with hash -2088122094, now seen corresponding path program 1 times [2019-01-08 14:03:16,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:16,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:16,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:16,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:16,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:16,643 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-08 14:03:16,744 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:03:16,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:16,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:16,745 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:03:16,745 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [21] [2019-01-08 14:03:16,746 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:03:16,746 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:03:16,749 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:03:16,749 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-08 14:03:16,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:16,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:03:16,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:16,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:16,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:16,758 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:03:16,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:16,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:16,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:03:16,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:16,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-08 14:03:16,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:16,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:16,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:03:16,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:16,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:16,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:16,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:03:16,792 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:16,815 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:16,824 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:16,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:16,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:16,852 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-08 14:03:16,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:16,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:16,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:16,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:16,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:16,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:16,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:16,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:03:16,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:16,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:16,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-08 14:03:16,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:16,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:16,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:16,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:16,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:16,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:16,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:16,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:16,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:16,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-08 14:03:16,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:17,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:17,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-08 14:03:17,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:17,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:17,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:17,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:17,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:17,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:17,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:17,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:17,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:17,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:17,049 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:03:17,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 33 treesize of output 77 [2019-01-08 14:03:17,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:17,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:17,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-08 14:03:17,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:17,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:17,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:17,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:17,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:17,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:17,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:17,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:17,130 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:03:17,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:17,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-08 14:03:17,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:17,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:17,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-08 14:03:17,198 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:17,199 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:17,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:17,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:17,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-08 14:03:17,277 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:17,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:03:17,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:03:17,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:03:17,277 INFO L87 Difference]: Start difference. First operand 334 states and 1603 transitions. Second operand 12 states. [2019-01-08 14:03:17,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:17,962 INFO L93 Difference]: Finished difference Result 457 states and 2102 transitions. [2019-01-08 14:03:17,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:03:17,962 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-08 14:03:17,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:17,967 INFO L225 Difference]: With dead ends: 457 [2019-01-08 14:03:17,967 INFO L226 Difference]: Without dead ends: 456 [2019-01-08 14:03:17,967 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-08 14:03:17,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-01-08 14:03:18,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 329. [2019-01-08 14:03:18,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-01-08 14:03:18,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 1582 transitions. [2019-01-08 14:03:18,059 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 1582 transitions. Word has length 7 [2019-01-08 14:03:18,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:18,059 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 1582 transitions. [2019-01-08 14:03:18,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:03:18,059 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 1582 transitions. [2019-01-08 14:03:18,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:03:18,060 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:18,060 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:03:18,061 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:18,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:18,061 INFO L82 PathProgramCache]: Analyzing trace with hash -2084662494, now seen corresponding path program 2 times [2019-01-08 14:03:18,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:18,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:18,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:18,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:18,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:18,283 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 20 [2019-01-08 14:03:18,374 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:03:18,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:18,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:18,374 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:03:18,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:03:18,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:18,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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:18,384 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:03:18,384 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:03:18,395 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:03:18,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:03:18,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:18,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:03:18,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-08 14:03:18,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,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-08 14:03:18,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:03:18,427 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:18,451 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:18,462 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:18,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:18,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:18,487 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-08 14:03:18,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:03:18,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:18,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:18,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-08 14:03:18,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,590 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:03:18,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-08 14:03:18,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:18,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:18,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:30 [2019-01-08 14:03:18,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-08 14:03:18,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:18,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:18,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-01-08 14:03:18,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:18,744 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:03:18,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-08 14:03:18,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:18,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:18,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-08 14:03:18,813 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:18,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:18,882 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:18,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:18,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-08 14:03:18,901 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:18,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:03:18,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:03:18,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:03:18,902 INFO L87 Difference]: Start difference. First operand 329 states and 1582 transitions. Second operand 11 states. [2019-01-08 14:03:19,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:19,574 INFO L93 Difference]: Finished difference Result 346 states and 1608 transitions. [2019-01-08 14:03:19,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:03:19,574 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-08 14:03:19,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:19,578 INFO L225 Difference]: With dead ends: 346 [2019-01-08 14:03:19,578 INFO L226 Difference]: Without dead ends: 345 [2019-01-08 14:03:19,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:03:19,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-01-08 14:03:19,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 213. [2019-01-08 14:03:19,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-08 14:03:19,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 1003 transitions. [2019-01-08 14:03:19,649 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 1003 transitions. Word has length 7 [2019-01-08 14:03:19,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:19,649 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 1003 transitions. [2019-01-08 14:03:19,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:03:19,650 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 1003 transitions. [2019-01-08 14:03:19,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:03:19,650 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:19,650 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:03:19,650 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:19,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:19,651 INFO L82 PathProgramCache]: Analyzing trace with hash -2084418336, now seen corresponding path program 1 times [2019-01-08 14:03:19,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:19,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:19,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:03:19,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:19,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:19,806 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:03:19,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:19,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:19,807 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:03:19,807 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [22], [23] [2019-01-08 14:03:19,808 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:03:19,809 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:03:19,811 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:03:19,811 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-08 14:03:19,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:19,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:03:19,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:19,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:19,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:19,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:03:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:19,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:19,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-08 14:03:19,840 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-08 14:03:19,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:19,847 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-08 14:03:19,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:19,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:19,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:03:19,866 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:19,885 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:19,895 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:19,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:19,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:19,919 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-08 14:03:19,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:19,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:19,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:19,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:19,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-08 14:03:19,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:19,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:19,974 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-08 14:03:19,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:19,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:19,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:19,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:19,998 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:03:19,999 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-08 14:03:19,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:20,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:20,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:22 [2019-01-08 14:03:20,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:20,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:20,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:20,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:20,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:20,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:20,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:03:20,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:20,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:20,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:26 [2019-01-08 14:03:20,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:20,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:20,133 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:20,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:20,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:03:20,153 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:20,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:03:20,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:03:20,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:03:20,154 INFO L87 Difference]: Start difference. First operand 213 states and 1003 transitions. Second operand 10 states. [2019-01-08 14:03:20,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:20,571 INFO L93 Difference]: Finished difference Result 280 states and 1278 transitions. [2019-01-08 14:03:20,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:03:20,571 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-08 14:03:20,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:20,573 INFO L225 Difference]: With dead ends: 280 [2019-01-08 14:03:20,573 INFO L226 Difference]: Without dead ends: 277 [2019-01-08 14:03:20,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:03:20,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-01-08 14:03:20,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 242. [2019-01-08 14:03:20,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-01-08 14:03:20,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 1141 transitions. [2019-01-08 14:03:20,671 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 1141 transitions. Word has length 7 [2019-01-08 14:03:20,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:20,672 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 1141 transitions. [2019-01-08 14:03:20,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:03:20,672 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 1141 transitions. [2019-01-08 14:03:20,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:03:20,672 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:20,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:03:20,673 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:20,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:20,673 INFO L82 PathProgramCache]: Analyzing trace with hash -2080543520, now seen corresponding path program 1 times [2019-01-08 14:03:20,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:20,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:20,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:20,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:20,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:20,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:20,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:20,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:20,781 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:03:20,782 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [24], [25] [2019-01-08 14:03:20,784 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:03:20,784 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:03:20,787 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:03:20,787 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-08 14:03:20,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:20,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:03:20,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:20,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:20,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:20,798 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:03:20,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:20,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:20,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-08 14:03:20,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-08 14:03:20,827 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-08 14:03:20,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:20,839 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-08 14:03:20,840 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:20,852 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:20,861 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:20,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:20,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:20,882 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-01-08 14:03:20,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:20,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:20,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-08 14:03:20,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:20,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:20,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-08 14:03:20,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:20,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:20,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:20,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:20,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:03:20,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:20,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:20,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-01-08 14:03:20,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:20,972 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:20,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:21,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:21,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-08 14:03:21,013 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:21,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:03:21,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:03:21,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:03:21,013 INFO L87 Difference]: Start difference. First operand 242 states and 1141 transitions. Second operand 9 states. [2019-01-08 14:03:21,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:21,391 INFO L93 Difference]: Finished difference Result 390 states and 1798 transitions. [2019-01-08 14:03:21,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:03:21,391 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-08 14:03:21,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:21,394 INFO L225 Difference]: With dead ends: 390 [2019-01-08 14:03:21,394 INFO L226 Difference]: Without dead ends: 377 [2019-01-08 14:03:21,394 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-08 14:03:21,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-01-08 14:03:21,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 367. [2019-01-08 14:03:21,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-01-08 14:03:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1654 transitions. [2019-01-08 14:03:21,564 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1654 transitions. Word has length 7 [2019-01-08 14:03:21,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:21,565 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 1654 transitions. [2019-01-08 14:03:21,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:03:21,565 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1654 transitions. [2019-01-08 14:03:21,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:03:21,566 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:21,566 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-08 14:03:21,566 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:21,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:21,567 INFO L82 PathProgramCache]: Analyzing trace with hash -2080966800, now seen corresponding path program 4 times [2019-01-08 14:03:21,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:21,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:21,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:21,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:21,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:21,727 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 21 [2019-01-08 14:03:21,843 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:03:21,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:21,844 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:21,844 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:03:21,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:03:21,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:21,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:21,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:21,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:03:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:21,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:21,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:03:21,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:21,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-08 14:03:21,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:21,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:21,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:03:21,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:21,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:21,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:21,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:03:21,881 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:21,904 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:21,915 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:21,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:21,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:21,943 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-08 14:03:21,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:21,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:21,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:21,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:21,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:21,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:21,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:21,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:03:21,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:22,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:22,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:30 [2019-01-08 14:03:22,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-08 14:03:22,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:22,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:22,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-08 14:03:22,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,137 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:03:22,138 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-08 14:03:22,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:22,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:22,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-08 14:03:22,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-08 14:03:22,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:22,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:22,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-08 14:03:22,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:22,318 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-08 14:03:22,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:22,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:22,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-08 14:03:22,390 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:22,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:22,496 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:22,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:22,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-08 14:03:22,517 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:22,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-08 14:03:22,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-08 14:03:22,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=220, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:03:22,517 INFO L87 Difference]: Start difference. First operand 367 states and 1654 transitions. Second operand 13 states. [2019-01-08 14:03:23,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:23,214 INFO L93 Difference]: Finished difference Result 375 states and 1668 transitions. [2019-01-08 14:03:23,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:03:23,214 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-08 14:03:23,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:23,218 INFO L225 Difference]: With dead ends: 375 [2019-01-08 14:03:23,218 INFO L226 Difference]: Without dead ends: 374 [2019-01-08 14:03:23,219 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-08 14:03:23,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-01-08 14:03:23,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 147. [2019-01-08 14:03:23,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-08 14:03:23,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 607 transitions. [2019-01-08 14:03:23,345 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 607 transitions. Word has length 7 [2019-01-08 14:03:23,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:23,346 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 607 transitions. [2019-01-08 14:03:23,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-08 14:03:23,346 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 607 transitions. [2019-01-08 14:03:23,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:03:23,347 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:23,347 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:03:23,347 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:23,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:23,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1924438182, now seen corresponding path program 1 times [2019-01-08 14:03:23,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:23,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:23,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:23,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:23,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:23,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:03:23,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:23,516 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:23,516 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:03:23,517 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [24], [25] [2019-01-08 14:03:23,517 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:03:23,517 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:03:23,520 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:03:23,520 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-08 14:03:23,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:23,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:03:23,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:23,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:23,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:23,529 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:03:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:23,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:23,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-08 14:03:23,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:23,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-08 14:03:23,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:23,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:23,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-08 14:03:23,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:23,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:23,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:23,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:03:23,636 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:23,661 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:23,672 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:23,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:23,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:23,698 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-08 14:03:23,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:23,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:23,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:23,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:23,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:23,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:23,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:23,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:03:23,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:23,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:23,766 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:03:23,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:23,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:23,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:23,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:23,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:23,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:23,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:23,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:23,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:23,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-08 14:03:23,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:23,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:23,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-08 14:03:23,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-08 14:03:23,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:23,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:23,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:23,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-08 14:03:23,905 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:23,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-08 14:03:23,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-08 14:03:23,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:03:23,906 INFO L87 Difference]: Start difference. First operand 147 states and 607 transitions. Second operand 7 states. [2019-01-08 14:03:24,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:24,227 INFO L93 Difference]: Finished difference Result 157 states and 628 transitions. [2019-01-08 14:03:24,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:03:24,227 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-08 14:03:24,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:24,229 INFO L225 Difference]: With dead ends: 157 [2019-01-08 14:03:24,229 INFO L226 Difference]: Without dead ends: 150 [2019-01-08 14:03:24,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:03:24,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-08 14:03:24,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-01-08 14:03:24,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-08 14:03:24,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 611 transitions. [2019-01-08 14:03:24,363 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 611 transitions. Word has length 7 [2019-01-08 14:03:24,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:24,363 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 611 transitions. [2019-01-08 14:03:24,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-08 14:03:24,363 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 611 transitions. [2019-01-08 14:03:24,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:03:24,364 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:24,364 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:03:24,364 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:24,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:24,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1928011116, now seen corresponding path program 1 times [2019-01-08 14:03:24,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:24,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:24,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:24,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:24,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:24,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:03:24,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:24,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:24,551 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:03:24,551 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [23] [2019-01-08 14:03:24,552 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:03:24,552 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:03:24,555 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:03:24,555 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-08 14:03:24,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:24,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:03:24,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:24,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:24,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:24,567 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:03:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:24,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:24,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:03:24,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:24,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-08 14:03:24,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:24,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:24,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-08 14:03:24,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:24,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:24,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:24,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:03:24,598 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:24,620 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:24,632 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:24,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:24,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:24,657 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-08 14:03:24,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:24,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:24,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:24,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:24,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:24,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:24,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:24,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:03:24,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:24,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:24,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:03:24,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:24,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:24,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:24,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:24,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:24,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:24,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:24,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:24,761 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:03:24,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-08 14:03:24,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:24,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:24,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:03:24,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:24,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:24,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:24,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:24,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:24,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:24,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:24,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:24,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:24,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-08 14:03:24,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:24,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:24,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-08 14:03:24,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:24,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:24,977 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:24,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:24,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:03:24,996 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:24,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:03:24,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:03:24,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:03:24,997 INFO L87 Difference]: Start difference. First operand 149 states and 611 transitions. Second operand 10 states. [2019-01-08 14:03:25,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:25,559 INFO L93 Difference]: Finished difference Result 206 states and 810 transitions. [2019-01-08 14:03:25,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:03:25,560 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-08 14:03:25,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:25,563 INFO L225 Difference]: With dead ends: 206 [2019-01-08 14:03:25,563 INFO L226 Difference]: Without dead ends: 199 [2019-01-08 14:03:25,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:03:25,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-01-08 14:03:25,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 158. [2019-01-08 14:03:25,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-08 14:03:25,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 646 transitions. [2019-01-08 14:03:25,754 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 646 transitions. Word has length 7 [2019-01-08 14:03:25,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:25,754 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 646 transitions. [2019-01-08 14:03:25,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:03:25,754 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 646 transitions. [2019-01-08 14:03:25,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:03:25,754 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:25,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:03:25,755 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:25,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:25,755 INFO L82 PathProgramCache]: Analyzing trace with hash 2042527720, now seen corresponding path program 2 times [2019-01-08 14:03:25,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:25,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:25,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:25,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:25,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:25,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:03:25,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:25,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:25,931 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:03:25,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:03:25,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:25,932 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:25,941 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:03:25,941 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:03:25,947 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:03:25,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:03:25,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:25,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-08 14:03:25,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 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-08 14:03:25,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:25,969 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-08 14:03:25,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:25,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:25,986 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-08 14:03:25,987 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:26,004 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:26,014 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:26,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:26,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:26,036 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-08 14:03:26,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:26,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:26,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:26,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:26,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-08 14:03:26,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:26,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:26,091 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-08 14:03:26,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:26,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:26,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:26,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:26,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:26,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:26,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-08 14:03:26,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:26,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:26,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2019-01-08 14:03:26,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:26,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:26,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:26,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:26,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:26,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:26,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:26,171 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:03:26,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:03:26,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:26,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:26,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-08 14:03:26,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:26,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:26,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:26,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:26,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:03:26,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:26,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:03:26,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:03:26,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:03:26,306 INFO L87 Difference]: Start difference. First operand 158 states and 646 transitions. Second operand 10 states. [2019-01-08 14:03:26,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:26,828 INFO L93 Difference]: Finished difference Result 161 states and 653 transitions. [2019-01-08 14:03:26,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:03:26,829 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-08 14:03:26,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:26,831 INFO L225 Difference]: With dead ends: 161 [2019-01-08 14:03:26,831 INFO L226 Difference]: Without dead ends: 156 [2019-01-08 14:03:26,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:03:26,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-08 14:03:26,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 33. [2019-01-08 14:03:26,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-08 14:03:26,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 119 transitions. [2019-01-08 14:03:26,918 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 119 transitions. Word has length 7 [2019-01-08 14:03:26,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:26,918 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 119 transitions. [2019-01-08 14:03:26,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:03:26,919 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 119 transitions. [2019-01-08 14:03:26,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:03:26,919 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:26,919 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:03:26,919 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:26,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:26,920 INFO L82 PathProgramCache]: Analyzing trace with hash -305786232, now seen corresponding path program 1 times [2019-01-08 14:03:26,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:26,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:26,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:03:26,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:26,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:27,098 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:27,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:27,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:27,099 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:03:27,099 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [24], [25] [2019-01-08 14:03:27,100 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:03:27,101 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:03:27,103 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:03:27,104 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-08 14:03:27,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:27,104 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:03:27,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:27,104 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:27,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:27,125 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:03:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:27,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:27,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:03:27,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:27,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-08 14:03:27,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:27,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:27,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:03:27,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:27,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:27,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:27,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:03:27,168 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:27,189 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:27,200 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:27,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:27,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:27,228 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-08 14:03:27,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:27,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:27,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:27,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:27,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:27,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:27,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:27,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:03:27,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:27,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:27,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:03:27,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:27,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:27,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:27,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:27,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:27,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:27,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:27,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:27,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:27,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-08 14:03:27,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:27,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:27,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:03:27,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:27,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:27,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:27,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:27,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:27,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:27,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:27,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:27,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:27,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:27,404 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:03:27,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-08 14:03:27,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:27,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:27,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-08 14:03:27,473 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:27,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:27,520 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:27,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:27,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:03:27,539 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:27,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:03:27,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:03:27,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:03:27,540 INFO L87 Difference]: Start difference. First operand 33 states and 119 transitions. Second operand 10 states. [2019-01-08 14:03:27,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:27,955 INFO L93 Difference]: Finished difference Result 62 states and 209 transitions. [2019-01-08 14:03:27,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:03:27,955 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-08 14:03:27,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:27,956 INFO L225 Difference]: With dead ends: 62 [2019-01-08 14:03:27,957 INFO L226 Difference]: Without dead ends: 52 [2019-01-08 14:03:27,957 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-08 14:03:27,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-08 14:03:28,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2019-01-08 14:03:28,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-08 14:03:28,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 167 transitions. [2019-01-08 14:03:28,069 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 167 transitions. Word has length 8 [2019-01-08 14:03:28,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:28,069 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 167 transitions. [2019-01-08 14:03:28,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:03:28,069 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 167 transitions. [2019-01-08 14:03:28,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:03:28,070 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:28,070 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:03:28,070 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:28,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:28,070 INFO L82 PathProgramCache]: Analyzing trace with hash -477561138, now seen corresponding path program 1 times [2019-01-08 14:03:28,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:28,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:28,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:28,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:28,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:28,233 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-01-08 14:03:28,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-08 14:03:28,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:28,270 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:28,270 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:03:28,270 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [22], [24], [25] [2019-01-08 14:03:28,271 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:03:28,271 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:03:28,276 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:03:28,276 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-08 14:03:28,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:28,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:03:28,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:28,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:28,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:28,285 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:03:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:28,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:28,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:03:28,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:28,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-08 14:03:28,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:28,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:28,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:03:28,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:28,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:28,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:28,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:03:28,315 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:28,337 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:28,349 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:28,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:28,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:28,375 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-08 14:03:28,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:28,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:28,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:28,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:28,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:28,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:28,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:28,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:03:28,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:28,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:28,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-08 14:03:28,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:28,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:28,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:28,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:28,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:28,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:28,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:28,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:28,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:28,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-08 14:03:28,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:28,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:28,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:03:28,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:28,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:28,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:28,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:28,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:28,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:28,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:28,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:28,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:28,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:28,554 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:03:28,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-08 14:03:28,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:28,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:28,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-08 14:03:28,624 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:28,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:28,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:28,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:28,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2019-01-08 14:03:28,685 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:28,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:03:28,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:03:28,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:03:28,686 INFO L87 Difference]: Start difference. First operand 45 states and 167 transitions. Second operand 8 states. [2019-01-08 14:03:29,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:29,115 INFO L93 Difference]: Finished difference Result 59 states and 204 transitions. [2019-01-08 14:03:29,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:03:29,116 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-01-08 14:03:29,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:29,116 INFO L225 Difference]: With dead ends: 59 [2019-01-08 14:03:29,117 INFO L226 Difference]: Without dead ends: 52 [2019-01-08 14:03:29,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:03:29,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-08 14:03:29,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2019-01-08 14:03:29,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-08 14:03:29,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 167 transitions. [2019-01-08 14:03:29,257 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 167 transitions. Word has length 8 [2019-01-08 14:03:29,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:29,257 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 167 transitions. [2019-01-08 14:03:29,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:03:29,258 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 167 transitions. [2019-01-08 14:03:29,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:03:29,258 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:29,258 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:03:29,258 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:29,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:29,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1160942496, now seen corresponding path program 2 times [2019-01-08 14:03:29,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:29,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:29,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:29,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:29,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:29,490 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-08 14:03:29,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:29,490 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:29,490 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:03:29,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:03:29,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:29,491 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:29,500 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:03:29,500 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:03:29,509 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:03:29,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:03:29,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:29,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-08 14:03:29,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-08 14:03:29,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:03:29,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:03:29,548 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:29,582 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:29,594 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:29,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:29,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:29,622 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-08 14:03:29,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:03:29,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:29,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:29,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-08 14:03:29,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-08 14:03:29,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:29,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:29,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-08 14:03:29,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:03:29,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:29,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:29,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-08 14:03:29,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:29,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:03:29,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:29,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:29,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-08 14:03:29,967 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:29,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:30,079 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:30,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:30,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-01-08 14:03:30,099 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:30,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:03:30,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:03:30,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:03:30,100 INFO L87 Difference]: Start difference. First operand 45 states and 167 transitions. Second operand 10 states. [2019-01-08 14:03:30,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:30,650 INFO L93 Difference]: Finished difference Result 67 states and 237 transitions. [2019-01-08 14:03:30,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:03:30,650 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-08 14:03:30,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:30,651 INFO L225 Difference]: With dead ends: 67 [2019-01-08 14:03:30,651 INFO L226 Difference]: Without dead ends: 32 [2019-01-08 14:03:30,651 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-08 14:03:30,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-08 14:03:30,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-01-08 14:03:30,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-08 14:03:30,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 100 transitions. [2019-01-08 14:03:30,759 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 100 transitions. Word has length 9 [2019-01-08 14:03:30,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:30,759 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 100 transitions. [2019-01-08 14:03:30,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:03:30,759 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 100 transitions. [2019-01-08 14:03:30,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:03:30,759 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:30,759 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:03:30,760 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:30,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:30,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1292813016, now seen corresponding path program 1 times [2019-01-08 14:03:30,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:30,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:30,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:03:30,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:30,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:30,893 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-08 14:03:30,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:30,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:30,894 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-08 14:03:30,894 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [24], [25] [2019-01-08 14:03:30,895 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:03:30,895 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:03:30,898 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:03:30,898 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-08 14:03:30,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:30,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:03:30,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:30,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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:30,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:30,909 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:03:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:30,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:30,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-08 14:03:30,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:30,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-08 14:03:30,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:30,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:30,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:03:30,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:30,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:30,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:30,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-08 14:03:30,945 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:30,970 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:30,982 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:30,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:31,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:31,011 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-08 14:03:31,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:03:31,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:31,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:31,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-08 14:03:31,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-08 14:03:31,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:31,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:31,153 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:03:31,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-08 14:03:31,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:31,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:31,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-08 14:03:31,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:31,272 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:03:31,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 78 [2019-01-08 14:03:31,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:31,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:31,321 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-08 14:03:31,343 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:31,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:31,397 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-08 14:03:31,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:31,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-01-08 14:03:31,417 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:31,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:03:31,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:03:31,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:03:31,418 INFO L87 Difference]: Start difference. First operand 30 states and 100 transitions. Second operand 10 states. [2019-01-08 14:03:31,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:31,845 INFO L93 Difference]: Finished difference Result 47 states and 147 transitions. [2019-01-08 14:03:31,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:03:31,845 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-08 14:03:31,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:31,846 INFO L225 Difference]: With dead ends: 47 [2019-01-08 14:03:31,847 INFO L226 Difference]: Without dead ends: 40 [2019-01-08 14:03:31,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:03:31,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-08 14:03:31,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2019-01-08 14:03:31,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-08 14:03:31,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 122 transitions. [2019-01-08 14:03:31,991 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 122 transitions. Word has length 9 [2019-01-08 14:03:31,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:31,992 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 122 transitions. [2019-01-08 14:03:31,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:03:31,992 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 122 transitions. [2019-01-08 14:03:31,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:03:31,992 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:31,992 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:03:31,993 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:31,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:31,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1875225892, now seen corresponding path program 2 times [2019-01-08 14:03:31,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:31,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:31,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:31,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:31,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:32,142 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-08 14:03:32,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:32,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:32,143 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:03:32,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:03:32,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:32,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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:32,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:03:32,153 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:03:32,160 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:03:32,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:03:32,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:32,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-08 14:03:32,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-08 14:03:32,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 14:03:32,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-08 14:03:32,188 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:32,211 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:32,223 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:32,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:32,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:32,252 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-08 14:03:32,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,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-08 14:03:32,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:32,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:32,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-08 14:03:32,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-08 14:03:32,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:32,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:32,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:03:32,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,451 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:03:32,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-08 14:03:32,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:32,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:32,499 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-08 14:03:32,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:32,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, 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-08 14:03:32,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:32,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:32,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-08 14:03:32,609 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:32,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:32,678 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:32,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:32,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-08 14:03:32,697 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:32,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:03:32,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:03:32,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:03:32,698 INFO L87 Difference]: Start difference. First operand 36 states and 122 transitions. Second operand 11 states. [2019-01-08 14:03:33,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:33,203 INFO L93 Difference]: Finished difference Result 52 states and 168 transitions. [2019-01-08 14:03:33,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:03:33,204 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-08 14:03:33,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:33,205 INFO L225 Difference]: With dead ends: 52 [2019-01-08 14:03:33,205 INFO L226 Difference]: Without dead ends: 45 [2019-01-08 14:03:33,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-01-08 14:03:33,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-08 14:03:33,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2019-01-08 14:03:33,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-08 14:03:33,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 138 transitions. [2019-01-08 14:03:33,351 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 138 transitions. Word has length 9 [2019-01-08 14:03:33,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:33,351 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 138 transitions. [2019-01-08 14:03:33,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:03:33,351 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 138 transitions. [2019-01-08 14:03:33,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:03:33,352 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:33,352 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:03:33,352 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:33,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:33,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1867837724, now seen corresponding path program 1 times [2019-01-08 14:03:33,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:33,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:33,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:03:33,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:33,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:33,574 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:03:33,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:33,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:33,575 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-08 14:03:33,575 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [22], [24], [25] [2019-01-08 14:03:33,576 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:03:33,576 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:03:33,579 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:03:33,579 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-08 14:03:33,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:33,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:03:33,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:33,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:33,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:33,589 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:03:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:33,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:33,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-08 14:03:33,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:33,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-08 14:03:33,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:33,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:33,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-08 14:03:33,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:33,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:33,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:33,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-08 14:03:33,618 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:33,640 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:33,651 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:33,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:33,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:33,678 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-08 14:03:33,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:33,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:33,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:33,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:33,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:33,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:33,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:33,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:03:33,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:33,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:33,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-08 14:03:33,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:33,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:33,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:33,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:33,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:33,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:33,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:33,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:33,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:33,976 INFO L303 Elim1Store]: Index analysis took 210 ms [2019-01-08 14:03:33,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-08 14:03:33,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:34,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:34,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:03:34,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:34,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:34,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:34,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:34,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:34,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:34,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:34,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:34,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:34,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:34,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:34,105 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:03:34,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-08 14:03:34,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:34,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:34,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-08 14:03:34,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:34,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:34,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:34,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:34,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:34,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:34,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:34,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:34,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:34,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:34,189 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:03:34,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-08 14:03:34,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:34,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:34,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-08 14:03:34,260 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:34,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:34,383 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:34,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:34,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-08 14:03:34,402 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:34,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:03:34,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:03:34,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:03:34,403 INFO L87 Difference]: Start difference. First operand 40 states and 138 transitions. Second operand 12 states. [2019-01-08 14:03:35,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:35,064 INFO L93 Difference]: Finished difference Result 66 states and 218 transitions. [2019-01-08 14:03:35,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:03:35,065 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-08 14:03:35,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:35,066 INFO L225 Difference]: With dead ends: 66 [2019-01-08 14:03:35,066 INFO L226 Difference]: Without dead ends: 56 [2019-01-08 14:03:35,066 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-08 14:03:35,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-08 14:03:35,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2019-01-08 14:03:35,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-08 14:03:35,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 140 transitions. [2019-01-08 14:03:35,244 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 140 transitions. Word has length 9 [2019-01-08 14:03:35,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:35,244 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 140 transitions. [2019-01-08 14:03:35,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:03:35,244 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 140 transitions. [2019-01-08 14:03:35,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-08 14:03:35,244 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:35,244 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:03:35,244 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:35,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:35,245 INFO L82 PathProgramCache]: Analyzing trace with hash 638911500, now seen corresponding path program 2 times [2019-01-08 14:03:35,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:35,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:35,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:35,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:35,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:35,516 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-08 14:03:35,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:35,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:35,517 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:03:35,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:03:35,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:35,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:35,526 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:03:35,526 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:03:35,534 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-08 14:03:35,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:03:35,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:35,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-08 14:03:35,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-08 14:03:35,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-08 14:03:35,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-08 14:03:35,555 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:35,576 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:35,588 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:35,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:35,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:35,614 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-08 14:03:35,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:03:35,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:35,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:35,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-08 14:03:35,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,729 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:03:35,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 58 [2019-01-08 14:03:35,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:35,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:35,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-08 14:03:35,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-08 14:03:35,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:35,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:35,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:34 [2019-01-08 14:03:35,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-08 14:03:35,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:35,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:35,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-01-08 14:03:35,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:03:35,974 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-08 14:03:35,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:36,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:03:36,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-08 14:03:36,048 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:36,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:36,128 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:36,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:36,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 16 [2019-01-08 14:03:36,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:36,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:03:36,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:03:36,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2019-01-08 14:03:36,148 INFO L87 Difference]: Start difference. First operand 40 states and 140 transitions. Second operand 12 states. [2019-01-08 14:03:36,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:36,831 INFO L93 Difference]: Finished difference Result 48 states and 164 transitions. [2019-01-08 14:03:36,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:03:36,832 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2019-01-08 14:03:36,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:36,832 INFO L225 Difference]: With dead ends: 48 [2019-01-08 14:03:36,832 INFO L226 Difference]: Without dead ends: 0 [2019-01-08 14:03:36,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-01-08 14:03:36,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-08 14:03:36,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-08 14:03:36,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-08 14:03:36,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-08 14:03:36,834 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-01-08 14:03:36,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:36,834 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-08 14:03:36,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:03:36,834 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-08 14:03:36,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-08 14:03:36,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-08 14:03:36,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:36,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:36,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:37,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:37,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:37,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:37,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:37,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:37,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:37,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:37,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:37,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:37,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:37,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:37,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:37,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:37,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:37,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:37,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:37,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:37,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:37,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:37,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:37,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:37,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:38,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:38,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:38,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:38,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:38,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:38,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:38,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:39,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:39,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:39,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:39,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:39,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:39,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:39,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:39,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:39,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:39,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:40,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:40,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:40,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:40,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:40,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:40,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:41,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:41,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:41,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:41,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:41,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:41,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:41,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:41,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:41,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:41,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:41,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:41,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:41,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:41,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:42,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:42,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:42,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:42,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:42,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:42,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:43,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:43,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:43,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:43,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:43,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:44,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:44,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:44,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:44,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:45,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:45,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:45,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:45,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:45,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:45,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:45,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:46,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:46,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:46,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:47,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:03:47,422 WARN L181 SmtUtils]: Spent 10.58 s on a formula simplification. DAG size of input: 1855 DAG size of output: 1101 [2019-01-08 14:04:02,103 WARN L181 SmtUtils]: Spent 14.67 s on a formula simplification. DAG size of input: 1000 DAG size of output: 85 [2019-01-08 14:04:02,106 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-08 14:04:02,107 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-08 14:04:02,107 INFO L448 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2019-01-08 14:04:02,107 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 43) no Hoare annotation was computed. [2019-01-08 14:04:02,107 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-08 14:04:02,107 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 44) no Hoare annotation was computed. [2019-01-08 14:04:02,107 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-08 14:04:02,107 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 48) no Hoare annotation was computed. [2019-01-08 14:04:02,107 INFO L448 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-01-08 14:04:02,108 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 46) no Hoare annotation was computed. [2019-01-08 14:04:02,108 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 45) no Hoare annotation was computed. [2019-01-08 14:04:02,123 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 02:04:02 BoogieIcfgContainer [2019-01-08 14:04:02,124 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-08 14:04:02,125 INFO L168 Benchmark]: Toolchain (without parser) took 92822.03 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-01-08 14:04:02,125 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 14:04:02,125 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 14:04:02,126 INFO L168 Benchmark]: Boogie Preprocessor took 26.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 14:04:02,126 INFO L168 Benchmark]: RCFGBuilder took 304.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-01-08 14:04:02,126 INFO L168 Benchmark]: TraceAbstraction took 92429.25 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-01-08 14:04:02,128 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 304.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 92429.25 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 45]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 46]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 43]: 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 - 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, 92.3s OverallTime, 57 OverallIterations, 2 TraceHistogramMax, 24.0s AutomataDifference, 0.0s DeadEndRemovalTime, 25.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 210 SDtfs, 857 SDslu, 1 SDs, 0 SdLazy, 8790 SolverSat, 608 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 875 GetRequests, 174 SyntacticMatches, 38 SemanticMatches, 663 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2487 ImplicationChecksByTransitivity, 22.7s 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.8s AutomataMinimizationTime, 57 MinimizatonAttempts, 1522 StatesRemovedByMinimization, 56 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 64 NumberOfFragments, 342 HoareAnnotationTreeSize, 1 FomulaSimplifications, 181006621 FormulaSimplificationTreeSizeReduction, 10.5s HoareSimplificationTime, 1 FomulaSimplificationsInter, 10044512 FormulaSimplificationTreeSizeReductionInter, 14.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 36.7s InterpolantComputationTime, 648 NumberOfCodeBlocks, 648 NumberOfCodeBlocksAsserted, 129 NumberOfCheckSat, 802 ConstructedInterpolants, 235 QuantifiedInterpolants, 90984 SizeOfPredicates, 162 NumberOfNonLiveVariables, 1237 ConjunctsInSsa, 390 ConjunctsInUnsatCore, 165 InterpolantComputations, 7 PerfectInterpolantSequences, 158/841 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...