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_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-8-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:40:13,907 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:40:13,910 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:40:13,922 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:40:13,922 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:40:13,923 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:40:13,925 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:40:13,926 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:40:13,928 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:40:13,929 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:40:13,930 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:40:13,930 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:40:13,931 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:40:13,932 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:40:13,933 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:40:13,934 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:40:13,935 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:40:13,937 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:40:13,939 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:40:13,940 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:40:13,941 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:40:13,943 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:40:13,945 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:40:13,945 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:40:13,946 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:40:13,947 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:40:13,948 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:40:13,952 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:40:13,954 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:40:13,955 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:40:13,955 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:40:13,957 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:40:13,957 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:40:13,957 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:40:13,958 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:40:13,959 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:40:13,959 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_oct.epf [2019-03-04 16:40:13,983 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:40:13,983 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:40:13,984 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:40:13,984 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:40:13,985 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:40:13,985 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:40:13,985 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:40:13,985 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:40:13,985 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:40:13,986 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:40:13,986 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2019-03-04 16:40:13,986 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:40:13,986 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:40:13,987 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:40:13,987 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:40:13,988 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:40:13,988 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:40:13,988 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:40:13,988 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:40:13,988 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:40:13,989 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:40:13,989 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:40:13,989 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:40:13,989 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:40:13,989 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:40:13,989 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:40:13,990 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:40:13,991 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:40:13,991 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:40:13,991 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:40:13,991 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:40:13,992 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:40:13,992 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:40:13,992 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:40:13,992 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-03-04 16:40:13,992 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:40:13,992 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:40:13,993 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:40:13,993 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:40:14,024 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:40:14,037 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:40:14,040 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:40:14,042 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:40:14,043 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:40:14,043 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-8-unlimited.bpl [2019-03-04 16:40:14,044 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-8-unlimited.bpl' [2019-03-04 16:40:14,082 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:40:14,084 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:40:14,085 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:40:14,085 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:40:14,085 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:40:14,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:40:14" (1/1) ... [2019-03-04 16:40:14,114 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:40:14" (1/1) ... [2019-03-04 16:40:14,151 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:40:14,152 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:40:14,152 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:40:14,152 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:40:14,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:40:14" (1/1) ... [2019-03-04 16:40:14,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:40:14" (1/1) ... [2019-03-04 16:40:14,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:40:14" (1/1) ... [2019-03-04 16:40:14,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:40:14" (1/1) ... [2019-03-04 16:40:14,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:40:14" (1/1) ... [2019-03-04 16:40:14,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:40:14" (1/1) ... [2019-03-04 16:40:14,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:40:14" (1/1) ... [2019-03-04 16:40:14,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:40:14,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:40:14,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:40:14,195 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:40:14,199 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:40:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:40:14,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-03-04 16:40:14,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-03-04 16:40:14,709 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-03-04 16:40:14,709 INFO L286 CfgBuilder]: Removed 19 assue(true) statements. [2019-03-04 16:40:14,710 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:40:14 BoogieIcfgContainer [2019-03-04 16:40:14,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:40:14,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:40:14,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:40:14,720 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:40:14,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:40:14" (1/2) ... [2019-03-04 16:40:14,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d57738 and model type speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:40:14, skipping insertion in model container [2019-03-04 16:40:14,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:40:14" (2/2) ... [2019-03-04 16:40:14,723 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-8-unlimited.bpl [2019-03-04 16:40:14,733 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:40:14,741 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-03-04 16:40:14,754 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-03-04 16:40:14,784 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:40:14,784 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:40:14,784 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:40:14,785 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:40:14,785 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:40:14,785 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:40:14,785 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:40:14,785 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:40:14,798 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-03-04 16:40:14,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-03-04 16:40:14,804 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:14,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-03-04 16:40:14,809 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:14,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:14,815 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 1 times [2019-03-04 16:40:14,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:14,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:14,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:14,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:14,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:15,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:15,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:40:15,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:40:15,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:40:15,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:40:15,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:40:15,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:40:15,053 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-03-04 16:40:15,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:15,255 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2019-03-04 16:40:15,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:40:15,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-03-04 16:40:15,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:15,273 INFO L225 Difference]: With dead ends: 37 [2019-03-04 16:40:15,274 INFO L226 Difference]: Without dead ends: 32 [2019-03-04 16:40:15,280 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-03-04 16:40:15,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-03-04 16:40:15,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2019-03-04 16:40:15,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-03-04 16:40:15,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2019-03-04 16:40:15,315 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 2 [2019-03-04 16:40:15,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:15,317 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2019-03-04 16:40:15,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:40:15,317 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2019-03-04 16:40:15,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:40:15,318 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:15,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:40:15,319 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:15,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:15,319 INFO L82 PathProgramCache]: Analyzing trace with hash 30818, now seen corresponding path program 1 times [2019-03-04 16:40:15,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:15,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:15,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:15,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:15,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:15,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:15,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:15,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:15,488 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:40:15,490 INFO L207 CegarAbsIntRunner]: [0], [32], [35] [2019-03-04 16:40:15,543 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:15,544 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:15,606 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:15,608 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:40:15,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:15,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:15,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:15,615 INFO 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-03-04 16:40:15,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:15,631 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:15,675 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 20 conjunts are in the unsatisfiable core [2019-03-04 16:40:15,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:15,866 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:40:15,926 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:15,928 INFO L453 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 30 treesize of output 32 [2019-03-04 16:40:15,994 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,022 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,047 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,050 INFO L453 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 32 treesize of output 34 [2019-03-04 16:40:16,090 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,126 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,136 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,158 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,164 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,168 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:40:16,190 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,192 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,218 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,242 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,248 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,258 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,265 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,267 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,276 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,279 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:40:16,337 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,367 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,390 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,412 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,439 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,464 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,494 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,516 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,541 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,544 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,546 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,550 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,552 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,552 INFO L301 Elim1Store]: Index analysis took 236 ms [2019-03-04 16:40:16,555 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:40:16,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,633 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,639 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,653 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,674 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,680 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,687 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,688 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,689 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,690 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,724 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,726 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,743 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,789 INFO L301 Elim1Store]: Index analysis took 200 ms [2019-03-04 16:40:16,795 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:40:16,823 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,825 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,827 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,831 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,832 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,835 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,836 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,837 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,840 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,843 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,845 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,849 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,855 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,858 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,859 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,872 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,876 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,877 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,878 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,879 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,880 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,884 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,885 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,887 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,888 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,890 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,892 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,895 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2019-03-04 16:40:16,896 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:16,997 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:17,022 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:17,044 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:17,067 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:17,116 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:17,197 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:17,413 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:17,660 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2019-03-04 16:40:17,661 INFO L309 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:17,676 INFO L309 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:17,705 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:17,750 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:17,798 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:17,860 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:17,968 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:18,081 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:18,241 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:18,241 INFO L209 ElimStorePlain]: Needed 17 recursive calls to eliminate 8 variables, input treesize:147, output treesize:153 [2019-03-04 16:40:18,309 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2019-03-04 16:40:18,310 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:18,523 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:18,523 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:163, output treesize:127 [2019-03-04 16:40:18,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:18,618 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:18,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:18,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:18,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:40:18,654 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:18,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:40:18,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:40:18,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:40:18,655 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 6 states. [2019-03-04 16:40:30,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:30,575 INFO L93 Difference]: Finished difference Result 63 states and 92 transitions. [2019-03-04 16:40:30,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:40:30,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:40:30,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:30,577 INFO L225 Difference]: With dead ends: 63 [2019-03-04 16:40:30,577 INFO L226 Difference]: Without dead ends: 60 [2019-03-04 16:40:30,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:40:30,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-03-04 16:40:30,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 25. [2019-03-04 16:40:30,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-03-04 16:40:30,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 53 transitions. [2019-03-04 16:40:30,586 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 53 transitions. Word has length 3 [2019-03-04 16:40:30,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:30,587 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 53 transitions. [2019-03-04 16:40:30,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:40:30,587 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 53 transitions. [2019-03-04 16:40:30,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:40:30,587 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:30,587 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:40:30,588 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:30,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:30,588 INFO L82 PathProgramCache]: Analyzing trace with hash 30384, now seen corresponding path program 1 times [2019-03-04 16:40:30,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:30,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:30,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:30,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:30,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:30,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:30,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:30,672 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:30,672 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:40:30,673 INFO L207 CegarAbsIntRunner]: [0], [18], [35] [2019-03-04 16:40:30,674 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:30,674 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:30,686 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:30,687 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:40:30,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:30,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:30,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:30,687 INFO 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-03-04 16:40:30,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:30,696 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:30,703 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:40:30,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:30,726 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:40:30,751 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,752 INFO L453 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 30 treesize of output 32 [2019-03-04 16:40:30,762 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,767 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,768 INFO L453 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 32 treesize of output 34 [2019-03-04 16:40:30,778 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,780 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,782 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,784 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,787 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:40:30,799 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,801 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,806 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,808 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,811 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,813 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,815 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:40:30,852 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,878 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,895 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,899 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,901 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,904 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,905 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,906 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,906 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,907 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,909 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,910 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,912 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,913 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,915 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:40:30,961 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,963 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,965 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,966 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,966 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,967 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,968 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,969 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,971 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,972 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,973 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,975 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,976 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,978 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,979 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,980 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,982 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,985 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,986 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,987 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,990 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:40:30,995 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,996 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,997 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,998 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,999 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,001 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,002 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,004 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,005 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,006 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,008 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,009 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,011 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,012 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,013 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,018 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,019 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,020 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,022 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,105 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:40:31,107 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:31,128 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:31,147 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:31,172 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:31,190 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:31,208 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:31,226 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:31,247 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:31,441 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:40:31,442 INFO L309 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:31,470 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:31,520 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:31,540 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:31,568 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:31,602 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:31,655 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:31,757 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:31,757 INFO L209 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:121, output treesize:125 [2019-03-04 16:40:31,812 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:40:31,813 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:31,883 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:31,883 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:98 [2019-03-04 16:40:32,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:32,013 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:32,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:32,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:32,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:40:32,048 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:32,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:40:32,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:40:32,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:40:32,049 INFO L87 Difference]: Start difference. First operand 25 states and 53 transitions. Second operand 6 states. [2019-03-04 16:40:32,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:32,992 INFO L93 Difference]: Finished difference Result 62 states and 99 transitions. [2019-03-04 16:40:32,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:40:32,992 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:40:32,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:32,995 INFO L225 Difference]: With dead ends: 62 [2019-03-04 16:40:32,995 INFO L226 Difference]: Without dead ends: 60 [2019-03-04 16:40:32,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:40:32,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-03-04 16:40:33,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 26. [2019-03-04 16:40:33,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-03-04 16:40:33,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 61 transitions. [2019-03-04 16:40:33,003 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 61 transitions. Word has length 3 [2019-03-04 16:40:33,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:33,003 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 61 transitions. [2019-03-04 16:40:33,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:40:33,004 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 61 transitions. [2019-03-04 16:40:33,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:40:33,004 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:33,004 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:40:33,005 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:33,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:33,005 INFO L82 PathProgramCache]: Analyzing trace with hash 30944, now seen corresponding path program 1 times [2019-03-04 16:40:33,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:33,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:33,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:33,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:33,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:33,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:33,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:40:33,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:40:33,081 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:40:33,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:40:33,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:40:33,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:40:33,082 INFO L87 Difference]: Start difference. First operand 26 states and 61 transitions. Second operand 3 states. [2019-03-04 16:40:33,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:33,521 INFO L93 Difference]: Finished difference Result 31 states and 61 transitions. [2019-03-04 16:40:33,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:40:33,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-03-04 16:40:33,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:33,522 INFO L225 Difference]: With dead ends: 31 [2019-03-04 16:40:33,522 INFO L226 Difference]: Without dead ends: 30 [2019-03-04 16:40:33,522 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-03-04 16:40:33,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-03-04 16:40:33,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2019-03-04 16:40:33,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-03-04 16:40:33,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 60 transitions. [2019-03-04 16:40:33,528 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 60 transitions. Word has length 3 [2019-03-04 16:40:33,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:33,529 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 60 transitions. [2019-03-04 16:40:33,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:40:33,529 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 60 transitions. [2019-03-04 16:40:33,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:40:33,529 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:33,529 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:40:33,530 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:33,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:33,530 INFO L82 PathProgramCache]: Analyzing trace with hash 30012, now seen corresponding path program 1 times [2019-03-04 16:40:33,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:33,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:33,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:33,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:33,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:33,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:33,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:33,699 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:40:33,699 INFO L207 CegarAbsIntRunner]: [0], [6], [35] [2019-03-04 16:40:33,701 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:33,701 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:33,713 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:33,713 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:40:33,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:33,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:33,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:33,714 INFO 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-03-04 16:40:33,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:33,727 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:33,743 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:40:33,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:33,843 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:40:33,844 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:33,884 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:33,896 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:33,907 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:33,929 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:33,958 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:34,005 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:34,063 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:40:34,068 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:40:34,083 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-03-04 16:40:34,088 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:40:34,109 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:40:34,137 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:40:34,167 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:40:34,261 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:40:34,263 INFO L309 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:34,277 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:34,294 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:34,312 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:34,328 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:34,345 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:34,363 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:34,379 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:34,453 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:34,453 INFO L209 ElimStorePlain]: Needed 16 recursive calls to eliminate 9 variables, input treesize:121, output treesize:125 [2019-03-04 16:40:34,551 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:40:34,552 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:34,616 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:34,617 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:96 [2019-03-04 16:40:34,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:34,638 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:34,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:34,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:40:34,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-03-04 16:40:34,661 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:40:34,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:40:34,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:40:34,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:40:34,662 INFO L87 Difference]: Start difference. First operand 26 states and 60 transitions. Second operand 4 states. [2019-03-04 16:40:34,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:34,897 INFO L93 Difference]: Finished difference Result 32 states and 98 transitions. [2019-03-04 16:40:34,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:40:34,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-03-04 16:40:34,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:34,899 INFO L225 Difference]: With dead ends: 32 [2019-03-04 16:40:34,899 INFO L226 Difference]: Without dead ends: 31 [2019-03-04 16:40:34,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:40:34,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-03-04 16:40:34,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-03-04 16:40:34,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-03-04 16:40:34,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2019-03-04 16:40:34,908 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 3 [2019-03-04 16:40:34,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:34,908 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2019-03-04 16:40:34,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:40:34,908 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2019-03-04 16:40:34,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:40:34,909 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:34,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:40:34,910 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:34,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:34,910 INFO L82 PathProgramCache]: Analyzing trace with hash 30136, now seen corresponding path program 1 times [2019-03-04 16:40:34,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:34,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:34,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:34,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:34,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:35,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:35,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:35,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:35,045 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:40:35,045 INFO L207 CegarAbsIntRunner]: [0], [10], [35] [2019-03-04 16:40:35,046 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:35,046 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:35,055 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:35,055 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:40:35,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:35,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:35,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:35,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:40:35,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:35,065 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:35,072 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:40:35,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:35,086 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:40:35,092 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,094 INFO L453 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 30 treesize of output 32 [2019-03-04 16:40:35,103 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,105 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,107 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,108 INFO L453 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 32 treesize of output 34 [2019-03-04 16:40:35,131 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,133 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,136 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,138 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,140 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,142 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,143 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:40:35,166 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,168 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,171 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,176 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,180 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,181 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,182 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,182 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,183 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,185 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:40:35,197 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,199 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,199 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,202 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,203 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,205 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,206 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,209 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,211 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,212 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,214 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,217 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,218 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:40:35,226 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,228 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,229 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,230 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,232 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,233 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,235 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,236 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,238 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,239 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,241 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,242 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,244 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,245 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,247 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,248 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,250 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,251 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,253 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,254 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,258 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:40:35,264 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,266 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,267 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,280 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,282 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,283 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,285 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,288 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,315 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,327 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,331 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,391 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:40:35,393 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:35,417 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:35,435 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:35,453 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:35,472 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:35,492 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:35,515 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:35,542 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:35,673 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:40:35,674 INFO L309 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:35,688 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:35,702 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:35,733 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:35,780 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:35,836 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:35,893 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:35,965 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:35,965 INFO L209 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:121, output treesize:125 [2019-03-04 16:40:36,005 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:40:36,006 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:36,070 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:36,070 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:98 [2019-03-04 16:40:36,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:36,092 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:36,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:36,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:36,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:40:36,127 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:36,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:40:36,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:40:36,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:40:36,128 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 6 states. [2019-03-04 16:40:37,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:37,151 INFO L93 Difference]: Finished difference Result 65 states and 143 transitions. [2019-03-04 16:40:37,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:40:37,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:40:37,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:37,153 INFO L225 Difference]: With dead ends: 65 [2019-03-04 16:40:37,153 INFO L226 Difference]: Without dead ends: 64 [2019-03-04 16:40:37,153 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-03-04 16:40:37,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-03-04 16:40:37,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 32. [2019-03-04 16:40:37,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-03-04 16:40:37,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 115 transitions. [2019-03-04 16:40:37,163 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 115 transitions. Word has length 3 [2019-03-04 16:40:37,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:37,163 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 115 transitions. [2019-03-04 16:40:37,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:40:37,164 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 115 transitions. [2019-03-04 16:40:37,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:40:37,164 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:37,164 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:40:37,165 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:37,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:37,165 INFO L82 PathProgramCache]: Analyzing trace with hash 30632, now seen corresponding path program 1 times [2019-03-04 16:40:37,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:37,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:37,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:37,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:37,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:37,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:37,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:37,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:37,282 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:40:37,282 INFO L207 CegarAbsIntRunner]: [0], [26], [35] [2019-03-04 16:40:37,284 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:37,284 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:37,293 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:37,293 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:40:37,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:37,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:37,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:37,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:40:37,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:37,307 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:37,315 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:40:37,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:37,326 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:40:37,333 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,334 INFO L453 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 30 treesize of output 32 [2019-03-04 16:40:37,344 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,346 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,349 INFO L453 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 32 treesize of output 34 [2019-03-04 16:40:37,355 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,356 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,358 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,360 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,362 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,364 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,366 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:40:37,372 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,374 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,376 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,378 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,380 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,382 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,384 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,386 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,390 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,391 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,392 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:40:37,401 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,404 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,406 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,406 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,409 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,410 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,411 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,412 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,413 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,415 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,416 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,418 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,419 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,420 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,422 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:40:37,434 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,435 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,436 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,437 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,439 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,440 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,442 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,443 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,444 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,446 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,449 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,450 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,451 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,453 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,454 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,456 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,461 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,463 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:40:37,470 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,471 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,472 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,473 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,475 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,477 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,479 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,480 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,482 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,483 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,485 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,486 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,487 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,495 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,496 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,497 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,498 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,500 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,501 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,503 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,557 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:40:37,559 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:37,682 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:37,701 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:37,724 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:37,743 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:37,761 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:37,779 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:37,798 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:37,897 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:40:37,898 INFO L309 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:37,903 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:37,919 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:37,940 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:37,964 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:37,998 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:38,041 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:38,144 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:38,145 INFO L209 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:121, output treesize:125 [2019-03-04 16:40:38,340 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-03-04 16:40:38,373 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:40:38,374 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:38,600 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:38,600 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:98 [2019-03-04 16:40:38,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:38,618 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:38,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:38,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:38,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:40:38,648 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:38,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:40:38,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:40:38,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:40:38,649 INFO L87 Difference]: Start difference. First operand 32 states and 115 transitions. Second operand 6 states. [2019-03-04 16:40:39,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:39,377 INFO L93 Difference]: Finished difference Result 67 states and 161 transitions. [2019-03-04 16:40:39,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:40:39,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:40:39,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:39,379 INFO L225 Difference]: With dead ends: 67 [2019-03-04 16:40:39,379 INFO L226 Difference]: Without dead ends: 65 [2019-03-04 16:40:39,379 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-03-04 16:40:39,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-03-04 16:40:39,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 34. [2019-03-04 16:40:39,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-03-04 16:40:39,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 132 transitions. [2019-03-04 16:40:39,389 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 132 transitions. Word has length 3 [2019-03-04 16:40:39,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:39,389 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 132 transitions. [2019-03-04 16:40:39,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:40:39,389 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 132 transitions. [2019-03-04 16:40:39,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:40:39,390 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:39,390 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:40:39,391 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:39,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:39,391 INFO L82 PathProgramCache]: Analyzing trace with hash 954866, now seen corresponding path program 1 times [2019-03-04 16:40:39,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:39,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:39,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:39,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:39,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:39,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:39,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:39,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:39,487 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:40:39,487 INFO L207 CegarAbsIntRunner]: [0], [18], [32], [35] [2019-03-04 16:40:39,489 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:39,489 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:39,495 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:39,495 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:40:39,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:39,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:39,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:39,496 INFO 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-03-04 16:40:39,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:39,508 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:39,515 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 21 conjunts are in the unsatisfiable core [2019-03-04 16:40:39,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:39,534 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:40:39,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,543 INFO L453 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 30 treesize of output 32 [2019-03-04 16:40:39,550 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,552 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,555 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,556 INFO L453 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 32 treesize of output 34 [2019-03-04 16:40:39,562 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,564 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,566 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,569 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,573 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,574 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:40:39,578 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,586 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,587 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,589 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,590 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,591 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,593 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:40:39,599 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,601 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,602 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,603 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,606 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,609 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,610 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,612 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,613 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,614 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,616 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,617 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,619 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,620 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:40:39,628 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,631 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,632 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,634 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,635 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,636 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,638 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,639 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,641 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,642 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,645 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,646 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,648 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,649 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,650 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,652 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,653 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,654 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,656 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:40:39,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,663 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,664 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,665 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,667 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,668 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,671 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,672 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,674 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,675 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,678 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,682 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,684 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,685 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,688 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,689 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,692 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,693 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,695 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,696 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,697 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,699 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,701 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2019-03-04 16:40:39,702 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:39,787 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:39,806 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:39,894 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:39,913 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:39,932 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:39,954 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:39,973 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,152 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2019-03-04 16:40:40,153 INFO L309 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,158 INFO L309 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,179 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,199 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,233 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,278 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,319 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,385 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,479 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:40,479 INFO L209 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:147, output treesize:153 [2019-03-04 16:40:40,582 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2019-03-04 16:40:40,582 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,696 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:40,696 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:163, output treesize:127 [2019-03-04 16:40:40,829 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 53 treesize of output 55 [2019-03-04 16:40:40,830 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:40,921 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:40,921 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:137, output treesize:109 [2019-03-04 16:40:40,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:40,966 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:41,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:41,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:41,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:40:41,071 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:41,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:40:41,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:40:41,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:40:41,072 INFO L87 Difference]: Start difference. First operand 34 states and 132 transitions. Second operand 8 states. [2019-03-04 16:40:41,280 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-03-04 16:40:47,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:47,546 INFO L93 Difference]: Finished difference Result 82 states and 191 transitions. [2019-03-04 16:40:47,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:40:47,546 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:40:47,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:47,548 INFO L225 Difference]: With dead ends: 82 [2019-03-04 16:40:47,548 INFO L226 Difference]: Without dead ends: 80 [2019-03-04 16:40:47,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:40:47,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-03-04 16:40:47,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 36. [2019-03-04 16:40:47,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-03-04 16:40:47,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 128 transitions. [2019-03-04 16:40:47,557 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 128 transitions. Word has length 4 [2019-03-04 16:40:47,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:47,558 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 128 transitions. [2019-03-04 16:40:47,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:40:47,558 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 128 transitions. [2019-03-04 16:40:47,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:40:47,559 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:47,559 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:40:47,559 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:47,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:47,559 INFO L82 PathProgramCache]: Analyzing trace with hash 955426, now seen corresponding path program 1 times [2019-03-04 16:40:47,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:47,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:47,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:47,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:47,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:47,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:47,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:47,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:47,611 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:40:47,611 INFO L207 CegarAbsIntRunner]: [0], [32], [36], [37] [2019-03-04 16:40:47,612 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:47,613 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:47,619 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:47,619 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:40:47,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:47,619 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:47,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:47,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 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-03-04 16:40:47,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:47,628 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:47,653 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:40:47,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:48,141 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:40:48,142 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:48,227 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:48,258 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:48,293 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:48,341 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:48,404 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:48,476 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 27 treesize of output 30 [2019-03-04 16:40:48,496 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 35 [2019-03-04 16:40:48,507 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 14 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-03-04 16:40:48,519 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 17 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:40:48,526 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:40:48,543 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:40:48,552 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:40:48,619 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:40:48,621 INFO L309 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:48,660 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:48,677 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:48,694 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:48,711 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:48,727 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:48,744 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:48,761 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:48,828 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:48,828 INFO L209 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:113, output treesize:121 [2019-03-04 16:40:49,049 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 20 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 22 case distinctions, treesize of input 51 treesize of output 95 [2019-03-04 16:40:49,050 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-03-04 16:40:49,080 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 128 xjuncts. [2019-03-04 16:40:50,128 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 54 dim-0 vars, and 9 xjuncts. [2019-03-04 16:40:50,129 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:131, output treesize:1043 [2019-03-04 16:41:01,712 WARN L181 SmtUtils]: Spent 9.24 s on a formula simplification. DAG size of input: 556 DAG size of output: 119 [2019-03-04 16:41:01,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:01,720 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:01,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:01,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:41:01,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-03-04 16:41:01,855 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:41:01,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:41:01,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:41:01,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=22, Unknown=1, NotChecked=0, Total=42 [2019-03-04 16:41:01,857 INFO L87 Difference]: Start difference. First operand 36 states and 128 transitions. Second operand 4 states. [2019-03-04 16:41:02,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:02,080 INFO L93 Difference]: Finished difference Result 40 states and 140 transitions. [2019-03-04 16:41:02,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:41:02,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:41:02,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:02,082 INFO L225 Difference]: With dead ends: 40 [2019-03-04 16:41:02,082 INFO L226 Difference]: Without dead ends: 39 [2019-03-04 16:41:02,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=19, Invalid=22, Unknown=1, NotChecked=0, Total=42 [2019-03-04 16:41:02,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-03-04 16:41:02,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-03-04 16:41:02,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-03-04 16:41:02,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 138 transitions. [2019-03-04 16:41:02,091 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 138 transitions. Word has length 4 [2019-03-04 16:41:02,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:02,091 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 138 transitions. [2019-03-04 16:41:02,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:41:02,091 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 138 transitions. [2019-03-04 16:41:02,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:41:02,092 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:02,092 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:41:02,092 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:02,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:02,093 INFO L82 PathProgramCache]: Analyzing trace with hash 954990, now seen corresponding path program 1 times [2019-03-04 16:41:02,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:02,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:02,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:02,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:02,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:02,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:02,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:02,185 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:02,185 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:41:02,186 INFO L207 CegarAbsIntRunner]: [0], [22], [32], [35] [2019-03-04 16:41:02,187 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:02,188 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:02,193 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:02,193 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:41:02,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:02,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:02,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:02,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 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-03-04 16:41:02,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:02,202 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:02,210 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 21 conjunts are in the unsatisfiable core [2019-03-04 16:41:02,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:02,375 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2019-03-04 16:41:02,376 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:02,390 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:02,423 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:02,463 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:02,504 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:02,560 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:02,628 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:02,706 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:02,789 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:41:02,823 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:41:02,839 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 18 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-03-04 16:41:02,844 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 22 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:41:02,850 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 25 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:41:02,856 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 27 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:41:02,863 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:41:02,872 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2019-03-04 16:41:02,873 INFO L309 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:02,889 INFO L309 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:02,907 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:02,924 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:03,020 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:03,036 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:03,052 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:03,068 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:03,167 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:03,168 INFO L209 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:147, output treesize:153 [2019-03-04 16:41:03,231 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2019-03-04 16:41:03,231 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:03,323 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:03,323 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:163, output treesize:127 [2019-03-04 16:41:03,542 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-03-04 16:41:03,840 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 53 treesize of output 55 [2019-03-04 16:41:03,841 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,381 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:04,381 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:137, output treesize:103 [2019-03-04 16:41:04,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:04,468 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:04,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:04,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:04,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:41:04,511 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:04,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:41:04,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:41:04,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:41:04,512 INFO L87 Difference]: Start difference. First operand 38 states and 138 transitions. Second operand 8 states. [2019-03-04 16:41:08,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:08,850 INFO L93 Difference]: Finished difference Result 84 states and 220 transitions. [2019-03-04 16:41:08,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:41:08,850 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:41:08,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:08,851 INFO L225 Difference]: With dead ends: 84 [2019-03-04 16:41:08,851 INFO L226 Difference]: Without dead ends: 82 [2019-03-04 16:41:08,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:41:08,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-03-04 16:41:08,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 43. [2019-03-04 16:41:08,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-03-04 16:41:08,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 174 transitions. [2019-03-04 16:41:08,861 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 174 transitions. Word has length 4 [2019-03-04 16:41:08,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:08,861 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 174 transitions. [2019-03-04 16:41:08,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:41:08,862 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 174 transitions. [2019-03-04 16:41:08,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:41:08,862 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:08,862 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:41:08,863 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:08,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:08,863 INFO L82 PathProgramCache]: Analyzing trace with hash 954618, now seen corresponding path program 1 times [2019-03-04 16:41:08,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:08,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:08,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:08,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:08,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:08,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:08,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:08,958 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:08,958 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:41:08,958 INFO L207 CegarAbsIntRunner]: [0], [10], [32], [35] [2019-03-04 16:41:08,960 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:08,960 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:08,964 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:08,965 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:41:08,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:08,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:08,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:08,965 INFO 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-03-04 16:41:08,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:08,974 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:08,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:08,980 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 21 conjunts are in the unsatisfiable core [2019-03-04 16:41:08,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:09,073 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2019-03-04 16:41:09,074 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:09,079 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:09,092 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:09,121 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:09,159 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:09,200 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:09,289 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:09,358 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:09,439 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:41:09,463 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:41:09,496 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 18 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-03-04 16:41:09,529 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 22 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:41:09,563 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 25 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:41:09,593 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 27 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:41:09,623 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:41:09,660 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2019-03-04 16:41:09,661 INFO L309 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:09,868 INFO L309 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:10,088 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:10,264 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:10,282 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:10,301 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:10,320 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:10,338 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:10,444 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:10,445 INFO L209 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:147, output treesize:153 [2019-03-04 16:41:10,482 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2019-03-04 16:41:10,483 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:10,576 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:10,576 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:163, output treesize:127 [2019-03-04 16:41:10,666 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 53 treesize of output 55 [2019-03-04 16:41:10,666 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:10,740 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:10,740 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:137, output treesize:109 [2019-03-04 16:41:10,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:10,762 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:10,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:10,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:10,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:41:10,804 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:10,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:41:10,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:41:10,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:41:10,805 INFO L87 Difference]: Start difference. First operand 43 states and 174 transitions. Second operand 8 states. [2019-03-04 16:41:14,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:14,720 INFO L93 Difference]: Finished difference Result 81 states and 223 transitions. [2019-03-04 16:41:14,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:41:14,721 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:41:14,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:14,722 INFO L225 Difference]: With dead ends: 81 [2019-03-04 16:41:14,722 INFO L226 Difference]: Without dead ends: 80 [2019-03-04 16:41:14,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:41:14,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-03-04 16:41:14,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 43. [2019-03-04 16:41:14,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-03-04 16:41:14,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 174 transitions. [2019-03-04 16:41:14,733 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 174 transitions. Word has length 4 [2019-03-04 16:41:14,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:14,733 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 174 transitions. [2019-03-04 16:41:14,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:41:14,733 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 174 transitions. [2019-03-04 16:41:14,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:41:14,734 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:14,734 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:41:14,734 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:14,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:14,735 INFO L82 PathProgramCache]: Analyzing trace with hash 955114, now seen corresponding path program 1 times [2019-03-04 16:41:14,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:14,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:14,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:14,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:14,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:15,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:15,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:15,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:15,066 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:41:15,066 INFO L207 CegarAbsIntRunner]: [0], [26], [32], [35] [2019-03-04 16:41:15,067 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:15,067 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:15,072 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:15,072 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:41:15,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:15,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:15,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:15,073 INFO 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-03-04 16:41:15,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:15,083 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:15,092 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 21 conjunts are in the unsatisfiable core [2019-03-04 16:41:15,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:15,219 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2019-03-04 16:41:15,220 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,234 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,262 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,297 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,356 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,418 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,500 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,579 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,667 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:41:15,675 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:41:15,679 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 18 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-03-04 16:41:15,684 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 22 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:41:15,689 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 25 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:41:15,719 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 27 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:41:15,724 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:41:15,730 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2019-03-04 16:41:15,731 INFO L309 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,750 INFO L309 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,765 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,782 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,798 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,815 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,832 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,849 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:15,946 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:15,947 INFO L209 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:147, output treesize:153 [2019-03-04 16:41:16,225 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-03-04 16:41:16,268 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2019-03-04 16:41:16,269 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:17,198 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:17,199 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:163, output treesize:127 [2019-03-04 16:41:17,462 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-03-04 16:41:17,759 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 53 treesize of output 55 [2019-03-04 16:41:17,759 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:18,083 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:18,083 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:137, output treesize:109 [2019-03-04 16:41:18,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:18,237 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:18,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:18,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:18,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:41:18,279 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:18,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:41:18,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:41:18,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:41:18,280 INFO L87 Difference]: Start difference. First operand 43 states and 174 transitions. Second operand 8 states. [2019-03-04 16:41:20,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:20,533 INFO L93 Difference]: Finished difference Result 81 states and 223 transitions. [2019-03-04 16:41:20,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:41:20,534 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:41:20,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:20,535 INFO L225 Difference]: With dead ends: 81 [2019-03-04 16:41:20,535 INFO L226 Difference]: Without dead ends: 79 [2019-03-04 16:41:20,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:41:20,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-03-04 16:41:20,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 44. [2019-03-04 16:41:20,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-03-04 16:41:20,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 175 transitions. [2019-03-04 16:41:20,559 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 175 transitions. Word has length 4 [2019-03-04 16:41:20,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:20,559 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 175 transitions. [2019-03-04 16:41:20,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:41:20,560 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 175 transitions. [2019-03-04 16:41:20,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:41:20,560 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:20,560 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:41:20,561 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:20,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:20,561 INFO L82 PathProgramCache]: Analyzing trace with hash 954742, now seen corresponding path program 1 times [2019-03-04 16:41:20,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:20,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:20,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:20,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:20,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:20,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:20,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:20,747 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:20,747 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:41:20,748 INFO L207 CegarAbsIntRunner]: [0], [14], [32], [35] [2019-03-04 16:41:20,749 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:20,749 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:20,753 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:20,754 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:41:20,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:20,754 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:20,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:20,754 INFO 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-03-04 16:41:20,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:20,763 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:20,770 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 21 conjunts are in the unsatisfiable core [2019-03-04 16:41:20,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:20,781 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:41:20,797 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,798 INFO L453 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 30 treesize of output 32 [2019-03-04 16:41:20,805 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,809 INFO L453 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 32 treesize of output 34 [2019-03-04 16:41:20,845 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,849 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,851 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,852 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,853 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,854 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:41:20,861 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,863 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,864 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,865 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,866 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,868 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,869 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,871 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,872 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,873 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,874 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:41:20,880 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,881 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,883 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,884 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,885 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,887 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,888 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,890 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,891 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,892 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,894 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,895 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,898 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,900 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,901 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:41:20,936 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,937 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,938 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,939 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,940 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,941 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,942 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,944 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,945 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,947 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,948 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,949 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,951 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,952 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,954 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,955 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,957 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,958 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,959 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,961 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,962 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,963 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:41:20,970 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,972 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,973 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,975 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:20,976 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:21,001 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:21,010 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:21,011 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:21,012 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:21,013 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:21,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:21,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:21,018 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:21,019 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:21,021 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:21,022 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:21,024 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:21,025 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:21,026 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:21,028 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:21,029 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:21,031 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:21,032 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:21,033 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:21,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:21,036 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:21,037 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:21,039 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:21,040 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2019-03-04 16:41:21,040 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:21,061 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:21,082 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:21,099 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:21,120 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:21,139 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:21,167 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:21,187 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:21,327 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2019-03-04 16:41:21,328 INFO L309 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:21,330 INFO L309 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:21,341 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:21,378 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:21,409 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:21,457 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:21,505 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:21,582 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:21,709 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:21,710 INFO L209 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:147, output treesize:153 [2019-03-04 16:41:21,772 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2019-03-04 16:41:21,773 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:22,344 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:22,345 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:163, output treesize:127 [2019-03-04 16:41:22,395 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 53 treesize of output 55 [2019-03-04 16:41:22,395 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:22,467 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:22,467 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:137, output treesize:103 [2019-03-04 16:41:22,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:22,613 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:22,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:22,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:22,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:41:22,661 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:22,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:41:22,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:41:22,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:41:22,662 INFO L87 Difference]: Start difference. First operand 44 states and 175 transitions. Second operand 8 states. [2019-03-04 16:41:26,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:26,363 INFO L93 Difference]: Finished difference Result 99 states and 274 transitions. [2019-03-04 16:41:26,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:41:26,364 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:41:26,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:26,365 INFO L225 Difference]: With dead ends: 99 [2019-03-04 16:41:26,365 INFO L226 Difference]: Without dead ends: 95 [2019-03-04 16:41:26,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:41:26,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-03-04 16:41:26,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 52. [2019-03-04 16:41:26,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-03-04 16:41:26,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 210 transitions. [2019-03-04 16:41:26,380 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 210 transitions. Word has length 4 [2019-03-04 16:41:26,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:26,380 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 210 transitions. [2019-03-04 16:41:26,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:41:26,380 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 210 transitions. [2019-03-04 16:41:26,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:41:26,381 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:26,381 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:41:26,381 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:26,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:26,382 INFO L82 PathProgramCache]: Analyzing trace with hash 941536, now seen corresponding path program 1 times [2019-03-04 16:41:26,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:26,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:26,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:26,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:26,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:26,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:26,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:26,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:26,528 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:41:26,528 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [35] [2019-03-04 16:41:26,529 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:26,529 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:26,534 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:26,534 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:41:26,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:26,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:26,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:26,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:41:26,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:26,550 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:26,558 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:41:26,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:26,567 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:41:26,571 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,572 INFO L453 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 30 treesize of output 32 [2019-03-04 16:41:26,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,585 INFO L453 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 32 treesize of output 34 [2019-03-04 16:41:26,590 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,591 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,592 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,594 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,596 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,597 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:41:26,604 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,606 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,609 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,610 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,611 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,613 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,614 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,615 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,616 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:41:26,642 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,659 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,680 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,685 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,687 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,689 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,693 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,694 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,695 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,698 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,702 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,705 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:41:26,718 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,720 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,721 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,722 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,724 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,725 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,726 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,728 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,729 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,730 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,732 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,733 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,734 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,736 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,737 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,738 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,740 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,741 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,742 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,744 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,745 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:41:26,751 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,752 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,753 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,754 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,756 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,757 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,758 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,760 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,761 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,763 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,764 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,767 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,768 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,770 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,771 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,772 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,774 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,775 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,777 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,779 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:26,842 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:41:26,843 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:26,865 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:26,887 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:26,910 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:26,933 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:26,954 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:26,980 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:26,999 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:27,429 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:41:27,430 INFO L309 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:27,534 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:27,694 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:28,007 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:28,353 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:28,827 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:29,358 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:30,068 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:30,068 INFO L209 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-03-04 16:41:30,229 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-03-04 16:41:30,236 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:41:30,236 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:30,315 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:30,316 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:98 [2019-03-04 16:41:30,361 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 48 treesize of output 50 [2019-03-04 16:41:30,362 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:30,483 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:30,483 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:78 [2019-03-04 16:41:30,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:30,504 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:30,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:30,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:30,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:41:30,547 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:30,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:41:30,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:41:30,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:41:30,547 INFO L87 Difference]: Start difference. First operand 52 states and 210 transitions. Second operand 8 states. [2019-03-04 16:41:31,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:31,124 INFO L93 Difference]: Finished difference Result 101 states and 289 transitions. [2019-03-04 16:41:31,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:41:31,125 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:41:31,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:31,126 INFO L225 Difference]: With dead ends: 101 [2019-03-04 16:41:31,126 INFO L226 Difference]: Without dead ends: 99 [2019-03-04 16:41:31,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:41:31,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-03-04 16:41:31,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 59. [2019-03-04 16:41:31,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-03-04 16:41:31,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 243 transitions. [2019-03-04 16:41:31,142 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 243 transitions. Word has length 4 [2019-03-04 16:41:31,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:31,142 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 243 transitions. [2019-03-04 16:41:31,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:41:31,142 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 243 transitions. [2019-03-04 16:41:31,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:41:31,143 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:31,143 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:41:31,143 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:31,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:31,144 INFO L82 PathProgramCache]: Analyzing trace with hash 941164, now seen corresponding path program 1 times [2019-03-04 16:41:31,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:31,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:31,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:31,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:31,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:31,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:31,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:31,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:31,230 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:41:31,230 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [35] [2019-03-04 16:41:31,232 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:31,232 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:31,236 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:31,237 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:41:31,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:31,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:31,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:31,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:41:31,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:31,254 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:31,259 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:41:31,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:31,322 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:41:31,323 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:31,326 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:31,336 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:31,364 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:31,389 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:31,422 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:31,469 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:31,547 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:41:31,550 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:41:31,555 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-03-04 16:41:31,559 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:41:31,564 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:41:31,600 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:41:31,607 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:41:31,688 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:41:31,689 INFO L309 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:31,702 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:31,720 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:31,737 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:31,754 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:31,771 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:31,788 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:31,805 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:31,893 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:31,893 INFO L209 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-03-04 16:41:31,956 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:41:31,956 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:32,038 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:32,038 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:98 [2019-03-04 16:41:32,106 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 48 treesize of output 50 [2019-03-04 16:41:32,107 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:32,157 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:32,158 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:84 [2019-03-04 16:41:32,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:32,185 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:32,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:32,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:32,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:41:32,228 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:32,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:41:32,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:41:32,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:41:32,229 INFO L87 Difference]: Start difference. First operand 59 states and 243 transitions. Second operand 8 states. [2019-03-04 16:41:33,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:33,415 INFO L93 Difference]: Finished difference Result 99 states and 302 transitions. [2019-03-04 16:41:33,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:41:33,415 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:41:33,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:33,417 INFO L225 Difference]: With dead ends: 99 [2019-03-04 16:41:33,417 INFO L226 Difference]: Without dead ends: 98 [2019-03-04 16:41:33,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:41:33,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-03-04 16:41:33,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 61. [2019-03-04 16:41:33,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-03-04 16:41:33,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 261 transitions. [2019-03-04 16:41:33,433 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 261 transitions. Word has length 4 [2019-03-04 16:41:33,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:33,433 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 261 transitions. [2019-03-04 16:41:33,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:41:33,434 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 261 transitions. [2019-03-04 16:41:33,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:41:33,434 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:33,434 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:41:33,435 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:33,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:33,435 INFO L82 PathProgramCache]: Analyzing trace with hash 941660, now seen corresponding path program 1 times [2019-03-04 16:41:33,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:33,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:33,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:33,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:33,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:33,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-03-04 16:41:33,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:33,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:33,540 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:41:33,540 INFO L207 CegarAbsIntRunner]: [0], [18], [26], [35] [2019-03-04 16:41:33,541 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:33,541 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:33,547 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:33,547 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:41:33,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:33,547 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:33,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:33,548 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:41:33,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:33,574 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:33,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:33,583 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:41:33,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:33,589 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:41:33,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,596 INFO L453 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 30 treesize of output 32 [2019-03-04 16:41:33,606 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,607 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,608 INFO L453 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 32 treesize of output 34 [2019-03-04 16:41:33,614 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,615 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,616 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,619 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,621 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,622 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:41:33,632 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,635 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,637 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,640 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,646 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,648 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,651 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,653 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,656 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:41:33,664 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,665 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,666 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,668 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,669 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,674 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,675 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,676 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,678 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,682 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,683 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,684 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:41:33,690 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,692 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,693 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,694 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,696 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,697 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,698 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,701 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,705 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,706 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,710 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,712 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,713 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,743 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,790 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:41:33,799 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,800 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,801 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,802 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,805 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,806 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,808 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,811 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,814 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,815 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,816 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,818 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,819 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,820 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,821 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,823 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,824 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,889 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:41:33,890 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:33,910 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:33,931 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:33,950 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:33,969 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:33,988 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:34,007 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:34,026 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:34,107 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:41:34,108 INFO L309 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:34,258 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:34,434 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:34,598 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:34,631 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:34,665 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:34,709 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:34,782 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:34,783 INFO L209 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-03-04 16:41:34,831 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:41:34,832 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:34,898 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:34,899 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:98 [2019-03-04 16:41:34,956 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 48 treesize of output 50 [2019-03-04 16:41:34,957 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:35,005 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:35,005 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:84 [2019-03-04 16:41:35,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:35,033 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:35,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:35,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:35,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:41:35,075 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:35,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:41:35,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:41:35,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:41:35,076 INFO L87 Difference]: Start difference. First operand 61 states and 261 transitions. Second operand 8 states. [2019-03-04 16:41:35,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:35,810 INFO L93 Difference]: Finished difference Result 101 states and 320 transitions. [2019-03-04 16:41:35,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:41:35,811 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:41:35,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:35,812 INFO L225 Difference]: With dead ends: 101 [2019-03-04 16:41:35,812 INFO L226 Difference]: Without dead ends: 99 [2019-03-04 16:41:35,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:41:35,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-03-04 16:41:35,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 62. [2019-03-04 16:41:35,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-03-04 16:41:35,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 278 transitions. [2019-03-04 16:41:35,826 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 278 transitions. Word has length 4 [2019-03-04 16:41:35,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:35,826 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 278 transitions. [2019-03-04 16:41:35,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:41:35,826 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 278 transitions. [2019-03-04 16:41:35,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:41:35,827 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:35,827 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:41:35,828 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:35,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:35,828 INFO L82 PathProgramCache]: Analyzing trace with hash 941288, now seen corresponding path program 1 times [2019-03-04 16:41:35,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:35,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:35,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:35,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:35,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:35,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:35,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:35,942 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:35,942 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:41:35,942 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [35] [2019-03-04 16:41:35,943 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:35,943 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:35,948 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:35,948 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:41:35,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:35,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:35,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:35,949 INFO 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-03-04 16:41:35,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:35,968 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:35,974 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:41:35,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:36,065 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:41:36,066 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,077 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,100 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,126 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,156 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,194 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,238 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,296 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:41:36,300 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:41:36,304 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-03-04 16:41:36,309 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:41:36,316 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:41:36,320 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:41:36,343 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:41:37,123 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:41:37,124 INFO L309 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:37,320 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:37,514 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:37,732 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:37,779 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:37,794 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:37,810 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:37,827 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:37,918 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:37,918 INFO L209 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-03-04 16:41:37,988 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:41:37,989 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:38,063 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:38,064 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:98 [2019-03-04 16:41:38,171 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 48 treesize of output 46 [2019-03-04 16:41:38,171 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:38,238 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:38,238 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:78 [2019-03-04 16:41:38,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:38,263 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:38,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:38,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:38,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:41:38,304 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:38,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:41:38,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:41:38,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:41:38,305 INFO L87 Difference]: Start difference. First operand 62 states and 278 transitions. Second operand 8 states. [2019-03-04 16:41:38,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:38,931 INFO L93 Difference]: Finished difference Result 106 states and 350 transitions. [2019-03-04 16:41:38,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:41:38,931 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:41:38,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:38,933 INFO L225 Difference]: With dead ends: 106 [2019-03-04 16:41:38,933 INFO L226 Difference]: Without dead ends: 104 [2019-03-04 16:41:38,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:41:38,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-03-04 16:41:38,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 65. [2019-03-04 16:41:38,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-03-04 16:41:38,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 304 transitions. [2019-03-04 16:41:38,959 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 304 transitions. Word has length 4 [2019-03-04 16:41:38,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:38,960 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 304 transitions. [2019-03-04 16:41:38,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:41:38,960 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 304 transitions. [2019-03-04 16:41:38,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:41:38,960 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:38,960 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:41:38,962 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:38,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:38,962 INFO L82 PathProgramCache]: Analyzing trace with hash 941784, now seen corresponding path program 1 times [2019-03-04 16:41:38,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:38,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:38,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:38,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:38,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:39,273 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-03-04 16:41:39,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:39,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:39,480 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:39,480 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:41:39,481 INFO L207 CegarAbsIntRunner]: [0], [18], [30], [35] [2019-03-04 16:41:39,483 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:39,483 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:39,490 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:39,491 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:41:39,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:39,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:39,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:39,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:41:39,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:39,513 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:39,534 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:41:39,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:39,563 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:41:39,614 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,615 INFO L453 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 30 treesize of output 32 [2019-03-04 16:41:39,663 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,685 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,707 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,708 INFO L453 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 32 treesize of output 34 [2019-03-04 16:41:39,741 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,743 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,745 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,746 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,746 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,747 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,748 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:41:39,752 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,753 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,754 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,756 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,757 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,758 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,759 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,761 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,762 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,763 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,764 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:41:39,770 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,772 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,774 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,775 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,777 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,778 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,779 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,780 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,782 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,783 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,784 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,787 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,789 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:41:39,794 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,795 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,796 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,798 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,799 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,800 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,802 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,804 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,806 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,808 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,811 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,813 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,814 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,815 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,818 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,819 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,821 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,822 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:41:39,827 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,829 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,830 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,832 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,833 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,834 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,836 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,837 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,838 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,840 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,841 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,842 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,844 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,845 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,846 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,848 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,849 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,850 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,852 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,853 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,855 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,907 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:41:39,908 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:39,924 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:39,943 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:39,962 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:39,981 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:40,001 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:40,019 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:40,038 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:40,120 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:41:40,121 INFO L309 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:40,132 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:40,149 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:40,177 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:40,213 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:40,253 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:40,295 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:40,366 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:40,367 INFO L209 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-03-04 16:41:40,413 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:41:40,413 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:40,477 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:40,478 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:98 [2019-03-04 16:41:40,546 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 48 treesize of output 46 [2019-03-04 16:41:40,547 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:40,591 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:40,591 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:78 [2019-03-04 16:41:40,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:40,623 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:40,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:40,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:40,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:41:40,664 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:40,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:41:40,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:41:40,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:41:40,665 INFO L87 Difference]: Start difference. First operand 65 states and 304 transitions. Second operand 8 states. [2019-03-04 16:41:41,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:41,280 INFO L93 Difference]: Finished difference Result 107 states and 376 transitions. [2019-03-04 16:41:41,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:41:41,280 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:41:41,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:41,282 INFO L225 Difference]: With dead ends: 107 [2019-03-04 16:41:41,282 INFO L226 Difference]: Without dead ends: 99 [2019-03-04 16:41:41,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:41:41,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-03-04 16:41:41,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 66. [2019-03-04 16:41:41,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-03-04 16:41:41,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 328 transitions. [2019-03-04 16:41:41,296 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 328 transitions. Word has length 4 [2019-03-04 16:41:41,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:41,296 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 328 transitions. [2019-03-04 16:41:41,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:41:41,297 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 328 transitions. [2019-03-04 16:41:41,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:41:41,297 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:41,297 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:41:41,298 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:41,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:41,298 INFO L82 PathProgramCache]: Analyzing trace with hash 930314, now seen corresponding path program 1 times [2019-03-04 16:41:41,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:41,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:41,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:41,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:41,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:41,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-03-04 16:41:41,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:41,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:41,420 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:41:41,420 INFO L207 CegarAbsIntRunner]: [0], [6], [32], [35] [2019-03-04 16:41:41,421 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:41,422 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:41,425 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:41,425 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:41:41,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:41,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:41,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:41,426 INFO 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-03-04 16:41:41,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:41,450 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:41,464 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:41:41,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:41,764 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:41:41,765 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:41,771 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:41,781 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:41,798 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:41,828 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:41,859 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:41,904 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:41,958 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:41:41,962 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:41:41,966 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-03-04 16:41:41,971 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:41:41,975 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:41:41,979 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:41:41,983 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:41:42,041 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:41:42,042 INFO L309 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:42,062 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:42,081 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:42,105 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:42,124 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:42,148 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:42,170 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:42,192 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:42,276 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:42,276 INFO L209 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:121, output treesize:125 [2019-03-04 16:41:42,326 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 51 treesize of output 53 [2019-03-04 16:41:42,327 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:41:42,432 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 12 dim-0 vars, and 2 xjuncts. [2019-03-04 16:41:42,433 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:135, output treesize:201 [2019-03-04 16:41:42,570 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 15 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 27 case distinctions, treesize of input 111 treesize of output 151 [2019-03-04 16:41:42,571 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-03-04 16:41:42,598 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 64 xjuncts. [2019-03-04 16:41:44,181 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 106 treesize of output 143 [2019-03-04 16:41:44,182 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:44,705 INFO L309 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 2 dim-1 vars, End of recursive call: 49 dim-0 vars, and 8 xjuncts. [2019-03-04 16:41:44,706 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 15 variables, input treesize:218, output treesize:692 [2019-03-04 16:41:53,234 WARN L181 SmtUtils]: Spent 8.04 s on a formula simplification. DAG size of input: 385 DAG size of output: 114 [2019-03-04 16:41:53,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:53,236 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:53,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:53,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:53,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-03-04 16:41:53,262 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:53,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:41:53,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:41:53,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:41:53,262 INFO L87 Difference]: Start difference. First operand 66 states and 328 transitions. Second operand 8 states. [2019-03-04 16:41:54,705 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 118 [2019-03-04 16:41:57,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:57,954 INFO L93 Difference]: Finished difference Result 155 states and 556 transitions. [2019-03-04 16:41:57,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:41:57,954 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:41:57,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:57,957 INFO L225 Difference]: With dead ends: 155 [2019-03-04 16:41:57,957 INFO L226 Difference]: Without dead ends: 152 [2019-03-04 16:41:57,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:41:57,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-03-04 16:41:57,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 78. [2019-03-04 16:41:57,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-03-04 16:41:57,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 438 transitions. [2019-03-04 16:41:57,973 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 438 transitions. Word has length 4 [2019-03-04 16:41:57,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:57,973 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 438 transitions. [2019-03-04 16:41:57,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:41:57,973 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 438 transitions. [2019-03-04 16:41:57,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:41:57,974 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:57,974 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:41:57,974 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:57,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:57,975 INFO L82 PathProgramCache]: Analyzing trace with hash 930440, now seen corresponding path program 1 times [2019-03-04 16:41:57,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:57,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:57,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:57,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:57,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:58,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:58,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:58,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:58,155 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:41:58,155 INFO L207 CegarAbsIntRunner]: [0], [6], [36], [37] [2019-03-04 16:41:58,156 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:58,156 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:58,159 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:58,159 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:41:58,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:58,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:58,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:58,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:41:58,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:58,177 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:58,196 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:41:58,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:58,203 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:41:58,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,209 INFO L453 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 30 treesize of output 32 [2019-03-04 16:41:58,214 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,216 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,217 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,218 INFO L453 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 32 treesize of output 34 [2019-03-04 16:41:58,223 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,225 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,229 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,230 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,232 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,233 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,234 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:41:58,239 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,241 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,242 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,243 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,243 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,245 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,246 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,247 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,248 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,250 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,251 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:41:58,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,258 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,262 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,263 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,264 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,264 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,265 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,266 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,268 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,276 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:41:58,283 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,284 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,285 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,287 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,289 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,290 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,291 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,293 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,294 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,295 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,297 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,298 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,299 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,301 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,302 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,304 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,305 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,306 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,308 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,309 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,310 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:41:58,316 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,318 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,319 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,320 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,323 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,324 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,327 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,331 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,333 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,335 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,337 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,338 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,339 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,341 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,342 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,343 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,397 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:41:58,398 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:58,417 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:58,436 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:58,456 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:58,476 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:58,496 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:58,515 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:58,535 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:58,628 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:41:58,629 INFO L309 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:58,638 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:58,655 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:58,676 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:58,699 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:58,731 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:58,775 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:58,846 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:58,846 INFO L209 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:121, output treesize:125 [2019-03-04 16:41:58,884 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:41:58,885 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:58,949 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:58,949 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:96 [2019-03-04 16:41:58,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:58,969 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:58,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:58,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:58,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:41:58,999 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:58,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:41:58,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:41:58,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:41:59,000 INFO L87 Difference]: Start difference. First operand 78 states and 438 transitions. Second operand 6 states. [2019-03-04 16:41:59,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:59,346 INFO L93 Difference]: Finished difference Result 104 states and 471 transitions. [2019-03-04 16:41:59,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:41:59,346 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:41:59,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:59,348 INFO L225 Difference]: With dead ends: 104 [2019-03-04 16:41:59,348 INFO L226 Difference]: Without dead ends: 103 [2019-03-04 16:41:59,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:41:59,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-03-04 16:41:59,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 80. [2019-03-04 16:41:59,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-03-04 16:41:59,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 448 transitions. [2019-03-04 16:41:59,366 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 448 transitions. Word has length 4 [2019-03-04 16:41:59,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:59,366 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 448 transitions. [2019-03-04 16:41:59,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:41:59,366 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 448 transitions. [2019-03-04 16:41:59,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:41:59,367 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:59,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:41:59,367 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:59,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:59,367 INFO L82 PathProgramCache]: Analyzing trace with hash 945816, now seen corresponding path program 1 times [2019-03-04 16:41:59,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:59,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:59,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:59,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:59,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:59,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:59,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:59,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:59,537 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:41:59,537 INFO L207 CegarAbsIntRunner]: [0], [22], [36], [37] [2019-03-04 16:41:59,538 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:59,539 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:59,542 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:59,542 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:41:59,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:59,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:59,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:59,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:41:59,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:59,561 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:59,566 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:41:59,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:59,572 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:41:59,595 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 35 [2019-03-04 16:41:59,600 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,602 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,604 INFO L453 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 1 case distinctions, treesize of input 32 treesize of output 34 [2019-03-04 16:41:59,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,611 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,612 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,613 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,615 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,618 INFO L453 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:41:59,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,623 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,627 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,630 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,631 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,633 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,634 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,643 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:41:59,651 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,654 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,655 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,657 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,659 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,663 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,664 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,665 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,666 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,667 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,668 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,673 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:41:59,678 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,680 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,683 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,685 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,687 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,688 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,689 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,692 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,693 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,695 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,696 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,697 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,699 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,701 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,705 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,708 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:41:59,714 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,715 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,717 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,718 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,722 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,723 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,724 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,726 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,727 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,728 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,733 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,734 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,735 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,736 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,737 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,739 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,740 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,741 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,743 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:59,798 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:41:59,799 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:59,819 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:59,838 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:59,857 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:59,877 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:59,894 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:59,913 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:59,933 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:00,007 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:42:00,008 INFO L309 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:00,013 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:00,023 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:00,048 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:00,076 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:00,117 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:00,186 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:00,187 INFO L209 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:113, output treesize:121 [2019-03-04 16:42:00,220 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:42:00,221 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:00,282 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:00,282 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:126, output treesize:92 [2019-03-04 16:42:00,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:00,302 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:00,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:00,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:00,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:42:00,332 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:00,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:42:00,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:42:00,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:42:00,333 INFO L87 Difference]: Start difference. First operand 80 states and 448 transitions. Second operand 6 states. [2019-03-04 16:42:00,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:00,666 INFO L93 Difference]: Finished difference Result 108 states and 483 transitions. [2019-03-04 16:42:00,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:42:00,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:42:00,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:00,668 INFO L225 Difference]: With dead ends: 108 [2019-03-04 16:42:00,668 INFO L226 Difference]: Without dead ends: 107 [2019-03-04 16:42:00,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:42:00,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-03-04 16:42:00,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 80. [2019-03-04 16:42:00,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-03-04 16:42:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 448 transitions. [2019-03-04 16:42:00,687 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 448 transitions. Word has length 4 [2019-03-04 16:42:00,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:00,687 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 448 transitions. [2019-03-04 16:42:00,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:42:00,687 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 448 transitions. [2019-03-04 16:42:00,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:42:00,688 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:00,688 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:42:00,688 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:00,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:00,688 INFO L82 PathProgramCache]: Analyzing trace with hash 945008, now seen corresponding path program 1 times [2019-03-04 16:42:00,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:00,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:00,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:00,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:00,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:00,873 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-03-04 16:42:00,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:00,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:00,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:00,904 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:42:00,904 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [35] [2019-03-04 16:42:00,905 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:42:00,905 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:42:00,908 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:42:00,908 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:42:00,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:00,909 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:42:00,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:00,909 INFO 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-03-04 16:42:00,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:00,932 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:00,945 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:42:00,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:00,987 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:42:00,987 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:00,995 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,003 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,023 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,047 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,079 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,124 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,187 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:42:01,192 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:42:01,196 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-03-04 16:42:01,212 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:42:01,215 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:42:01,219 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:42:01,240 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:42:01,297 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:42:01,298 INFO L309 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,314 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,331 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,346 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,363 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,384 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,399 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,415 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,487 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:01,488 INFO L209 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-03-04 16:42:01,570 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:42:01,570 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,689 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:01,690 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-03-04 16:42:01,748 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 44 [2019-03-04 16:42:01,748 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,794 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:01,794 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:78 [2019-03-04 16:42:01,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:01,819 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:01,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:01,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:01,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:42:01,868 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:01,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:42:01,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:42:01,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:42:01,868 INFO L87 Difference]: Start difference. First operand 80 states and 448 transitions. Second operand 8 states. [2019-03-04 16:42:03,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:03,211 INFO L93 Difference]: Finished difference Result 154 states and 652 transitions. [2019-03-04 16:42:03,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:42:03,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:42:03,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:03,215 INFO L225 Difference]: With dead ends: 154 [2019-03-04 16:42:03,215 INFO L226 Difference]: Without dead ends: 153 [2019-03-04 16:42:03,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:42:03,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-03-04 16:42:03,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 92. [2019-03-04 16:42:03,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-03-04 16:42:03,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 556 transitions. [2019-03-04 16:42:03,238 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 556 transitions. Word has length 4 [2019-03-04 16:42:03,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:03,238 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 556 transitions. [2019-03-04 16:42:03,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:42:03,238 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 556 transitions. [2019-03-04 16:42:03,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:42:03,239 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:03,239 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:42:03,239 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:03,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:03,239 INFO L82 PathProgramCache]: Analyzing trace with hash 945504, now seen corresponding path program 1 times [2019-03-04 16:42:03,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:03,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:03,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:03,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:03,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:03,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:03,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:03,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:03,427 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:42:03,427 INFO L207 CegarAbsIntRunner]: [0], [22], [26], [35] [2019-03-04 16:42:03,428 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:42:03,428 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:42:03,431 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:42:03,432 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:42:03,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:03,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:42:03,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:03,432 INFO 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-03-04 16:42:03,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:03,441 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:03,448 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:42:03,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:03,454 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:42:03,462 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,463 INFO L453 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 30 treesize of output 32 [2019-03-04 16:42:03,471 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,473 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,476 INFO L453 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 32 treesize of output 34 [2019-03-04 16:42:03,480 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,482 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,484 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,486 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,488 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,490 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,491 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:42:03,500 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,505 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,507 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,509 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,512 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,512 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,513 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,515 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:42:03,522 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,523 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,527 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,528 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,529 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,531 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,532 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,538 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,539 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,540 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,541 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,544 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,545 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:42:03,549 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,550 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,551 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,553 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,554 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,555 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,556 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,558 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,559 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,562 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,563 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,564 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,566 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,567 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,568 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,570 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,571 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,574 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,575 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,576 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:42:03,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,586 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,587 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,589 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,590 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,591 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,593 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,594 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,597 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,598 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,599 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,601 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,602 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,603 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,606 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,607 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:03,658 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:42:03,659 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:03,677 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:03,695 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:03,714 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:03,733 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:03,752 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:03,771 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:03,790 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:03,871 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:42:03,872 INFO L309 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:03,879 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:03,889 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:03,907 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:03,935 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:03,963 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:04,007 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:04,078 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:04,079 INFO L209 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-03-04 16:42:04,126 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:42:04,126 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:04,206 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:04,206 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-03-04 16:42:04,249 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 44 [2019-03-04 16:42:04,249 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:04,292 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:04,293 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:78 [2019-03-04 16:42:04,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:04,315 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:04,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:04,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:04,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:42:04,360 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:04,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:42:04,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:42:04,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:42:04,361 INFO L87 Difference]: Start difference. First operand 92 states and 556 transitions. Second operand 8 states. [2019-03-04 16:42:05,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:05,506 INFO L93 Difference]: Finished difference Result 148 states and 688 transitions. [2019-03-04 16:42:05,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:42:05,507 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:42:05,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:05,508 INFO L225 Difference]: With dead ends: 148 [2019-03-04 16:42:05,508 INFO L226 Difference]: Without dead ends: 146 [2019-03-04 16:42:05,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:42:05,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-03-04 16:42:05,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 103. [2019-03-04 16:42:05,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-03-04 16:42:05,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 590 transitions. [2019-03-04 16:42:05,529 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 590 transitions. Word has length 4 [2019-03-04 16:42:05,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:05,529 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 590 transitions. [2019-03-04 16:42:05,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:42:05,530 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 590 transitions. [2019-03-04 16:42:05,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:42:05,530 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:05,530 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:42:05,531 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:05,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:05,531 INFO L82 PathProgramCache]: Analyzing trace with hash 933972, now seen corresponding path program 1 times [2019-03-04 16:42:05,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:05,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:05,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:05,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:05,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:05,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:05,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:05,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:05,659 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:42:05,659 INFO L207 CegarAbsIntRunner]: [0], [10], [26], [35] [2019-03-04 16:42:05,661 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:42:05,661 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:42:05,665 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:42:05,665 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:42:05,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:05,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:42:05,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:05,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 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-03-04 16:42:05,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:05,682 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:05,688 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:42:05,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:05,694 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:42:05,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,700 INFO L453 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 30 treesize of output 32 [2019-03-04 16:42:05,706 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,707 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,709 INFO L453 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 32 treesize of output 34 [2019-03-04 16:42:05,739 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,842 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,864 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,864 INFO L301 Elim1Store]: Index analysis took 126 ms [2019-03-04 16:42:05,865 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:42:05,911 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,936 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,938 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,939 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,940 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,942 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,943 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,944 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,946 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,947 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,948 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:42:05,954 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,955 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,956 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,957 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,958 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,959 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,960 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,962 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,963 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,964 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,966 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,967 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,968 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,970 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,971 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,972 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:42:05,978 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,979 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,982 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,985 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,986 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,987 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,989 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,990 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,991 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,993 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,994 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,995 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,997 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,998 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:05,999 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:06,001 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:06,002 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:06,003 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:06,005 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:06,006 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:42:06,012 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:06,013 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:06,014 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:06,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:06,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:06,018 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:06,019 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:06,020 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:06,022 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:06,023 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:06,024 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:06,026 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:06,027 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:06,028 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:06,030 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:06,031 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:06,032 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:06,034 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:06,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:06,036 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:06,038 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:06,092 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:42:06,093 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:06,110 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:06,129 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:06,149 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:06,167 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:06,187 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:06,203 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:06,221 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:06,302 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:42:06,303 INFO L309 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:06,312 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:06,333 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:06,356 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:06,384 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:06,423 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:06,467 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:06,538 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:06,539 INFO L209 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-03-04 16:42:06,589 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:42:06,589 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:06,655 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:06,655 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:98 [2019-03-04 16:42:06,700 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 48 treesize of output 50 [2019-03-04 16:42:06,701 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:06,749 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:06,749 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:84 [2019-03-04 16:42:06,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:06,769 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:06,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:06,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:06,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:42:06,812 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:06,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:42:06,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:42:06,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:42:06,813 INFO L87 Difference]: Start difference. First operand 103 states and 590 transitions. Second operand 8 states. [2019-03-04 16:42:09,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:09,395 INFO L93 Difference]: Finished difference Result 145 states and 646 transitions. [2019-03-04 16:42:09,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:42:09,396 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:42:09,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:09,398 INFO L225 Difference]: With dead ends: 145 [2019-03-04 16:42:09,398 INFO L226 Difference]: Without dead ends: 143 [2019-03-04 16:42:09,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:42:09,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-03-04 16:42:09,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 104. [2019-03-04 16:42:09,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-03-04 16:42:09,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 599 transitions. [2019-03-04 16:42:09,423 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 599 transitions. Word has length 4 [2019-03-04 16:42:09,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:09,423 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 599 transitions. [2019-03-04 16:42:09,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:42:09,423 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 599 transitions. [2019-03-04 16:42:09,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:42:09,424 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:09,424 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:42:09,424 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:09,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:09,425 INFO L82 PathProgramCache]: Analyzing trace with hash 938128, now seen corresponding path program 1 times [2019-03-04 16:42:09,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:09,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:09,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:09,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:09,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:09,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:09,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:09,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:09,509 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:42:09,510 INFO L207 CegarAbsIntRunner]: [0], [14], [36], [37] [2019-03-04 16:42:09,510 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:42:09,510 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:42:09,517 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:42:09,517 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:42:09,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:09,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:42:09,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:09,518 INFO 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-03-04 16:42:09,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:09,529 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:09,534 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:42:09,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:09,542 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:42:09,571 INFO L453 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 35 [2019-03-04 16:42:09,578 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,581 INFO L453 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 1 case distinctions, treesize of input 32 treesize of output 34 [2019-03-04 16:42:09,587 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,589 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,591 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,592 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,593 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,595 INFO L453 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:42:09,601 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,602 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,606 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,607 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,609 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,610 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,611 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,613 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,615 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:42:09,621 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,623 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,627 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,630 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,631 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,632 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,634 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,635 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,636 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,638 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,639 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,641 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:42:09,653 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,654 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,654 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,655 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,658 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,659 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,660 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,663 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,665 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,666 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,667 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,668 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,671 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,672 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,673 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,675 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,676 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,680 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:42:09,684 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,685 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,687 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,688 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,692 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,694 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,695 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,696 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,698 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,699 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,702 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,706 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,707 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,710 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:09,767 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:42:09,768 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:09,785 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:09,802 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:09,821 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:09,841 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:09,856 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:09,874 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:09,894 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:09,967 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:42:09,967 INFO L309 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:09,974 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:09,988 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:10,005 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:10,032 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:10,073 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:10,142 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:10,143 INFO L209 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:113, output treesize:121 [2019-03-04 16:42:10,210 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:42:10,211 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:10,272 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:10,273 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:126, output treesize:92 [2019-03-04 16:42:10,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:10,320 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:10,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:10,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:10,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:42:10,354 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:10,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:42:10,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:42:10,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:42:10,354 INFO L87 Difference]: Start difference. First operand 104 states and 599 transitions. Second operand 6 states. [2019-03-04 16:42:10,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:10,859 INFO L93 Difference]: Finished difference Result 124 states and 613 transitions. [2019-03-04 16:42:10,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:42:10,860 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:42:10,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:10,862 INFO L225 Difference]: With dead ends: 124 [2019-03-04 16:42:10,862 INFO L226 Difference]: Without dead ends: 123 [2019-03-04 16:42:10,862 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-03-04 16:42:10,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-03-04 16:42:10,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 104. [2019-03-04 16:42:10,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-03-04 16:42:10,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 598 transitions. [2019-03-04 16:42:10,881 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 598 transitions. Word has length 4 [2019-03-04 16:42:10,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:10,881 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 598 transitions. [2019-03-04 16:42:10,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:42:10,881 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 598 transitions. [2019-03-04 16:42:10,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:42:10,882 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:10,882 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:42:10,882 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:10,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:10,882 INFO L82 PathProgramCache]: Analyzing trace with hash 937816, now seen corresponding path program 1 times [2019-03-04 16:42:10,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:10,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:10,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:10,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:10,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:11,299 WARN L181 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2019-03-04 16:42:11,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:11,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:11,371 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:11,371 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:42:11,371 INFO L207 CegarAbsIntRunner]: [0], [14], [26], [35] [2019-03-04 16:42:11,372 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:42:11,373 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:42:11,375 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:42:11,375 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:42:11,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:11,376 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:42:11,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:11,376 INFO 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-03-04 16:42:11,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:11,384 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:11,390 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:42:11,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:11,400 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:42:11,405 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,406 INFO L453 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 30 treesize of output 32 [2019-03-04 16:42:11,412 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,413 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,414 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,414 INFO L453 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 32 treesize of output 34 [2019-03-04 16:42:11,420 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,421 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,422 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,424 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,425 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,426 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,427 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:42:11,433 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,434 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,436 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,437 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,438 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,440 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,441 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,442 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,443 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,445 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,446 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:42:11,451 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,453 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,454 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,455 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,459 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,461 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,462 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,464 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,468 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,470 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,471 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:42:11,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,478 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,479 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,480 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,482 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,483 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,484 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,486 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,487 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,488 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,490 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,491 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,492 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,494 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,495 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,496 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,498 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,499 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,500 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,503 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,504 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:42:11,510 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,512 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,515 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,516 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,518 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,519 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,522 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,523 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,527 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,528 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,529 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,531 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,532 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,534 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,536 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,589 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:42:11,589 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:11,607 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:11,626 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:11,646 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:11,665 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:11,684 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:11,702 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:11,722 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:11,801 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:42:11,802 INFO L309 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:11,812 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:11,831 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:11,853 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:11,883 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:11,924 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:11,968 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:12,039 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:12,039 INFO L209 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-03-04 16:42:12,154 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:42:12,155 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:12,218 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:12,219 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-03-04 16:42:12,265 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 48 [2019-03-04 16:42:12,266 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:12,319 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:12,319 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:78 [2019-03-04 16:42:12,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:12,341 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:12,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:12,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:12,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:42:12,387 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:12,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:42:12,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:42:12,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:42:12,388 INFO L87 Difference]: Start difference. First operand 104 states and 598 transitions. Second operand 8 states. [2019-03-04 16:42:13,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:13,418 INFO L93 Difference]: Finished difference Result 176 states and 800 transitions. [2019-03-04 16:42:13,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:42:13,418 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:42:13,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:13,421 INFO L225 Difference]: With dead ends: 176 [2019-03-04 16:42:13,421 INFO L226 Difference]: Without dead ends: 174 [2019-03-04 16:42:13,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:42:13,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-03-04 16:42:13,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 108. [2019-03-04 16:42:13,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-03-04 16:42:13,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 670 transitions. [2019-03-04 16:42:13,444 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 670 transitions. Word has length 4 [2019-03-04 16:42:13,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:13,444 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 670 transitions. [2019-03-04 16:42:13,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:42:13,445 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 670 transitions. [2019-03-04 16:42:13,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:42:13,445 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:13,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:42:13,445 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:13,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:13,446 INFO L82 PathProgramCache]: Analyzing trace with hash 953504, now seen corresponding path program 1 times [2019-03-04 16:42:13,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:13,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:13,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:13,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:13,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:13,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:13,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:13,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:13,568 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:42:13,568 INFO L207 CegarAbsIntRunner]: [0], [30], [36], [37] [2019-03-04 16:42:13,569 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:42:13,569 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:42:13,571 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:42:13,571 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:42:13,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:13,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:42:13,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:13,572 INFO 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-03-04 16:42:13,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:13,581 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:13,587 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:42:13,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:13,628 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:42:13,628 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:13,638 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:13,658 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:13,683 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:13,718 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:13,764 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:13,817 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 27 treesize of output 30 [2019-03-04 16:42:13,829 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 35 [2019-03-04 16:42:13,848 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 14 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-03-04 16:42:13,860 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 17 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:42:13,866 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:42:13,873 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:42:13,880 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:42:13,947 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:42:13,948 INFO L309 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:13,963 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:13,980 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:13,997 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:14,014 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:14,030 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:14,047 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:14,064 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:14,132 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:14,132 INFO L209 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:113, output treesize:121 [2019-03-04 16:42:14,176 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:42:14,177 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:14,236 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:14,236 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:126, output treesize:92 [2019-03-04 16:42:14,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:14,288 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:14,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:14,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:14,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:42:14,318 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:14,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:42:14,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:42:14,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:42:14,319 INFO L87 Difference]: Start difference. First operand 108 states and 670 transitions. Second operand 6 states. [2019-03-04 16:42:14,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:14,634 INFO L93 Difference]: Finished difference Result 135 states and 696 transitions. [2019-03-04 16:42:14,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:42:14,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:42:14,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:14,637 INFO L225 Difference]: With dead ends: 135 [2019-03-04 16:42:14,637 INFO L226 Difference]: Without dead ends: 134 [2019-03-04 16:42:14,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:42:14,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-03-04 16:42:14,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 108. [2019-03-04 16:42:14,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-03-04 16:42:14,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 670 transitions. [2019-03-04 16:42:14,662 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 670 transitions. Word has length 4 [2019-03-04 16:42:14,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:14,662 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 670 transitions. [2019-03-04 16:42:14,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:42:14,662 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 670 transitions. [2019-03-04 16:42:14,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:42:14,663 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:14,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:42:14,663 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:14,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:14,663 INFO L82 PathProgramCache]: Analyzing trace with hash 29600478, now seen corresponding path program 1 times [2019-03-04 16:42:14,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:14,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:14,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:14,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:14,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:14,875 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 15 [2019-03-04 16:42:14,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:14,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:14,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:14,997 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:42:14,997 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [32], [35] [2019-03-04 16:42:14,999 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:42:14,999 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:42:15,003 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:42:15,003 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:42:15,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:15,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:42:15,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:15,004 INFO 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-03-04 16:42:15,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:15,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:15,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:15,018 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 22 conjunts are in the unsatisfiable core [2019-03-04 16:42:15,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:15,027 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:42:15,038 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,039 INFO L453 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 30 treesize of output 32 [2019-03-04 16:42:15,042 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,044 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,045 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,046 INFO L453 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 32 treesize of output 34 [2019-03-04 16:42:15,052 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,053 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,054 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,056 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,057 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,058 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,059 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:42:15,064 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,065 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,066 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,067 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,068 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,070 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,071 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,072 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,074 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,075 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,076 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:42:15,082 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,083 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,085 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,086 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,088 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,089 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,090 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,092 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,093 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,094 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,096 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,097 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,098 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,099 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,101 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,102 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:42:15,107 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,108 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,109 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,110 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,112 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,113 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,116 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,117 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,119 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,120 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,121 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,123 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,124 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,126 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,127 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,128 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,130 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,131 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,133 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,134 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,135 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:42:15,141 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,143 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,144 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,146 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,147 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,149 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,153 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,154 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,157 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,158 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,160 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,161 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,164 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,165 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,166 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,168 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,169 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,170 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,172 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,173 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,175 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,176 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,179 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,180 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2019-03-04 16:42:15,180 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:15,201 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:15,220 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:15,241 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:15,260 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:15,281 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:15,301 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:15,321 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:15,418 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2019-03-04 16:42:15,419 INFO L309 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:15,425 INFO L309 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:15,437 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:15,453 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:15,485 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:15,530 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:15,577 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:15,641 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:15,743 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:15,743 INFO L209 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:147, output treesize:153 [2019-03-04 16:42:15,813 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2019-03-04 16:42:15,814 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:15,960 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:15,961 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:163, output treesize:127 [2019-03-04 16:42:16,271 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 53 treesize of output 55 [2019-03-04 16:42:16,272 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:16,595 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:16,596 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:137, output treesize:109 [2019-03-04 16:42:16,686 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 16 disjoint index pairs (out of 28 index pairs), introduced 3 new quantified variables, introduced 16 case distinctions, treesize of input 55 treesize of output 60 [2019-03-04 16:42:16,687 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:16,743 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:16,743 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:119, output treesize:89 [2019-03-04 16:42:16,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:16,771 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:16,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:16,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:16,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:42:16,831 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:16,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:42:16,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:42:16,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:42:16,832 INFO L87 Difference]: Start difference. First operand 108 states and 670 transitions. Second operand 10 states. [2019-03-04 16:42:18,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:18,110 INFO L93 Difference]: Finished difference Result 212 states and 968 transitions. [2019-03-04 16:42:18,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:42:18,110 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:42:18,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:18,112 INFO L225 Difference]: With dead ends: 212 [2019-03-04 16:42:18,112 INFO L226 Difference]: Without dead ends: 205 [2019-03-04 16:42:18,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:42:18,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-03-04 16:42:18,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 122. [2019-03-04 16:42:18,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-03-04 16:42:18,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 789 transitions. [2019-03-04 16:42:18,147 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 789 transitions. Word has length 5 [2019-03-04 16:42:18,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:18,147 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 789 transitions. [2019-03-04 16:42:18,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:42:18,147 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 789 transitions. [2019-03-04 16:42:18,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:42:18,148 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:18,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:42:18,148 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:18,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:18,148 INFO L82 PathProgramCache]: Analyzing trace with hash 29600106, now seen corresponding path program 1 times [2019-03-04 16:42:18,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:18,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:18,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:18,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:18,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:18,462 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2019-03-04 16:42:18,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:18,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:18,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:18,499 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:42:18,499 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [32], [35] [2019-03-04 16:42:18,500 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:42:18,500 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:42:18,503 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:42:18,503 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:42:18,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:18,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:42:18,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:18,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:42:18,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:18,514 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:18,520 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 22 conjunts are in the unsatisfiable core [2019-03-04 16:42:18,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:18,632 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2019-03-04 16:42:18,633 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:18,639 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:18,662 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:18,697 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:18,757 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:18,817 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:18,888 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:18,968 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:19,056 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:42:19,061 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:42:19,066 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 18 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-03-04 16:42:19,071 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 22 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:42:19,077 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 25 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:42:19,082 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 27 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:42:19,087 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:42:19,093 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2019-03-04 16:42:19,093 INFO L309 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:19,110 INFO L309 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:19,125 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:19,143 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:19,158 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:19,175 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:19,191 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:19,208 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:19,304 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:19,305 INFO L209 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:147, output treesize:153 [2019-03-04 16:42:19,344 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2019-03-04 16:42:19,345 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:19,445 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:19,445 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:163, output treesize:127 [2019-03-04 16:42:19,506 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 53 treesize of output 55 [2019-03-04 16:42:19,507 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:19,583 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:19,583 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:137, output treesize:109 [2019-03-04 16:42:19,690 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 16 disjoint index pairs (out of 28 index pairs), introduced 3 new quantified variables, introduced 16 case distinctions, treesize of input 55 treesize of output 64 [2019-03-04 16:42:19,690 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:19,748 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:19,749 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:119, output treesize:99 [2019-03-04 16:42:19,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:19,802 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:19,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:19,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:19,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:42:19,864 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:19,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:42:19,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:42:19,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:42:19,864 INFO L87 Difference]: Start difference. First operand 122 states and 789 transitions. Second operand 10 states. [2019-03-04 16:42:24,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:24,788 INFO L93 Difference]: Finished difference Result 169 states and 850 transitions. [2019-03-04 16:42:24,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:42:24,788 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:42:24,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:24,791 INFO L225 Difference]: With dead ends: 169 [2019-03-04 16:42:24,791 INFO L226 Difference]: Without dead ends: 168 [2019-03-04 16:42:24,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:42:24,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-03-04 16:42:24,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 119. [2019-03-04 16:42:24,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-03-04 16:42:24,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 762 transitions. [2019-03-04 16:42:24,824 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 762 transitions. Word has length 5 [2019-03-04 16:42:24,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:24,825 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 762 transitions. [2019-03-04 16:42:24,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:42:24,825 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 762 transitions. [2019-03-04 16:42:24,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:42:24,826 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:24,826 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:42:24,826 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:24,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:24,826 INFO L82 PathProgramCache]: Analyzing trace with hash 29600602, now seen corresponding path program 1 times [2019-03-04 16:42:24,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:24,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:24,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:24,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:24,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:25,265 WARN L181 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2019-03-04 16:42:25,535 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-03-04 16:42:25,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:25,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:25,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:25,552 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:42:25,552 INFO L207 CegarAbsIntRunner]: [0], [18], [26], [32], [35] [2019-03-04 16:42:25,553 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:42:25,553 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:42:25,556 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:42:25,556 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:42:25,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:25,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:42:25,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:25,557 INFO 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-03-04 16:42:25,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:25,566 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:25,571 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 22 conjunts are in the unsatisfiable core [2019-03-04 16:42:25,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:25,634 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2019-03-04 16:42:25,635 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:25,643 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:25,656 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:25,677 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:25,703 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:25,747 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:25,797 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:25,866 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:25,947 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:42:25,952 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:42:25,957 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 18 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-03-04 16:42:25,963 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 22 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:42:25,969 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 25 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:42:25,973 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 27 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:42:25,980 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:42:25,985 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2019-03-04 16:42:25,985 INFO L309 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:26,002 INFO L309 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:26,019 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:26,035 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:26,052 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:26,070 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:26,085 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:26,102 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:26,199 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:26,200 INFO L209 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:147, output treesize:153 [2019-03-04 16:42:26,239 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2019-03-04 16:42:26,239 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:26,333 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:26,333 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:163, output treesize:127 [2019-03-04 16:42:26,410 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 53 treesize of output 55 [2019-03-04 16:42:26,410 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:26,482 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:26,482 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:137, output treesize:109 [2019-03-04 16:42:26,577 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 16 disjoint index pairs (out of 28 index pairs), introduced 3 new quantified variables, introduced 16 case distinctions, treesize of input 55 treesize of output 64 [2019-03-04 16:42:26,578 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:26,637 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:26,637 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:119, output treesize:99 [2019-03-04 16:42:26,918 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:26,918 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:26,958 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:26,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:26,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:42:26,978 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:26,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:42:26,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:42:26,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:42:26,979 INFO L87 Difference]: Start difference. First operand 119 states and 762 transitions. Second operand 10 states. [2019-03-04 16:42:29,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:29,814 INFO L93 Difference]: Finished difference Result 176 states and 845 transitions. [2019-03-04 16:42:29,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:42:29,814 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:42:29,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:29,817 INFO L225 Difference]: With dead ends: 176 [2019-03-04 16:42:29,817 INFO L226 Difference]: Without dead ends: 172 [2019-03-04 16:42:29,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:42:29,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-03-04 16:42:29,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 125. [2019-03-04 16:42:29,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-03-04 16:42:29,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 788 transitions. [2019-03-04 16:42:29,849 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 788 transitions. Word has length 5 [2019-03-04 16:42:29,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:29,849 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 788 transitions. [2019-03-04 16:42:29,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:42:29,849 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 788 transitions. [2019-03-04 16:42:29,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:42:29,850 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:29,850 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:42:29,850 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:29,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:29,850 INFO L82 PathProgramCache]: Analyzing trace with hash 29588822, now seen corresponding path program 1 times [2019-03-04 16:42:29,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:29,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:29,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:29,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:29,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:29,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:29,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:29,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:29,961 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:42:29,961 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [32], [35] [2019-03-04 16:42:29,962 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:42:29,962 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:42:29,966 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:42:29,966 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:42:29,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:29,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:42:29,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:29,966 INFO 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-03-04 16:42:29,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:29,975 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:29,981 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 17 conjunts are in the unsatisfiable core [2019-03-04 16:42:29,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:30,036 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:42:30,037 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:30,043 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:30,062 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:30,088 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:30,115 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:30,155 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:30,202 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:30,258 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:42:30,263 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:42:30,272 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-03-04 16:42:30,275 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:42:30,281 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:42:30,285 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:42:30,321 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:42:30,381 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:42:30,384 INFO L309 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:30,400 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:30,416 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:30,431 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:30,448 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:30,465 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:30,481 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:30,498 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:30,571 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:30,571 INFO L209 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-03-04 16:42:30,666 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 51 treesize of output 95 [2019-03-04 16:42:30,667 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-03-04 16:42:30,692 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 128 xjuncts. [2019-03-04 16:42:31,625 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 41 dim-0 vars, and 8 xjuncts. [2019-03-04 16:42:31,626 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:135, output treesize:982 [2019-03-04 16:42:32,473 WARN L181 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 490 DAG size of output: 191 [2019-03-04 16:42:32,503 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 130 [2019-03-04 16:42:32,503 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:32,889 INFO L301 Elim1Store]: Index analysis took 132 ms [2019-03-04 16:42:32,953 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 108 treesize of output 106 [2019-03-04 16:42:32,954 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:33,175 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 108 treesize of output 110 [2019-03-04 16:42:33,176 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:33,354 INFO L309 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 3 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2019-03-04 16:42:33,354 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 18 variables, input treesize:389, output treesize:277 [2019-03-04 16:42:33,608 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 93 [2019-03-04 16:42:33,609 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:33,882 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 23 case distinctions, treesize of input 88 treesize of output 117 [2019-03-04 16:42:33,883 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:34,056 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 125 [2019-03-04 16:42:34,057 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:34,203 INFO L309 ElimStorePlain]: Start of recursive call 1: 18 dim-0 vars, 3 dim-1 vars, End of recursive call: 18 dim-0 vars, and 3 xjuncts. [2019-03-04 16:42:34,203 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 21 variables, input treesize:307, output treesize:245 [2019-03-04 16:42:34,427 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-03-04 16:42:34,429 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:34,430 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:34,452 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:34,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:34,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-03-04 16:42:34,471 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:34,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:42:34,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:42:34,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:42:34,472 INFO L87 Difference]: Start difference. First operand 125 states and 788 transitions. Second operand 10 states. [2019-03-04 16:42:34,926 WARN L181 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 70 [2019-03-04 16:42:38,753 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-03-04 16:42:38,754 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:102) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:652) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:256) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:715) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.io.IOException: Stream closed at java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:433) at java.io.OutputStream.write(OutputStream.java:116) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:120) ... 28 more [2019-03-04 16:42:38,758 INFO L168 Benchmark]: Toolchain (without parser) took 144674.84 ms. Allocated memory was 135.8 MB in the beginning and 229.1 MB in the end (delta: 93.3 MB). Free memory was 111.0 MB in the beginning and 87.8 MB in the end (delta: 23.2 MB). Peak memory consumption was 116.5 MB. Max. memory is 7.1 GB. [2019-03-04 16:42:38,758 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 135.8 MB. Free memory is still 112.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:42:38,758 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.57 ms. Allocated memory is still 135.8 MB. Free memory was 110.8 MB in the beginning and 108.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:42:38,759 INFO L168 Benchmark]: Boogie Preprocessor took 42.74 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-03-04 16:42:38,759 INFO L168 Benchmark]: RCFGBuilder took 521.35 ms. Allocated memory is still 135.8 MB. Free memory was 107.1 MB in the beginning and 94.2 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. [2019-03-04 16:42:38,759 INFO L168 Benchmark]: TraceAbstraction took 144040.22 ms. Allocated memory was 135.8 MB in the beginning and 229.1 MB in the end (delta: 93.3 MB). Free memory was 94.0 MB in the beginning and 87.8 MB in the end (delta: 6.2 MB). Peak memory consumption was 99.5 MB. Max. memory is 7.1 GB. [2019-03-04 16:42:38,761 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.20 ms. Allocated memory is still 135.8 MB. Free memory is still 112.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.57 ms. Allocated memory is still 135.8 MB. Free memory was 110.8 MB in the beginning and 108.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.74 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 521.35 ms. Allocated memory is still 135.8 MB. Free memory was 107.1 MB in the beginning and 94.2 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 144040.22 ms. Allocated memory was 135.8 MB in the beginning and 229.1 MB in the end (delta: 93.3 MB). Free memory was 94.0 MB in the beginning and 87.8 MB in the end (delta: 6.2 MB). Peak memory consumption was 99.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...