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_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-18 10:06:49,798 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-18 10:06:49,800 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-18 10:06:49,816 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-18 10:06:49,816 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-18 10:06:49,818 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-18 10:06:49,820 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-18 10:06:49,822 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-18 10:06:49,825 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-18 10:06:49,826 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-18 10:06:49,827 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-18 10:06:49,827 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-18 10:06:49,828 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-18 10:06:49,829 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-18 10:06:49,830 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-18 10:06:49,831 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-18 10:06:49,832 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-18 10:06:49,834 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-18 10:06:49,836 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-18 10:06:49,837 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-18 10:06:49,838 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-18 10:06:49,840 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-18 10:06:49,842 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-18 10:06:49,842 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-18 10:06:49,842 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-18 10:06:49,843 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-18 10:06:49,844 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-18 10:06:49,845 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-18 10:06:49,846 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-18 10:06:49,847 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-18 10:06:49,847 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-18 10:06:49,848 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-18 10:06:49,848 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-18 10:06:49,848 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-18 10:06:49,849 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-18 10:06:49,850 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-18 10:06:49,850 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-18 10:06:49,875 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-18 10:06:49,875 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-18 10:06:49,877 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-18 10:06:49,877 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-18 10:06:49,877 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-18 10:06:49,877 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-18 10:06:49,877 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-18 10:06:49,878 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-18 10:06:49,878 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-18 10:06:49,879 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-18 10:06:49,879 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-18 10:06:49,879 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-18 10:06:49,879 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-18 10:06:49,880 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-18 10:06:49,880 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-18 10:06:49,880 INFO L133 SettingsManager]: * Use SBE=true [2019-02-18 10:06:49,880 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-18 10:06:49,881 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-18 10:06:49,881 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-18 10:06:49,881 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-18 10:06:49,881 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-18 10:06:49,881 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-18 10:06:49,882 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-18 10:06:49,882 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-18 10:06:49,882 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-18 10:06:49,882 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-18 10:06:49,882 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-18 10:06:49,883 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-18 10:06:49,883 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-18 10:06:49,883 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-18 10:06:49,883 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 10:06:49,883 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-18 10:06:49,884 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-18 10:06:49,886 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-18 10:06:49,887 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-18 10:06:49,887 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-18 10:06:49,887 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-02-18 10:06:49,887 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-18 10:06:49,887 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-18 10:06:49,924 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-18 10:06:49,935 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-18 10:06:49,939 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-18 10:06:49,940 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-18 10:06:49,941 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-18 10:06:49,941 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl [2019-02-18 10:06:49,942 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl' [2019-02-18 10:06:49,979 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-18 10:06:49,980 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-18 10:06:49,981 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-18 10:06:49,981 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-18 10:06:49,981 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-18 10:06:49,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:06:49" (1/1) ... [2019-02-18 10:06:50,009 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:06:49" (1/1) ... [2019-02-18 10:06:50,033 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-18 10:06:50,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-18 10:06:50,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-18 10:06:50,035 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-18 10:06:50,046 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:06:49" (1/1) ... [2019-02-18 10:06:50,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:06:49" (1/1) ... [2019-02-18 10:06:50,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:06:49" (1/1) ... [2019-02-18 10:06:50,051 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:06:49" (1/1) ... [2019-02-18 10:06:50,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:06:49" (1/1) ... [2019-02-18 10:06:50,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:06:49" (1/1) ... [2019-02-18 10:06:50,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:06:49" (1/1) ... [2019-02-18 10:06:50,068 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-18 10:06:50,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-18 10:06:50,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-18 10:06:50,069 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-18 10:06:50,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:06:49" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 10:06:50,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-18 10:06:50,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-18 10:06:50,531 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-18 10:06:50,531 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-02-18 10:06:50,532 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 10:06:50 BoogieIcfgContainer [2019-02-18 10:06:50,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-18 10:06:50,534 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-18 10:06:50,534 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-18 10:06:50,538 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-18 10:06:50,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:06:49" (1/2) ... [2019-02-18 10:06:50,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24be8267 and model type speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 10:06:50, skipping insertion in model container [2019-02-18 10:06:50,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 10:06:50" (2/2) ... [2019-02-18 10:06:50,542 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-unlimited.bpl [2019-02-18 10:06:50,550 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-18 10:06:50,557 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-02-18 10:06:50,569 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-02-18 10:06:50,599 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-18 10:06:50,599 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-18 10:06:50,599 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-18 10:06:50,600 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-18 10:06:50,600 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-18 10:06:50,600 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-18 10:06:50,600 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-18 10:06:50,600 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-18 10:06:50,612 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-02-18 10:06:50,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-18 10:06:50,627 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:06:50,629 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-18 10:06:50,632 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:06:50,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:50,640 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-02-18 10:06:50,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:06:50,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:50,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:50,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:50,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:06:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:50,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:50,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 10:06:50,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-18 10:06:50,851 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:06:50,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 10:06:50,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 10:06:50,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:06:50,881 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-02-18 10:06:51,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:06:51,080 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-02-18 10:06:51,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:06:51,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-18 10:06:51,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:06:51,095 INFO L225 Difference]: With dead ends: 21 [2019-02-18 10:06:51,095 INFO L226 Difference]: Without dead ends: 16 [2019-02-18 10:06:51,098 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-02-18 10:06:51,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-18 10:06:51,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-02-18 10:06:51,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-18 10:06:51,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-02-18 10:06:51,132 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-02-18 10:06:51,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:06:51,134 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-02-18 10:06:51,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 10:06:51,135 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-02-18 10:06:51,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 10:06:51,135 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:06:51,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 10:06:51,136 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:06:51,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:51,136 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-02-18 10:06:51,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:06:51,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:51,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:51,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:51,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:06:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:51,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:51,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:51,244 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:06:51,245 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 10:06:51,250 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-02-18 10:06:51,326 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:06:51,327 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:06:55,652 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:06:55,654 INFO L272 AbstractInterpreter]: Visited 3 different actions 11 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 10:06:55,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:55,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:06:55,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:55,666 INFO 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-02-18 10:06:55,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:55,693 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:06:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:55,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:06:55,941 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-02-18 10:06:55,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02-18 10:06:55,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-02-18 10:06:56,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:56,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:56,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-18 10:06:56,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:56,092 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:56,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:56,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-18 10:06:56,096 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:06:56,194 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:06:56,332 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:06:56,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:06:56,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:56,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:06:56,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:56,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:56,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:06:56,767 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2019-02-18 10:06:56,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:56,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:56,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:56,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:56,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:06:56,777 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:06:56,792 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:06:56,810 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:06:56,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:06:56,851 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-18 10:06:56,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:56,944 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-02-18 10:06:56,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:06:56,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:06:56,987 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-18 10:06:57,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:57,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:06:57,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:57,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:06:57,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 10:06:57,087 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:06:57,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 10:06:57,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 10:06:57,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 10:06:57,089 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 6 states. [2019-02-18 10:06:57,343 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-02-18 10:06:57,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:06:57,614 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2019-02-18 10:06:57,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 10:06:57,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-18 10:06:57,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:06:57,617 INFO L225 Difference]: With dead ends: 31 [2019-02-18 10:06:57,617 INFO L226 Difference]: Without dead ends: 28 [2019-02-18 10:06:57,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-18 10:06:57,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-18 10:06:57,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 13. [2019-02-18 10:06:57,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-18 10:06:57,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2019-02-18 10:06:57,623 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 25 transitions. Word has length 3 [2019-02-18 10:06:57,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:06:57,624 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 25 transitions. [2019-02-18 10:06:57,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 10:06:57,624 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 25 transitions. [2019-02-18 10:06:57,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 10:06:57,624 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:06:57,624 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 10:06:57,625 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:06:57,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:57,625 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-02-18 10:06:57,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:06:57,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:57,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:57,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:57,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:06:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:57,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:57,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 10:06:57,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-18 10:06:57,679 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:06:57,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 10:06:57,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 10:06:57,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:06:57,680 INFO L87 Difference]: Start difference. First operand 13 states and 25 transitions. Second operand 3 states. [2019-02-18 10:06:57,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:06:57,713 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2019-02-18 10:06:57,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:06:57,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-18 10:06:57,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:06:57,715 INFO L225 Difference]: With dead ends: 15 [2019-02-18 10:06:57,715 INFO L226 Difference]: Without dead ends: 14 [2019-02-18 10:06:57,715 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-02-18 10:06:57,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-18 10:06:57,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-02-18 10:06:57,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-18 10:06:57,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2019-02-18 10:06:57,719 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 3 [2019-02-18 10:06:57,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:06:57,719 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 24 transitions. [2019-02-18 10:06:57,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 10:06:57,719 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 24 transitions. [2019-02-18 10:06:57,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 10:06:57,720 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:06:57,720 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 10:06:57,720 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:06:57,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:57,720 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-02-18 10:06:57,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:06:57,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:57,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:57,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:57,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:06:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:57,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:57,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:57,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:06:57,772 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 10:06:57,772 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-02-18 10:06:57,776 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:06:57,776 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:06:58,118 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:06:58,119 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 10:06:58,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:58,119 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:06:58,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:58,120 INFO 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-02-18 10:06:58,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:58,136 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:06:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:58,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:06:58,264 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-02-18 10:06:58,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02-18 10:06:58,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-02-18 10:06:58,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:58,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:58,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-18 10:06:58,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-02-18 10:06:58,455 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:06:58,647 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:06:58,785 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:06:58,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:06:58,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:58,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-02-18 10:06:58,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:58,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:58,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-02-18 10:06:58,953 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-18 10:06:58,958 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:06:58,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:06:58,975 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:35, output treesize:33 [2019-02-18 10:06:59,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:59,001 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-02-18 10:06:59,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:06:59,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:06:59,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-02-18 10:06:59,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:59,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:06:59,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:59,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 10:06:59,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-18 10:06:59,091 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:06:59,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 10:06:59,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 10:06:59,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 10:06:59,093 INFO L87 Difference]: Start difference. First operand 13 states and 24 transitions. Second operand 4 states. [2019-02-18 10:06:59,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:06:59,234 INFO L93 Difference]: Finished difference Result 18 states and 41 transitions. [2019-02-18 10:06:59,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-18 10:06:59,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-18 10:06:59,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:06:59,235 INFO L225 Difference]: With dead ends: 18 [2019-02-18 10:06:59,235 INFO L226 Difference]: Without dead ends: 17 [2019-02-18 10:06:59,236 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-02-18 10:06:59,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-18 10:06:59,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-02-18 10:06:59,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-18 10:06:59,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2019-02-18 10:06:59,242 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 40 transitions. Word has length 3 [2019-02-18 10:06:59,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:06:59,242 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 40 transitions. [2019-02-18 10:06:59,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 10:06:59,242 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 40 transitions. [2019-02-18 10:06:59,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 10:06:59,243 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:06:59,243 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 10:06:59,243 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:06:59,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:59,244 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-02-18 10:06:59,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:06:59,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:59,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:59,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:59,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:06:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:59,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:59,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:59,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:06:59,306 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 10:06:59,306 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-02-18 10:06:59,309 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:06:59,309 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:06:59,537 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:06:59,538 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 10:06:59,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:59,538 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:06:59,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:59,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 10:06:59,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:59,555 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:06:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:59,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:06:59,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:59,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-02-18 10:06:59,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:59,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:59,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-02-18 10:06:59,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:06:59,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:06:59,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-02-18 10:06:59,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-02-18 10:06:59,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 10:06:59,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-02-18 10:06:59,756 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-18 10:06:59,806 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:06:59,815 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:06:59,825 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:06:59,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:06:59,838 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2019-02-18 10:06:59,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:06:59,869 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-02-18 10:06:59,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:06:59,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-02-18 10:06:59,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-02-18 10:06:59,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:59,896 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:06:59,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:59,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:06:59,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 10:06:59,932 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:06:59,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 10:06:59,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 10:06:59,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 10:06:59,933 INFO L87 Difference]: Start difference. First operand 16 states and 40 transitions. Second operand 6 states. [2019-02-18 10:07:00,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:00,064 INFO L93 Difference]: Finished difference Result 32 states and 62 transitions. [2019-02-18 10:07:00,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 10:07:00,064 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-18 10:07:00,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:00,065 INFO L225 Difference]: With dead ends: 32 [2019-02-18 10:07:00,066 INFO L226 Difference]: Without dead ends: 31 [2019-02-18 10:07:00,066 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-02-18 10:07:00,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-18 10:07:00,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2019-02-18 10:07:00,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-18 10:07:00,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2019-02-18 10:07:00,072 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 50 transitions. Word has length 3 [2019-02-18 10:07:00,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:00,073 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 50 transitions. [2019-02-18 10:07:00,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 10:07:00,073 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 50 transitions. [2019-02-18 10:07:00,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 10:07:00,073 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:00,074 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 10:07:00,074 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:00,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:00,074 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2019-02-18 10:07:00,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:00,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:00,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:00,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:00,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:00,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-02-18 10:07:00,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:00,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:00,183 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 10:07:00,184 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2019-02-18 10:07:00,186 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:00,186 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:02,000 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:02,001 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 10:07:02,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:02,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:02,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:02,001 INFO 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-02-18 10:07:02,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:02,010 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:02,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:02,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:02,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:02,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:02,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:02,094 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:02,241 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2019-02-18 10:07:02,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:02,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:02,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:02,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:02,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:07:02,250 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:02,262 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:02,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:02,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-02-18 10:07:02,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-02-18 10:07:02,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 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-02-18 10:07:02,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-02-18 10:07:02,302 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:02,349 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:02,356 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:02,362 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:02,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:02,392 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-18 10:07:02,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:02,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 10:07:02,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:02,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:02,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:02,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:02,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:02,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:02,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 10:07:02,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-18 10:07:02,473 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:07:02,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 10:07:02,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 10:07:02,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-18 10:07:02,474 INFO L87 Difference]: Start difference. First operand 18 states and 50 transitions. Second operand 4 states. [2019-02-18 10:07:02,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:02,509 INFO L93 Difference]: Finished difference Result 22 states and 58 transitions. [2019-02-18 10:07:02,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:07:02,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-18 10:07:02,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:02,510 INFO L225 Difference]: With dead ends: 22 [2019-02-18 10:07:02,510 INFO L226 Difference]: Without dead ends: 21 [2019-02-18 10:07:02,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-18 10:07:02,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-18 10:07:02,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-02-18 10:07:02,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-18 10:07:02,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2019-02-18 10:07:02,516 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 57 transitions. Word has length 4 [2019-02-18 10:07:02,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:02,516 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 57 transitions. [2019-02-18 10:07:02,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 10:07:02,517 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 57 transitions. [2019-02-18 10:07:02,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 10:07:02,517 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:02,517 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 10:07:02,518 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:02,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:02,518 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2019-02-18 10:07:02,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:02,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:02,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:02,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:02,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:02,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:02,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:02,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:02,580 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 10:07:02,580 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2019-02-18 10:07:02,581 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:02,582 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:03,192 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:03,192 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:07:03,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:03,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:03,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:03,193 INFO 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-02-18 10:07:03,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:03,209 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:03,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:03,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02-18 10:07:03,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-02-18 10:07:03,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:03,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:03,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-18 10:07:03,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:03,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:03,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:03,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 10:07:03,349 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:03,375 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:03,385 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:03,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:03,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:03,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:03,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:03,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:03,440 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:03,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:03,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:03,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:03,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:03,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:07:03,474 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:03,482 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:03,489 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:03,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:03,507 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 10:07:03,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:03,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 10:07:03,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:03,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:03,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:03,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:03,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:03,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:03,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:03,593 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:03,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 10:07:03,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:03,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:03,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:29 [2019-02-18 10:07:03,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:03,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:03,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:03,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:03,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 10:07:03,679 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:03,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:07:03,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:07:03,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:07:03,680 INFO L87 Difference]: Start difference. First operand 20 states and 57 transitions. Second operand 8 states. [2019-02-18 10:07:03,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:03,988 INFO L93 Difference]: Finished difference Result 37 states and 74 transitions. [2019-02-18 10:07:03,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 10:07:03,988 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 10:07:03,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:03,990 INFO L225 Difference]: With dead ends: 37 [2019-02-18 10:07:03,990 INFO L226 Difference]: Without dead ends: 36 [2019-02-18 10:07:03,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:07:03,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-18 10:07:03,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 17. [2019-02-18 10:07:03,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-18 10:07:03,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2019-02-18 10:07:03,996 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 41 transitions. Word has length 4 [2019-02-18 10:07:03,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:03,997 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 41 transitions. [2019-02-18 10:07:03,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:07:03,997 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 41 transitions. [2019-02-18 10:07:03,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 10:07:03,997 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:03,997 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 10:07:03,998 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:03,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:03,998 INFO L82 PathProgramCache]: Analyzing trace with hash 939350, now seen corresponding path program 1 times [2019-02-18 10:07:03,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:03,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:03,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:03,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:03,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:04,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:04,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:04,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:04,082 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 10:07:04,082 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2019-02-18 10:07:04,083 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:04,084 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:04,680 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:04,680 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:07:04,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:04,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:04,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:04,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 10:07:04,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:04,690 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:04,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:04,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:04,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:04,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:04,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:04,769 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:04,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:04,813 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:04,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:04,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:04,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:07:04,847 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:04,862 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:04,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:04,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-02-18 10:07:04,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-02-18 10:07:04,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 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-02-18 10:07:04,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-18 10:07:04,892 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:04,916 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:04,926 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:04,934 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:04,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:04,967 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 10:07:05,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:05,014 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-02-18 10:07:05,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:05,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:05,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:05,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:05,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:05,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:05,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:05,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:05,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:05,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-02-18 10:07:05,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:05,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:05,132 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-18 10:07:05,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:05,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:05,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:05,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:05,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 10:07:05,226 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:05,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:07:05,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:07:05,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:07:05,227 INFO L87 Difference]: Start difference. First operand 17 states and 41 transitions. Second operand 8 states. [2019-02-18 10:07:05,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:05,603 INFO L93 Difference]: Finished difference Result 46 states and 87 transitions. [2019-02-18 10:07:05,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 10:07:05,604 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 10:07:05,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:05,605 INFO L225 Difference]: With dead ends: 46 [2019-02-18 10:07:05,606 INFO L226 Difference]: Without dead ends: 40 [2019-02-18 10:07:05,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-02-18 10:07:05,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-18 10:07:05,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 22. [2019-02-18 10:07:05,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-18 10:07:05,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2019-02-18 10:07:05,633 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 58 transitions. Word has length 4 [2019-02-18 10:07:05,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:05,634 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 58 transitions. [2019-02-18 10:07:05,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:07:05,634 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 58 transitions. [2019-02-18 10:07:05,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 10:07:05,638 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:05,638 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 10:07:05,638 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:05,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:05,639 INFO L82 PathProgramCache]: Analyzing trace with hash 929802, now seen corresponding path program 1 times [2019-02-18 10:07:05,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:05,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:05,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:05,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:05,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:05,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:05,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:05,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:05,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:05,779 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 10:07:05,780 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2019-02-18 10:07:05,783 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:05,783 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:06,359 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:06,360 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:07:06,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:06,360 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:06,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:06,360 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 10:07:06,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:06,368 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:06,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:06,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02-18 10:07:06,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-02-18 10:07:06,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:06,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:06,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-18 10:07:06,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:06,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:06,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:06,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-18 10:07:06,429 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:06,458 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:06,469 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:06,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:06,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:06,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:06,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:06,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:06,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:06,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:06,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:06,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:06,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:06,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:07:06,564 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:06,573 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:06,582 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:06,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:06,601 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-18 10:07:06,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:06,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 10:07:06,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:06,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:06,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:06,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:06,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:06,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:06,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:06,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:06,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:06,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-18 10:07:06,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:06,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:06,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-18 10:07:06,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:06,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:06,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:06,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:06,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 10:07:06,775 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:06,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:07:06,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:07:06,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-18 10:07:06,776 INFO L87 Difference]: Start difference. First operand 22 states and 58 transitions. Second operand 8 states. [2019-02-18 10:07:06,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:06,983 INFO L93 Difference]: Finished difference Result 52 states and 124 transitions. [2019-02-18 10:07:06,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 10:07:06,984 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 10:07:06,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:06,986 INFO L225 Difference]: With dead ends: 52 [2019-02-18 10:07:06,986 INFO L226 Difference]: Without dead ends: 49 [2019-02-18 10:07:06,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-18 10:07:06,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-18 10:07:06,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 26. [2019-02-18 10:07:06,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-18 10:07:06,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 78 transitions. [2019-02-18 10:07:06,995 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 78 transitions. Word has length 4 [2019-02-18 10:07:06,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:06,995 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 78 transitions. [2019-02-18 10:07:06,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:07:06,995 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 78 transitions. [2019-02-18 10:07:06,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 10:07:06,996 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:06,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 10:07:06,996 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:06,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:06,997 INFO L82 PathProgramCache]: Analyzing trace with hash 929928, now seen corresponding path program 1 times [2019-02-18 10:07:06,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:06,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:06,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:06,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:06,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:07,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:07,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:07,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:07,056 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 10:07:07,056 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [21] [2019-02-18 10:07:07,057 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:07,057 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:07,254 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:07,255 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 10:07:07,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:07,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:07,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:07,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 10:07:07,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:07,275 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:07,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:07,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:07,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-02-18 10:07:07,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:07,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:07,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-02-18 10:07:07,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:07,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:07,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-02-18 10:07:07,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-02-18 10:07:07,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-18 10:07:07,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-18 10:07:07,446 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:07,456 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:07,465 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:07,471 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:07,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:07,483 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2019-02-18 10:07:07,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07: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 26 treesize of output 28 [2019-02-18 10:07:07,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:07,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:07,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-02-18 10:07:07,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:07,535 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:07,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:07,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:07,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 10:07:07,592 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:07,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 10:07:07,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 10:07:07,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 10:07:07,593 INFO L87 Difference]: Start difference. First operand 26 states and 78 transitions. Second operand 6 states. [2019-02-18 10:07:07,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:07,832 INFO L93 Difference]: Finished difference Result 36 states and 91 transitions. [2019-02-18 10:07:07,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 10:07:07,832 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-18 10:07:07,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:07,834 INFO L225 Difference]: With dead ends: 36 [2019-02-18 10:07:07,834 INFO L226 Difference]: Without dead ends: 35 [2019-02-18 10:07:07,835 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-02-18 10:07:07,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-18 10:07:07,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2019-02-18 10:07:07,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-18 10:07:07,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 84 transitions. [2019-02-18 10:07:07,842 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 84 transitions. Word has length 4 [2019-02-18 10:07:07,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:07,843 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 84 transitions. [2019-02-18 10:07:07,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 10:07:07,843 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 84 transitions. [2019-02-18 10:07:07,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 10:07:07,843 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:07,844 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 10:07:07,844 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:07,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:07,844 INFO L82 PathProgramCache]: Analyzing trace with hash 933584, now seen corresponding path program 1 times [2019-02-18 10:07:07,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:07,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:07,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:07,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:07,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:07,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:07,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:07,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:07,911 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 10:07:07,911 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [19] [2019-02-18 10:07:07,912 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:07,912 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:08,135 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:08,135 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:07:08,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:08,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:08,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:08,136 INFO 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-02-18 10:07:08,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:08,145 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:08,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:08,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02-18 10:07:08,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 10:07:08,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:08,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:08,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 10:07:08,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:08,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:08,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:08,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 10:07:08,214 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:08,240 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:08,256 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:08,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:08,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:08,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:08,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:08,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:08,325 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:08,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:08,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:08,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:08,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:08,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:07:08,376 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:08,384 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:08,394 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:08,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:08,414 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 10:07:08,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:08,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, 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-02-18 10:07:08,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:08,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:08,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:08,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:08,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:08,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:08,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:08,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:08,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:08,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-02-18 10:07:08,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:08,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:08,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-18 10:07:08,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:08,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:08,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:08,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:08,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 10:07:08,580 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:08,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:07:08,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:07:08,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:07:08,582 INFO L87 Difference]: Start difference. First operand 28 states and 84 transitions. Second operand 8 states. [2019-02-18 10:07:08,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:08,883 INFO L93 Difference]: Finished difference Result 52 states and 123 transitions. [2019-02-18 10:07:08,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 10:07:08,883 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 10:07:08,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:08,885 INFO L225 Difference]: With dead ends: 52 [2019-02-18 10:07:08,885 INFO L226 Difference]: Without dead ends: 50 [2019-02-18 10:07:08,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:07:08,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-18 10:07:08,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 31. [2019-02-18 10:07:08,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-18 10:07:08,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 99 transitions. [2019-02-18 10:07:08,895 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 99 transitions. Word has length 4 [2019-02-18 10:07:08,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:08,896 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 99 transitions. [2019-02-18 10:07:08,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:07:08,896 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 99 transitions. [2019-02-18 10:07:08,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 10:07:08,897 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:08,897 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 10:07:08,897 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:08,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:08,897 INFO L82 PathProgramCache]: Analyzing trace with hash 937616, now seen corresponding path program 1 times [2019-02-18 10:07:08,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:08,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:08,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:08,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:08,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:08,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:08,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:08,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:08,937 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 10:07:08,937 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [21] [2019-02-18 10:07:08,937 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:08,938 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:09,130 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:09,130 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 10:07:09,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:09,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:09,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:09,130 INFO 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-02-18 10:07:09,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:09,140 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:09,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:09,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 10:07:09,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, 0 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-02-18 10:07:09,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:09,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:09,173 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-02-18 10:07:09,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:09,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:09,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:09,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-02-18 10:07:09,191 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:09,211 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:09,245 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:09,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:09,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-18 10:07:09,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:09,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:09,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-18 10:07:09,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:09,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:09,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:09,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:09,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 10:07:09,318 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:09,325 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:09,333 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:09,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:09,351 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:41, output treesize:41 [2019-02-18 10:07:09,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:09,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2019-02-18 10:07:09,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:09,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:09,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:29 [2019-02-18 10:07:09,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:09,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:09,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:09,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:09,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 10:07:09,532 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:09,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 10:07:09,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 10:07:09,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 10:07:09,532 INFO L87 Difference]: Start difference. First operand 31 states and 99 transitions. Second operand 6 states. [2019-02-18 10:07:09,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:09,649 INFO L93 Difference]: Finished difference Result 39 states and 105 transitions. [2019-02-18 10:07:09,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 10:07:09,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-18 10:07:09,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:09,650 INFO L225 Difference]: With dead ends: 39 [2019-02-18 10:07:09,651 INFO L226 Difference]: Without dead ends: 38 [2019-02-18 10:07:09,651 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-02-18 10:07:09,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-18 10:07:09,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2019-02-18 10:07:09,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-18 10:07:09,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2019-02-18 10:07:09,661 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 4 [2019-02-18 10:07:09,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:09,661 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2019-02-18 10:07:09,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 10:07:09,661 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2019-02-18 10:07:09,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:07:09,662 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:09,662 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-18 10:07:09,662 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:09,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:09,662 INFO L82 PathProgramCache]: Analyzing trace with hash 29121388, now seen corresponding path program 2 times [2019-02-18 10:07:09,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:09,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:09,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:09,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:09,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:09,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:07:09,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:09,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:09,750 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:07:09,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:07:09,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:09,750 INFO 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-02-18 10:07:09,759 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:07:09,759 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:07:09,765 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 10:07:09,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:07:09,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:09,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:09,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:09,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:09,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:09,813 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:09,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:09,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:09,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:09,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:09,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:07:09,845 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:09,853 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:09,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:09,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-02-18 10:07:09,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-02-18 10:07:09,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 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-02-18 10:07:09,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-02-18 10:07:09,907 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:09,922 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:09,929 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:09,937 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:09,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:09,956 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-18 10:07:09,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:09,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, 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-02-18 10:07:09,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:09,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:09,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:10,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-02-18 10:07:10,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:10,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:10,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:33 [2019-02-18 10:07:10,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-02-18 10:07:10,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:10,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:10,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-18 10:07:10,090 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:10,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:10,126 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:10,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:10,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-18 10:07:10,146 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:10,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 10:07:10,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 10:07:10,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:07:10,147 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 9 states. [2019-02-18 10:07:10,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:10,486 INFO L93 Difference]: Finished difference Result 65 states and 148 transitions. [2019-02-18 10:07:10,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 10:07:10,492 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-02-18 10:07:10,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:10,493 INFO L225 Difference]: With dead ends: 65 [2019-02-18 10:07:10,493 INFO L226 Difference]: Without dead ends: 60 [2019-02-18 10:07:10,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-18 10:07:10,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-02-18 10:07:10,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 32. [2019-02-18 10:07:10,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-18 10:07:10,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 106 transitions. [2019-02-18 10:07:10,503 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 106 transitions. Word has length 5 [2019-02-18 10:07:10,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:10,504 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 106 transitions. [2019-02-18 10:07:10,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 10:07:10,504 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 106 transitions. [2019-02-18 10:07:10,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:07:10,504 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:10,505 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-18 10:07:10,505 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:10,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:10,505 INFO L82 PathProgramCache]: Analyzing trace with hash 29121636, now seen corresponding path program 2 times [2019-02-18 10:07:10,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:10,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:10,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:07:10,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:10,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:10,624 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:07:10,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:10,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:10,624 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:07:10,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:07:10,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:10,625 INFO 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-02-18 10:07:10,634 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:07:10,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:07:10,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 10:07:10,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:07:10,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:10,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02-18 10:07:10,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-02-18 10:07:10,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-18 10:07:10,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-18 10:07:10,677 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:10,695 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:10,706 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:10,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:10,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:10,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,778 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:10,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:07:10,811 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:10,825 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:10,833 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:10,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:10,853 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 10:07:10,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 10:07:10,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:10,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:10,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:10,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-02-18 10:07:10,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:10,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:10,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-02-18 10:07:10,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:10,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-02-18 10:07:10,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:10,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:10,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-18 10:07:11,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:11,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:11,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:11,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:11,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-02-18 10:07:11,078 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:11,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 10:07:11,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 10:07:11,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-02-18 10:07:11,079 INFO L87 Difference]: Start difference. First operand 32 states and 106 transitions. Second operand 9 states. [2019-02-18 10:07:11,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:11,524 INFO L93 Difference]: Finished difference Result 53 states and 146 transitions. [2019-02-18 10:07:11,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 10:07:11,524 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-02-18 10:07:11,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:11,526 INFO L225 Difference]: With dead ends: 53 [2019-02-18 10:07:11,526 INFO L226 Difference]: Without dead ends: 51 [2019-02-18 10:07:11,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:07:11,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-18 10:07:11,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2019-02-18 10:07:11,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-18 10:07:11,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 106 transitions. [2019-02-18 10:07:11,538 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 106 transitions. Word has length 5 [2019-02-18 10:07:11,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:11,538 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 106 transitions. [2019-02-18 10:07:11,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 10:07:11,538 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 106 transitions. [2019-02-18 10:07:11,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:07:11,539 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:11,539 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 10:07:11,539 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:11,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:11,540 INFO L82 PathProgramCache]: Analyzing trace with hash 29112214, now seen corresponding path program 1 times [2019-02-18 10:07:11,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:11,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:11,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:07:11,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:11,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:11,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:11,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:11,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:11,609 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 10:07:11,609 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [21] [2019-02-18 10:07:11,610 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:11,610 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:12,461 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:12,462 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:07:12,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:12,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:12,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:12,462 INFO 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-02-18 10:07:12,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:12,471 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:12,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:12,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:12,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:12,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:12,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:12,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:12,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:12,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:12,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:12,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:12,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:07:12,587 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:12,597 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:12,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:12,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-02-18 10:07:12,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-02-18 10:07:12,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 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-02-18 10:07:12,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-18 10:07:12,629 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:12,643 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:12,652 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:12,658 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:12,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:12,676 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 10:07:12,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:12,705 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-02-18 10:07:12,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:12,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:12,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:12,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:12,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:12,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:12,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:12,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:12,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:12,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-02-18 10:07:12,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:12,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:12,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-18 10:07:12,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:12,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:12,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:12,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:12,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 10:07:12,835 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:12,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:07:12,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:07:12,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:07:12,836 INFO L87 Difference]: Start difference. First operand 32 states and 106 transitions. Second operand 8 states. [2019-02-18 10:07:13,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:13,067 INFO L93 Difference]: Finished difference Result 54 states and 147 transitions. [2019-02-18 10:07:13,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 10:07:13,067 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 10:07:13,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:13,068 INFO L225 Difference]: With dead ends: 54 [2019-02-18 10:07:13,068 INFO L226 Difference]: Without dead ends: 53 [2019-02-18 10:07:13,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:07:13,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-18 10:07:13,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2019-02-18 10:07:13,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-18 10:07:13,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 122 transitions. [2019-02-18 10:07:13,080 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 122 transitions. Word has length 5 [2019-02-18 10:07:13,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:13,081 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 122 transitions. [2019-02-18 10:07:13,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:07:13,081 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 122 transitions. [2019-02-18 10:07:13,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:07:13,081 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:13,081 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 10:07:13,082 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:13,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:13,082 INFO L82 PathProgramCache]: Analyzing trace with hash 29115622, now seen corresponding path program 1 times [2019-02-18 10:07:13,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:13,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:13,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:13,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:13,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:13,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:13,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:13,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:13,235 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 10:07:13,236 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [19] [2019-02-18 10:07:13,238 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:13,238 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:14,079 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:14,079 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:07:14,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:14,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:14,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:14,080 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 10:07:14,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:14,089 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:14,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:14,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02-18 10:07:14,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-18 10:07:14,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:14,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:14,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-18 10:07:14,139 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-02-18 10:07:14,140 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:14,159 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:14,168 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:14,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:14,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:14,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-02-18 10:07:14,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:14,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:14,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-02-18 10:07:14,219 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:14,224 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:14,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:14,235 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2019-02-18 10:07:14,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:14,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 10:07:14,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-18 10:07:14,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2019-02-18 10:07:14,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:124 [2019-02-18 10:07:14,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:14,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:14,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:14,446 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:14,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:07:14,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:14,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:14,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:14,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:14,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:14,499 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:14,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 45 [2019-02-18 10:07:14,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:14,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:14,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:14,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:14,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:14,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:14,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 32 treesize of output 44 [2019-02-18 10:07:14,546 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:14,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2019-02-18 10:07:14,581 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:113, output treesize:61 [2019-02-18 10:07:14,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:14,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:14,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:14,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:14,621 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:14,622 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 34 treesize of output 44 [2019-02-18 10:07:14,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:14,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:14,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:14,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:14,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:14,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:14,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 34 treesize of output 44 [2019-02-18 10:07:14,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:14,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:14,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:14,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:14,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:14,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:14,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 54 [2019-02-18 10:07:14,714 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:14,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2019-02-18 10:07:14,750 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:101, output treesize:65 [2019-02-18 10:07:14,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:14,788 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:14,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:14,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:14,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2019-02-18 10:07:14,820 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:14,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 10:07:14,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 10:07:14,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:07:14,821 INFO L87 Difference]: Start difference. First operand 35 states and 122 transitions. Second operand 10 states. [2019-02-18 10:07:15,039 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 36 [2019-02-18 10:07:15,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:15,622 INFO L93 Difference]: Finished difference Result 81 states and 236 transitions. [2019-02-18 10:07:15,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-18 10:07:15,623 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-18 10:07:15,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:15,624 INFO L225 Difference]: With dead ends: 81 [2019-02-18 10:07:15,624 INFO L226 Difference]: Without dead ends: 80 [2019-02-18 10:07:15,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-02-18 10:07:15,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-18 10:07:15,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 40. [2019-02-18 10:07:15,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-18 10:07:15,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 148 transitions. [2019-02-18 10:07:15,638 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 148 transitions. Word has length 5 [2019-02-18 10:07:15,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:15,639 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 148 transitions. [2019-02-18 10:07:15,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 10:07:15,639 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 148 transitions. [2019-02-18 10:07:15,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:07:15,639 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:15,640 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 10:07:15,640 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:15,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:15,640 INFO L82 PathProgramCache]: Analyzing trace with hash 29115870, now seen corresponding path program 1 times [2019-02-18 10:07:15,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:15,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:15,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:15,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:15,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:15,740 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:15,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:15,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:15,740 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 10:07:15,740 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [19] [2019-02-18 10:07:15,743 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:15,744 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:16,539 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:16,539 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:07:16,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:16,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:16,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:16,539 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 10:07:16,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:16,548 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:16,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:16,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02-18 10:07:16,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 10:07:16,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:16,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:16,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 10:07:16,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:16,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:16,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:16,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-18 10:07:16,588 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:16,612 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:16,624 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:16,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:16,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:16,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:16,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:16,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:16,681 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:16,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:16,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:16,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:16,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:16,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:07:16,712 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:16,722 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:16,730 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:16,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:16,749 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-18 10:07:16,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:16,791 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-02-18 10:07:16,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:16,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:16,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:16,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:16,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:16,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:16,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:16,843 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:16,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-02-18 10:07:16,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:16,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:16,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:29 [2019-02-18 10:07:16,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:16,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:16,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:16,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:17,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:17,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:17,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:17,057 INFO L303 Elim1Store]: Index analysis took 179 ms [2019-02-18 10:07:17,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-02-18 10:07:17,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:17,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:17,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-02-18 10:07:17,607 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-02-18 10:07:17,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:17,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:18,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:18,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:18,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 10:07:18,294 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:18,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 10:07:18,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 10:07:18,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-18 10:07:18,296 INFO L87 Difference]: Start difference. First operand 40 states and 148 transitions. Second operand 10 states. [2019-02-18 10:07:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:18,732 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2019-02-18 10:07:18,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 10:07:18,733 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-18 10:07:18,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:18,734 INFO L225 Difference]: With dead ends: 66 [2019-02-18 10:07:18,735 INFO L226 Difference]: Without dead ends: 64 [2019-02-18 10:07:18,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-18 10:07:18,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-02-18 10:07:18,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 41. [2019-02-18 10:07:18,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-18 10:07:18,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-02-18 10:07:18,752 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-02-18 10:07:18,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:18,753 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-02-18 10:07:18,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 10:07:18,753 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-02-18 10:07:18,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:07:18,753 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:18,753 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 10:07:18,754 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:18,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:18,754 INFO L82 PathProgramCache]: Analyzing trace with hash 29119902, now seen corresponding path program 1 times [2019-02-18 10:07:18,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:18,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:18,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:18,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:18,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:18,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:18,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:18,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:18,845 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 10:07:18,845 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [21] [2019-02-18 10:07:18,847 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:18,847 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:19,532 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:19,532 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:07:19,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:19,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:19,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:19,533 INFO 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-02-18 10:07:19,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:19,545 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:19,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:19,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-18 10:07:19,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:19,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:19,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-18 10:07:19,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:19,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:19,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:19,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:19,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 10:07:19,629 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:19,644 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:19,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:19,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-02-18 10:07:19,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-02-18 10:07:19,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-02-18 10:07:19,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-02-18 10:07:19,943 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:20,174 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:20,202 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:20,209 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:20,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:20,226 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-02-18 10:07:20,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:20,252 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-02-18 10:07:20,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:20,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:20,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-18 10:07:20,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:20,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:20,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:20,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:20,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:20,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-18 10:07:20,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:20,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:20,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-02-18 10:07:20,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:20,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:20,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:20,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:20,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 10:07:20,410 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:20,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:07:20,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:07:20,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-18 10:07:20,410 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 8 states. [2019-02-18 10:07:20,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:20,622 INFO L93 Difference]: Finished difference Result 62 states and 176 transitions. [2019-02-18 10:07:20,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 10:07:20,622 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 10:07:20,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:20,623 INFO L225 Difference]: With dead ends: 62 [2019-02-18 10:07:20,623 INFO L226 Difference]: Without dead ends: 61 [2019-02-18 10:07:20,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:07:20,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-18 10:07:20,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2019-02-18 10:07:20,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-18 10:07:20,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 137 transitions. [2019-02-18 10:07:20,640 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 137 transitions. Word has length 5 [2019-02-18 10:07:20,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:20,640 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 137 transitions. [2019-02-18 10:07:20,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:07:20,640 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 137 transitions. [2019-02-18 10:07:20,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:07:20,641 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:20,641 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 10:07:20,641 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:20,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:20,641 INFO L82 PathProgramCache]: Analyzing trace with hash 28827822, now seen corresponding path program 1 times [2019-02-18 10:07:20,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:20,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:20,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:20,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:20,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:20,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:07:20,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 10:07:20,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-18 10:07:20,695 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:07:20,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 10:07:20,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 10:07:20,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-18 10:07:20,696 INFO L87 Difference]: Start difference. First operand 38 states and 137 transitions. Second operand 4 states. [2019-02-18 10:07:20,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:20,756 INFO L93 Difference]: Finished difference Result 51 states and 158 transitions. [2019-02-18 10:07:20,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-18 10:07:20,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-18 10:07:20,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:20,757 INFO L225 Difference]: With dead ends: 51 [2019-02-18 10:07:20,757 INFO L226 Difference]: Without dead ends: 46 [2019-02-18 10:07:20,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-18 10:07:20,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-02-18 10:07:20,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2019-02-18 10:07:20,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-18 10:07:20,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 145 transitions. [2019-02-18 10:07:20,771 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 145 transitions. Word has length 5 [2019-02-18 10:07:20,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:20,772 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 145 transitions. [2019-02-18 10:07:20,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 10:07:20,772 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 145 transitions. [2019-02-18 10:07:20,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:07:20,772 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:20,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 10:07:20,773 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:20,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:20,773 INFO L82 PathProgramCache]: Analyzing trace with hash 28818022, now seen corresponding path program 2 times [2019-02-18 10:07:20,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:20,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:20,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:20,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:20,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:21,014 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2019-02-18 10:07:21,052 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:21,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:21,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:21,052 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:07:21,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:07:21,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:21,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 10:07:21,064 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:07:21,064 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:07:21,068 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 10:07:21,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:07:21,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:21,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02-18 10:07:21,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-02-18 10:07:21,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:21,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:21,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-18 10:07:21,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:21,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:21,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:21,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 10:07:21,114 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:21,128 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:21,138 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:21,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:21,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:21,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:21,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:21,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:21,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:21,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:21,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:21,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:21,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:21,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:07:21,225 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:21,234 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:21,243 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:21,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:21,262 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 10:07:21,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:21,288 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-02-18 10:07:21,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:21,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:21,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:21,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:21,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:21,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:21,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:21,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:21,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:21,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-02-18 10:07:21,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:21,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:21,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-02-18 10:07:21,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:21,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:21,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:21,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:21,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:21,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:21,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:21,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:21,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:21,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:21,385 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:21,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 10:07:21,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:21,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:21,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-18 10:07:21,426 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:21,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:21,453 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:21,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:21,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 10:07:21,472 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:21,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 10:07:21,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 10:07:21,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:07:21,473 INFO L87 Difference]: Start difference. First operand 39 states and 145 transitions. Second operand 10 states. [2019-02-18 10:07:22,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:22,196 INFO L93 Difference]: Finished difference Result 90 states and 270 transitions. [2019-02-18 10:07:22,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 10:07:22,197 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-18 10:07:22,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:22,198 INFO L225 Difference]: With dead ends: 90 [2019-02-18 10:07:22,199 INFO L226 Difference]: Without dead ends: 87 [2019-02-18 10:07:22,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-02-18 10:07:22,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-18 10:07:22,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 47. [2019-02-18 10:07:22,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-18 10:07:22,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 178 transitions. [2019-02-18 10:07:22,220 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 178 transitions. Word has length 5 [2019-02-18 10:07:22,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:22,220 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 178 transitions. [2019-02-18 10:07:22,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 10:07:22,220 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 178 transitions. [2019-02-18 10:07:22,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:07:22,220 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:22,221 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 10:07:22,221 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:22,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:22,221 INFO L82 PathProgramCache]: Analyzing trace with hash 28818148, now seen corresponding path program 1 times [2019-02-18 10:07:22,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:22,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:22,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:07:22,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:22,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:22,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:22,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:22,270 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:22,271 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 10:07:22,271 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [21] [2019-02-18 10:07:22,272 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:22,272 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:22,596 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:22,596 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:07:22,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:22,596 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:22,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:22,597 INFO 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-02-18 10:07:22,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:22,618 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:22,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:22,795 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-02-18 10:07:22,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02-18 10:07:22,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-02-18 10:07:22,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:22,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:22,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-18 10:07:22,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:22,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:22,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:22,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-18 10:07:22,946 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:23,015 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:23,025 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:23,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:23,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:23,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:23,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:23,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:23,110 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:23,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:23,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:23,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:23,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:23,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:07:23,143 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:23,153 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:23,161 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:23,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:23,180 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-18 10:07:23,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:23,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 10:07:23,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:23,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:23,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:23,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:23,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:23,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:23,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:23,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:23,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:23,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-02-18 10:07:23,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:23,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:23,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-18 10:07:23,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:23,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:23,441 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:23,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:23,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 10:07:23,460 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:23,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:07:23,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:07:23,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-18 10:07:23,461 INFO L87 Difference]: Start difference. First operand 47 states and 178 transitions. Second operand 8 states. [2019-02-18 10:07:23,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:23,615 INFO L93 Difference]: Finished difference Result 66 states and 232 transitions. [2019-02-18 10:07:23,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 10:07:23,615 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 10:07:23,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:23,616 INFO L225 Difference]: With dead ends: 66 [2019-02-18 10:07:23,617 INFO L226 Difference]: Without dead ends: 65 [2019-02-18 10:07:23,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 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-02-18 10:07:23,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-18 10:07:23,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2019-02-18 10:07:23,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-18 10:07:23,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 209 transitions. [2019-02-18 10:07:23,640 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 209 transitions. Word has length 5 [2019-02-18 10:07:23,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:23,641 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 209 transitions. [2019-02-18 10:07:23,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:07:23,641 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 209 transitions. [2019-02-18 10:07:23,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:07:23,641 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:23,641 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 10:07:23,641 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:23,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:23,642 INFO L82 PathProgramCache]: Analyzing trace with hash 28821992, now seen corresponding path program 1 times [2019-02-18 10:07:23,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:23,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:23,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:23,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:23,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:23,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:07:23,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:23,695 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:23,695 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 10:07:23,695 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [21] [2019-02-18 10:07:23,696 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:23,696 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:23,898 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:23,898 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:07:23,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:23,898 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:23,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:23,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 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-02-18 10:07:23,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:23,907 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:23,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:23,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:23,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:23,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:23,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:23,978 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:24,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:24,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:24,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:24,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:24,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:07:24,009 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:24,019 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:24,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:24,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-02-18 10:07:24,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-02-18 10:07:24,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 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-02-18 10:07:24,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 10:07:24,050 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:24,063 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:24,072 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:24,080 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:24,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:24,098 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 10:07:24,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:24,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 10:07:24,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:24,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:24,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:24,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:24,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:24,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:24,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:24,376 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:24,377 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 53 [2019-02-18 10:07:24,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:24,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:24,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-02-18 10:07:24,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:24,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:24,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:24,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:24,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-18 10:07:24,452 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:24,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-18 10:07:24,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-18 10:07:24,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-02-18 10:07:24,452 INFO L87 Difference]: Start difference. First operand 53 states and 209 transitions. Second operand 7 states. [2019-02-18 10:07:24,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:24,671 INFO L93 Difference]: Finished difference Result 63 states and 221 transitions. [2019-02-18 10:07:24,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 10:07:24,674 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-02-18 10:07:24,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:24,675 INFO L225 Difference]: With dead ends: 63 [2019-02-18 10:07:24,675 INFO L226 Difference]: Without dead ends: 62 [2019-02-18 10:07:24,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-02-18 10:07:24,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-02-18 10:07:24,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2019-02-18 10:07:24,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-18 10:07:24,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 207 transitions. [2019-02-18 10:07:24,692 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 207 transitions. Word has length 5 [2019-02-18 10:07:24,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:24,692 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 207 transitions. [2019-02-18 10:07:24,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-18 10:07:24,693 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 207 transitions. [2019-02-18 10:07:24,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:07:24,693 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:24,693 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 10:07:24,693 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:24,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:24,694 INFO L82 PathProgramCache]: Analyzing trace with hash 28933468, now seen corresponding path program 2 times [2019-02-18 10:07:24,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:24,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:24,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:24,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:24,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:24,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:24,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:24,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:24,749 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:07:24,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:07:24,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:24,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 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-02-18 10:07:24,758 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:07:24,758 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:07:24,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-18 10:07:24,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:07:24,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:24,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02-18 10:07:24,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-18 10:07:24,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:24,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:24,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 10:07:24,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:24,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:24,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:24,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 10:07:24,798 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:24,814 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:24,824 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:24,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:24,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:24,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:24,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:24,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:24,879 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:24,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:24,907 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:24,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:24,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:24,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:07:24,910 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:24,918 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:24,927 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:24,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:24,961 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-18 10:07:24,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:24,978 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-02-18 10:07:24,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:24,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:24,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:25,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 10:07:25,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:25,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:25,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-18 10:07:25,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:25,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:25,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:25,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:25,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 10:07:25,089 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:25,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:07:25,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:07:25,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:07:25,089 INFO L87 Difference]: Start difference. First operand 52 states and 207 transitions. Second operand 8 states. [2019-02-18 10:07:25,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:25,279 INFO L93 Difference]: Finished difference Result 86 states and 292 transitions. [2019-02-18 10:07:25,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 10:07:25,279 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 10:07:25,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:25,280 INFO L225 Difference]: With dead ends: 86 [2019-02-18 10:07:25,280 INFO L226 Difference]: Without dead ends: 85 [2019-02-18 10:07:25,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-18 10:07:25,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-18 10:07:25,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 61. [2019-02-18 10:07:25,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-18 10:07:25,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 254 transitions. [2019-02-18 10:07:25,304 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 254 transitions. Word has length 5 [2019-02-18 10:07:25,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:25,304 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 254 transitions. [2019-02-18 10:07:25,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:07:25,304 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 254 transitions. [2019-02-18 10:07:25,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 10:07:25,305 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:25,305 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-02-18 10:07:25,305 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:25,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:25,305 INFO L82 PathProgramCache]: Analyzing trace with hash 902762954, now seen corresponding path program 3 times [2019-02-18 10:07:25,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:25,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:25,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:07:25,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:25,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:25,394 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 10:07:25,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:25,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:25,395 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:07:25,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:07:25,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:25,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 10:07:25,405 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:07:25,405 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:07:25,409 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:07:25,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:07:25,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:25,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:25,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,456 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:25,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:07:25,486 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:25,496 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:25,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:25,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-02-18 10:07:25,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-02-18 10:07:25,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 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-02-18 10:07:25,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-18 10:07:25,526 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:25,540 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:25,549 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:25,556 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:25,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:25,574 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-18 10:07:25,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,593 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-02-18 10:07:25,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:25,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:25,611 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:25,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-02-18 10:07:25,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:25,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:25,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-02-18 10:07:25,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 10:07:25,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:25,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:25,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 10:07:25,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,716 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:25,720 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-02-18 10:07:25,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:25,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:25,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-18 10:07:25,761 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:25,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:25,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:25,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:25,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-02-18 10:07:25,822 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:25,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 10:07:25,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 10:07:25,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-02-18 10:07:25,823 INFO L87 Difference]: Start difference. First operand 61 states and 254 transitions. Second operand 10 states. [2019-02-18 10:07:26,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:26,241 INFO L93 Difference]: Finished difference Result 96 states and 318 transitions. [2019-02-18 10:07:26,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 10:07:26,242 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 10:07:26,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:26,243 INFO L225 Difference]: With dead ends: 96 [2019-02-18 10:07:26,243 INFO L226 Difference]: Without dead ends: 90 [2019-02-18 10:07:26,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-18 10:07:26,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-02-18 10:07:26,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 66. [2019-02-18 10:07:26,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-18 10:07:26,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 276 transitions. [2019-02-18 10:07:26,269 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 276 transitions. Word has length 6 [2019-02-18 10:07:26,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:26,269 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 276 transitions. [2019-02-18 10:07:26,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 10:07:26,270 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 276 transitions. [2019-02-18 10:07:26,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 10:07:26,270 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:26,270 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-18 10:07:26,270 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:26,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:26,270 INFO L82 PathProgramCache]: Analyzing trace with hash 902762768, now seen corresponding path program 3 times [2019-02-18 10:07:26,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:26,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:26,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:07:26,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:26,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:26,372 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:07:26,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:26,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:26,372 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:07:26,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:07:26,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:26,373 INFO 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-02-18 10:07:26,382 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:07:26,382 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:07:26,386 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:07:26,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:07:26,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:26,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:26,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:26,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:26,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:26,438 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:26,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:26,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:26,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:26,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:26,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:07:26,498 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:26,506 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:26,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:26,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-02-18 10:07:26,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-02-18 10:07:26,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 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-02-18 10:07:26,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 10:07:26,539 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:26,553 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:26,562 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:26,569 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:26,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:26,587 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 10:07:26,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:26,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 10:07:26,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:26,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-02-18 10:07:26,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:26,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:26,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:26,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:26,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:26,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:26,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:26,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-02-18 10:07:26,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:26,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:26,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-02-18 10:07:26,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:26,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:26,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:26,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:26,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:26,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:26,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 10:07:26,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:26,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:26,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 10:07:26,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:26,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:26,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:26,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:26,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:26,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:26,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:26,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:26,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:26,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:26,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:26,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 10:07:26,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:26,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:26,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-02-18 10:07:26,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:26,896 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:26,976 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:26,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:26,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-18 10:07:26,996 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:26,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 10:07:26,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 10:07:26,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-18 10:07:26,997 INFO L87 Difference]: Start difference. First operand 66 states and 276 transitions. Second operand 11 states. [2019-02-18 10:07:27,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:27,588 INFO L93 Difference]: Finished difference Result 107 states and 377 transitions. [2019-02-18 10:07:27,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 10:07:27,588 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-18 10:07:27,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:27,590 INFO L225 Difference]: With dead ends: 107 [2019-02-18 10:07:27,590 INFO L226 Difference]: Without dead ends: 106 [2019-02-18 10:07:27,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-02-18 10:07:27,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-02-18 10:07:27,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 75. [2019-02-18 10:07:27,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-18 10:07:27,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 321 transitions. [2019-02-18 10:07:27,618 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 321 transitions. Word has length 6 [2019-02-18 10:07:27,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:27,618 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 321 transitions. [2019-02-18 10:07:27,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 10:07:27,619 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 321 transitions. [2019-02-18 10:07:27,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 10:07:27,619 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:27,619 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-18 10:07:27,620 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:27,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:27,620 INFO L82 PathProgramCache]: Analyzing trace with hash 902474468, now seen corresponding path program 4 times [2019-02-18 10:07:27,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:27,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:27,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:07:27,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:27,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:27,741 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:07:27,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:27,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:27,742 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:07:27,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:07:27,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:27,742 INFO 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-02-18 10:07:27,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:27,752 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:27,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:27,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02-18 10:07:27,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-02-18 10:07:27,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:27,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:27,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-18 10:07:27,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:27,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:27,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:27,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-18 10:07:27,792 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:27,806 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:27,816 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:27,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:27,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:27,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:27,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:27,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:27,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:27,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:27,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:27,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:27,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:27,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:07:27,942 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:27,952 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:27,960 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:27,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:27,979 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 10:07:28,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 10:07:28,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:28,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:28,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:28,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 10:07:28,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:28,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:28,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-02-18 10:07:28,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,092 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-02-18 10:07:28,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:28,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:28,119 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:25 [2019-02-18 10:07:28,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 10:07:28,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:28,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-02-18 10:07:28,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-02-18 10:07:28,210 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:28,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:28,259 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:28,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:28,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-18 10:07:28,279 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:28,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 10:07:28,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 10:07:28,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-18 10:07:28,280 INFO L87 Difference]: Start difference. First operand 75 states and 321 transitions. Second operand 11 states. [2019-02-18 10:07:28,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:28,675 INFO L93 Difference]: Finished difference Result 116 states and 391 transitions. [2019-02-18 10:07:28,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 10:07:28,676 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-18 10:07:28,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:28,677 INFO L225 Difference]: With dead ends: 116 [2019-02-18 10:07:28,678 INFO L226 Difference]: Without dead ends: 113 [2019-02-18 10:07:28,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-02-18 10:07:28,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-18 10:07:28,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 51. [2019-02-18 10:07:28,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-18 10:07:28,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 198 transitions. [2019-02-18 10:07:28,700 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 198 transitions. Word has length 6 [2019-02-18 10:07:28,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:28,700 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 198 transitions. [2019-02-18 10:07:28,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 10:07:28,700 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 198 transitions. [2019-02-18 10:07:28,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 10:07:28,701 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:28,701 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 10:07:28,701 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:28,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:28,701 INFO L82 PathProgramCache]: Analyzing trace with hash 902478688, now seen corresponding path program 1 times [2019-02-18 10:07:28,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:28,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:28,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:28,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:28,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:28,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:07:28,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:28,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:28,761 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 10:07:28,761 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [23] [2019-02-18 10:07:28,762 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:28,762 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:29,231 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:29,232 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:07:29,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:29,232 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:29,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:29,232 INFO 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-02-18 10:07:29,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:29,240 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:29,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:29,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02-18 10:07:29,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 10:07:29,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:29,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:29,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 10:07:29,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:29,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:29,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:29,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 10:07:29,295 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:29,316 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:29,326 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:29,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:29,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:29,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:29,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:29,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:29,405 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:29,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:29,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:29,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:29,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:29,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:07:29,437 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:29,447 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:29,454 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:29,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:29,472 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 10:07:29,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:29,492 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-02-18 10:07:29,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:29,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:29,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:29,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:29,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:29,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:29,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:29,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:29,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:29,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 10:07:29,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:29,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:29,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-18 10:07:29,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:29,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:29,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:29,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:29,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 10:07:29,620 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:29,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:07:29,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:07:29,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-02-18 10:07:29,621 INFO L87 Difference]: Start difference. First operand 51 states and 198 transitions. Second operand 8 states. [2019-02-18 10:07:29,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:29,911 INFO L93 Difference]: Finished difference Result 72 states and 235 transitions. [2019-02-18 10:07:29,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 10:07:29,911 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-18 10:07:29,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:29,912 INFO L225 Difference]: With dead ends: 72 [2019-02-18 10:07:29,912 INFO L226 Difference]: Without dead ends: 67 [2019-02-18 10:07:29,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:07:29,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-18 10:07:29,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2019-02-18 10:07:29,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-18 10:07:29,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 214 transitions. [2019-02-18 10:07:29,936 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 214 transitions. Word has length 6 [2019-02-18 10:07:29,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:29,937 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 214 transitions. [2019-02-18 10:07:29,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:07:29,937 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 214 transitions. [2019-02-18 10:07:29,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 10:07:29,937 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:29,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 10:07:29,938 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:29,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:29,938 INFO L82 PathProgramCache]: Analyzing trace with hash 902469014, now seen corresponding path program 1 times [2019-02-18 10:07:29,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:29,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:29,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:29,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:29,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:29,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:30,005 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:07:30,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:30,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:30,005 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 10:07:30,006 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [21] [2019-02-18 10:07:30,009 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:30,009 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:30,619 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:30,620 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:07:30,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:30,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:30,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:30,620 INFO 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-02-18 10:07:30,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:30,628 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:30,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:30,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02-18 10:07:30,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-02-18 10:07:30,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-18 10:07:30,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-02-18 10:07:30,686 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:30,707 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:30,717 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:30,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:30,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:30,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,773 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:30,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:07:30,803 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:30,813 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:30,822 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:30,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:30,841 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 10:07:30,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 10:07:30,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:30,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:30,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:30,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,904 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,907 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-02-18 10:07:30,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:30,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:30,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-18 10:07:30,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,955 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:30,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 10:07:30,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:30,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:30,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-18 10:07:30,999 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:30,999 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:31,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:31,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:31,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 10:07:31,041 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:31,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 10:07:31,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 10:07:31,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:07:31,041 INFO L87 Difference]: Start difference. First operand 55 states and 214 transitions. Second operand 10 states. [2019-02-18 10:07:31,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:31,385 INFO L93 Difference]: Finished difference Result 77 states and 249 transitions. [2019-02-18 10:07:31,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 10:07:31,386 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 10:07:31,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:31,387 INFO L225 Difference]: With dead ends: 77 [2019-02-18 10:07:31,387 INFO L226 Difference]: Without dead ends: 76 [2019-02-18 10:07:31,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-02-18 10:07:31,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-18 10:07:31,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-02-18 10:07:31,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-18 10:07:31,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 213 transitions. [2019-02-18 10:07:31,415 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 213 transitions. Word has length 6 [2019-02-18 10:07:31,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:31,415 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 213 transitions. [2019-02-18 10:07:31,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 10:07:31,415 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 213 transitions. [2019-02-18 10:07:31,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 10:07:31,416 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:31,416 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 10:07:31,416 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:31,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:31,416 INFO L82 PathProgramCache]: Analyzing trace with hash 902472858, now seen corresponding path program 1 times [2019-02-18 10:07:31,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:31,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:31,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:31,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:31,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:31,518 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:07:31,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:31,518 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:31,518 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 10:07:31,518 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [21] [2019-02-18 10:07:31,519 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:31,519 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:32,138 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:32,138 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:07:32,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:32,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:32,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:32,138 INFO 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-02-18 10:07:32,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:32,146 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:32,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:32,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02-18 10:07:32,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-02-18 10:07:32,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:32,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:32,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-18 10:07:32,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:32,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:32,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:32,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-18 10:07:32,198 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:32,225 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:32,234 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:32,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:32,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:32,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:32,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:32,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:32,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:32,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:32,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:32,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:32,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:32,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:07:32,356 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:32,370 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:32,383 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:32,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:32,407 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-18 10:07:32,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:32,444 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-02-18 10:07:32,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:32,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:32,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:32,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:32,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:32,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:32,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:32,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:32,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:32,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 10:07:32,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:32,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:32,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 10:07:32,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:32,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:32,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:32,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:32,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:32,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:32,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:32,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:32,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:32,754 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:32,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-02-18 10:07:32,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:32,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:32,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-18 10:07:32,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:32,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:32,867 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:32,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:32,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 10:07:32,887 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:32,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 10:07:32,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 10:07:32,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-02-18 10:07:32,888 INFO L87 Difference]: Start difference. First operand 55 states and 213 transitions. Second operand 10 states. [2019-02-18 10:07:33,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:33,219 INFO L93 Difference]: Finished difference Result 78 states and 272 transitions. [2019-02-18 10:07:33,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 10:07:33,219 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 10:07:33,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:33,220 INFO L225 Difference]: With dead ends: 78 [2019-02-18 10:07:33,220 INFO L226 Difference]: Without dead ends: 77 [2019-02-18 10:07:33,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-02-18 10:07:33,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-18 10:07:33,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 59. [2019-02-18 10:07:33,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-18 10:07:33,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 238 transitions. [2019-02-18 10:07:33,251 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 238 transitions. Word has length 6 [2019-02-18 10:07:33,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:33,252 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 238 transitions. [2019-02-18 10:07:33,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 10:07:33,252 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 238 transitions. [2019-02-18 10:07:33,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 10:07:33,252 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:33,252 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-18 10:07:33,253 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:33,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:33,253 INFO L82 PathProgramCache]: Analyzing trace with hash 902712672, now seen corresponding path program 1 times [2019-02-18 10:07:33,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:33,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:33,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:33,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:33,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:33,323 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:07:33,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:33,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:33,324 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 10:07:33,324 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [19] [2019-02-18 10:07:33,325 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:33,325 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:33,920 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:33,920 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:07:33,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:33,920 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:33,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:33,921 INFO 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-02-18 10:07:33,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:33,930 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:33,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:33,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:33,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:33,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,001 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:34,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,030 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:07:34,033 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:34,043 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:34,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:34,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-02-18 10:07:34,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-02-18 10:07:34,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 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-02-18 10:07:34,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 10:07:34,074 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:34,090 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:34,099 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:34,107 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:34,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:34,126 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 10:07:34,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 10:07:34,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:34,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:34,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:34,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-02-18 10:07:34,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:34,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:34,216 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 10:07:34,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,246 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-02-18 10:07:34,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:34,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:34,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-18 10:07:34,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,301 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:34,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-02-18 10:07:34,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:34,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:34,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-18 10:07:34,344 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:34,344 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:34,388 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:34,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:34,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-18 10:07:34,409 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:34,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 10:07:34,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 10:07:34,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-18 10:07:34,410 INFO L87 Difference]: Start difference. First operand 59 states and 238 transitions. Second operand 11 states. [2019-02-18 10:07:34,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:34,876 INFO L93 Difference]: Finished difference Result 95 states and 298 transitions. [2019-02-18 10:07:34,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 10:07:34,876 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-18 10:07:34,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:34,878 INFO L225 Difference]: With dead ends: 95 [2019-02-18 10:07:34,878 INFO L226 Difference]: Without dead ends: 90 [2019-02-18 10:07:34,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-02-18 10:07:34,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-02-18 10:07:34,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2019-02-18 10:07:34,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-18 10:07:34,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 247 transitions. [2019-02-18 10:07:34,917 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 247 transitions. Word has length 6 [2019-02-18 10:07:34,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:34,917 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 247 transitions. [2019-02-18 10:07:34,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 10:07:34,918 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 247 transitions. [2019-02-18 10:07:34,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 10:07:34,918 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:34,918 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 10:07:34,918 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:34,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:34,919 INFO L82 PathProgramCache]: Analyzing trace with hash 893362642, now seen corresponding path program 1 times [2019-02-18 10:07:34,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:34,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:34,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:34,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:34,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:35,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:07:35,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:35,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:35,042 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 10:07:35,042 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [23] [2019-02-18 10:07:35,043 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:35,043 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:35,295 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:35,296 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:07:35,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:35,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:35,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:35,296 INFO 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-02-18 10:07:35,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:35,305 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:35,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:35,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02-18 10:07:35,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-02-18 10:07:35,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02-18 10:07:35,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-18 10:07:35,365 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:35,389 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:35,399 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:35,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:35,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:35,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:35,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:07:35,493 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:35,503 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:35,513 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:35,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:35,534 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 10:07:35,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,559 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-02-18 10:07:35,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:35,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:35,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:35,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 10:07:35,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:35,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:35,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-18 10:07:35,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:35,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:35,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:35,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:35,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-02-18 10:07:35,704 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:35,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 10:07:35,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 10:07:35,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:07:35,705 INFO L87 Difference]: Start difference. First operand 61 states and 247 transitions. Second operand 9 states. [2019-02-18 10:07:36,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:36,506 INFO L93 Difference]: Finished difference Result 90 states and 328 transitions. [2019-02-18 10:07:36,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 10:07:36,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-18 10:07:36,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:36,508 INFO L225 Difference]: With dead ends: 90 [2019-02-18 10:07:36,508 INFO L226 Difference]: Without dead ends: 87 [2019-02-18 10:07:36,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-18 10:07:36,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-18 10:07:36,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 72. [2019-02-18 10:07:36,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-02-18 10:07:36,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 308 transitions. [2019-02-18 10:07:36,549 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 308 transitions. Word has length 6 [2019-02-18 10:07:36,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:36,549 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 308 transitions. [2019-02-18 10:07:36,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 10:07:36,549 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 308 transitions. [2019-02-18 10:07:36,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 10:07:36,549 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:36,550 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 10:07:36,550 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:36,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:36,550 INFO L82 PathProgramCache]: Analyzing trace with hash 893472132, now seen corresponding path program 1 times [2019-02-18 10:07:36,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:36,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:36,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:36,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:36,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:36,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:07:36,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:36,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:36,615 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 10:07:36,615 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [21] [2019-02-18 10:07:36,616 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:36,616 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:36,873 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:36,873 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:07:36,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:36,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:36,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:36,874 INFO 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-02-18 10:07:36,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:36,884 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:36,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:36,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02-18 10:07:36,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-02-18 10:07:36,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:36,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:36,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-18 10:07:36,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-02-18 10:07:36,934 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:36,949 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:36,958 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:36,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:36,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:36,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-02-18 10:07:37,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:37,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:37,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-02-18 10:07:37,004 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:37,009 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:37,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:37,022 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2019-02-18 10:07:37,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:37,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-18 10:07:37,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:37,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:37,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-18 10:07:37,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:37,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:37,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:37,076 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:37,077 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 36 [2019-02-18 10:07:37,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:37,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:37,089 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-02-18 10:07:37,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:37,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:37,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:37,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:37,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:37,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-18 10:07:37,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:37,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:37,123 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-02-18 10:07:37,135 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:37,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:37,179 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:37,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:37,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 10:07:37,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:37,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 10:07:37,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 10:07:37,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:07:37,200 INFO L87 Difference]: Start difference. First operand 72 states and 308 transitions. Second operand 10 states. [2019-02-18 10:07:37,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:37,581 INFO L93 Difference]: Finished difference Result 122 states and 469 transitions. [2019-02-18 10:07:37,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 10:07:37,582 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 10:07:37,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:37,583 INFO L225 Difference]: With dead ends: 122 [2019-02-18 10:07:37,583 INFO L226 Difference]: Without dead ends: 121 [2019-02-18 10:07:37,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-18 10:07:37,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-02-18 10:07:37,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2019-02-18 10:07:37,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-02-18 10:07:37,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 434 transitions. [2019-02-18 10:07:37,635 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 434 transitions. Word has length 6 [2019-02-18 10:07:37,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:37,635 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 434 transitions. [2019-02-18 10:07:37,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 10:07:37,635 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 434 transitions. [2019-02-18 10:07:37,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 10:07:37,636 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:37,636 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 10:07:37,636 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:37,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:37,636 INFO L82 PathProgramCache]: Analyzing trace with hash 897235472, now seen corresponding path program 1 times [2019-02-18 10:07:37,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:37,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:37,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:37,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:37,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:37,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:07:37,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:37,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:37,799 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 10:07:37,799 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [23] [2019-02-18 10:07:37,800 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:37,800 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:38,284 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:38,285 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:07:38,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:38,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:38,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:38,285 INFO 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-02-18 10:07:38,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:38,293 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:38,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:38,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-18 10:07:38,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:38,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:38,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-18 10:07:38,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:38,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:38,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:38,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:38,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 10:07:38,374 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:38,383 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:38,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:38,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-02-18 10:07:38,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-02-18 10:07:38,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-02-18 10:07:38,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, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-02-18 10:07:38,418 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:38,432 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:38,440 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:38,447 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:38,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:38,464 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-02-18 10:07:38,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:38,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-18 10:07:38,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:38,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:38,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-18 10:07:38,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:38,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:38,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:38,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:38,546 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:38,547 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-02-18 10:07:38,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:38,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:38,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-18 10:07:38,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:38,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:38,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:38,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:38,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 10:07:38,612 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:38,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:07:38,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:07:38,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:07:38,613 INFO L87 Difference]: Start difference. First operand 96 states and 434 transitions. Second operand 8 states. [2019-02-18 10:07:38,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:38,833 INFO L93 Difference]: Finished difference Result 113 states and 457 transitions. [2019-02-18 10:07:38,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 10:07:38,834 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-18 10:07:38,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:38,835 INFO L225 Difference]: With dead ends: 113 [2019-02-18 10:07:38,835 INFO L226 Difference]: Without dead ends: 108 [2019-02-18 10:07:38,836 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-02-18 10:07:38,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-02-18 10:07:38,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2019-02-18 10:07:38,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-18 10:07:38,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 438 transitions. [2019-02-18 10:07:38,893 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 438 transitions. Word has length 6 [2019-02-18 10:07:38,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:38,893 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 438 transitions. [2019-02-18 10:07:38,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:07:38,893 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 438 transitions. [2019-02-18 10:07:38,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 10:07:38,894 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:38,894 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 10:07:38,895 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:38,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:38,895 INFO L82 PathProgramCache]: Analyzing trace with hash 896931732, now seen corresponding path program 2 times [2019-02-18 10:07:38,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:38,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:38,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:38,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:38,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:39,043 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-02-18 10:07:39,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:07:39,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:39,059 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:39,059 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:07:39,059 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:07:39,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:39,059 INFO 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-02-18 10:07:39,068 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:07:39,068 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:07:39,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 10:07:39,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:07:39,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:39,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:39,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,118 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:39,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:07:39,149 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:39,158 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:39,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:39,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-02-18 10:07:39,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-02-18 10:07:39,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 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-02-18 10:07:39,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-02-18 10:07:39,190 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:39,205 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:39,214 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:39,222 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:39,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:39,241 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 10:07:39,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,264 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-02-18 10:07:39,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:39,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:39,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:39,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 10:07:39,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:39,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:39,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 10:07:39,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,352 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:39,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 71 [2019-02-18 10:07:39,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:39,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:39,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-18 10:07:39,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:39,394 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:39,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:39,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:39,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-18 10:07:39,444 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:39,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 10:07:39,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 10:07:39,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:07:39,445 INFO L87 Difference]: Start difference. First operand 97 states and 438 transitions. Second operand 9 states. [2019-02-18 10:07:39,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:39,795 INFO L93 Difference]: Finished difference Result 137 states and 550 transitions. [2019-02-18 10:07:39,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 10:07:39,795 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-18 10:07:39,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:39,797 INFO L225 Difference]: With dead ends: 137 [2019-02-18 10:07:39,797 INFO L226 Difference]: Without dead ends: 136 [2019-02-18 10:07:39,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-02-18 10:07:39,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-02-18 10:07:39,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2019-02-18 10:07:39,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-18 10:07:39,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 421 transitions. [2019-02-18 10:07:39,842 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 421 transitions. Word has length 6 [2019-02-18 10:07:39,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:39,842 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 421 transitions. [2019-02-18 10:07:39,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 10:07:39,842 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 421 transitions. [2019-02-18 10:07:39,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 10:07:39,843 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:39,843 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 10:07:39,843 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:39,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:39,844 INFO L82 PathProgramCache]: Analyzing trace with hash 900929556, now seen corresponding path program 1 times [2019-02-18 10:07:39,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:39,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:39,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:07:39,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:39,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:40,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:40,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:40,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:40,136 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 10:07:40,136 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [23] [2019-02-18 10:07:40,137 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:40,137 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:40,788 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:40,789 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:07:40,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:40,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:40,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:40,789 INFO 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-02-18 10:07:40,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:40,797 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:40,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:40,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2019-02-18 10:07:40,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2019-02-18 10:07:40,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:40,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:40,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:40,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 9 [2019-02-18 10:07:40,851 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:40,860 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:40,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:40,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02-18 10:07:40,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-02-18 10:07:40,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 22 [2019-02-18 10:07:40,896 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-02-18 10:07:40,897 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:40,910 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:40,918 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:40,927 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:40,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:40,942 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:30, output treesize:33 [2019-02-18 10:07:41,037 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02-18 10:07:41,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:41,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:41,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-02-18 10:07:41,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,090 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-02-18 10:07:41,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:41,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:41,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-02-18 10:07:41,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:41,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:41,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:41,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:41,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 10:07:41,145 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:41,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:07:41,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:07:41,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:07:41,145 INFO L87 Difference]: Start difference. First operand 93 states and 421 transitions. Second operand 8 states. [2019-02-18 10:07:41,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:41,338 INFO L93 Difference]: Finished difference Result 110 states and 439 transitions. [2019-02-18 10:07:41,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 10:07:41,339 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-18 10:07:41,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:41,340 INFO L225 Difference]: With dead ends: 110 [2019-02-18 10:07:41,341 INFO L226 Difference]: Without dead ends: 109 [2019-02-18 10:07:41,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-18 10:07:41,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-18 10:07:41,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2019-02-18 10:07:41,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-02-18 10:07:41,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 406 transitions. [2019-02-18 10:07:41,388 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 406 transitions. Word has length 6 [2019-02-18 10:07:41,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:41,388 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 406 transitions. [2019-02-18 10:07:41,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:07:41,388 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 406 transitions. [2019-02-18 10:07:41,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 10:07:41,388 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:41,388 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-18 10:07:41,389 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:41,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:41,389 INFO L82 PathProgramCache]: Analyzing trace with hash 900915912, now seen corresponding path program 2 times [2019-02-18 10:07:41,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:41,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:41,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:41,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:41,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:41,606 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:07:41,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:41,607 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:41,607 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:07:41,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:07:41,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:41,607 INFO 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-02-18 10:07:41,616 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:07:41,616 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:07:41,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 10:07:41,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:07:41,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:41,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02-18 10:07:41,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-02-18 10:07:41,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-18 10:07:41,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-18 10:07:41,655 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:41,671 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:41,680 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:41,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:41,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:41,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:41,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:07:41,766 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:41,774 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:41,783 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:41,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:41,802 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 10:07:41,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,826 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-02-18 10:07:41,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:41,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:41,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:41,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-02-18 10:07:41,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:41,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:41,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-02-18 10:07:41,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,904 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,907 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,910 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:41,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-02-18 10:07:41,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:41,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-02-18 10:07:41,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-02-18 10:07:41,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,964 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-02-18 10:07:41,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:41,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:41,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-18 10:07:42,005 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:42,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:42,045 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:42,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:42,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-18 10:07:42,064 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:42,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 10:07:42,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 10:07:42,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2019-02-18 10:07:42,065 INFO L87 Difference]: Start difference. First operand 90 states and 406 transitions. Second operand 11 states. [2019-02-18 10:07:42,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:42,481 INFO L93 Difference]: Finished difference Result 124 states and 476 transitions. [2019-02-18 10:07:42,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 10:07:42,481 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-18 10:07:42,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:42,483 INFO L225 Difference]: With dead ends: 124 [2019-02-18 10:07:42,483 INFO L226 Difference]: Without dead ends: 116 [2019-02-18 10:07:42,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=190, Unknown=0, NotChecked=0, Total=306 [2019-02-18 10:07:42,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-02-18 10:07:42,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 97. [2019-02-18 10:07:42,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-18 10:07:42,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 435 transitions. [2019-02-18 10:07:42,531 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 435 transitions. Word has length 6 [2019-02-18 10:07:42,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:42,532 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 435 transitions. [2019-02-18 10:07:42,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 10:07:42,532 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 435 transitions. [2019-02-18 10:07:42,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 10:07:42,532 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:42,533 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 10:07:42,533 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:42,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:42,533 INFO L82 PathProgramCache]: Analyzing trace with hash 900919446, now seen corresponding path program 1 times [2019-02-18 10:07:42,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:42,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:42,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:07:42,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:42,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:42,626 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:42,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:42,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:42,626 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 10:07:42,627 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [19] [2019-02-18 10:07:42,627 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:42,628 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:43,365 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:43,365 INFO L272 AbstractInterpreter]: Visited 6 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-18 10:07:43,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:43,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:43,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:43,365 INFO 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-02-18 10:07:43,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:43,373 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:43,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:43,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02-18 10:07:43,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-02-18 10:07:43,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-18 10:07:43,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-18 10:07:43,430 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:43,448 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:43,458 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:43,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:43,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:43,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,514 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:43,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:07:43,571 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:43,579 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:43,588 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:43,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:43,607 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-18 10:07:43,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,633 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-02-18 10:07:43,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:43,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:43,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:43,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,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, 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-02-18 10:07:43,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:43,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:43,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-02-18 10:07:43,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,726 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:43,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-02-18 10:07:43,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:43,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:43,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-18 10:07:43,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,781 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:43,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-02-18 10:07:43,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:43,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:43,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-18 10:07:43,825 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:43,825 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:43,865 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:43,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:43,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-18 10:07:43,885 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:43,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 10:07:43,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 10:07:43,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-02-18 10:07:43,885 INFO L87 Difference]: Start difference. First operand 97 states and 435 transitions. Second operand 12 states. [2019-02-18 10:07:44,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:44,395 INFO L93 Difference]: Finished difference Result 137 states and 564 transitions. [2019-02-18 10:07:44,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 10:07:44,395 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-18 10:07:44,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:44,397 INFO L225 Difference]: With dead ends: 137 [2019-02-18 10:07:44,397 INFO L226 Difference]: Without dead ends: 136 [2019-02-18 10:07:44,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2019-02-18 10:07:44,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-02-18 10:07:44,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 103. [2019-02-18 10:07:44,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-18 10:07:44,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 465 transitions. [2019-02-18 10:07:44,463 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 465 transitions. Word has length 6 [2019-02-18 10:07:44,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:44,463 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 465 transitions. [2019-02-18 10:07:44,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 10:07:44,463 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 465 transitions. [2019-02-18 10:07:44,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 10:07:44,464 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:44,464 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 10:07:44,464 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:44,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:44,465 INFO L82 PathProgramCache]: Analyzing trace with hash 900627426, now seen corresponding path program 2 times [2019-02-18 10:07:44,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:44,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:44,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:44,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:44,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:44,622 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-02-18 10:07:44,685 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:44,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:44,686 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:44,686 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:07:44,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:07:44,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:44,686 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 10:07:44,696 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:07:44,696 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:07:44,702 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 10:07:44,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:07:44,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:44,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02-18 10:07:44,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, 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-02-18 10:07:44,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:44,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:44,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02-18 10:07:44,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:44,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:44,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:44,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 10:07:44,732 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:44,750 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:44,760 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:44,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:44,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:44,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:44,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:44,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:44,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:44,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:44,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:44,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:44,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:44,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:07:44,872 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:44,908 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:44,915 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:44,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:44,934 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-18 10:07:44,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:44,962 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-02-18 10:07:44,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:44,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:44,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:45,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,021 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:45,021 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-02-18 10:07:45,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:45,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:45,042 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29 [2019-02-18 10:07:45,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 10:07:45,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:45,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:45,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2019-02-18 10:07:45,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,137 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:45,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-02-18 10:07:45,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:45,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:45,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-02-18 10:07:45,179 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:45,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:45,231 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:45,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:45,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-18 10:07:45,250 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:45,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 10:07:45,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 10:07:45,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-18 10:07:45,251 INFO L87 Difference]: Start difference. First operand 103 states and 465 transitions. Second operand 12 states. [2019-02-18 10:07:45,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:45,868 INFO L93 Difference]: Finished difference Result 172 states and 721 transitions. [2019-02-18 10:07:45,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 10:07:45,868 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-18 10:07:45,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:45,871 INFO L225 Difference]: With dead ends: 172 [2019-02-18 10:07:45,871 INFO L226 Difference]: Without dead ends: 167 [2019-02-18 10:07:45,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-02-18 10:07:45,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-02-18 10:07:45,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 116. [2019-02-18 10:07:45,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-02-18 10:07:45,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 529 transitions. [2019-02-18 10:07:45,924 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 529 transitions. Word has length 6 [2019-02-18 10:07:45,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:45,924 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 529 transitions. [2019-02-18 10:07:45,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 10:07:45,924 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 529 transitions. [2019-02-18 10:07:45,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 10:07:45,925 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:45,925 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 10:07:45,925 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:45,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:45,925 INFO L82 PathProgramCache]: Analyzing trace with hash 900621846, now seen corresponding path program 3 times [2019-02-18 10:07:45,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:45,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:45,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:07:45,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:45,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:46,123 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:46,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:46,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:46,124 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:07:46,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:07:46,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:46,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 10:07:46,133 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:07:46,134 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:07:46,138 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:07:46,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:07:46,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:46,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:46,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:46,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:07:46,245 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:46,254 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:46,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:46,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-02-18 10:07:46,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-02-18 10:07:46,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 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-02-18 10:07:46,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-18 10:07:46,287 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:46,301 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:46,310 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:46,318 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:46,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:46,337 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-18 10:07:46,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,363 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-02-18 10:07:46,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:46,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:46,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:46,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,410 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:46,411 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-02-18 10:07:46,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:46,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:46,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29 [2019-02-18 10:07:46,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-02-18 10:07:46,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:46,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:46,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2019-02-18 10:07:46,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,508 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:46,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 10:07:46,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:46,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:46,533 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:31 [2019-02-18 10:07:46,551 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:46,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:46,604 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:46,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:46,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-18 10:07:46,623 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:46,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 10:07:46,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 10:07:46,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-02-18 10:07:46,624 INFO L87 Difference]: Start difference. First operand 116 states and 529 transitions. Second operand 12 states. [2019-02-18 10:07:47,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:47,072 INFO L93 Difference]: Finished difference Result 140 states and 566 transitions. [2019-02-18 10:07:47,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 10:07:47,073 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-18 10:07:47,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:47,075 INFO L225 Difference]: With dead ends: 140 [2019-02-18 10:07:47,075 INFO L226 Difference]: Without dead ends: 135 [2019-02-18 10:07:47,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2019-02-18 10:07:47,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-02-18 10:07:47,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 46. [2019-02-18 10:07:47,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-18 10:07:47,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 176 transitions. [2019-02-18 10:07:47,134 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 176 transitions. Word has length 6 [2019-02-18 10:07:47,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:47,134 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 176 transitions. [2019-02-18 10:07:47,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 10:07:47,135 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 176 transitions. [2019-02-18 10:07:47,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 10:07:47,135 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:47,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:07:47,135 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:47,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:47,136 INFO L82 PathProgramCache]: Analyzing trace with hash -2088231584, now seen corresponding path program 1 times [2019-02-18 10:07:47,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:47,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:47,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:07:47,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:47,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:47,374 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-02-18 10:07:47,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:07:47,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:47,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:47,547 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 10:07:47,548 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [23] [2019-02-18 10:07:47,549 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:47,549 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:48,209 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:48,209 INFO L272 AbstractInterpreter]: Visited 7 different actions 15 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:07:48,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:48,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:48,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:48,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 10:07:48,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:48,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:48,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:48,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02-18 10:07:48,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-02-18 10:07:48,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-18 10:07:48,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 10:07:48,274 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:48,308 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:48,317 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:48,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:48,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:48,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,371 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:48,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:07:48,404 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:48,413 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:48,421 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:48,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:48,438 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-18 10:07:48,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,463 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-02-18 10:07:48,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:48,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:48,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:48,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 10:07:48,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:48,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:48,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 10:07:48,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,553 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:48,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,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 72 [2019-02-18 10:07:48,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:48,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-02-18 10:07:48,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-18 10:07:48,595 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:48,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:48,628 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:48,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:48,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 10:07:48,648 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:48,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 10:07:48,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 10:07:48,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:07:48,649 INFO L87 Difference]: Start difference. First operand 46 states and 176 transitions. Second operand 10 states. [2019-02-18 10:07:49,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:49,090 INFO L93 Difference]: Finished difference Result 77 states and 262 transitions. [2019-02-18 10:07:49,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 10:07:49,091 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-18 10:07:49,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:49,092 INFO L225 Difference]: With dead ends: 77 [2019-02-18 10:07:49,092 INFO L226 Difference]: Without dead ends: 76 [2019-02-18 10:07:49,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-02-18 10:07:49,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-18 10:07:49,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2019-02-18 10:07:49,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-02-18 10:07:49,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 213 transitions. [2019-02-18 10:07:49,151 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 213 transitions. Word has length 7 [2019-02-18 10:07:49,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:49,151 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 213 transitions. [2019-02-18 10:07:49,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 10:07:49,151 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 213 transitions. [2019-02-18 10:07:49,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 10:07:49,152 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:49,152 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:07:49,152 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:49,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:49,152 INFO L82 PathProgramCache]: Analyzing trace with hash -2088122094, now seen corresponding path program 1 times [2019-02-18 10:07:49,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:49,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:49,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:49,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:49,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:49,241 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:07:49,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:49,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:49,241 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 10:07:49,242 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [21] [2019-02-18 10:07:49,243 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:49,243 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:50,140 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:50,140 INFO L272 AbstractInterpreter]: Visited 7 different actions 17 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-18 10:07:50,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:50,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:50,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:50,141 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 10:07:50,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:50,148 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:50,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:50,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02-18 10:07:50,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-02-18 10:07:50,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 10:07:50,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-18 10:07:50,198 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:50,221 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:50,233 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:50,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:50,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:50,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,288 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:50,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:07:50,320 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:50,330 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:50,338 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:50,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:50,356 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-18 10:07:50,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 10:07:50,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:50,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:50,399 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:50,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-02-18 10:07:50,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:50,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:50,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 10:07:50,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,479 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:50,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 10:07:50,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:50,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:50,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-18 10:07:50,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,529 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:50,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-02-18 10:07:50,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:50,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:50,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-02-18 10:07:50,576 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:50,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:50,618 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:50,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:50,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-18 10:07:50,636 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:50,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 10:07:50,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 10:07:50,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-18 10:07:50,637 INFO L87 Difference]: Start difference. First operand 54 states and 213 transitions. Second operand 12 states. [2019-02-18 10:07:51,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:51,165 INFO L93 Difference]: Finished difference Result 86 states and 270 transitions. [2019-02-18 10:07:51,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 10:07:51,165 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-18 10:07:51,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:51,167 INFO L225 Difference]: With dead ends: 86 [2019-02-18 10:07:51,167 INFO L226 Difference]: Without dead ends: 85 [2019-02-18 10:07:51,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-02-18 10:07:51,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-18 10:07:51,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 53. [2019-02-18 10:07:51,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-18 10:07:51,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 208 transitions. [2019-02-18 10:07:51,242 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 208 transitions. Word has length 7 [2019-02-18 10:07:51,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:51,242 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 208 transitions. [2019-02-18 10:07:51,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 10:07:51,242 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 208 transitions. [2019-02-18 10:07:51,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 10:07:51,243 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:51,243 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:07:51,243 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:51,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:51,243 INFO L82 PathProgramCache]: Analyzing trace with hash -2084237604, now seen corresponding path program 1 times [2019-02-18 10:07:51,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:51,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:51,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:51,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:51,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:51,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:51,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:51,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:51,431 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 10:07:51,431 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [24], [25] [2019-02-18 10:07:51,432 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:51,433 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:52,238 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:52,238 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:07:52,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:52,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:52,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:52,239 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 10:07:52,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:52,247 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:52,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:52,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-18 10:07:52,261 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-02-18 10:07:52,268 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-02-18 10:07:52,282 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-02-18 10:07:52,283 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:52,296 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:52,308 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:52,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:52,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:52,328 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:15, output treesize:21 [2019-02-18 10:07:52,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:52,352 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 15 [2019-02-18 10:07:52,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:07:52,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-18 10:07:52,362 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:21 [2019-02-18 10:07:52,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:52,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-18 10:07:52,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:52,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:52,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:52,397 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:52,398 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 23 treesize of output 28 [2019-02-18 10:07:52,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:52,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-18 10:07:52,411 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:21 [2019-02-18 10:07:52,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:52,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:52,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:52,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 10:07:52,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 9 [2019-02-18 10:07:52,466 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:07:52,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-18 10:07:52,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-18 10:07:52,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:07:52,467 INFO L87 Difference]: Start difference. First operand 53 states and 208 transitions. Second operand 5 states. [2019-02-18 10:07:52,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:52,710 INFO L93 Difference]: Finished difference Result 115 states and 427 transitions. [2019-02-18 10:07:52,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 10:07:52,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-02-18 10:07:52,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:52,712 INFO L225 Difference]: With dead ends: 115 [2019-02-18 10:07:52,712 INFO L226 Difference]: Without dead ends: 110 [2019-02-18 10:07:52,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:07:52,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-18 10:07:52,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 84. [2019-02-18 10:07:52,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-18 10:07:52,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 343 transitions. [2019-02-18 10:07:52,827 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 343 transitions. Word has length 7 [2019-02-18 10:07:52,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:52,827 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 343 transitions. [2019-02-18 10:07:52,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-18 10:07:52,827 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 343 transitions. [2019-02-18 10:07:52,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 10:07:52,828 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:52,828 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:07:52,828 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:52,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:52,829 INFO L82 PathProgramCache]: Analyzing trace with hash -2084662494, now seen corresponding path program 2 times [2019-02-18 10:07:52,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:52,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:52,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:52,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:52,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:53,226 WARN L181 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2019-02-18 10:07:53,385 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-18 10:07:53,415 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:07:53,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:53,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:53,416 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:07:53,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:07:53,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:53,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 10:07:53,425 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:07:53,425 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:07:53,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 10:07:53,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:07:53,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:53,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02-18 10:07:53,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-02-18 10:07:53,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-18 10:07:53,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-18 10:07:53,465 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:53,482 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:53,491 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:53,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:53,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:53,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:53,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:07:53,575 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:53,584 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:53,593 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:53,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:53,610 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-18 10:07:53,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 10:07:53,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:53,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:53,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:53,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,760 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:53,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 33 treesize of output 60 [2019-02-18 10:07:53,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:53,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:53,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-02-18 10:07:53,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,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, 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-02-18 10:07:53,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:53,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:53,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-18 10:07:53,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,855 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:53,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-02-18 10:07:53,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:53,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:53,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-18 10:07:53,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:53,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:53,943 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:53,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:53,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-18 10:07:53,962 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:53,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 10:07:53,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 10:07:53,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-18 10:07:53,963 INFO L87 Difference]: Start difference. First operand 84 states and 343 transitions. Second operand 11 states. [2019-02-18 10:07:54,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:54,599 INFO L93 Difference]: Finished difference Result 104 states and 372 transitions. [2019-02-18 10:07:54,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 10:07:54,599 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-18 10:07:54,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:54,601 INFO L225 Difference]: With dead ends: 104 [2019-02-18 10:07:54,601 INFO L226 Difference]: Without dead ends: 103 [2019-02-18 10:07:54,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-02-18 10:07:54,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-18 10:07:54,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 47. [2019-02-18 10:07:54,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-18 10:07:54,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 177 transitions. [2019-02-18 10:07:54,675 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 177 transitions. Word has length 7 [2019-02-18 10:07:54,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:54,676 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 177 transitions. [2019-02-18 10:07:54,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 10:07:54,676 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 177 transitions. [2019-02-18 10:07:54,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 10:07:54,676 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:54,677 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:07:54,677 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:54,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:54,677 INFO L82 PathProgramCache]: Analyzing trace with hash -2080843416, now seen corresponding path program 1 times [2019-02-18 10:07:54,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:54,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:54,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:07:54,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:54,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:54,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:54,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:54,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:54,731 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 10:07:54,731 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [22], [23] [2019-02-18 10:07:54,732 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:54,732 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:55,389 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:55,389 INFO L272 AbstractInterpreter]: Visited 7 different actions 15 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:07:55,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:55,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:55,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:55,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 10:07:55,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:55,397 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:55,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:55,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-18 10:07:55,413 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-02-18 10:07:55,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:55,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:55,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-02-18 10:07:55,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:55,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:55,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:55,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-02-18 10:07:55,436 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:55,462 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:55,471 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:55,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:55,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-18 10:07:55,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:55,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:55,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-18 10:07:55,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:55,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:55,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:55,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:55,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 10:07:55,559 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:55,567 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:55,576 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:55,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:55,593 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-02-18 10:07:55,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:55,625 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-02-18 10:07:55,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:55,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:55,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-18 10:07:55,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:55,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:55,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:55,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:55,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:55,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-18 10:07:55,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:55,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:55,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-02-18 10:07:55,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:55,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:55,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:55,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:55,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:55,687 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:55,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:55,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-18 10:07:55,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:55,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-02-18 10:07:55,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:20 [2019-02-18 10:07:55,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:55,722 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:55,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:55,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:55,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 10:07:55,777 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:55,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 10:07:55,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 10:07:55,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-18 10:07:55,778 INFO L87 Difference]: Start difference. First operand 47 states and 177 transitions. Second operand 10 states. [2019-02-18 10:07:56,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:56,199 INFO L93 Difference]: Finished difference Result 68 states and 235 transitions. [2019-02-18 10:07:56,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 10:07:56,200 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-18 10:07:56,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:56,201 INFO L225 Difference]: With dead ends: 68 [2019-02-18 10:07:56,201 INFO L226 Difference]: Without dead ends: 67 [2019-02-18 10:07:56,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-18 10:07:56,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-18 10:07:56,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2019-02-18 10:07:56,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-02-18 10:07:56,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 190 transitions. [2019-02-18 10:07:56,301 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 190 transitions. Word has length 7 [2019-02-18 10:07:56,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:56,302 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 190 transitions. [2019-02-18 10:07:56,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 10:07:56,302 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 190 transitions. [2019-02-18 10:07:56,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 10:07:56,302 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:56,302 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-18 10:07:56,303 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:56,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:56,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1920744098, now seen corresponding path program 1 times [2019-02-18 10:07:56,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:56,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:56,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:56,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:56,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:56,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 10:07:56,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 10:07:56,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-18 10:07:56,355 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:07:56,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 10:07:56,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 10:07:56,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-18 10:07:56,356 INFO L87 Difference]: Start difference. First operand 50 states and 190 transitions. Second operand 4 states. [2019-02-18 10:07:56,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:56,467 INFO L93 Difference]: Finished difference Result 54 states and 193 transitions. [2019-02-18 10:07:56,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:07:56,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-02-18 10:07:56,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:56,468 INFO L225 Difference]: With dead ends: 54 [2019-02-18 10:07:56,468 INFO L226 Difference]: Without dead ends: 50 [2019-02-18 10:07:56,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-18 10:07:56,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-18 10:07:56,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-02-18 10:07:56,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-02-18 10:07:56,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 189 transitions. [2019-02-18 10:07:56,566 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 189 transitions. Word has length 7 [2019-02-18 10:07:56,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:56,566 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 189 transitions. [2019-02-18 10:07:56,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 10:07:56,566 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 189 transitions. [2019-02-18 10:07:56,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 10:07:56,566 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:56,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:07:56,567 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:56,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:56,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1928011116, now seen corresponding path program 1 times [2019-02-18 10:07:56,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:56,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:56,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:56,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:56,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:56,650 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:07:56,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:56,651 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:56,651 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 10:07:56,651 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [23] [2019-02-18 10:07:56,652 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:56,652 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:57,278 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:57,278 INFO L272 AbstractInterpreter]: Visited 7 different actions 15 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:07:57,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:57,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:57,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:57,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 10:07:57,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:57,287 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:57,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:57,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:57,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,354 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:57,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:07:57,395 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:57,405 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:57,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:57,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-02-18 10:07:57,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-02-18 10:07:57,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 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-02-18 10:07:57,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-18 10:07:57,454 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:57,481 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:57,489 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:57,497 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:57,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:57,517 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 10:07:57,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,552 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-02-18 10:07:57,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:57,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:57,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:57,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,594 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:57,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 10:07:57,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:57,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:57,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-18 10:07:57,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-02-18 10:07:57,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:57,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:57,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2019-02-18 10:07:57,679 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:57,679 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:57,704 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:57,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:57,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 10:07:57,722 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:57,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 10:07:57,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 10:07:57,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:07:57,723 INFO L87 Difference]: Start difference. First operand 50 states and 189 transitions. Second operand 10 states. [2019-02-18 10:07:58,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:58,155 INFO L93 Difference]: Finished difference Result 78 states and 242 transitions. [2019-02-18 10:07:58,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 10:07:58,156 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-18 10:07:58,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:58,156 INFO L225 Difference]: With dead ends: 78 [2019-02-18 10:07:58,156 INFO L226 Difference]: Without dead ends: 71 [2019-02-18 10:07:58,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-02-18 10:07:58,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-18 10:07:58,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2019-02-18 10:07:58,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-18 10:07:58,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 193 transitions. [2019-02-18 10:07:58,262 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 193 transitions. Word has length 7 [2019-02-18 10:07:58,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:58,262 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 193 transitions. [2019-02-18 10:07:58,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 10:07:58,262 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 193 transitions. [2019-02-18 10:07:58,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 10:07:58,263 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:58,263 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:07:58,263 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:58,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:58,263 INFO L82 PathProgramCache]: Analyzing trace with hash 2035260702, now seen corresponding path program 1 times [2019-02-18 10:07:58,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:58,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:58,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:58,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:58,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:58,420 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 20 [2019-02-18 10:07:58,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:07:58,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:58,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:58,462 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 10:07:58,462 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [24], [25] [2019-02-18 10:07:58,464 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:58,464 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:58,693 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:58,693 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:07:58,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:58,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:58,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:58,694 INFO 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-02-18 10:07:58,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:58,703 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:58,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:58,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:58,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:58,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:58,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:58,777 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:58,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:58,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:58,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:58,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:58,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:07:58,810 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:58,820 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:58,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:58,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-02-18 10:07:58,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-02-18 10:07:58,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, 6 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-02-18 10:07:58,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-18 10:07:58,849 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:58,863 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:58,871 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:58,879 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:58,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:58,897 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 10:07:58,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:58,920 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-02-18 10:07:58,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:58,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:58,939 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:58,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:58,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:58,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:58,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:58,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:58,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:58,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-02-18 10:07:58,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:58,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:58,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-18 10:07:59,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:59,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:59,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:59,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:59,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 10:07:59,043 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:59,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:07:59,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:07:59,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-02-18 10:07:59,044 INFO L87 Difference]: Start difference. First operand 51 states and 193 transitions. Second operand 8 states. [2019-02-18 10:07:59,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:59,441 INFO L93 Difference]: Finished difference Result 64 states and 222 transitions. [2019-02-18 10:07:59,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 10:07:59,441 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-18 10:07:59,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:59,442 INFO L225 Difference]: With dead ends: 64 [2019-02-18 10:07:59,442 INFO L226 Difference]: Without dead ends: 56 [2019-02-18 10:07:59,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-02-18 10:07:59,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-18 10:07:59,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-02-18 10:07:59,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-02-18 10:07:59,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 187 transitions. [2019-02-18 10:07:59,547 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 187 transitions. Word has length 7 [2019-02-18 10:07:59,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:59,547 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 187 transitions. [2019-02-18 10:07:59,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:07:59,548 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 187 transitions. [2019-02-18 10:07:59,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 10:07:59,548 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:59,548 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:07:59,548 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:59,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:59,549 INFO L82 PathProgramCache]: Analyzing trace with hash 2042527720, now seen corresponding path program 2 times [2019-02-18 10:07:59,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:59,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:59,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:59,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:59,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:59,628 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:07:59,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:59,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:59,629 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:07:59,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:07:59,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:59,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 10:07:59,638 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:07:59,638 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:07:59,643 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 10:07:59,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:07:59,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:59,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-18 10:07:59,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-18 10:07:59,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 10:07:59,701 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:59,728 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:59,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:59,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-02-18 10:07:59,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-02-18 10:07:59,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-02-18 10:07:59,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-02-18 10:07:59,772 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:59,785 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:59,792 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:59,800 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:59,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:59,817 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-02-18 10:07:59,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,849 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-02-18 10:07:59,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:59,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:59,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-18 10:07:59,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,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 28 treesize of output 50 [2019-02-18 10:07:59,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:59,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:59,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-02-18 10:07:59,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,918 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:59,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, 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-02-18 10:07:59,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:59,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:59,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-02-18 10:07:59,951 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:59,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:00,005 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:00,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:00,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 10:08:00,023 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:00,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 10:08:00,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 10:08:00,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-02-18 10:08:00,024 INFO L87 Difference]: Start difference. First operand 50 states and 187 transitions. Second operand 10 states. [2019-02-18 10:08:00,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:00,452 INFO L93 Difference]: Finished difference Result 76 states and 253 transitions. [2019-02-18 10:08:00,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 10:08:00,452 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-18 10:08:00,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:00,453 INFO L225 Difference]: With dead ends: 76 [2019-02-18 10:08:00,453 INFO L226 Difference]: Without dead ends: 67 [2019-02-18 10:08:00,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-02-18 10:08:00,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-18 10:08:00,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2019-02-18 10:08:00,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-18 10:08:00,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 191 transitions. [2019-02-18 10:08:00,591 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 191 transitions. Word has length 7 [2019-02-18 10:08:00,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:00,591 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 191 transitions. [2019-02-18 10:08:00,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 10:08:00,592 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 191 transitions. [2019-02-18 10:08:00,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 10:08:00,592 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:00,592 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:08:00,592 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:00,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:00,592 INFO L82 PathProgramCache]: Analyzing trace with hash -2141495906, now seen corresponding path program 1 times [2019-02-18 10:08:00,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:00,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:00,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:08:00,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:00,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:00,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:08:00,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:00,703 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:00,703 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 10:08:00,703 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [22], [24], [25] [2019-02-18 10:08:00,704 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:08:00,704 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:08:00,899 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:08:00,899 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:08:00,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:00,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:08:00,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:00,900 INFO 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-02-18 10:08:00,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:00,915 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:08:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:00,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:00,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2019-02-18 10:08:00,945 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 17 treesize of output 19 [2019-02-18 10:08:00,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:00,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:00,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:00,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 9 [2019-02-18 10:08:00,967 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:00,976 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:00,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:00,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02-18 10:08:00,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-02-18 10:08:01,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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 22 [2019-02-18 10:08:01,013 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-02-18 10:08:01,014 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:01,029 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:01,037 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:01,044 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:01,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:01,057 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:30, output treesize:33 [2019-02-18 10:08:01,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:01,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2019-02-18 10:08:01,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:08:01,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-18 10:08:01,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-02-18 10:08:01,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:01,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:01,145 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:01,145 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-02-18 10:08:01,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:01,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:01,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:01,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:01,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:01,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:01,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 48 [2019-02-18 10:08:01,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:01,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-18 10:08:01,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:32 [2019-02-18 10:08:01,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:01,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:01,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:01,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:01,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-02-18 10:08:01,258 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:01,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 10:08:01,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 10:08:01,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-02-18 10:08:01,258 INFO L87 Difference]: Start difference. First operand 51 states and 191 transitions. Second operand 10 states. [2019-02-18 10:08:01,672 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2019-02-18 10:08:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:02,180 INFO L93 Difference]: Finished difference Result 90 states and 306 transitions. [2019-02-18 10:08:02,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 10:08:02,180 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-18 10:08:02,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:02,181 INFO L225 Difference]: With dead ends: 90 [2019-02-18 10:08:02,181 INFO L226 Difference]: Without dead ends: 77 [2019-02-18 10:08:02,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-02-18 10:08:02,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-18 10:08:02,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2019-02-18 10:08:02,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-18 10:08:02,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 241 transitions. [2019-02-18 10:08:02,389 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 241 transitions. Word has length 7 [2019-02-18 10:08:02,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:02,389 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 241 transitions. [2019-02-18 10:08:02,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 10:08:02,389 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 241 transitions. [2019-02-18 10:08:02,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 10:08:02,390 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:02,390 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-02-18 10:08:02,390 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:02,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:02,391 INFO L82 PathProgramCache]: Analyzing trace with hash -314363692, now seen corresponding path program 1 times [2019-02-18 10:08:02,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:02,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:02,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:02,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:02,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:02,594 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:08:02,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:02,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:02,594 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 10:08:02,594 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [24], [25] [2019-02-18 10:08:02,595 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:08:02,595 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:08:03,067 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:08:03,067 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:08:03,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:03,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:08:03,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:03,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 10:08:03,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:03,076 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:08:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:03,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:03,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02-18 10:08:03,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-02-18 10:08:03,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-18 10:08:03,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-18 10:08:03,128 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:03,151 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:03,164 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:03,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:03,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:08:03,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:08:03,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:08:03,284 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:03,299 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:03,311 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:03,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:03,332 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-18 10:08:03,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,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 45 [2019-02-18 10:08:03,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:03,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:03,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 10:08:03,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 10:08:03,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:03,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:03,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 10:08:03,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,464 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-02-18 10:08:03,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:03,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:03,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-18 10:08:03,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:03,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:03,541 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:03,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:03,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-18 10:08:03,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:03,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 10:08:03,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 10:08:03,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-02-18 10:08:03,562 INFO L87 Difference]: Start difference. First operand 63 states and 241 transitions. Second operand 11 states. [2019-02-18 10:08:04,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:04,206 INFO L93 Difference]: Finished difference Result 118 states and 409 transitions. [2019-02-18 10:08:04,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-18 10:08:04,206 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-18 10:08:04,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:04,208 INFO L225 Difference]: With dead ends: 118 [2019-02-18 10:08:04,208 INFO L226 Difference]: Without dead ends: 106 [2019-02-18 10:08:04,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-02-18 10:08:04,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-02-18 10:08:04,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 62. [2019-02-18 10:08:04,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-02-18 10:08:04,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 229 transitions. [2019-02-18 10:08:04,425 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 229 transitions. Word has length 8 [2019-02-18 10:08:04,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:04,426 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 229 transitions. [2019-02-18 10:08:04,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 10:08:04,426 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 229 transitions. [2019-02-18 10:08:04,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 10:08:04,426 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:04,426 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:08:04,426 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:04,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:04,427 INFO L82 PathProgramCache]: Analyzing trace with hash -307275420, now seen corresponding path program 1 times [2019-02-18 10:08:04,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:04,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:04,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:04,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:04,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:04,536 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:04,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:04,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:04,537 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 10:08:04,537 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [22], [23] [2019-02-18 10:08:04,538 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:08:04,538 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:08:05,299 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:08:05,299 INFO L272 AbstractInterpreter]: Visited 8 different actions 18 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-18 10:08:05,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:05,300 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:08:05,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:05,300 INFO 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-02-18 10:08:05,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:05,308 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:08:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:05,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:05,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-02-18 10:08:05,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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-02-18 10:08:05,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-02-18 10:08:05,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 10:08:05,372 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:05,388 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:05,397 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:05,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:05,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:08:05,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:08:05,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:08:05,483 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:05,492 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:05,501 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:05,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:05,517 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-18 10:08:05,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-02-18 10:08:05,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:05,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:05,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 10:08:05,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,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, 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-02-18 10:08:05,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:05,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:05,612 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 10:08:05,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,694 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:05,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-02-18 10:08:05,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:05,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:05,720 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-02-18 10:08:05,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,746 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:05,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-02-18 10:08:05,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:05,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:05,772 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-02-18 10:08:05,802 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:05,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:05,846 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:05,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:05,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-02-18 10:08:05,866 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:05,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-18 10:08:05,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-18 10:08:05,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-02-18 10:08:05,866 INFO L87 Difference]: Start difference. First operand 62 states and 229 transitions. Second operand 13 states. [2019-02-18 10:08:06,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:06,732 INFO L93 Difference]: Finished difference Result 124 states and 443 transitions. [2019-02-18 10:08:06,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-18 10:08:06,732 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-02-18 10:08:06,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:06,734 INFO L225 Difference]: With dead ends: 124 [2019-02-18 10:08:06,734 INFO L226 Difference]: Without dead ends: 119 [2019-02-18 10:08:06,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=300, Unknown=0, NotChecked=0, Total=462 [2019-02-18 10:08:06,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-18 10:08:07,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 73. [2019-02-18 10:08:07,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-18 10:08:07,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 277 transitions. [2019-02-18 10:08:07,016 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 277 transitions. Word has length 8 [2019-02-18 10:08:07,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:07,016 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 277 transitions. [2019-02-18 10:08:07,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-18 10:08:07,017 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 277 transitions. [2019-02-18 10:08:07,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 10:08:07,017 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:07,017 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-02-18 10:08:07,018 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:07,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:07,018 INFO L82 PathProgramCache]: Analyzing trace with hash -592077742, now seen corresponding path program 1 times [2019-02-18 10:08:07,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:07,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:07,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:07,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:07,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:07,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 10:08:07,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:07,128 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:07,128 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 10:08:07,128 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [22], [24], [25] [2019-02-18 10:08:07,129 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:08:07,129 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:08:07,346 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:08:07,346 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:08:07,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:07,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:08:07,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:07,347 INFO 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-02-18 10:08:07,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:07,370 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:08:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:07,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:07,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-18 10:08:07,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 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-02-18 10:08:07,395 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-02-18 10:08:07,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:07,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:07,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:07,415 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-02-18 10:08:07,415 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:07,433 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:07,441 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:07,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:07,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2019-02-18 10:08:07,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2019-02-18 10:08:07,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:07,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:07,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:07,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 9 [2019-02-18 10:08:07,479 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:07,483 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:07,489 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:07,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:07,501 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:30, output treesize:33 [2019-02-18 10:08:07,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:07,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2019-02-18 10:08:07,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:08:07,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-18 10:08:07,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:35 [2019-02-18 10:08:07,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:07,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:07,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:07,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:07,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02-18 10:08:07,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:07,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:07,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:07,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:07,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:07,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:07,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 40 [2019-02-18 10:08:07,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:07,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-18 10:08:07,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:32 [2019-02-18 10:08:07,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:07,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:07,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:07,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:07,671 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-02-18 10:08:07,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:07,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:07,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:07,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:07,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:07,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:07,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 48 [2019-02-18 10:08:07,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:07,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-18 10:08:07,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:28 [2019-02-18 10:08:07,748 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:07,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:07,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:07,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:07,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-18 10:08:07,803 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:07,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 10:08:07,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 10:08:07,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:08:07,804 INFO L87 Difference]: Start difference. First operand 73 states and 277 transitions. Second operand 9 states. [2019-02-18 10:08:08,078 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2019-02-18 10:08:08,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:08,558 INFO L93 Difference]: Finished difference Result 87 states and 314 transitions. [2019-02-18 10:08:08,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 10:08:08,559 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-18 10:08:08,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:08,560 INFO L225 Difference]: With dead ends: 87 [2019-02-18 10:08:08,560 INFO L226 Difference]: Without dead ends: 80 [2019-02-18 10:08:08,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-02-18 10:08:08,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-18 10:08:08,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-02-18 10:08:08,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-18 10:08:08,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 297 transitions. [2019-02-18 10:08:08,887 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 297 transitions. Word has length 8 [2019-02-18 10:08:08,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:08,887 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 297 transitions. [2019-02-18 10:08:08,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 10:08:08,887 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 297 transitions. [2019-02-18 10:08:08,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 10:08:08,888 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:08,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:08:08,888 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:08,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:08,889 INFO L82 PathProgramCache]: Analyzing trace with hash -477682288, now seen corresponding path program 2 times [2019-02-18 10:08:08,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:08,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:08,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:08,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:08,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:09,034 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-18 10:08:09,114 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:08:09,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:09,115 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:09,115 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:08:09,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:08:09,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:09,115 INFO 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-02-18 10:08:09,124 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:08:09,124 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:08:09,129 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 10:08:09,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:08:09,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:09,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-02-18 10:08:09,136 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-02-18 10:08:09,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,144 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-02-18 10:08:09,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-02-18 10:08:09,150 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:09,166 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:09,175 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:09,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:09,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-18 10:08:09,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-18 10:08:09,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,240 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 10:08:09,241 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:09,249 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:09,258 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:09,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:09,274 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:41, output treesize:41 [2019-02-18 10:08:09,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 10:08:09,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:08:09,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-18 10:08:09,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:58 [2019-02-18 10:08:09,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-02-18 10:08:09,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:09,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,476 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:09,476 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 30 treesize of output 34 [2019-02-18 10:08:09,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:09,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-18 10:08:09,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:74, output treesize:54 [2019-02-18 10:08:09,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,550 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:09,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 77 [2019-02-18 10:08:09,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:09,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,593 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 38 treesize of output 34 [2019-02-18 10:08:09,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:09,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-18 10:08:09,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:48 [2019-02-18 10:08:09,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2019-02-18 10:08:09,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:09,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,701 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:09,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 78 [2019-02-18 10:08:09,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:09,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 10:08:09,738 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:68, output treesize:48 [2019-02-18 10:08:09,775 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:09,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:09,825 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:09,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:09,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-02-18 10:08:09,844 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:09,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-18 10:08:09,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-18 10:08:09,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-02-18 10:08:09,845 INFO L87 Difference]: Start difference. First operand 78 states and 297 transitions. Second operand 13 states. [2019-02-18 10:08:11,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:11,115 INFO L93 Difference]: Finished difference Result 186 states and 694 transitions. [2019-02-18 10:08:11,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 10:08:11,116 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-02-18 10:08:11,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:11,117 INFO L225 Difference]: With dead ends: 186 [2019-02-18 10:08:11,117 INFO L226 Difference]: Without dead ends: 177 [2019-02-18 10:08:11,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2019-02-18 10:08:11,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-02-18 10:08:11,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 95. [2019-02-18 10:08:11,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-18 10:08:11,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 371 transitions. [2019-02-18 10:08:11,522 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 371 transitions. Word has length 8 [2019-02-18 10:08:11,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:11,523 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 371 transitions. [2019-02-18 10:08:11,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-18 10:08:11,523 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 371 transitions. [2019-02-18 10:08:11,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 10:08:11,523 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:11,523 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:08:11,523 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:11,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:11,524 INFO L82 PathProgramCache]: Analyzing trace with hash -931909288, now seen corresponding path program 1 times [2019-02-18 10:08:11,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:11,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:11,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:08:11,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:11,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:11,642 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 10:08:11,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:11,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:11,643 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 10:08:11,643 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [24], [25] [2019-02-18 10:08:11,644 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:08:11,645 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:08:12,258 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:08:12,258 INFO L272 AbstractInterpreter]: Visited 8 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:08:12,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:12,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:08:12,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:12,259 INFO 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-02-18 10:08:12,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:12,271 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:08:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:12,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:12,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:08:12,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:08:12,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:08:12,377 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:12,387 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:12,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:12,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-02-18 10:08:12,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-02-18 10:08:12,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, 6 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-02-18 10:08:12,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-02-18 10:08:12,418 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:12,431 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:12,440 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:12,447 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:12,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:12,465 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 10:08:12,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,491 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-02-18 10:08:12,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:12,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:12,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 10:08:12,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-02-18 10:08:12,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:12,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:12,553 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 10:08:12,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,579 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,582 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:12,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-02-18 10:08:12,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:12,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:12,605 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-02-18 10:08:12,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,638 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-02-18 10:08:12,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:12,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:12,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-02-18 10:08:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:12,687 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:12,730 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:12,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:12,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-18 10:08:12,749 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:12,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 10:08:12,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 10:08:12,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-18 10:08:12,750 INFO L87 Difference]: Start difference. First operand 95 states and 371 transitions. Second operand 12 states. [2019-02-18 10:08:13,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:13,499 INFO L93 Difference]: Finished difference Result 110 states and 418 transitions. [2019-02-18 10:08:13,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 10:08:13,503 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-18 10:08:13,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:13,504 INFO L225 Difference]: With dead ends: 110 [2019-02-18 10:08:13,504 INFO L226 Difference]: Without dead ends: 80 [2019-02-18 10:08:13,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2019-02-18 10:08:13,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-18 10:08:13,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 26. [2019-02-18 10:08:13,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-18 10:08:13,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-02-18 10:08:13,606 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 9 [2019-02-18 10:08:13,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:13,606 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-02-18 10:08:13,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 10:08:13,606 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-02-18 10:08:13,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 10:08:13,607 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:13,607 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:08:13,607 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:13,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:13,607 INFO L82 PathProgramCache]: Analyzing trace with hash -898856470, now seen corresponding path program 3 times [2019-02-18 10:08:13,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:13,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:13,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:13,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:13,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:13,805 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-02-18 10:08:13,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:13,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:13,806 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:08:13,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:08:13,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:13,806 INFO 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-02-18 10:08:13,815 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:08:13,815 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:08:13,819 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:08:13,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:08:13,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:13,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:13,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:08:13,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:13,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:13,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:08:13,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:13,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:13,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:13,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:13,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-02-18 10:08:13,890 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:13,900 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:13,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:13,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-02-18 10:08:13,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-02-18 10:08:13,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 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-02-18 10:08:13,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-02-18 10:08:13,931 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:13,945 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:13,952 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:13,960 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:13,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:13,978 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-18 10:08:14,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,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 51 [2019-02-18 10:08:14,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:14,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:14,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 10:08:14,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-02-18 10:08:14,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:14,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:14,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:25 [2019-02-18 10:08:14,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,106 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:14,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 77 [2019-02-18 10:08:14,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:14,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:14,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:27 [2019-02-18 10:08:14,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,154 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:14,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-02-18 10:08:14,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:14,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:14,180 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:29 [2019-02-18 10:08:14,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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 59 [2019-02-18 10:08:14,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:14,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:14,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2019-02-18 10:08:14,251 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:14,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:14,325 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:14,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:14,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-02-18 10:08:14,345 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:14,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-18 10:08:14,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-18 10:08:14,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-02-18 10:08:14,346 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 13 states. [2019-02-18 10:08:14,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:14,837 INFO L93 Difference]: Finished difference Result 32 states and 109 transitions. [2019-02-18 10:08:14,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 10:08:14,837 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-02-18 10:08:14,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:14,838 INFO L225 Difference]: With dead ends: 32 [2019-02-18 10:08:14,838 INFO L226 Difference]: Without dead ends: 0 [2019-02-18 10:08:14,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-02-18 10:08:14,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-18 10:08:14,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-18 10:08:14,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-18 10:08:14,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-18 10:08:14,839 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2019-02-18 10:08:14,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:14,839 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-18 10:08:14,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-18 10:08:14,839 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-18 10:08:14,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-18 10:08:14,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-18 10:08:14,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:08:14,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:08:15,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:08:15,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:08:15,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:08:15,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:08:15,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:08:15,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:08:15,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:08:15,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:08:15,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:08:15,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:08:15,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:08:15,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:08:15,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:08:15,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:08:16,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:08:16,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:08:16,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:08:16,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:08:21,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:08:21,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:08:25,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:08:28,478 WARN L181 SmtUtils]: Spent 13.63 s on a formula simplification. DAG size of input: 1516 DAG size of output: 1068 [2019-02-18 10:08:41,737 WARN L181 SmtUtils]: Spent 13.25 s on a formula simplification. DAG size of input: 1007 DAG size of output: 76 [2019-02-18 10:08:41,740 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-02-18 10:08:41,740 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 42) no Hoare annotation was computed. [2019-02-18 10:08:41,740 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-02-18 10:08:41,740 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 41) no Hoare annotation was computed. [2019-02-18 10:08:41,740 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-02-18 10:08:41,741 INFO L444 ceAbstractionStarter]: At program point L32-1(lines 27 37) the Hoare annotation is: (let ((.cse3 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse7 (select |#memory_int| ULTIMATE.start_main_p1)) (.cse17 (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse3 1)))) (let ((.cse2 (select |#memory_int| ULTIMATE.start_main_p2)) (.cse9 (= 0 (select .cse17 ULTIMATE.start_main_p1))) (.cse6 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4))) (.cse10 (= 0 (select .cse17 ULTIMATE.start_main_p2))) (.cse5 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4))) (.cse4 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (.cse11 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse7 1))) (.cse8 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (.cse0 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4))) (.cse1 (select |#memory_int| ULTIMATE.start_main_p4))) (or (and .cse0 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= .cse1 0) (<= .cse2 0) (= .cse3 0) .cse4 .cse5 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) .cse6 (<= 0 .cse7)) (and (and .cse8 .cse9 (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse2 (- 1))) ULTIMATE.start_main_p3)) .cse10) (<= (+ (select .cse11 ULTIMATE.start_main_p4) 1) 0)) (and (<= .cse1 0) (let ((.cse12 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse1 (- 1))))) (or (and .cse0 .cse8 .cse9 .cse6 .cse10 (<= 1 (select .cse12 ULTIMATE.start_main_p3))) (and .cse5 (let ((.cse16 (select .cse12 ULTIMATE.start_main_p1))) (let ((.cse14 (and .cse8 (<= 1 .cse16) .cse0)) (.cse13 (<= 0 .cse3))) (or (and .cse13 (= 0 (select .cse12 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) .cse14) (let ((.cse15 (<= (+ (select .cse11 ULTIMATE.start_main_p2) 1) 0))) (or (and (and .cse13 .cse14) .cse15) (and .cse13 .cse15 (= 0 .cse16) .cse4)))))))))))))) [2019-02-18 10:08:41,741 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-02-18 10:08:41,741 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 40) no Hoare annotation was computed. [2019-02-18 10:08:41,741 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 39) no Hoare annotation was computed. [2019-02-18 10:08:41,741 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 44) no Hoare annotation was computed. [2019-02-18 10:08:41,741 INFO L448 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-02-18 10:08:41,767 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 10:08:41 BoogieIcfgContainer [2019-02-18 10:08:41,767 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-18 10:08:41,768 INFO L168 Benchmark]: Toolchain (without parser) took 111788.34 ms. Allocated memory was 135.8 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 110.9 MB in the beginning and 493.2 MB in the end (delta: -382.3 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-02-18 10:08:41,769 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 135.8 MB. Free memory is still 111.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-18 10:08:41,769 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.14 ms. Allocated memory is still 135.8 MB. Free memory was 110.5 MB in the beginning and 108.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-02-18 10:08:41,769 INFO L168 Benchmark]: Boogie Preprocessor took 33.96 ms. Allocated memory is still 135.8 MB. Free memory was 108.4 MB in the beginning and 107.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-18 10:08:41,769 INFO L168 Benchmark]: RCFGBuilder took 464.04 ms. Allocated memory is still 135.8 MB. Free memory was 107.1 MB in the beginning and 96.6 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2019-02-18 10:08:41,770 INFO L168 Benchmark]: TraceAbstraction took 111233.67 ms. Allocated memory was 135.8 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 96.6 MB in the beginning and 493.2 MB in the end (delta: -396.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-02-18 10:08:41,775 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 135.8 MB. Free memory is still 111.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 53.14 ms. Allocated memory is still 135.8 MB. Free memory was 110.5 MB in the beginning and 108.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.96 ms. Allocated memory is still 135.8 MB. Free memory was 108.4 MB in the beginning and 107.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 464.04 ms. Allocated memory is still 135.8 MB. Free memory was 107.1 MB in the beginning and 96.6 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 111233.67 ms. Allocated memory was 135.8 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 96.6 MB in the beginning and 493.2 MB in the end (delta: -396.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 40]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 41]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 42]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 39]: 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: 27]: Loop Invariant Derived loop invariant: ((((((((((!(p1 == p4) && !(p2 == p1)) && #memory_int[p4] == 0) && #memory_int[p2] <= 0) && #memory_int[p3] == 0) && !(p1 == p3)) && !(p3 == p4)) && !(p3 == p2)) && !(p2 == p4)) && 0 <= #memory_int[p1]) || ((((!(p1 == p2) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1]) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p3]) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0)) || (#memory_int[p4] <= 0 && ((((((!(p1 == p4) && !(p1 == p2)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1]) && !(p2 == p4)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) || (!(p3 == p4) && ((((0 <= #memory_int[p3] && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && !(p2 == p3)) && (!(p1 == p2) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p4)) || ((0 <= #memory_int[p3] && (!(p1 == p2) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p4)) && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0) || (((0 <= #memory_int[p3] && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p3)))))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 4 error locations. SAFE Result, 111.1s OverallTime, 55 OverallIterations, 3 TraceHistogramMax, 22.7s AutomataDifference, 0.0s DeadEndRemovalTime, 26.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 198 SDtfs, 956 SDslu, 1 SDs, 0 SdLazy, 9084 SolverSat, 820 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 838 GetRequests, 140 SyntacticMatches, 32 SemanticMatches, 666 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2560 ImplicationChecksByTransitivity, 16.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 23.7s AbstIntTime, 36 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.3s AutomataMinimizationTime, 55 MinimizatonAttempts, 1314 StatesRemovedByMinimization, 53 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 46 NumberOfFragments, 286 HoareAnnotationTreeSize, 1 FomulaSimplifications, 4050516002 FormulaSimplificationTreeSizeReduction, 13.6s HoareSimplificationTime, 1 FomulaSimplificationsInter, 39887995 FormulaSimplificationTreeSizeReductionInter, 13.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 31.7s InterpolantComputationTime, 609 NumberOfCodeBlocks, 609 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 748 ConstructedInterpolants, 222 QuantifiedInterpolants, 91527 SizeOfPredicates, 243 NumberOfNonLiveVariables, 1010 ConjunctsInSsa, 643 ConjunctsInUnsatCore, 157 InterpolantComputations, 7 PerfectInterpolantSequences, 155/871 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...