java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-18 17:38:45,960 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-18 17:38:45,962 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-18 17:38:45,979 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-18 17:38:45,979 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-18 17:38:45,980 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-18 17:38:45,981 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-18 17:38:45,983 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-18 17:38:45,985 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-18 17:38:45,986 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-18 17:38:45,987 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-18 17:38:45,987 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-18 17:38:45,988 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-18 17:38:45,989 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-18 17:38:45,990 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-18 17:38:45,991 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-18 17:38:45,992 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-18 17:38:45,994 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-18 17:38:45,996 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-18 17:38:45,998 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-18 17:38:45,999 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-18 17:38:46,000 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-18 17:38:46,003 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-18 17:38:46,003 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-18 17:38:46,003 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-18 17:38:46,004 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-18 17:38:46,005 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-18 17:38:46,006 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-18 17:38:46,007 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-18 17:38:46,008 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-18 17:38:46,008 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-18 17:38:46,009 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-18 17:38:46,009 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-18 17:38:46,010 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-18 17:38:46,011 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-18 17:38:46,011 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-18 17:38:46,012 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-18 17:38:46,037 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-18 17:38:46,037 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-18 17:38:46,039 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-18 17:38:46,039 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-18 17:38:46,039 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-18 17:38:46,039 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-18 17:38:46,040 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-18 17:38:46,040 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-18 17:38:46,040 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-18 17:38:46,040 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-18 17:38:46,041 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-18 17:38:46,041 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-18 17:38:46,041 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-18 17:38:46,041 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-18 17:38:46,042 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-18 17:38:46,042 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-18 17:38:46,042 INFO L133 SettingsManager]: * Use SBE=true [2019-01-18 17:38:46,042 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-18 17:38:46,044 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-18 17:38:46,044 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-18 17:38:46,044 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-18 17:38:46,044 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-18 17:38:46,044 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-18 17:38:46,045 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-18 17:38:46,045 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-18 17:38:46,045 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-18 17:38:46,045 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-18 17:38:46,045 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-18 17:38:46,046 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-18 17:38:46,047 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-18 17:38:46,047 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-18 17:38:46,047 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 17:38:46,047 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-18 17:38:46,047 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-18 17:38:46,048 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-18 17:38:46,048 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-18 17:38:46,048 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-18 17:38:46,048 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-18 17:38:46,048 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-18 17:38:46,049 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-18 17:38:46,096 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-18 17:38:46,110 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-18 17:38:46,116 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-18 17:38:46,118 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-18 17:38:46,119 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-18 17:38:46,119 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-limited.bpl [2019-01-18 17:38:46,120 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-limited.bpl' [2019-01-18 17:38:46,176 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-18 17:38:46,177 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-18 17:38:46,179 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-18 17:38:46,179 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-18 17:38:46,179 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-18 17:38:46,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:38:46" (1/1) ... [2019-01-18 17:38:46,211 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:38:46" (1/1) ... [2019-01-18 17:38:46,244 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-18 17:38:46,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-18 17:38:46,246 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-18 17:38:46,246 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-18 17:38:46,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:38:46" (1/1) ... [2019-01-18 17:38:46,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:38:46" (1/1) ... [2019-01-18 17:38:46,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:38:46" (1/1) ... [2019-01-18 17:38:46,259 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:38:46" (1/1) ... [2019-01-18 17:38:46,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:38:46" (1/1) ... [2019-01-18 17:38:46,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:38:46" (1/1) ... [2019-01-18 17:38:46,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:38:46" (1/1) ... [2019-01-18 17:38:46,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-18 17:38:46,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-18 17:38:46,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-18 17:38:46,279 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-18 17:38:46,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:38:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 17:38:46,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-18 17:38:46,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-18 17:38:46,656 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-18 17:38:46,657 INFO L286 CfgBuilder]: Removed 15 assue(true) statements. [2019-01-18 17:38:46,658 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 05:38:46 BoogieIcfgContainer [2019-01-18 17:38:46,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-18 17:38:46,659 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-18 17:38:46,659 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-18 17:38:46,663 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-18 17:38:46,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:38:46" (1/2) ... [2019-01-18 17:38:46,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d384200 and model type speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 05:38:46, skipping insertion in model container [2019-01-18 17:38:46,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 05:38:46" (2/2) ... [2019-01-18 17:38:46,668 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-6-limited.bpl [2019-01-18 17:38:46,685 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-18 17:38:46,703 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-18 17:38:46,737 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-18 17:38:46,806 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-18 17:38:46,806 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-18 17:38:46,806 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-18 17:38:46,806 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-18 17:38:46,806 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-18 17:38:46,807 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-18 17:38:46,807 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-18 17:38:46,807 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-18 17:38:46,824 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-01-18 17:38:46,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-18 17:38:46,837 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:46,838 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-18 17:38:46,842 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:46,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:46,849 INFO L82 PathProgramCache]: Analyzing trace with hash 988, now seen corresponding path program 1 times [2019-01-18 17:38:46,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:46,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:46,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:46,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:46,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:47,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:47,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:38:47,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-18 17:38:47,025 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:38:47,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 17:38:47,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 17:38:47,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 17:38:47,042 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2019-01-18 17:38:47,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:47,245 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2019-01-18 17:38:47,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 17:38:47,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-18 17:38:47,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:47,268 INFO L225 Difference]: With dead ends: 29 [2019-01-18 17:38:47,269 INFO L226 Difference]: Without dead ends: 24 [2019-01-18 17:38:47,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 17:38:47,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-18 17:38:47,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 14. [2019-01-18 17:38:47,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-18 17:38:47,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2019-01-18 17:38:47,317 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 2 [2019-01-18 17:38:47,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:47,319 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2019-01-18 17:38:47,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 17:38:47,319 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2019-01-18 17:38:47,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 17:38:47,320 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:47,320 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 17:38:47,321 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:47,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:47,321 INFO L82 PathProgramCache]: Analyzing trace with hash 30376, now seen corresponding path program 1 times [2019-01-18 17:38:47,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:47,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:47,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:47,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:47,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:47,619 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-18 17:38:47,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:47,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:47,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:47,655 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 17:38:47,657 INFO L207 CegarAbsIntRunner]: [0], [18], [27] [2019-01-18 17:38:47,696 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:47,696 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:47,773 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:47,774 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:38:47,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:47,780 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:47,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:47,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:47,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:47,800 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:47,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:48,037 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-01-18 17:38:48,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-18 17:38:48,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:48,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-18 17:38:48,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-18 17:38:48,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-18 17:38:48,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,234 INFO L303 Elim1Store]: Index analysis took 103 ms [2019-01-18 17:38:48,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-18 17:38:48,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-18 17:38:48,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:48,355 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-18 17:38:48,357 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:48,598 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:48,664 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:48,686 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:48,727 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:48,759 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:48,788 INFO L267 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-01-18 17:38:48,789 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-01-18 17:38:48,959 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-18 17:38:49,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:49,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:49,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:49,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:49,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:49,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:49,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:49,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:49,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:49,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:49,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:49,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:49,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:49,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:49,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:49,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:49,172 INFO L303 Elim1Store]: Index analysis took 203 ms [2019-01-18 17:38:49,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-18 17:38:49,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:49,265 INFO L267 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-01-18 17:38:49,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-18 17:38:49,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:49,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:49,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:49,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:49,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-18 17:38:49,445 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:49,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 17:38:49,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 17:38:49,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:38:49,446 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 6 states. [2019-01-18 17:38:51,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:51,298 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2019-01-18 17:38:51,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:38:51,298 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-18 17:38:51,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:51,300 INFO L225 Difference]: With dead ends: 47 [2019-01-18 17:38:51,301 INFO L226 Difference]: Without dead ends: 45 [2019-01-18 17:38:51,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-18 17:38:51,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-18 17:38:51,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 18. [2019-01-18 17:38:51,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-18 17:38:51,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 37 transitions. [2019-01-18 17:38:51,309 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 37 transitions. Word has length 3 [2019-01-18 17:38:51,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:51,309 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 37 transitions. [2019-01-18 17:38:51,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 17:38:51,310 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 37 transitions. [2019-01-18 17:38:51,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 17:38:51,310 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:51,310 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 17:38:51,311 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:51,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:51,311 INFO L82 PathProgramCache]: Analyzing trace with hash 30004, now seen corresponding path program 1 times [2019-01-18 17:38:51,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:51,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:51,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:51,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:51,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:51,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:51,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:51,371 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:51,371 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 17:38:51,371 INFO L207 CegarAbsIntRunner]: [0], [6], [27] [2019-01-18 17:38:51,378 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:51,378 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:51,388 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:51,388 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:38:51,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:51,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:51,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:51,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:51,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:51,398 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:51,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:51,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-18 17:38:51,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-18 17:38:51,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-18 17:38:51,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-18 17:38:51,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,571 INFO L478 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 30 treesize of output 72 [2019-01-18 17:38:51,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,617 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-18 17:38:51,618 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:51,706 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:51,776 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:51,816 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:51,829 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:51,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:51,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-18 17:38:51,876 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:51,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:51,905 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:45, output treesize:46 [2019-01-18 17:38:51,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:51,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-18 17:38:51,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:52,058 INFO L267 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-01-18 17:38:52,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-18 17:38:52,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:52,072 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:52,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:52,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-18 17:38:52,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-18 17:38:52,096 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:38:52,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 17:38:52,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 17:38:52,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-18 17:38:52,097 INFO L87 Difference]: Start difference. First operand 18 states and 37 transitions. Second operand 4 states. [2019-01-18 17:38:52,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:52,167 INFO L93 Difference]: Finished difference Result 23 states and 60 transitions. [2019-01-18 17:38:52,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 17:38:52,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-18 17:38:52,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:52,169 INFO L225 Difference]: With dead ends: 23 [2019-01-18 17:38:52,169 INFO L226 Difference]: Without dead ends: 22 [2019-01-18 17:38:52,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-18 17:38:52,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-18 17:38:52,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-18 17:38:52,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-18 17:38:52,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2019-01-18 17:38:52,176 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 59 transitions. Word has length 3 [2019-01-18 17:38:52,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:52,177 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 59 transitions. [2019-01-18 17:38:52,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 17:38:52,177 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 59 transitions. [2019-01-18 17:38:52,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 17:38:52,178 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:52,178 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 17:38:52,178 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:52,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:52,178 INFO L82 PathProgramCache]: Analyzing trace with hash 30562, now seen corresponding path program 1 times [2019-01-18 17:38:52,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:52,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:52,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:52,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:52,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:52,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:52,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:52,264 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:52,264 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 17:38:52,264 INFO L207 CegarAbsIntRunner]: [0], [24], [27] [2019-01-18 17:38:52,267 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:52,267 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:52,275 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:52,276 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:38:52,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:52,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:52,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:52,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:52,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:52,287 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:52,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:52,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-18 17:38:52,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:52,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-18 17:38:52,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-18 17:38:52,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-18 17:38:52,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-18 17:38:52,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,571 INFO L478 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 30 treesize of output 72 [2019-01-18 17:38:52,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,672 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-18 17:38:52,673 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:52,766 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:52,791 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:52,809 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:52,823 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:52,836 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:52,896 INFO L267 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-01-18 17:38:52,897 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-01-18 17:38:52,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:52,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-18 17:38:52,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:53,027 INFO L267 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-01-18 17:38:53,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-18 17:38:53,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:53,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:53,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:53,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:53,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-18 17:38:53,137 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:53,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 17:38:53,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 17:38:53,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:38:53,137 INFO L87 Difference]: Start difference. First operand 21 states and 59 transitions. Second operand 6 states. [2019-01-18 17:38:54,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:54,557 INFO L93 Difference]: Finished difference Result 50 states and 96 transitions. [2019-01-18 17:38:54,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:38:54,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-18 17:38:54,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:54,560 INFO L225 Difference]: With dead ends: 50 [2019-01-18 17:38:54,560 INFO L226 Difference]: Without dead ends: 47 [2019-01-18 17:38:54,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-18 17:38:54,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-18 17:38:54,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 24. [2019-01-18 17:38:54,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-18 17:38:54,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 74 transitions. [2019-01-18 17:38:54,568 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 74 transitions. Word has length 3 [2019-01-18 17:38:54,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:54,568 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 74 transitions. [2019-01-18 17:38:54,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 17:38:54,569 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 74 transitions. [2019-01-18 17:38:54,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 17:38:54,569 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:54,569 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 17:38:54,570 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:54,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:54,570 INFO L82 PathProgramCache]: Analyzing trace with hash 30128, now seen corresponding path program 1 times [2019-01-18 17:38:54,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:54,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:54,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:54,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:54,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:54,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:54,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:54,645 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:54,645 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 17:38:54,646 INFO L207 CegarAbsIntRunner]: [0], [10], [27] [2019-01-18 17:38:54,648 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:54,648 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:54,656 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:54,656 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:38:54,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:54,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:54,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:54,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:54,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:54,668 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:54,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:54,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-18 17:38:54,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:54,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-18 17:38:54,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:54,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:54,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-18 17:38:54,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:54,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:54,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:54,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-18 17:38:54,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:54,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:54,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:54,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:54,779 INFO L478 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 30 treesize of output 72 [2019-01-18 17:38:54,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:54,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:54,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:54,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:54,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:54,796 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-18 17:38:54,797 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:54,841 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:54,881 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:54,933 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:54,960 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:54,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:55,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-18 17:38:55,011 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:55,037 INFO L267 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-01-18 17:38:55,038 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-01-18 17:38:55,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:55,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-18 17:38:55,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:55,238 INFO L267 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-01-18 17:38:55,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-18 17:38:55,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:55,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:55,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:55,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:55,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-18 17:38:55,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:55,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 17:38:55,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 17:38:55,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:38:55,365 INFO L87 Difference]: Start difference. First operand 24 states and 74 transitions. Second operand 6 states. [2019-01-18 17:38:56,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:56,408 INFO L93 Difference]: Finished difference Result 50 states and 108 transitions. [2019-01-18 17:38:56,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:38:56,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-18 17:38:56,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:56,410 INFO L225 Difference]: With dead ends: 50 [2019-01-18 17:38:56,410 INFO L226 Difference]: Without dead ends: 48 [2019-01-18 17:38:56,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-18 17:38:56,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-18 17:38:56,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 26. [2019-01-18 17:38:56,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-18 17:38:56,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 87 transitions. [2019-01-18 17:38:56,419 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 87 transitions. Word has length 3 [2019-01-18 17:38:56,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:56,419 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 87 transitions. [2019-01-18 17:38:56,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 17:38:56,419 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 87 transitions. [2019-01-18 17:38:56,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:38:56,420 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:56,420 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:38:56,421 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:56,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:56,421 INFO L82 PathProgramCache]: Analyzing trace with hash 941528, now seen corresponding path program 1 times [2019-01-18 17:38:56,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:56,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:56,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:56,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:56,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:56,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:56,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:56,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:56,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:56,538 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:38:56,539 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [27] [2019-01-18 17:38:56,540 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:38:56,540 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:38:56,548 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:38:56,549 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:38:56,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:56,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:38:56,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:56,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:38:56,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:56,563 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:56,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:56,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-18 17:38:56,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-18 17:38:56,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-18 17:38:56,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-18 17:38:56,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,829 INFO L478 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 30 treesize of output 72 [2019-01-18 17:38:56,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:56,844 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-18 17:38:56,845 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:57,143 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:57,166 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:57,184 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:57,198 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:57,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:57,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-18 17:38:57,242 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:57,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:57,267 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-18 17:38:57,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-18 17:38:57,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:57,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:38:57,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-18 17:38:57,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:38:57,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 105 [2019-01-18 17:38:57,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:57,502 INFO L267 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-01-18 17:38:57,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:48 [2019-01-18 17:38:57,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:57,650 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:57,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:57,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:57,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:38:57,693 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:57,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:38:57,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:38:57,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:38:57,694 INFO L87 Difference]: Start difference. First operand 26 states and 87 transitions. Second operand 8 states. [2019-01-18 17:39:00,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:00,475 INFO L93 Difference]: Finished difference Result 62 states and 145 transitions. [2019-01-18 17:39:00,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:39:00,476 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 17:39:00,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:00,478 INFO L225 Difference]: With dead ends: 62 [2019-01-18 17:39:00,478 INFO L226 Difference]: Without dead ends: 58 [2019-01-18 17:39:00,479 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-01-18 17:39:00,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-18 17:39:00,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 30. [2019-01-18 17:39:00,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-18 17:39:00,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 105 transitions. [2019-01-18 17:39:00,486 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 105 transitions. Word has length 4 [2019-01-18 17:39:00,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:00,487 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 105 transitions. [2019-01-18 17:39:00,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:39:00,487 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 105 transitions. [2019-01-18 17:39:00,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:39:00,488 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:00,488 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:39:00,488 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:00,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:00,488 INFO L82 PathProgramCache]: Analyzing trace with hash 941590, now seen corresponding path program 1 times [2019-01-18 17:39:00,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:00,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:00,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:00,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:00,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:00,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:00,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:00,588 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:00,588 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:39:00,589 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [27] [2019-01-18 17:39:00,589 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:39:00,590 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:39:00,595 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:39:00,596 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:39:00,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:00,596 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:39:00,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:00,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:00,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:00,605 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:39:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:00,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:00,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-18 17:39:00,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:00,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-18 17:39:00,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-18 17:39:00,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-18 17:39:00,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-18 17:39:00,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,721 INFO L478 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 30 treesize of output 72 [2019-01-18 17:39:00,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,753 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-18 17:39:00,754 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:00,818 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:00,856 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:00,883 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:00,901 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:00,916 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:00,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:00,946 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-18 17:39:00,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:00,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-18 17:39:01,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:01,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:01,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-18 17:39:01,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:01,135 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:01,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-18 17:39:01,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:01,201 INFO L267 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-01-18 17:39:01,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-01-18 17:39:01,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:01,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:01,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:01,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:01,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:39:01,412 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:01,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:39:01,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:39:01,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:39:01,413 INFO L87 Difference]: Start difference. First operand 30 states and 105 transitions. Second operand 8 states. [2019-01-18 17:39:04,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:04,097 INFO L93 Difference]: Finished difference Result 60 states and 147 transitions. [2019-01-18 17:39:04,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:39:04,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 17:39:04,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:04,099 INFO L225 Difference]: With dead ends: 60 [2019-01-18 17:39:04,099 INFO L226 Difference]: Without dead ends: 56 [2019-01-18 17:39:04,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:39:04,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-18 17:39:04,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2019-01-18 17:39:04,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-18 17:39:04,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 110 transitions. [2019-01-18 17:39:04,108 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 110 transitions. Word has length 4 [2019-01-18 17:39:04,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:04,108 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 110 transitions. [2019-01-18 17:39:04,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:39:04,108 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 110 transitions. [2019-01-18 17:39:04,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:39:04,109 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:04,109 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:39:04,109 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:04,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:04,109 INFO L82 PathProgramCache]: Analyzing trace with hash 941156, now seen corresponding path program 1 times [2019-01-18 17:39:04,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:04,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:04,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:04,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:04,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:04,246 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-18 17:39:04,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:04,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:04,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:04,271 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:39:04,271 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [27] [2019-01-18 17:39:04,273 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:39:04,273 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:39:04,279 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:39:04,279 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:39:04,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:04,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:39:04,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:04,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:04,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:04,289 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:39:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:04,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:04,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-18 17:39:04,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-18 17:39:04,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-18 17:39:04,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-18 17:39:04,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-18 17:39:04,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,422 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-18 17:39:04,423 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:04,464 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:04,487 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:04,505 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:04,519 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:04,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:04,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-18 17:39:04,558 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:04,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:04,581 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-18 17:39:04,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-18 17:39:04,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:04,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:04,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-18 17:39:04,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:04,766 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:39:04,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-18 17:39:04,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:04,845 INFO L267 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-01-18 17:39:04,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-01-18 17:39:04,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:04,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:05,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:05,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:05,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:39:05,037 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:05,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:39:05,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:39:05,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:39:05,038 INFO L87 Difference]: Start difference. First operand 30 states and 110 transitions. Second operand 8 states. [2019-01-18 17:39:07,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:07,755 INFO L93 Difference]: Finished difference Result 57 states and 144 transitions. [2019-01-18 17:39:07,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:39:07,756 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 17:39:07,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:07,757 INFO L225 Difference]: With dead ends: 57 [2019-01-18 17:39:07,757 INFO L226 Difference]: Without dead ends: 55 [2019-01-18 17:39:07,758 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-01-18 17:39:07,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-18 17:39:07,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-01-18 17:39:07,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-18 17:39:07,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2019-01-18 17:39:07,768 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 109 transitions. Word has length 4 [2019-01-18 17:39:07,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:07,768 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 109 transitions. [2019-01-18 17:39:07,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:39:07,768 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 109 transitions. [2019-01-18 17:39:07,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:39:07,769 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:07,769 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:39:07,770 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:07,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:07,770 INFO L82 PathProgramCache]: Analyzing trace with hash 941280, now seen corresponding path program 1 times [2019-01-18 17:39:07,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:07,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:07,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:07,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:07,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:07,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:07,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:07,866 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:07,866 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:39:07,867 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [27] [2019-01-18 17:39:07,868 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:39:07,868 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:39:07,874 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:39:07,874 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:39:07,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:07,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:39:07,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:07,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:07,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:07,890 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:39:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:07,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:07,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-18 17:39:07,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:07,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-18 17:39:07,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:07,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-18 17:39:07,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:07,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:07,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-18 17:39:07,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-18 17:39:08,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,018 INFO L478 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 30 treesize of output 72 [2019-01-18 17:39:08,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,030 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-18 17:39:08,031 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:08,177 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:08,197 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:08,212 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:08,226 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:08,238 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:08,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:08,262 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-18 17:39:08,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-18 17:39:08,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:08,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:08,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-18 17:39:08,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:08,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-18 17:39:08,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:08,508 INFO L267 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-01-18 17:39:08,509 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:48 [2019-01-18 17:39:08,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:08,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:08,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:08,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:08,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:39:08,694 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:08,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:39:08,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:39:08,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:39:08,698 INFO L87 Difference]: Start difference. First operand 30 states and 109 transitions. Second operand 8 states. [2019-01-18 17:39:10,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:10,706 INFO L93 Difference]: Finished difference Result 57 states and 158 transitions. [2019-01-18 17:39:10,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:39:10,707 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 17:39:10,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:10,708 INFO L225 Difference]: With dead ends: 57 [2019-01-18 17:39:10,708 INFO L226 Difference]: Without dead ends: 53 [2019-01-18 17:39:10,709 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-01-18 17:39:10,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-18 17:39:10,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 31. [2019-01-18 17:39:10,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-18 17:39:10,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 126 transitions. [2019-01-18 17:39:10,718 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 126 transitions. Word has length 4 [2019-01-18 17:39:10,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:10,718 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 126 transitions. [2019-01-18 17:39:10,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:39:10,718 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 126 transitions. [2019-01-18 17:39:10,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:39:10,719 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:10,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:39:10,719 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:10,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:10,720 INFO L82 PathProgramCache]: Analyzing trace with hash 929872, now seen corresponding path program 1 times [2019-01-18 17:39:10,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:10,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:10,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:10,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:10,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:10,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:10,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:10,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:10,809 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:39:10,809 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [27] [2019-01-18 17:39:10,810 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:39:10,811 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:39:10,816 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:39:10,816 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:39:10,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:10,817 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:39:10,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:10,817 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:10,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:10,834 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:39:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:10,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:10,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-18 17:39:10,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:10,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-18 17:39:10,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:10,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-18 17:39:10,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:10,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:10,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-18 17:39:10,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:10,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:10,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:10,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-18 17:39:10,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:10,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:10,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:10,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:10,958 INFO L478 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 30 treesize of output 72 [2019-01-18 17:39:10,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,016 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-18 17:39:11,017 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:11,074 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:11,111 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:11,135 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:11,153 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:11,170 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:11,204 INFO L267 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-01-18 17:39:11,204 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-01-18 17:39:11,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-18 17:39:11,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:11,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:11,346 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-18 17:39:11,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:11,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-18 17:39:11,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:11,494 INFO L267 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-01-18 17:39:11,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-18 17:39:11,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:11,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:11,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:11,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:11,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:39:11,615 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:11,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:39:11,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:39:11,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:39:11,616 INFO L87 Difference]: Start difference. First operand 31 states and 126 transitions. Second operand 8 states. [2019-01-18 17:39:13,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:13,241 INFO L93 Difference]: Finished difference Result 77 states and 200 transitions. [2019-01-18 17:39:13,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:39:13,242 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 17:39:13,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:13,244 INFO L225 Difference]: With dead ends: 77 [2019-01-18 17:39:13,244 INFO L226 Difference]: Without dead ends: 75 [2019-01-18 17:39:13,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:39:13,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-18 17:39:13,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 38. [2019-01-18 17:39:13,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-18 17:39:13,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 159 transitions. [2019-01-18 17:39:13,255 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 159 transitions. Word has length 4 [2019-01-18 17:39:13,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:13,255 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 159 transitions. [2019-01-18 17:39:13,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:39:13,255 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 159 transitions. [2019-01-18 17:39:13,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:39:13,256 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:13,256 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:39:13,256 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:13,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:13,256 INFO L82 PathProgramCache]: Analyzing trace with hash 930058, now seen corresponding path program 1 times [2019-01-18 17:39:13,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:13,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:13,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:13,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:13,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:13,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:13,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:13,361 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:13,361 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:39:13,361 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [27] [2019-01-18 17:39:13,362 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:39:13,362 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:39:13,367 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:39:13,367 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:39:13,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:13,368 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:39:13,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:13,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:13,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:13,379 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:39:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:13,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:13,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-18 17:39:13,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-18 17:39:13,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-18 17:39:13,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-18 17:39:13,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,484 INFO L478 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 30 treesize of output 72 [2019-01-18 17:39:13,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,506 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-18 17:39:13,507 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:13,551 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:13,573 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:13,591 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:13,603 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:13,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:13,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-18 17:39:13,645 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:13,668 INFO L267 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-01-18 17:39:13,668 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-01-18 17:39:13,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-18 17:39:13,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:13,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:39:13,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-18 17:39:13,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:13,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-18 17:39:13,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:13,897 INFO L267 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-01-18 17:39:13,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-18 17:39:14,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:14,212 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:14,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:14,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:14,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 17:39:14,319 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:14,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:39:14,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:39:14,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:39:14,320 INFO L87 Difference]: Start difference. First operand 38 states and 159 transitions. Second operand 8 states. [2019-01-18 17:39:16,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:16,010 INFO L93 Difference]: Finished difference Result 82 states and 241 transitions. [2019-01-18 17:39:16,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:39:16,010 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 17:39:16,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:16,012 INFO L225 Difference]: With dead ends: 82 [2019-01-18 17:39:16,012 INFO L226 Difference]: Without dead ends: 79 [2019-01-18 17:39:16,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:39:16,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-18 17:39:16,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 46. [2019-01-18 17:39:16,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-18 17:39:16,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 209 transitions. [2019-01-18 17:39:16,024 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 209 transitions. Word has length 4 [2019-01-18 17:39:16,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:16,024 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 209 transitions. [2019-01-18 17:39:16,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:39:16,024 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 209 transitions. [2019-01-18 17:39:16,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:39:16,026 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:16,026 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:39:16,026 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:16,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:16,026 INFO L82 PathProgramCache]: Analyzing trace with hash 930184, now seen corresponding path program 1 times [2019-01-18 17:39:16,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:16,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:16,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:16,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:16,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:16,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:16,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:16,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:16,134 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:39:16,135 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [29] [2019-01-18 17:39:16,136 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:39:16,136 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:39:16,145 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:39:16,145 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:39:16,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:16,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:39:16,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:16,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:39:16,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:16,154 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:39:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:16,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:16,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-18 17:39:16,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:16,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-18 17:39:16,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-18 17:39:16,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:16,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-18 17:39:16,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:16,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:16,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 46 [2019-01-18 17:39:16,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:16,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:16,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:16,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 60 [2019-01-18 17:39:16,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:16,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:16,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:16,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:16,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 75 [2019-01-18 17:39:16,254 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 17:39:16,301 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:16,325 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:16,344 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:16,361 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:16,375 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:39:16,405 INFO L267 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-01-18 17:39:16,405 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:42, output treesize:47 [2019-01-18 17:39:18,455 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 29 [2019-01-18 17:39:18,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:18,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:18,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:18,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:18,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:18,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:18,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:18,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:18,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:18,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:18,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:39:18,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 41 treesize of output 91 [2019-01-18 17:39:18,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-18 17:39:19,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 5 xjuncts. [2019-01-18 17:39:19,016 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:57, output treesize:196 [2019-01-18 17:39:31,343 WARN L181 SmtUtils]: Spent 12.25 s on a formula simplification that was a NOOP. DAG size: 106 [2019-01-18 17:39:31,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:31,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:31,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:31,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:31,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-18 17:39:31,400 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:31,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 17:39:31,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 17:39:31,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:39:31,401 INFO L87 Difference]: Start difference. First operand 46 states and 209 transitions. Second operand 6 states. [2019-01-18 17:40:04,638 WARN L181 SmtUtils]: Spent 33.18 s on a formula simplification. DAG size of input: 113 DAG size of output: 111 [2019-01-18 17:40:06,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:40:06,944 INFO L93 Difference]: Finished difference Result 59 states and 225 transitions. [2019-01-18 17:40:06,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:40:06,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-18 17:40:06,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:40:06,946 INFO L225 Difference]: With dead ends: 59 [2019-01-18 17:40:06,946 INFO L226 Difference]: Without dead ends: 58 [2019-01-18 17:40:06,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 47.6s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-18 17:40:06,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-18 17:40:06,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2019-01-18 17:40:06,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-18 17:40:06,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 216 transitions. [2019-01-18 17:40:06,957 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 216 transitions. Word has length 4 [2019-01-18 17:40:06,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:40:06,958 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 216 transitions. [2019-01-18 17:40:06,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 17:40:06,958 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 216 transitions. [2019-01-18 17:40:06,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:40:06,959 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:40:06,959 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:40:06,959 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:40:06,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:40:06,960 INFO L82 PathProgramCache]: Analyzing trace with hash 945000, now seen corresponding path program 1 times [2019-01-18 17:40:06,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:40:06,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:40:06,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:40:06,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:40:06,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:40:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:40:07,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:40:07,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:40:07,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:40:07,099 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:40:07,100 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [27] [2019-01-18 17:40:07,102 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:40:07,102 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:40:07,106 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:40:07,107 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:40:07,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:40:07,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:40:07,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:40:07,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:40:07,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:40:07,122 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:40:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:40:07,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:40:07,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-18 17:40:07,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-18 17:40:07,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-18 17:40:07,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-18 17:40:07,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,268 INFO L478 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 30 treesize of output 72 [2019-01-18 17:40:07,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,287 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-18 17:40:07,287 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:07,337 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:07,360 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:07,379 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:07,396 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:07,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:07,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-18 17:40:07,451 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:07,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:40:07,481 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-18 17:40:07,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-18 17:40:07,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:07,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:40:07,637 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-18 17:40:07,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:07,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-18 17:40:07,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:07,833 INFO L267 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-01-18 17:40:07,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-18 17:40:07,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:40:07,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:40:08,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:40:08,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:40:08,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:40:08,042 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:40:08,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:40:08,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:40:08,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:40:08,043 INFO L87 Difference]: Start difference. First operand 48 states and 216 transitions. Second operand 8 states. [2019-01-18 17:40:10,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:40:10,224 INFO L93 Difference]: Finished difference Result 84 states and 281 transitions. [2019-01-18 17:40:10,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:40:10,225 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 17:40:10,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:40:10,226 INFO L225 Difference]: With dead ends: 84 [2019-01-18 17:40:10,226 INFO L226 Difference]: Without dead ends: 82 [2019-01-18 17:40:10,227 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-01-18 17:40:10,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-18 17:40:10,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 52. [2019-01-18 17:40:10,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-18 17:40:10,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 244 transitions. [2019-01-18 17:40:10,239 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 244 transitions. Word has length 4 [2019-01-18 17:40:10,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:40:10,239 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 244 transitions. [2019-01-18 17:40:10,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:40:10,239 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 244 transitions. [2019-01-18 17:40:10,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:40:10,240 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:40:10,240 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:40:10,240 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:40:10,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:40:10,241 INFO L82 PathProgramCache]: Analyzing trace with hash 946922, now seen corresponding path program 1 times [2019-01-18 17:40:10,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:40:10,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:40:10,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:40:10,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:40:10,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:40:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:40:10,759 WARN L181 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 17 [2019-01-18 17:40:11,064 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-01-18 17:40:11,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:40:11,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:40:11,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:40:11,142 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:40:11,142 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [27] [2019-01-18 17:40:11,143 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:40:11,143 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:40:11,147 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:40:11,147 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:40:11,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:40:11,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:40:11,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:40:11,148 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:40:11,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:40:11,157 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:40:11,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:40:11,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:40:11,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-18 17:40:11,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-18 17:40:11,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-18 17:40:11,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-18 17:40:11,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,260 INFO L478 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 30 treesize of output 72 [2019-01-18 17:40:11,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,272 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-18 17:40:11,273 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:11,311 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:11,335 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:11,353 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:11,368 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:11,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:40:11,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-18 17:40:11,409 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:11,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 17:40:11,430 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-18 17:40:11,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-18 17:40:11,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:11,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-18 17:40:11,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-18 17:40:11,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:40:11,645 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:40:11,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 112 [2019-01-18 17:40:11,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:40:11,716 INFO L267 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-01-18 17:40:11,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-01-18 17:40:11,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:40:11,893 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:40:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:40:11,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:40:11,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:40:11,991 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:40:11,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:40:11,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:40:11,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:40:11,992 INFO L87 Difference]: Start difference. First operand 52 states and 244 transitions. Second operand 8 states. [2019-01-18 17:40:13,025 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-01-18 17:40:13,027 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-01-18 17:40:13,031 INFO L168 Benchmark]: Toolchain (without parser) took 86854.57 ms. Allocated memory was 136.3 MB in the beginning and 431.0 MB in the end (delta: 294.6 MB). Free memory was 103.8 MB in the beginning and 149.4 MB in the end (delta: -45.5 MB). Peak memory consumption was 249.1 MB. Max. memory is 7.1 GB. [2019-01-18 17:40:13,032 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 136.3 MB. Free memory is still 104.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-18 17:40:13,032 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.47 ms. Allocated memory is still 136.3 MB. Free memory was 103.4 MB in the beginning and 101.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-01-18 17:40:13,032 INFO L168 Benchmark]: Boogie Preprocessor took 32.51 ms. Allocated memory is still 136.3 MB. Free memory was 101.3 MB in the beginning and 100.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-18 17:40:13,033 INFO L168 Benchmark]: RCFGBuilder took 380.09 ms. Allocated memory is still 136.3 MB. Free memory was 100.0 MB in the beginning and 88.1 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 7.1 GB. [2019-01-18 17:40:13,033 INFO L168 Benchmark]: TraceAbstraction took 86370.98 ms. Allocated memory was 136.3 MB in the beginning and 431.0 MB in the end (delta: 294.6 MB). Free memory was 88.1 MB in the beginning and 149.4 MB in the end (delta: -61.2 MB). Peak memory consumption was 233.4 MB. Max. memory is 7.1 GB. [2019-01-18 17:40:13,035 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.21 ms. Allocated memory is still 136.3 MB. Free memory is still 104.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.47 ms. Allocated memory is still 136.3 MB. Free memory was 103.4 MB in the beginning and 101.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.51 ms. Allocated memory is still 136.3 MB. Free memory was 101.3 MB in the beginning and 100.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 380.09 ms. Allocated memory is still 136.3 MB. Free memory was 100.0 MB in the beginning and 88.1 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 86370.98 ms. Allocated memory was 136.3 MB in the beginning and 431.0 MB in the end (delta: 294.6 MB). Free memory was 88.1 MB in the beginning and 149.4 MB in the end (delta: -61.2 MB). Peak memory consumption was 233.4 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...