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-7-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-07 21:41:35,032 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 21:41:35,034 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 21:41:35,049 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 21:41:35,049 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 21:41:35,050 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 21:41:35,052 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 21:41:35,054 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 21:41:35,056 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 21:41:35,056 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 21:41:35,057 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 21:41:35,058 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 21:41:35,059 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 21:41:35,060 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 21:41:35,061 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 21:41:35,062 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 21:41:35,062 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 21:41:35,064 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 21:41:35,066 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 21:41:35,068 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 21:41:35,069 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 21:41:35,070 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 21:41:35,073 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 21:41:35,073 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 21:41:35,073 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 21:41:35,074 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 21:41:35,075 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 21:41:35,076 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 21:41:35,077 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 21:41:35,081 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 21:41:35,082 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 21:41:35,082 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 21:41:35,083 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 21:41:35,083 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 21:41:35,086 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 21:41:35,087 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 21:41:35,087 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-07 21:41:35,111 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 21:41:35,111 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 21:41:35,112 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 21:41:35,112 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 21:41:35,112 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 21:41:35,112 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 21:41:35,113 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 21:41:35,113 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 21:41:35,113 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-07 21:41:35,113 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 21:41:35,113 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-07 21:41:35,114 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-07 21:41:35,114 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 21:41:35,114 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 21:41:35,115 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 21:41:35,115 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 21:41:35,115 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 21:41:35,115 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 21:41:35,115 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 21:41:35,116 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 21:41:35,116 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 21:41:35,116 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 21:41:35,116 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 21:41:35,116 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 21:41:35,117 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 21:41:35,117 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 21:41:35,117 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 21:41:35,117 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 21:41:35,117 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 21:41:35,118 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 21:41:35,118 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 21:41:35,118 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 21:41:35,118 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 21:41:35,118 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 21:41:35,119 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 21:41:35,119 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 21:41:35,119 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 21:41:35,119 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 21:41:35,119 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 21:41:35,119 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 21:41:35,154 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 21:41:35,170 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 21:41:35,174 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 21:41:35,175 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 21:41:35,176 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 21:41:35,177 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-limited.bpl [2019-01-07 21:41:35,177 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-limited.bpl' [2019-01-07 21:41:35,220 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 21:41:35,222 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 21:41:35,223 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 21:41:35,223 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 21:41:35,223 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 21:41:35,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:41:35" (1/1) ... [2019-01-07 21:41:35,253 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:41:35" (1/1) ... [2019-01-07 21:41:35,285 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 21:41:35,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 21:41:35,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 21:41:35,287 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 21:41:35,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:41:35" (1/1) ... [2019-01-07 21:41:35,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:41:35" (1/1) ... [2019-01-07 21:41:35,301 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:41:35" (1/1) ... [2019-01-07 21:41:35,302 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:41:35" (1/1) ... [2019-01-07 21:41:35,313 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:41:35" (1/1) ... [2019-01-07 21:41:35,321 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:41:35" (1/1) ... [2019-01-07 21:41:35,323 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:41:35" (1/1) ... [2019-01-07 21:41:35,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 21:41:35,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 21:41:35,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 21:41:35,326 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 21:41:35,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:41:35" (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-07 21:41:35,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-07 21:41:35,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-07 21:41:35,826 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-07 21:41:35,826 INFO L286 CfgBuilder]: Removed 17 assue(true) statements. [2019-01-07 21:41:35,828 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 09:41:35 BoogieIcfgContainer [2019-01-07 21:41:35,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 21:41:35,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 21:41:35,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 21:41:35,833 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 21:41:35,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:41:35" (1/2) ... [2019-01-07 21:41:35,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0dc176 and model type speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 09:41:35, skipping insertion in model container [2019-01-07 21:41:35,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 09:41:35" (2/2) ... [2019-01-07 21:41:35,836 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-7-limited.bpl [2019-01-07 21:41:35,847 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 21:41:35,855 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-01-07 21:41:35,874 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-01-07 21:41:35,910 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 21:41:35,910 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 21:41:35,910 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 21:41:35,910 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 21:41:35,910 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 21:41:35,911 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 21:41:35,911 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 21:41:35,911 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 21:41:35,927 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-01-07 21:41:35,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-07 21:41:35,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:35,935 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-07 21:41:35,937 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:35,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:35,944 INFO L82 PathProgramCache]: Analyzing trace with hash 992, now seen corresponding path program 1 times [2019-01-07 21:41:35,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:36,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:36,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:36,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:36,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:36,163 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-07 21:41:36,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 21:41:36,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-07 21:41:36,166 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:41:36,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 21:41:36,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 21:41:36,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 21:41:36,191 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-01-07 21:41:36,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:36,388 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2019-01-07 21:41:36,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 21:41:36,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-07 21:41:36,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:36,406 INFO L225 Difference]: With dead ends: 33 [2019-01-07 21:41:36,406 INFO L226 Difference]: Without dead ends: 28 [2019-01-07 21:41:36,409 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-07 21:41:36,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-07 21:41:36,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2019-01-07 21:41:36,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-07 21:41:36,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2019-01-07 21:41:36,450 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 2 [2019-01-07 21:41:36,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:36,452 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2019-01-07 21:41:36,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 21:41:36,452 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2019-01-07 21:41:36,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 21:41:36,453 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:36,453 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 21:41:36,454 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:36,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:36,454 INFO L82 PathProgramCache]: Analyzing trace with hash 30816, now seen corresponding path program 1 times [2019-01-07 21:41:36,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:36,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:36,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:36,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:36,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:36,519 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-07 21:41:36,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 21:41:36,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-07 21:41:36,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:41:36,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 21:41:36,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 21:41:36,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 21:41:36,523 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 3 states. [2019-01-07 21:41:36,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:36,764 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2019-01-07 21:41:36,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 21:41:36,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-07 21:41:36,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:36,766 INFO L225 Difference]: With dead ends: 28 [2019-01-07 21:41:36,766 INFO L226 Difference]: Without dead ends: 27 [2019-01-07 21:41:36,767 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-07 21:41:36,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-07 21:41:36,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2019-01-07 21:41:36,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-07 21:41:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2019-01-07 21:41:36,772 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 3 [2019-01-07 21:41:36,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:36,772 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 30 transitions. [2019-01-07 21:41:36,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 21:41:36,773 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 30 transitions. [2019-01-07 21:41:36,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 21:41:36,773 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:36,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 21:41:36,774 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:36,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:36,774 INFO L82 PathProgramCache]: Analyzing trace with hash 30380, now seen corresponding path program 1 times [2019-01-07 21:41:36,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:36,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:36,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:36,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:36,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:37,043 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-07 21:41:37,059 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-07 21:41:37,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:37,059 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:37,060 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 21:41:37,062 INFO L207 CegarAbsIntRunner]: [0], [18], [31] [2019-01-07 21:41:37,101 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:37,102 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:37,186 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:37,187 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 3. Performed 86 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-07 21:41:37,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:37,194 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:37,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:37,195 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-07 21:41:37,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:37,206 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:37,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:37,426 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-01-07 21:41:37,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2019-01-07 21:41:37,514 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 34 treesize of output 29 [2019-01-07 21:41:37,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,584 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 25 treesize of output 39 [2019-01-07 21:41:37,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,631 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 27 treesize of output 53 [2019-01-07 21:41:37,778 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-01-07 21:41:37,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:41:37,809 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:37,814 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:37,817 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:37,825 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:37,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:37,889 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 24 treesize of output 27 [2019-01-07 21:41:37,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,899 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 27 treesize of output 33 [2019-01-07 21:41:37,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,920 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 29 treesize of output 43 [2019-01-07 21:41:37,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-07 21:41:37,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-07 21:41:37,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,002 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-07 21:41:38,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-01-07 21:41:38,032 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:38,488 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:38,545 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:38,581 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:38,605 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:38,636 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:38,653 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:38,691 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-07 21:41:38,692 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:71, output treesize:54 [2019-01-07 21:41:38,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-01-07 21:41:38,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:39,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:39,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:64, output treesize:54 [2019-01-07 21:41:40,380 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-07 21:41:40,381 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:40,406 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-07 21:41:40,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:40,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-07 21:41:40,427 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:40,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 21:41:40,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 21:41:40,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:41:40,428 INFO L87 Difference]: Start difference. First operand 17 states and 30 transitions. Second operand 6 states. [2019-01-07 21:42:00,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:00,511 INFO L93 Difference]: Finished difference Result 54 states and 79 transitions. [2019-01-07 21:42:00,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 21:42:00,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-07 21:42:00,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:00,513 INFO L225 Difference]: With dead ends: 54 [2019-01-07 21:42:00,514 INFO L226 Difference]: Without dead ends: 52 [2019-01-07 21:42:00,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-07 21:42:00,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-07 21:42:00,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 20. [2019-01-07 21:42:00,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-07 21:42:00,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 41 transitions. [2019-01-07 21:42:00,520 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 41 transitions. Word has length 3 [2019-01-07 21:42:00,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:00,520 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 41 transitions. [2019-01-07 21:42:00,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 21:42:00,521 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 41 transitions. [2019-01-07 21:42:00,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 21:42:00,521 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:00,521 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 21:42:00,522 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:00,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:00,522 INFO L82 PathProgramCache]: Analyzing trace with hash 30008, now seen corresponding path program 1 times [2019-01-07 21:42:00,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:00,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:00,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:00,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:00,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:00,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:00,578 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-07 21:42:00,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:00,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:00,579 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 21:42:00,579 INFO L207 CegarAbsIntRunner]: [0], [6], [31] [2019-01-07 21:42:00,580 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:42:00,580 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:42:00,592 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:42:00,593 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 3. Performed 86 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-07 21:42:00,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:00,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:42:00,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:00,593 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-07 21:42:00,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:00,604 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:42:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:00,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:00,705 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 24 treesize of output 27 [2019-01-07 21:42:00,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-01-07 21:42:00,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,767 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 29 treesize of output 43 [2019-01-07 21:42:00,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,786 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 31 treesize of output 57 [2019-01-07 21:42:00,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,810 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 33 treesize of output 75 [2019-01-07 21:42:00,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-07 21:42:00,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-01-07 21:42:00,876 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:00,950 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:01,001 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:01,030 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:01,055 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:01,074 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:01,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:01,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2019-01-07 21:42:01,200 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 34 treesize of output 29 [2019-01-07 21:42:01,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,258 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 25 treesize of output 39 [2019-01-07 21:42:01,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 53 [2019-01-07 21:42:01,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:42:01,422 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:01,426 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:01,428 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:01,429 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:01,431 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:01,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-07 21:42:01,461 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:71, output treesize:54 [2019-01-07 21:42:01,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:01,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 126 [2019-01-07 21:42:01,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:01,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-07 21:42:01,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:64, output treesize:54 [2019-01-07 21:42:01,726 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-07 21:42:01,726 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:01,752 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-07 21:42:01,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-07 21:42:01,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-07 21:42:01,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:42:01,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 21:42:01,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 21:42:01,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:42:01,773 INFO L87 Difference]: Start difference. First operand 20 states and 41 transitions. Second operand 4 states. [2019-01-07 21:42:01,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:01,902 INFO L93 Difference]: Finished difference Result 25 states and 67 transitions. [2019-01-07 21:42:01,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 21:42:01,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-07 21:42:01,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:01,904 INFO L225 Difference]: With dead ends: 25 [2019-01-07 21:42:01,904 INFO L226 Difference]: Without dead ends: 24 [2019-01-07 21:42:01,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:42:01,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-07 21:42:01,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-01-07 21:42:01,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-07 21:42:01,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-01-07 21:42:01,912 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 3 [2019-01-07 21:42:01,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:01,912 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-01-07 21:42:01,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 21:42:01,912 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-01-07 21:42:01,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 21:42:01,913 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:01,913 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 21:42:01,913 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:01,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:01,913 INFO L82 PathProgramCache]: Analyzing trace with hash 30132, now seen corresponding path program 1 times [2019-01-07 21:42:01,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:01,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:01,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:01,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:01,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:02,046 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-07 21:42:02,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:02,047 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:02,048 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 21:42:02,048 INFO L207 CegarAbsIntRunner]: [0], [10], [31] [2019-01-07 21:42:02,050 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:42:02,050 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:42:02,065 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:42:02,066 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 3. Performed 86 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-07 21:42:02,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:02,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:42:02,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:02,067 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-07 21:42:02,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:02,083 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:42:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:02,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:02,232 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-01-07 21:42:02,235 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 24 treesize of output 27 [2019-01-07 21:42:02,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,242 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 27 treesize of output 33 [2019-01-07 21:42:02,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-01-07 21:42:02,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,265 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 31 treesize of output 57 [2019-01-07 21:42:02,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,382 INFO L303 Elim1Store]: Index analysis took 115 ms [2019-01-07 21:42:02,383 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 33 treesize of output 75 [2019-01-07 21:42:02,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,403 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-07 21:42:02,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-01-07 21:42:02,423 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:02,590 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:02,648 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:02,679 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:02,706 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:02,728 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:02,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:02,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2019-01-07 21:42:02,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,859 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 33 treesize of output 48 [2019-01-07 21:42:02,864 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 36 treesize of output 45 [2019-01-07 21:42:02,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-07 21:42:02,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:42:02,957 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:02,960 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:02,962 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:02,964 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:02,973 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:03,008 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-07 21:42:03,009 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:82, output treesize:54 [2019-01-07 21:42:03,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:03,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 126 [2019-01-07 21:42:03,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:03,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-07 21:42:03,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:64, output treesize:54 [2019-01-07 21:42:04,542 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-07 21:42:04,542 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:04,557 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-07 21:42:04,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:04,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-07 21:42:04,584 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:04,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 21:42:04,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 21:42:04,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:42:04,584 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 6 states. [2019-01-07 21:42:23,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:23,409 INFO L93 Difference]: Finished difference Result 57 states and 111 transitions. [2019-01-07 21:42:23,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 21:42:23,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-07 21:42:23,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:23,413 INFO L225 Difference]: With dead ends: 57 [2019-01-07 21:42:23,413 INFO L226 Difference]: Without dead ends: 56 [2019-01-07 21:42:23,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-07 21:42:23,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-07 21:42:23,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 25. [2019-01-07 21:42:23,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-07 21:42:23,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 82 transitions. [2019-01-07 21:42:23,422 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 82 transitions. Word has length 3 [2019-01-07 21:42:23,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:23,422 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 82 transitions. [2019-01-07 21:42:23,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 21:42:23,423 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 82 transitions. [2019-01-07 21:42:23,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 21:42:23,423 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:23,423 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 21:42:23,424 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:23,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:23,424 INFO L82 PathProgramCache]: Analyzing trace with hash 30628, now seen corresponding path program 1 times [2019-01-07 21:42:23,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:23,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:23,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:23,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:23,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:23,593 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-01-07 21:42:23,600 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-07 21:42:23,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:23,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:23,601 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 21:42:23,601 INFO L207 CegarAbsIntRunner]: [0], [26], [31] [2019-01-07 21:42:23,603 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:42:23,604 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:42:23,613 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:42:23,613 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 3. Performed 86 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-07 21:42:23,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:23,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:42:23,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:23,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 21:42:23,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:23,623 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:42:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:23,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:23,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-07 21:42:23,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-01-07 21:42:23,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,730 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 29 treesize of output 43 [2019-01-07 21:42:23,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,749 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 31 treesize of output 57 [2019-01-07 21:42:23,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,769 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 33 treesize of output 75 [2019-01-07 21:42:23,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,794 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-07 21:42:23,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:23,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-01-07 21:42:23,817 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:23,897 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:23,943 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:23,977 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:24,004 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:24,030 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:24,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:24,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2019-01-07 21:42:24,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,141 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 33 treesize of output 48 [2019-01-07 21:42:24,149 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 36 treesize of output 45 [2019-01-07 21:42:24,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-07 21:42:24,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:42:24,225 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:24,228 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:24,230 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:24,233 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:24,236 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:24,270 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-07 21:42:24,271 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:82, output treesize:54 [2019-01-07 21:42:24,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:24,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 126 [2019-01-07 21:42:24,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:24,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-07 21:42:24,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:64, output treesize:54 [2019-01-07 21:42:25,601 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-07 21:42:25,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:25,612 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-07 21:42:25,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:25,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-07 21:42:25,632 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:25,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 21:42:25,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 21:42:25,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:42:25,633 INFO L87 Difference]: Start difference. First operand 25 states and 82 transitions. Second operand 6 states. [2019-01-07 21:42:44,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:44,193 INFO L93 Difference]: Finished difference Result 59 states and 127 transitions. [2019-01-07 21:42:44,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 21:42:44,196 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-07 21:42:44,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:44,197 INFO L225 Difference]: With dead ends: 59 [2019-01-07 21:42:44,198 INFO L226 Difference]: Without dead ends: 57 [2019-01-07 21:42:44,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-07 21:42:44,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-07 21:42:44,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 29. [2019-01-07 21:42:44,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-07 21:42:44,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 101 transitions. [2019-01-07 21:42:44,207 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 101 transitions. Word has length 3 [2019-01-07 21:42:44,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:44,207 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 101 transitions. [2019-01-07 21:42:44,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 21:42:44,208 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 101 transitions. [2019-01-07 21:42:44,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:42:44,208 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:44,208 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:42:44,209 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:44,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:44,209 INFO L82 PathProgramCache]: Analyzing trace with hash 955362, now seen corresponding path program 1 times [2019-01-07 21:42:44,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:44,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:44,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:44,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:44,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:44,253 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-07 21:42:44,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 21:42:44,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-07 21:42:44,254 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:42:44,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 21:42:44,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 21:42:44,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 21:42:44,254 INFO L87 Difference]: Start difference. First operand 29 states and 101 transitions. Second operand 3 states. [2019-01-07 21:42:44,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:44,322 INFO L93 Difference]: Finished difference Result 33 states and 102 transitions. [2019-01-07 21:42:44,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 21:42:44,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-07 21:42:44,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:44,323 INFO L225 Difference]: With dead ends: 33 [2019-01-07 21:42:44,324 INFO L226 Difference]: Without dead ends: 32 [2019-01-07 21:42:44,324 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-07 21:42:44,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-07 21:42:44,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-01-07 21:42:44,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-07 21:42:44,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 100 transitions. [2019-01-07 21:42:44,331 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 100 transitions. Word has length 4 [2019-01-07 21:42:44,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:44,331 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 100 transitions. [2019-01-07 21:42:44,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 21:42:44,332 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 100 transitions. [2019-01-07 21:42:44,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:42:44,332 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:44,332 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:42:44,333 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:44,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:44,333 INFO L82 PathProgramCache]: Analyzing trace with hash 941844, now seen corresponding path program 1 times [2019-01-07 21:42:44,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:44,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:44,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:44,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:44,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:44,403 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-07 21:42:44,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:44,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:44,404 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:42:44,404 INFO L207 CegarAbsIntRunner]: [0], [18], [32], [33] [2019-01-07 21:42:44,405 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:42:44,405 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:42:44,417 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:42:44,417 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 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-07 21:42:44,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:44,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:42:44,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:44,418 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-07 21:42:44,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:44,428 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:42:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:44,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:44,441 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 20 treesize of output 23 [2019-01-07 21:42:44,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-07 21:42:44,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-07 21:42:44,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2019-01-07 21:42:44,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2019-01-07 21:42:44,517 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:44,534 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:44,540 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:44,543 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:44,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:44,566 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 24 treesize of output 27 [2019-01-07 21:42:44,570 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 27 treesize of output 29 [2019-01-07 21:42:44,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2019-01-07 21:42:44,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,592 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 31 treesize of output 45 [2019-01-07 21:42:44,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-07 21:42:44,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,637 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2019-01-07 21:42:44,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,681 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 37 treesize of output 100 [2019-01-07 21:42:44,682 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:44,747 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:44,778 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:44,801 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:44,820 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:44,836 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:44,853 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:44,886 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-07 21:42:44,886 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:60, output treesize:55 [2019-01-07 21:42:44,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:44,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 104 [2019-01-07 21:42:44,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-07 21:42:45,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 2 xjuncts. [2019-01-07 21:42:45,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:104 [2019-01-07 21:42:46,725 WARN L181 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 35 [2019-01-07 21:42:46,730 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-07 21:42:46,731 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:46,790 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-07 21:42:46,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-07 21:42:46,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-07 21:42:46,811 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:42:46,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 21:42:46,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 21:42:46,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:42:46,812 INFO L87 Difference]: Start difference. First operand 29 states and 100 transitions. Second operand 4 states. [2019-01-07 21:42:46,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:46,872 INFO L93 Difference]: Finished difference Result 33 states and 111 transitions. [2019-01-07 21:42:46,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 21:42:46,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-07 21:42:46,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:46,874 INFO L225 Difference]: With dead ends: 33 [2019-01-07 21:42:46,874 INFO L226 Difference]: Without dead ends: 32 [2019-01-07 21:42:46,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:42:46,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-07 21:42:46,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-01-07 21:42:46,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-07 21:42:46,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 110 transitions. [2019-01-07 21:42:46,882 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 110 transitions. Word has length 4 [2019-01-07 21:42:46,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:46,882 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 110 transitions. [2019-01-07 21:42:46,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 21:42:46,882 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 110 transitions. [2019-01-07 21:42:46,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:42:46,883 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:46,883 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:42:46,883 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:46,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:46,883 INFO L82 PathProgramCache]: Analyzing trace with hash 941532, now seen corresponding path program 1 times [2019-01-07 21:42:46,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:46,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:46,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:46,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:46,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:46,987 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-07 21:42:46,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:46,987 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:46,988 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:42:46,988 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [31] [2019-01-07 21:42:46,990 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:42:46,990 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:42:46,996 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:42:46,997 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 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-07 21:42:46,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:46,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:42:46,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:46,997 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-07 21:42:47,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:47,011 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:42:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:47,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:47,089 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 24 treesize of output 27 [2019-01-07 21:42:47,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,093 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 27 treesize of output 33 [2019-01-07 21:42:47,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,100 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 29 treesize of output 43 [2019-01-07 21:42:47,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,107 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 31 treesize of output 57 [2019-01-07 21:42:47,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,137 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 33 treesize of output 75 [2019-01-07 21:42:47,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,151 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-07 21:42:47,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-01-07 21:42:47,190 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:47,250 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:47,280 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:47,305 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:47,327 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:47,346 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:47,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:47,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2019-01-07 21:42:47,411 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 34 treesize of output 29 [2019-01-07 21:42:47,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:42:47,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,424 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 27 treesize of output 53 [2019-01-07 21:42:47,560 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-01-07 21:42:47,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:42:47,570 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:47,572 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:47,574 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:47,576 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:47,578 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:47,608 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-07 21:42:47,608 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:71, output treesize:54 [2019-01-07 21:42:47,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-01-07 21:42:47,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:47,862 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-07 21:42:47,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:54 [2019-01-07 21:42:47,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:47,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 134 [2019-01-07 21:42:47,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:48,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-07 21:42:48,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:66, output treesize:56 [2019-01-07 21:42:50,308 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-07 21:42:50,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:50,333 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-07 21:42:50,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:50,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:42:50,353 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:50,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:42:50,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:42:50,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:42:50,354 INFO L87 Difference]: Start difference. First operand 31 states and 110 transitions. Second operand 8 states. [2019-01-07 21:43:25,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:43:25,587 INFO L93 Difference]: Finished difference Result 74 states and 179 transitions. [2019-01-07 21:43:25,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:43:25,589 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 21:43:25,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:43:25,590 INFO L225 Difference]: With dead ends: 74 [2019-01-07 21:43:25,590 INFO L226 Difference]: Without dead ends: 72 [2019-01-07 21:43:25,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:43:25,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-07 21:43:25,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2019-01-07 21:43:25,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-07 21:43:25,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 139 transitions. [2019-01-07 21:43:25,599 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 139 transitions. Word has length 4 [2019-01-07 21:43:25,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:43:25,599 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 139 transitions. [2019-01-07 21:43:25,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:43:25,599 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 139 transitions. [2019-01-07 21:43:25,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:43:25,600 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:43:25,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:43:25,601 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:43:25,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:25,601 INFO L82 PathProgramCache]: Analyzing trace with hash 941160, now seen corresponding path program 1 times [2019-01-07 21:43:25,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:43:25,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:25,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:25,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:43:25,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:43:25,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:25,766 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-07 21:43:25,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:25,766 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:43:25,766 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:43:25,766 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [31] [2019-01-07 21:43:25,768 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:43:25,768 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:43:25,774 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:43:25,774 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 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-07 21:43:25,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:43:25,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:43:25,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:43:25,775 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-07 21:43:25,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:43:25,787 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:43:25,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:43:25,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:43:25,853 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 24 treesize of output 27 [2019-01-07 21:43:25,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,865 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 27 treesize of output 33 [2019-01-07 21:43:25,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-01-07 21:43:25,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,885 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 31 treesize of output 57 [2019-01-07 21:43:25,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-07 21:43:25,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,905 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-07 21:43:25,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:25,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-01-07 21:43:25,920 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:25,981 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:26,015 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:26,045 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:26,065 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:26,084 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:26,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:26,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 49 [2019-01-07 21:43:26,157 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 45 treesize of output 37 [2019-01-07 21:43:26,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 64 [2019-01-07 21:43:26,188 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 40 treesize of output 59 [2019-01-07 21:43:26,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:43:26,246 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:26,249 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:26,250 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:26,252 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:26,255 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:43:26,286 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-07 21:43:26,286 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:85, output treesize:54 [2019-01-07 21:43:26,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-01-07 21:43:26,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:26,444 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-07 21:43:26,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:54 [2019-01-07 21:43:26,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:43:26,685 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:43:26,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 135 [2019-01-07 21:43:26,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:43:26,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-07 21:43:26,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:66, output treesize:54 [2019-01-07 21:43:29,062 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-07 21:43:29,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:43:29,086 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-07 21:43:29,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:43:29,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:43:29,106 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:43:29,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:43:29,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:43:29,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:43:29,107 INFO L87 Difference]: Start difference. First operand 38 states and 139 transitions. Second operand 8 states. [2019-01-07 21:44:05,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:44:05,629 INFO L93 Difference]: Finished difference Result 71 states and 181 transitions. [2019-01-07 21:44:05,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:44:05,629 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 21:44:05,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:44:05,631 INFO L225 Difference]: With dead ends: 71 [2019-01-07 21:44:05,631 INFO L226 Difference]: Without dead ends: 70 [2019-01-07 21:44:05,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:44:05,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-07 21:44:05,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 38. [2019-01-07 21:44:05,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-07 21:44:05,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 139 transitions. [2019-01-07 21:44:05,640 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 139 transitions. Word has length 4 [2019-01-07 21:44:05,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:44:05,640 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 139 transitions. [2019-01-07 21:44:05,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:44:05,640 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 139 transitions. [2019-01-07 21:44:05,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:44:05,641 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:44:05,641 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:44:05,641 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:44:05,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:44:05,642 INFO L82 PathProgramCache]: Analyzing trace with hash 941656, now seen corresponding path program 1 times [2019-01-07 21:44:05,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:44:05,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:44:05,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:44:05,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:44:05,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:44:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:44:05,724 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-07 21:44:05,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:44:05,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:44:05,725 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:44:05,725 INFO L207 CegarAbsIntRunner]: [0], [18], [26], [31] [2019-01-07 21:44:05,727 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:44:05,727 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:44:05,735 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:44:05,735 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 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-07 21:44:05,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:44:05,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:44:05,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:44:05,736 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-07 21:44:05,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:44:05,744 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:44:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:44:05,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:44:05,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2019-01-07 21:44:05,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,899 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 33 treesize of output 48 [2019-01-07 21:44:05,903 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 36 treesize of output 45 [2019-01-07 21:44:05,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:05,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-07 21:44:06,200 WARN L181 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-01-07 21:44:06,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:44:06,210 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:06,212 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:06,214 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:06,216 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:06,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:06,239 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 24 treesize of output 27 [2019-01-07 21:44:06,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,244 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 27 treesize of output 33 [2019-01-07 21:44:06,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,249 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 29 treesize of output 43 [2019-01-07 21:44:06,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,260 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 31 treesize of output 57 [2019-01-07 21:44:06,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-07 21:44:06,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,351 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-07 21:44:06,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-01-07 21:44:06,367 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:06,427 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:06,460 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:06,487 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:06,509 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:06,525 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:06,539 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:06,569 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-07 21:44:06,570 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:82, output treesize:54 [2019-01-07 21:44:06,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-01-07 21:44:06,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:06,709 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-07 21:44:06,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:54 [2019-01-07 21:44:06,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:06,787 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:44:06,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 135 [2019-01-07 21:44:06,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:06,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-07 21:44:06,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:66, output treesize:54 [2019-01-07 21:44:09,167 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-07 21:44:09,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:44:09,193 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-07 21:44:09,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:44:09,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:44:09,213 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:44:09,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:44:09,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:44:09,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:44:09,214 INFO L87 Difference]: Start difference. First operand 38 states and 139 transitions. Second operand 8 states. [2019-01-07 21:44:43,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:44:43,606 INFO L93 Difference]: Finished difference Result 71 states and 181 transitions. [2019-01-07 21:44:43,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:44:43,607 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 21:44:43,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:44:43,608 INFO L225 Difference]: With dead ends: 71 [2019-01-07 21:44:43,608 INFO L226 Difference]: Without dead ends: 69 [2019-01-07 21:44:43,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:44:43,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-07 21:44:43,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 37. [2019-01-07 21:44:43,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-07 21:44:43,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 138 transitions. [2019-01-07 21:44:43,618 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 138 transitions. Word has length 4 [2019-01-07 21:44:43,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:44:43,618 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 138 transitions. [2019-01-07 21:44:43,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:44:43,618 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 138 transitions. [2019-01-07 21:44:43,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:44:43,619 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:44:43,619 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:44:43,619 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:44:43,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:44:43,620 INFO L82 PathProgramCache]: Analyzing trace with hash 941718, now seen corresponding path program 1 times [2019-01-07 21:44:43,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:44:43,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:44:43,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:44:43,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:44:43,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:44:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:44:43,812 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-07 21:44:43,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:44:43,813 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:44:43,813 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:44:43,814 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [31] [2019-01-07 21:44:43,815 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:44:43,815 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:44:43,821 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:44:43,821 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 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-07 21:44:43,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:44:43,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:44:43,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:44:43,822 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-07 21:44:43,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:44:43,834 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:44:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:44:43,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:44:43,980 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-01-07 21:44:43,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 24 treesize of output 27 [2019-01-07 21:44:43,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:43,991 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 27 treesize of output 33 [2019-01-07 21:44:43,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:43,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:43,998 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 29 treesize of output 43 [2019-01-07 21:44:44,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:44,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:44,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:44,007 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 31 treesize of output 57 [2019-01-07 21:44:44,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:44,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:44,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:44,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:44,019 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 33 treesize of output 75 [2019-01-07 21:44:44,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:44,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:44,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:44,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:44,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:44,167 INFO L303 Elim1Store]: Index analysis took 145 ms [2019-01-07 21:44:44,169 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-07 21:44:44,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:44,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:44,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:44,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:44,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:44,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:44,307 INFO L303 Elim1Store]: Index analysis took 135 ms [2019-01-07 21:44:44,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-01-07 21:44:44,309 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:44,576 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:44,616 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:44,645 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:44,670 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:44,689 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:44,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:44,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:44,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:44,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2019-01-07 21:44:44,759 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 34 treesize of output 29 [2019-01-07 21:44:44,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:44,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:44,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:44:44,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:44,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:44,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:44,817 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 27 treesize of output 53 [2019-01-07 21:44:44,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:44,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:44,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:44,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:44,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:44,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:44:44,853 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:44,856 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:44,858 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:44,861 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:44,866 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:44:44,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-07 21:44:44,897 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:71, output treesize:54 [2019-01-07 21:44:44,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:44,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:44,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-01-07 21:44:45,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:45,146 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-07 21:44:45,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:54 [2019-01-07 21:44:45,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:44:45,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 142 [2019-01-07 21:44:45,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:44:45,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-07 21:44:45,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:66, output treesize:56 [2019-01-07 21:44:47,745 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-07 21:44:47,745 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:44:47,770 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-07 21:44:47,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:44:47,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:44:47,791 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:44:47,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:44:47,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:44:47,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:44:47,792 INFO L87 Difference]: Start difference. First operand 37 states and 138 transitions. Second operand 8 states. [2019-01-07 21:45:22,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:45:22,048 INFO L93 Difference]: Finished difference Result 74 states and 200 transitions. [2019-01-07 21:45:22,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:45:22,048 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 21:45:22,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:45:22,049 INFO L225 Difference]: With dead ends: 74 [2019-01-07 21:45:22,049 INFO L226 Difference]: Without dead ends: 63 [2019-01-07 21:45:22,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:45:22,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-07 21:45:22,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 35. [2019-01-07 21:45:22,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-07 21:45:22,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 155 transitions. [2019-01-07 21:45:22,057 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 155 transitions. Word has length 4 [2019-01-07 21:45:22,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:45:22,058 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 155 transitions. [2019-01-07 21:45:22,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:45:22,058 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 155 transitions. [2019-01-07 21:45:22,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:45:22,058 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:45:22,059 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:45:22,059 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:45:22,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:45:22,059 INFO L82 PathProgramCache]: Analyzing trace with hash 941284, now seen corresponding path program 1 times [2019-01-07 21:45:22,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:45:22,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:45:22,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:45:22,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:45:22,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:45:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:45:22,230 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-07 21:45:22,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:45:22,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:45:22,230 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:45:22,230 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [31] [2019-01-07 21:45:22,231 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:45:22,232 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:45:22,237 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:45:22,238 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 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-07 21:45:22,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:45:22,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:45:22,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:45:22,238 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-07 21:45:22,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:45:22,255 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:45:22,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:45:22,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:45:22,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2019-01-07 21:45:22,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2019-01-07 21:45:22,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,337 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 25 treesize of output 39 [2019-01-07 21:45:22,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,344 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 27 treesize of output 53 [2019-01-07 21:45:22,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 21:45:22,374 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:22,376 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:22,378 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:22,380 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:22,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:22,402 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 24 treesize of output 27 [2019-01-07 21:45:22,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-01-07 21:45:22,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-01-07 21:45:22,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-07 21:45:22,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,481 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 33 treesize of output 75 [2019-01-07 21:45:22,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,492 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-07 21:45:22,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-01-07 21:45:22,502 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:22,561 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:22,592 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:22,616 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:22,635 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:22,650 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:22,664 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:22,692 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-07 21:45:22,692 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:71, output treesize:54 [2019-01-07 21:45:22,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-01-07 21:45:22,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:22,831 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-07 21:45:22,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:54 [2019-01-07 21:45:22,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:22,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 142 [2019-01-07 21:45:22,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:23,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-07 21:45:23,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:66, output treesize:56 [2019-01-07 21:45:25,298 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-07 21:45:25,299 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:45:25,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:45:25,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:45:25,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:45:25,408 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:45:25,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:45:25,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:45:25,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:45:25,409 INFO L87 Difference]: Start difference. First operand 35 states and 155 transitions. Second operand 8 states. [2019-01-07 21:45:37,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:45:37,183 INFO L93 Difference]: Finished difference Result 67 states and 213 transitions. [2019-01-07 21:45:37,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:45:37,184 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 21:45:37,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:45:37,185 INFO L225 Difference]: With dead ends: 67 [2019-01-07 21:45:37,185 INFO L226 Difference]: Without dead ends: 65 [2019-01-07 21:45:37,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:45:37,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-07 21:45:37,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 38. [2019-01-07 21:45:37,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-07 21:45:37,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 178 transitions. [2019-01-07 21:45:37,195 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 178 transitions. Word has length 4 [2019-01-07 21:45:37,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:45:37,195 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 178 transitions. [2019-01-07 21:45:37,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:45:37,195 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 178 transitions. [2019-01-07 21:45:37,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:45:37,196 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:45:37,196 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:45:37,196 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:45:37,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:45:37,196 INFO L82 PathProgramCache]: Analyzing trace with hash 930312, now seen corresponding path program 1 times [2019-01-07 21:45:37,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:45:37,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:45:37,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:45:37,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:45:37,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:45:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:45:37,254 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-07 21:45:37,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:45:37,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:45:37,255 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:45:37,255 INFO L207 CegarAbsIntRunner]: [0], [6], [32], [33] [2019-01-07 21:45:37,257 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:45:37,257 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:45:37,262 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:45:37,262 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 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-07 21:45:37,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:45:37,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:45:37,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:45:37,263 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-07 21:45:37,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:45:37,273 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:45:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:45:37,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:45:37,321 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 24 treesize of output 27 [2019-01-07 21:45:37,323 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 27 treesize of output 33 [2019-01-07 21:45:37,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2019-01-07 21:45:37,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,337 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 31 treesize of output 49 [2019-01-07 21:45:37,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,350 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 33 treesize of output 63 [2019-01-07 21:45:37,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 85 [2019-01-07 21:45:37,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 104 [2019-01-07 21:45:37,387 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:37,450 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:37,477 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:37,503 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:37,522 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:37,539 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:37,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:37,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2019-01-07 21:45:37,598 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 34 treesize of output 29 [2019-01-07 21:45:37,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,603 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 25 treesize of output 35 [2019-01-07 21:45:37,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 45 [2019-01-07 21:45:37,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 33 [2019-01-07 21:45:37,642 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-07 21:45:37,655 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:37,705 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:37,709 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:37,713 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:45:37,744 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-07 21:45:37,744 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:68, output treesize:59 [2019-01-07 21:45:37,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:45:37,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 120 [2019-01-07 21:45:37,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-07 21:45:38,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 26 dim-0 vars, and 5 xjuncts. [2019-01-07 21:45:38,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:69, output treesize:236 [2019-01-07 21:45:44,547 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-01-07 21:45:44,748 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:45:44,750 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)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:626) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) 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: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 45 more [2019-01-07 21:45:44,755 INFO L168 Benchmark]: Toolchain (without parser) took 249534.27 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 810.5 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -325.2 MB). Peak memory consumption was 485.3 MB. Max. memory is 7.1 GB. [2019-01-07 21:45:44,756 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 21:45:44,756 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.36 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 21:45:44,756 INFO L168 Benchmark]: Boogie Preprocessor took 39.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 21:45:44,756 INFO L168 Benchmark]: RCFGBuilder took 502.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-01-07 21:45:44,757 INFO L168 Benchmark]: TraceAbstraction took 248925.09 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 810.5 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -346.4 MB). Peak memory consumption was 464.2 MB. Max. memory is 7.1 GB. [2019-01-07 21:45:44,758 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 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.36 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 502.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 248925.09 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 810.5 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -346.4 MB). Peak memory consumption was 464.2 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)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...