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/real-life/ElevatorWithAssignments.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:07:33,079 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:07:33,081 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:07:33,102 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:07:33,102 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:07:33,104 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:07:33,106 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:07:33,109 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:07:33,113 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:07:33,114 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:07:33,115 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:07:33,116 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:07:33,117 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:07:33,122 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:07:33,127 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:07:33,130 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:07:33,131 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:07:33,134 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:07:33,135 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:07:33,144 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:07:33,145 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:07:33,146 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:07:33,149 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:07:33,149 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:07:33,149 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:07:33,151 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:07:33,153 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:07:33,156 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:07:33,156 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:07:33,169 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:07:33,169 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:07:33,170 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:07:33,171 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:07:33,171 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:07:33,172 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:07:33,173 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:07:33,173 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:07:33,186 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:07:33,186 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:07:33,187 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:07:33,187 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:07:33,188 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:07:33,188 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:07:33,188 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:07:33,188 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:07:33,189 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:07:33,189 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:07:33,189 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:07:33,189 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:07:33,189 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:07:33,190 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:07:33,190 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:07:33,191 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:07:33,191 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:07:33,191 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:07:33,191 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:07:33,192 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:07:33,192 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:07:33,192 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:07:33,192 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:07:33,192 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:07:33,193 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:07:33,193 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:07:33,193 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:07:33,193 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:07:33,193 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:07:33,194 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:07:33,194 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:07:33,194 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:07:33,194 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:07:33,195 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:07:33,195 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:07:33,195 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:07:33,195 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:07:33,195 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:07:33,196 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:07:33,196 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:07:33,196 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:07:33,235 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:07:33,248 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:07:33,253 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:07:33,254 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:07:33,255 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:07:33,256 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/ElevatorWithAssignments.bpl [2018-12-03 15:07:33,256 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/ElevatorWithAssignments.bpl' [2018-12-03 15:07:33,310 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:07:33,312 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:07:33,313 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:07:33,313 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:07:33,313 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:07:33,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,343 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,349 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 15:07:33,350 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 15:07:33,350 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 15:07:33,352 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:07:33,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:07:33,354 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:07:33,354 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:07:33,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,381 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/1) ... [2018-12-03 15:07:33,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:07:33,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:07:33,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:07:33,389 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:07:33,393 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (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 [2018-12-03 15:07:33,485 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Elevator given in one single declaration [2018-12-03 15:07:33,485 INFO L130 BoogieDeclarations]: Found specification of procedure Elevator [2018-12-03 15:07:33,486 INFO L138 BoogieDeclarations]: Found implementation of procedure Elevator [2018-12-03 15:07:34,021 INFO L272 CfgBuilder]: Using library mode [2018-12-03 15:07:34,022 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:07:34,022 INFO L202 PluginConnector]: Adding new model ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:07:34 BoogieIcfgContainer [2018-12-03 15:07:34,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:07:34,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:07:34,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:07:34,027 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:07:34,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:33" (1/2) ... [2018-12-03 15:07:34,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cd368e3 and model type ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:07:34, skipping insertion in model container [2018-12-03 15:07:34,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:07:34" (2/2) ... [2018-12-03 15:07:34,031 INFO L112 eAbstractionObserver]: Analyzing ICFG ElevatorWithAssignments.bpl [2018-12-03 15:07:34,041 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:07:34,050 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:07:34,069 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:07:34,106 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:07:34,107 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:07:34,107 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:07:34,107 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:07:34,107 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:07:34,107 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:07:34,107 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:07:34,108 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:07:34,128 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-12-03 15:07:34,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-03 15:07:34,142 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:34,143 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-03 15:07:34,147 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 15:07:34,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:34,159 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-03 15:07:34,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:34,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:34,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:34,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:34,208 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:34,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:34,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:34,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:34,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-03 15:07:34,333 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:34,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:34,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:34,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:34,351 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2018-12-03 15:07:34,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:34,587 INFO L93 Difference]: Finished difference Result 84 states and 157 transitions. [2018-12-03 15:07:34,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:34,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-03 15:07:34,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:34,604 INFO L225 Difference]: With dead ends: 84 [2018-12-03 15:07:34,604 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 15:07:34,608 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 [2018-12-03 15:07:34,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 15:07:34,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-12-03 15:07:34,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 15:07:34,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 93 transitions. [2018-12-03 15:07:34,654 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 93 transitions. Word has length 2 [2018-12-03 15:07:34,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:34,654 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 93 transitions. [2018-12-03 15:07:34,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:34,654 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 93 transitions. [2018-12-03 15:07:34,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:07:34,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:34,656 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:34,656 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 15:07:34,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:34,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1770004619, now seen corresponding path program 1 times [2018-12-03 15:07:34,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:34,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:34,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:34,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:34,658 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:34,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:34,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:34,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:07:34,733 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:34,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:34,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:34,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:34,736 INFO L87 Difference]: Start difference. First operand 53 states and 93 transitions. Second operand 3 states. [2018-12-03 15:07:34,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:34,860 INFO L93 Difference]: Finished difference Result 157 states and 277 transitions. [2018-12-03 15:07:34,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:34,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 15:07:34,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:34,864 INFO L225 Difference]: With dead ends: 157 [2018-12-03 15:07:34,864 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 15:07:34,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:34,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 15:07:34,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-12-03 15:07:34,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 15:07:34,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 175 transitions. [2018-12-03 15:07:34,883 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 175 transitions. Word has length 14 [2018-12-03 15:07:34,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:34,883 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 175 transitions. [2018-12-03 15:07:34,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:34,883 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 175 transitions. [2018-12-03 15:07:34,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:07:34,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:34,885 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:34,886 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 15:07:34,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:34,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1068940041, now seen corresponding path program 1 times [2018-12-03 15:07:34,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:34,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:34,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:34,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:34,888 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:34,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:34,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:34,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:07:34,923 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:34,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:34,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:34,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:34,925 INFO L87 Difference]: Start difference. First operand 100 states and 175 transitions. Second operand 3 states. [2018-12-03 15:07:35,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:35,202 INFO L93 Difference]: Finished difference Result 205 states and 356 transitions. [2018-12-03 15:07:35,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:35,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 15:07:35,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:35,205 INFO L225 Difference]: With dead ends: 205 [2018-12-03 15:07:35,206 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 15:07:35,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:35,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 15:07:35,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 89. [2018-12-03 15:07:35,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 15:07:35,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 152 transitions. [2018-12-03 15:07:35,220 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 152 transitions. Word has length 14 [2018-12-03 15:07:35,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:35,220 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 152 transitions. [2018-12-03 15:07:35,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:35,220 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 152 transitions. [2018-12-03 15:07:35,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 15:07:35,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:35,222 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:35,222 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 15:07:35,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:35,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1940946465, now seen corresponding path program 1 times [2018-12-03 15:07:35,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:35,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:35,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:35,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:35,224 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:35,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:35,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:35,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:07:35,395 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:35,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:07:35,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:07:35,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:07:35,397 INFO L87 Difference]: Start difference. First operand 89 states and 152 transitions. Second operand 5 states. [2018-12-03 15:07:35,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:35,535 INFO L93 Difference]: Finished difference Result 321 states and 545 transitions. [2018-12-03 15:07:35,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:07:35,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-03 15:07:35,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:35,539 INFO L225 Difference]: With dead ends: 321 [2018-12-03 15:07:35,539 INFO L226 Difference]: Without dead ends: 209 [2018-12-03 15:07:35,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:07:35,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-12-03 15:07:35,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2018-12-03 15:07:35,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-12-03 15:07:35,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 346 transitions. [2018-12-03 15:07:35,567 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 346 transitions. Word has length 19 [2018-12-03 15:07:35,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:35,568 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 346 transitions. [2018-12-03 15:07:35,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:07:35,568 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 346 transitions. [2018-12-03 15:07:35,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 15:07:35,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:35,570 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:35,571 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 15:07:35,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:35,571 INFO L82 PathProgramCache]: Analyzing trace with hash 2002343284, now seen corresponding path program 1 times [2018-12-03 15:07:35,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:35,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:35,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:35,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:35,573 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:35,616 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:07:35,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:35,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:07:35,617 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:35,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:35,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:35,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:35,618 INFO L87 Difference]: Start difference. First operand 207 states and 346 transitions. Second operand 3 states. [2018-12-03 15:07:35,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:35,731 INFO L93 Difference]: Finished difference Result 522 states and 865 transitions. [2018-12-03 15:07:35,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:35,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-12-03 15:07:35,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:35,737 INFO L225 Difference]: With dead ends: 522 [2018-12-03 15:07:35,737 INFO L226 Difference]: Without dead ends: 310 [2018-12-03 15:07:35,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:35,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-12-03 15:07:35,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 213. [2018-12-03 15:07:35,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-03 15:07:35,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 352 transitions. [2018-12-03 15:07:35,761 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 352 transitions. Word has length 41 [2018-12-03 15:07:35,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:35,761 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 352 transitions. [2018-12-03 15:07:35,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:35,761 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 352 transitions. [2018-12-03 15:07:35,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 15:07:35,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:35,763 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:35,763 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 15:07:35,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:35,764 INFO L82 PathProgramCache]: Analyzing trace with hash 2074119508, now seen corresponding path program 1 times [2018-12-03 15:07:35,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:35,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:35,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:35,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:35,766 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:35,825 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-03 15:07:35,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:35,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:07:35,826 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:35,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:35,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:35,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:35,827 INFO L87 Difference]: Start difference. First operand 213 states and 352 transitions. Second operand 3 states. [2018-12-03 15:07:36,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:36,023 INFO L93 Difference]: Finished difference Result 588 states and 972 transitions. [2018-12-03 15:07:36,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:36,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-12-03 15:07:36,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:36,028 INFO L225 Difference]: With dead ends: 588 [2018-12-03 15:07:36,028 INFO L226 Difference]: Without dead ends: 367 [2018-12-03 15:07:36,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:36,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-12-03 15:07:36,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 354. [2018-12-03 15:07:36,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-12-03 15:07:36,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 570 transitions. [2018-12-03 15:07:36,089 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 570 transitions. Word has length 42 [2018-12-03 15:07:36,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:36,093 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 570 transitions. [2018-12-03 15:07:36,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:36,093 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 570 transitions. [2018-12-03 15:07:36,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 15:07:36,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:36,097 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:36,101 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 15:07:36,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:36,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1430938278, now seen corresponding path program 1 times [2018-12-03 15:07:36,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:36,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:36,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:36,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:36,103 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:36,215 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 15:07:36,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:36,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:07:36,216 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:36,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:36,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:36,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:36,218 INFO L87 Difference]: Start difference. First operand 354 states and 570 transitions. Second operand 3 states. [2018-12-03 15:07:36,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:36,446 INFO L93 Difference]: Finished difference Result 880 states and 1399 transitions. [2018-12-03 15:07:36,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:36,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-12-03 15:07:36,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:36,454 INFO L225 Difference]: With dead ends: 880 [2018-12-03 15:07:36,457 INFO L226 Difference]: Without dead ends: 542 [2018-12-03 15:07:36,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:36,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-12-03 15:07:36,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 366. [2018-12-03 15:07:36,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-12-03 15:07:36,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 582 transitions. [2018-12-03 15:07:36,489 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 582 transitions. Word has length 44 [2018-12-03 15:07:36,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:36,489 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 582 transitions. [2018-12-03 15:07:36,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:36,489 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 582 transitions. [2018-12-03 15:07:36,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 15:07:36,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:36,494 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:36,495 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 15:07:36,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:36,495 INFO L82 PathProgramCache]: Analyzing trace with hash -138883553, now seen corresponding path program 1 times [2018-12-03 15:07:36,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:36,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:36,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:36,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:36,500 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:36,612 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:07:36,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:36,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:07:36,613 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:36,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:07:36,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:07:36,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:07:36,615 INFO L87 Difference]: Start difference. First operand 366 states and 582 transitions. Second operand 4 states. [2018-12-03 15:07:36,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:36,760 INFO L93 Difference]: Finished difference Result 1096 states and 1744 transitions. [2018-12-03 15:07:36,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:36,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-03 15:07:36,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:36,767 INFO L225 Difference]: With dead ends: 1096 [2018-12-03 15:07:36,767 INFO L226 Difference]: Without dead ends: 731 [2018-12-03 15:07:36,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:07:36,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-12-03 15:07:36,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 666. [2018-12-03 15:07:36,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2018-12-03 15:07:36,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1037 transitions. [2018-12-03 15:07:36,799 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1037 transitions. Word has length 46 [2018-12-03 15:07:36,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:36,799 INFO L480 AbstractCegarLoop]: Abstraction has 666 states and 1037 transitions. [2018-12-03 15:07:36,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:07:36,800 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1037 transitions. [2018-12-03 15:07:36,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 15:07:36,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:36,802 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:36,802 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 15:07:36,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:36,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1242691348, now seen corresponding path program 1 times [2018-12-03 15:07:36,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:36,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:36,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:36,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:36,804 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:37,197 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-12-03 15:07:37,456 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2018-12-03 15:07:37,580 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:37,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:37,581 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:07:37,582 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-12-03 15:07:37,584 INFO L205 CegarAbsIntRunner]: [0], [2], [3], [6], [11], [17], [23], [26], [28], [33], [36], [38], [43], [46], [59], [62], [64], [67], [69], [74], [77], [83], [85], [88], [106], [109], [111], [114] [2018-12-03 15:07:37,643 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:07:37,643 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:07:38,446 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:07:38,447 INFO L272 AbstractInterpreter]: Visited 28 different actions 131 times. Merged at 27 different actions 77 times. Widened at 1 different actions 1 times. Found 22 fixpoints after 10 different actions. Largest state had 0 variables. [2018-12-03 15:07:38,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:38,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:07:38,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:38,495 INFO L192 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 [2018-12-03 15:07:38,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:38,509 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:07:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:38,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:07:38,802 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:38,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:07:39,149 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-12-03 15:07:39,156 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:39,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:07:39,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2018-12-03 15:07:39,178 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:07:39,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:07:39,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:07:39,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:07:39,179 INFO L87 Difference]: Start difference. First operand 666 states and 1037 transitions. Second operand 8 states. [2018-12-03 15:07:39,708 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-03 15:07:40,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:40,278 INFO L93 Difference]: Finished difference Result 1293 states and 2002 transitions. [2018-12-03 15:07:40,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:07:40,280 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-12-03 15:07:40,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:40,287 INFO L225 Difference]: With dead ends: 1293 [2018-12-03 15:07:40,287 INFO L226 Difference]: Without dead ends: 1292 [2018-12-03 15:07:40,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:07:40,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2018-12-03 15:07:40,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1176. [2018-12-03 15:07:40,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-12-03 15:07:40,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1825 transitions. [2018-12-03 15:07:40,331 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1825 transitions. Word has length 49 [2018-12-03 15:07:40,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:40,332 INFO L480 AbstractCegarLoop]: Abstraction has 1176 states and 1825 transitions. [2018-12-03 15:07:40,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:07:40,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1825 transitions. [2018-12-03 15:07:40,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 15:07:40,334 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:40,335 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:40,335 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 15:07:40,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:40,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1557173637, now seen corresponding path program 1 times [2018-12-03 15:07:40,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:40,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:40,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:40,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:40,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:40,558 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 15:07:40,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:40,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:07:40,558 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:40,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:07:40,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:07:40,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:07:40,560 INFO L87 Difference]: Start difference. First operand 1176 states and 1825 transitions. Second operand 4 states. [2018-12-03 15:07:41,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:41,007 INFO L93 Difference]: Finished difference Result 2655 states and 4085 transitions. [2018-12-03 15:07:41,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:07:41,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-03 15:07:41,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:41,018 INFO L225 Difference]: With dead ends: 2655 [2018-12-03 15:07:41,018 INFO L226 Difference]: Without dead ends: 1510 [2018-12-03 15:07:41,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:07:41,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-12-03 15:07:41,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1468. [2018-12-03 15:07:41,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1468 states. [2018-12-03 15:07:41,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 2236 transitions. [2018-12-03 15:07:41,069 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 2236 transitions. Word has length 67 [2018-12-03 15:07:41,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:41,069 INFO L480 AbstractCegarLoop]: Abstraction has 1468 states and 2236 transitions. [2018-12-03 15:07:41,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:07:41,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 2236 transitions. [2018-12-03 15:07:41,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 15:07:41,072 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:41,072 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:41,072 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 15:07:41,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:41,073 INFO L82 PathProgramCache]: Analyzing trace with hash -423460397, now seen corresponding path program 1 times [2018-12-03 15:07:41,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:41,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:41,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:41,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:41,074 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:41,131 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-03 15:07:41,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:41,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:07:41,131 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:41,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:07:41,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:07:41,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:07:41,132 INFO L87 Difference]: Start difference. First operand 1468 states and 2236 transitions. Second operand 4 states. [2018-12-03 15:07:41,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:41,334 INFO L93 Difference]: Finished difference Result 2726 states and 4172 transitions. [2018-12-03 15:07:41,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:41,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-03 15:07:41,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:41,344 INFO L225 Difference]: With dead ends: 2726 [2018-12-03 15:07:41,344 INFO L226 Difference]: Without dead ends: 1469 [2018-12-03 15:07:41,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:07:41,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2018-12-03 15:07:41,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1466. [2018-12-03 15:07:41,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1466 states. [2018-12-03 15:07:41,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 2172 transitions. [2018-12-03 15:07:41,398 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 2172 transitions. Word has length 68 [2018-12-03 15:07:41,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:41,399 INFO L480 AbstractCegarLoop]: Abstraction has 1466 states and 2172 transitions. [2018-12-03 15:07:41,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:07:41,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 2172 transitions. [2018-12-03 15:07:41,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 15:07:41,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:41,402 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:41,402 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 15:07:41,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:41,403 INFO L82 PathProgramCache]: Analyzing trace with hash -734626103, now seen corresponding path program 2 times [2018-12-03 15:07:41,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:41,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:41,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:41,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:41,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:41,489 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-03 15:07:41,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:41,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:07:41,490 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:41,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:41,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:41,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:41,491 INFO L87 Difference]: Start difference. First operand 1466 states and 2172 transitions. Second operand 3 states. [2018-12-03 15:07:41,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:41,760 INFO L93 Difference]: Finished difference Result 2942 states and 4353 transitions. [2018-12-03 15:07:41,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:41,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-03 15:07:41,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:41,768 INFO L225 Difference]: With dead ends: 2942 [2018-12-03 15:07:41,768 INFO L226 Difference]: Without dead ends: 1457 [2018-12-03 15:07:41,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:41,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2018-12-03 15:07:41,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1397. [2018-12-03 15:07:41,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1397 states. [2018-12-03 15:07:41,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 2012 transitions. [2018-12-03 15:07:41,821 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 2012 transitions. Word has length 69 [2018-12-03 15:07:41,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:41,822 INFO L480 AbstractCegarLoop]: Abstraction has 1397 states and 2012 transitions. [2018-12-03 15:07:41,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:41,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 2012 transitions. [2018-12-03 15:07:41,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 15:07:41,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:41,825 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:41,825 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 15:07:41,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:41,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1023158359, now seen corresponding path program 1 times [2018-12-03 15:07:41,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:41,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:41,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:07:41,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:41,827 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:41,905 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-03 15:07:41,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:41,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:07:41,906 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:41,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:41,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:41,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:41,908 INFO L87 Difference]: Start difference. First operand 1397 states and 2012 transitions. Second operand 3 states. [2018-12-03 15:07:42,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:42,245 INFO L93 Difference]: Finished difference Result 3297 states and 4763 transitions. [2018-12-03 15:07:42,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:42,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-12-03 15:07:42,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:42,255 INFO L225 Difference]: With dead ends: 3297 [2018-12-03 15:07:42,255 INFO L226 Difference]: Without dead ends: 1830 [2018-12-03 15:07:42,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:42,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2018-12-03 15:07:42,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1612. [2018-12-03 15:07:42,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1612 states. [2018-12-03 15:07:42,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2296 transitions. [2018-12-03 15:07:42,317 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2296 transitions. Word has length 84 [2018-12-03 15:07:42,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:42,318 INFO L480 AbstractCegarLoop]: Abstraction has 1612 states and 2296 transitions. [2018-12-03 15:07:42,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:42,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2296 transitions. [2018-12-03 15:07:42,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 15:07:42,322 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:42,322 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:42,322 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 15:07:42,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:42,323 INFO L82 PathProgramCache]: Analyzing trace with hash -147951611, now seen corresponding path program 1 times [2018-12-03 15:07:42,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:42,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:42,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:42,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:42,324 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:42,823 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 16 proven. 116 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 15:07:42,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:42,824 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:07:42,824 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 86 with the following transitions: [2018-12-03 15:07:42,824 INFO L205 CegarAbsIntRunner]: [0], [2], [3], [6], [9], [11], [17], [23], [26], [28], [33], [36], [38], [41], [43], [46], [57], [59], [62], [64], [67], [69], [74], [77], [83], [85], [88], [90], [95], [98], [106], [109], [111], [114] [2018-12-03 15:07:42,828 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:07:42,828 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:07:43,124 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:07:43,124 INFO L272 AbstractInterpreter]: Visited 34 different actions 185 times. Merged at 32 different actions 98 times. Widened at 1 different actions 1 times. Found 36 fixpoints after 14 different actions. Largest state had 0 variables. [2018-12-03 15:07:43,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:43,164 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:07:43,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:43,164 INFO L192 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 [2018-12-03 15:07:43,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:43,179 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:07:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:43,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:07:43,572 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 31 proven. 100 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 15:07:43,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:07:56,850 WARN L180 SmtUtils]: Spent 12.79 s on a formula simplification that was a NOOP. DAG size: 33 [2018-12-03 15:07:57,371 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 9 [2018-12-03 15:07:57,423 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 4 proven. 127 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 15:07:57,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:07:57,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2018-12-03 15:07:57,443 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:07:57,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 15:07:57,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 15:07:57,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:07:57,446 INFO L87 Difference]: Start difference. First operand 1612 states and 2296 transitions. Second operand 13 states. [2018-12-03 15:07:58,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:58,992 INFO L93 Difference]: Finished difference Result 3128 states and 4425 transitions. [2018-12-03 15:07:58,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:07:58,993 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 85 [2018-12-03 15:07:58,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:59,008 INFO L225 Difference]: With dead ends: 3128 [2018-12-03 15:07:59,008 INFO L226 Difference]: Without dead ends: 3127 [2018-12-03 15:07:59,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 158 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:07:59,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3127 states. [2018-12-03 15:07:59,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3127 to 1270. [2018-12-03 15:07:59,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1270 states. [2018-12-03 15:07:59,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1805 transitions. [2018-12-03 15:07:59,064 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1805 transitions. Word has length 85 [2018-12-03 15:07:59,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:59,064 INFO L480 AbstractCegarLoop]: Abstraction has 1270 states and 1805 transitions. [2018-12-03 15:07:59,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 15:07:59,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1805 transitions. [2018-12-03 15:07:59,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 15:07:59,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:59,068 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:59,068 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 15:07:59,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:59,069 INFO L82 PathProgramCache]: Analyzing trace with hash -2004113356, now seen corresponding path program 1 times [2018-12-03 15:07:59,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:59,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:59,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:59,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:59,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:59,146 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-12-03 15:07:59,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:59,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:07:59,147 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:59,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:59,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:59,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:59,148 INFO L87 Difference]: Start difference. First operand 1270 states and 1805 transitions. Second operand 3 states. [2018-12-03 15:07:59,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:59,426 INFO L93 Difference]: Finished difference Result 2399 states and 3394 transitions. [2018-12-03 15:07:59,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:07:59,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-12-03 15:07:59,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:59,432 INFO L225 Difference]: With dead ends: 2399 [2018-12-03 15:07:59,432 INFO L226 Difference]: Without dead ends: 1130 [2018-12-03 15:07:59,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:59,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2018-12-03 15:07:59,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1129. [2018-12-03 15:07:59,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1129 states. [2018-12-03 15:07:59,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1537 transitions. [2018-12-03 15:07:59,472 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1537 transitions. Word has length 87 [2018-12-03 15:07:59,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:59,473 INFO L480 AbstractCegarLoop]: Abstraction has 1129 states and 1537 transitions. [2018-12-03 15:07:59,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:07:59,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1537 transitions. [2018-12-03 15:07:59,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 15:07:59,476 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:59,476 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:07:59,477 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 15:07:59,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:59,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1082348105, now seen corresponding path program 1 times [2018-12-03 15:07:59,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:59,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:59,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:59,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:59,478 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:59,554 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-12-03 15:07:59,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:59,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:07:59,555 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:59,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:07:59,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:07:59,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:07:59,556 INFO L87 Difference]: Start difference. First operand 1129 states and 1537 transitions. Second operand 3 states. [2018-12-03 15:08:00,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:00,025 INFO L93 Difference]: Finished difference Result 2013 states and 2713 transitions. [2018-12-03 15:08:00,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:08:00,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-12-03 15:08:00,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:00,031 INFO L225 Difference]: With dead ends: 2013 [2018-12-03 15:08:00,031 INFO L226 Difference]: Without dead ends: 850 [2018-12-03 15:08:00,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:08:00,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2018-12-03 15:08:00,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 700. [2018-12-03 15:08:00,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2018-12-03 15:08:00,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 909 transitions. [2018-12-03 15:08:00,058 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 909 transitions. Word has length 87 [2018-12-03 15:08:00,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:00,058 INFO L480 AbstractCegarLoop]: Abstraction has 700 states and 909 transitions. [2018-12-03 15:08:00,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:08:00,059 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 909 transitions. [2018-12-03 15:08:00,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 15:08:00,061 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:00,061 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:00,061 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 15:08:00,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:00,062 INFO L82 PathProgramCache]: Analyzing trace with hash -951849668, now seen corresponding path program 1 times [2018-12-03 15:08:00,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:00,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:00,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:00,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:00,063 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:00,487 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-03 15:08:00,765 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 107 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-12-03 15:08:00,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:00,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:00,765 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 91 with the following transitions: [2018-12-03 15:08:00,766 INFO L205 CegarAbsIntRunner]: [0], [2], [3], [6], [9], [11], [15], [17], [23], [26], [28], [33], [36], [38], [41], [43], [46], [57], [59], [62], [64], [67], [69], [74], [77], [83], [85], [88], [90], [95], [98], [106], [109], [111], [114], [116], [119], [121], [124] [2018-12-03 15:08:00,768 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:00,768 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:01,034 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:01,034 INFO L272 AbstractInterpreter]: Visited 39 different actions 230 times. Merged at 35 different actions 118 times. Widened at 2 different actions 2 times. Found 53 fixpoints after 17 different actions. Largest state had 0 variables. [2018-12-03 15:08:01,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:01,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:01,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:01,074 INFO L192 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 [2018-12-03 15:08:01,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:01,093 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:01,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:01,283 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 107 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-12-03 15:08:01,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:01,372 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 107 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-12-03 15:08:01,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:01,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2018-12-03 15:08:01,390 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:01,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:08:01,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:08:01,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-12-03 15:08:01,397 INFO L87 Difference]: Start difference. First operand 700 states and 909 transitions. Second operand 11 states. [2018-12-03 15:08:02,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:02,435 INFO L93 Difference]: Finished difference Result 1537 states and 1981 transitions. [2018-12-03 15:08:02,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:08:02,435 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2018-12-03 15:08:02,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:02,441 INFO L225 Difference]: With dead ends: 1537 [2018-12-03 15:08:02,441 INFO L226 Difference]: Without dead ends: 1017 [2018-12-03 15:08:02,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:08:02,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2018-12-03 15:08:02,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 761. [2018-12-03 15:08:02,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2018-12-03 15:08:02,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 978 transitions. [2018-12-03 15:08:02,468 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 978 transitions. Word has length 90 [2018-12-03 15:08:02,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:02,469 INFO L480 AbstractCegarLoop]: Abstraction has 761 states and 978 transitions. [2018-12-03 15:08:02,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:08:02,469 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 978 transitions. [2018-12-03 15:08:02,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 15:08:02,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:02,471 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:02,472 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 15:08:02,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:02,472 INFO L82 PathProgramCache]: Analyzing trace with hash 21511062, now seen corresponding path program 1 times [2018-12-03 15:08:02,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:02,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:02,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:02,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:02,473 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:02,573 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 160 proven. 13 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 15:08:02,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:02,573 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:02,573 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2018-12-03 15:08:02,574 INFO L205 CegarAbsIntRunner]: [0], [2], [3], [6], [9], [11], [17], [23], [26], [28], [33], [36], [38], [43], [46], [59], [62], [64], [67], [69], [74], [77], [83], [85], [88], [90], [95], [98], [106], [109], [111], [114] [2018-12-03 15:08:02,575 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:02,576 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:02,753 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:02,753 INFO L272 AbstractInterpreter]: Visited 32 different actions 184 times. Merged at 30 different actions 107 times. Widened at 1 different actions 2 times. Found 32 fixpoints after 13 different actions. Largest state had 0 variables. [2018-12-03 15:08:02,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:02,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:02,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:02,791 INFO L192 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 [2018-12-03 15:08:02,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:02,808 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:02,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:02,965 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 15:08:02,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:03,003 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 15:08:03,022 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 15:08:03,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2018-12-03 15:08:03,023 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:03,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:08:03,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:08:03,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:08:03,024 INFO L87 Difference]: Start difference. First operand 761 states and 978 transitions. Second operand 3 states. [2018-12-03 15:08:03,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:03,066 INFO L93 Difference]: Finished difference Result 1396 states and 1798 transitions. [2018-12-03 15:08:03,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:08:03,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-12-03 15:08:03,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:03,069 INFO L225 Difference]: With dead ends: 1396 [2018-12-03 15:08:03,070 INFO L226 Difference]: Without dead ends: 661 [2018-12-03 15:08:03,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:08:03,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2018-12-03 15:08:03,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2018-12-03 15:08:03,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2018-12-03 15:08:03,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 804 transitions. [2018-12-03 15:08:03,092 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 804 transitions. Word has length 99 [2018-12-03 15:08:03,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:03,092 INFO L480 AbstractCegarLoop]: Abstraction has 661 states and 804 transitions. [2018-12-03 15:08:03,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:08:03,092 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 804 transitions. [2018-12-03 15:08:03,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 15:08:03,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:03,094 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:03,095 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 15:08:03,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:03,095 INFO L82 PathProgramCache]: Analyzing trace with hash -224853863, now seen corresponding path program 1 times [2018-12-03 15:08:03,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:03,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:03,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:03,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:03,096 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:03,166 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-12-03 15:08:03,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:03,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:08:03,166 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:03,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:08:03,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:08:03,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:08:03,167 INFO L87 Difference]: Start difference. First operand 661 states and 804 transitions. Second operand 3 states. [2018-12-03 15:08:03,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:03,299 INFO L93 Difference]: Finished difference Result 1306 states and 1576 transitions. [2018-12-03 15:08:03,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:08:03,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2018-12-03 15:08:03,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:03,302 INFO L225 Difference]: With dead ends: 1306 [2018-12-03 15:08:03,302 INFO L226 Difference]: Without dead ends: 667 [2018-12-03 15:08:03,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:08:03,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-12-03 15:08:03,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 607. [2018-12-03 15:08:03,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2018-12-03 15:08:03,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 712 transitions. [2018-12-03 15:08:03,324 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 712 transitions. Word has length 103 [2018-12-03 15:08:03,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:03,324 INFO L480 AbstractCegarLoop]: Abstraction has 607 states and 712 transitions. [2018-12-03 15:08:03,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:08:03,325 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 712 transitions. [2018-12-03 15:08:03,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 15:08:03,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:03,327 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:03,327 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 15:08:03,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:03,327 INFO L82 PathProgramCache]: Analyzing trace with hash 707364856, now seen corresponding path program 1 times [2018-12-03 15:08:03,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:03,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:03,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:03,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:03,329 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:03,643 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-12-03 15:08:03,651 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-12-03 15:08:03,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:03,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:08:03,651 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:03,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:08:03,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:08:03,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:08:03,653 INFO L87 Difference]: Start difference. First operand 607 states and 712 transitions. Second operand 5 states. [2018-12-03 15:08:04,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:04,253 INFO L93 Difference]: Finished difference Result 930 states and 1090 transitions. [2018-12-03 15:08:04,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:08:04,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2018-12-03 15:08:04,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:04,256 INFO L225 Difference]: With dead ends: 930 [2018-12-03 15:08:04,256 INFO L226 Difference]: Without dead ends: 336 [2018-12-03 15:08:04,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:08:04,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-12-03 15:08:04,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 335. [2018-12-03 15:08:04,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-12-03 15:08:04,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 388 transitions. [2018-12-03 15:08:04,270 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 388 transitions. Word has length 108 [2018-12-03 15:08:04,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:04,270 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 388 transitions. [2018-12-03 15:08:04,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:08:04,271 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 388 transitions. [2018-12-03 15:08:04,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-03 15:08:04,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:04,272 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:04,272 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 15:08:04,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:04,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1140799292, now seen corresponding path program 1 times [2018-12-03 15:08:04,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:04,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:04,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:04,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:04,274 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:04,354 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-12-03 15:08:04,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:04,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:08:04,355 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:04,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:08:04,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:08:04,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:08:04,356 INFO L87 Difference]: Start difference. First operand 335 states and 388 transitions. Second operand 3 states. [2018-12-03 15:08:04,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:04,588 INFO L93 Difference]: Finished difference Result 663 states and 769 transitions. [2018-12-03 15:08:04,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:08:04,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-12-03 15:08:04,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:04,593 INFO L225 Difference]: With dead ends: 663 [2018-12-03 15:08:04,593 INFO L226 Difference]: Without dead ends: 335 [2018-12-03 15:08:04,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:08:04,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-12-03 15:08:04,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 331. [2018-12-03 15:08:04,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-12-03 15:08:04,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 379 transitions. [2018-12-03 15:08:04,609 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 379 transitions. Word has length 116 [2018-12-03 15:08:04,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:04,609 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 379 transitions. [2018-12-03 15:08:04,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:08:04,609 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 379 transitions. [2018-12-03 15:08:04,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-03 15:08:04,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:04,611 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:04,611 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 15:08:04,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:04,612 INFO L82 PathProgramCache]: Analyzing trace with hash 166395550, now seen corresponding path program 2 times [2018-12-03 15:08:04,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:04,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:04,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:04,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:04,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:05,262 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 17 [2018-12-03 15:08:05,653 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 20 proven. 266 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 15:08:05,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:05,653 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:05,654 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:08:05,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:08:05,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:05,654 INFO L192 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 [2018-12-03 15:08:05,663 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:08:05,663 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:08:05,759 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 15:08:05,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:08:05,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:06,219 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 41 proven. 256 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 15:08:06,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:29,079 WARN L180 SmtUtils]: Spent 22.56 s on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-12-03 15:08:29,282 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 20 proven. 277 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 15:08:29,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:29,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2018-12-03 15:08:29,301 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:29,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:08:29,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:08:29,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2018-12-03 15:08:29,302 INFO L87 Difference]: Start difference. First operand 331 states and 379 transitions. Second operand 19 states. [2018-12-03 15:08:30,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:30,569 INFO L93 Difference]: Finished difference Result 1146 states and 1314 transitions. [2018-12-03 15:08:30,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:08:30,572 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 121 [2018-12-03 15:08:30,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:30,575 INFO L225 Difference]: With dead ends: 1146 [2018-12-03 15:08:30,576 INFO L226 Difference]: Without dead ends: 1145 [2018-12-03 15:08:30,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 224 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=271, Invalid=1135, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:08:30,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2018-12-03 15:08:30,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 419. [2018-12-03 15:08:30,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-12-03 15:08:30,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 477 transitions. [2018-12-03 15:08:30,596 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 477 transitions. Word has length 121 [2018-12-03 15:08:30,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:30,596 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 477 transitions. [2018-12-03 15:08:30,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:08:30,596 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 477 transitions. [2018-12-03 15:08:30,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-03 15:08:30,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:30,598 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:30,598 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 15:08:30,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:30,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1620918566, now seen corresponding path program 1 times [2018-12-03 15:08:30,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:30,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:30,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:08:30,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:30,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:30,714 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-12-03 15:08:30,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:30,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 15:08:30,714 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:30,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:08:30,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:08:30,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:08:30,715 INFO L87 Difference]: Start difference. First operand 419 states and 477 transitions. Second operand 5 states. [2018-12-03 15:08:30,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:30,796 INFO L93 Difference]: Finished difference Result 673 states and 765 transitions. [2018-12-03 15:08:30,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:08:30,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2018-12-03 15:08:30,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:30,798 INFO L225 Difference]: With dead ends: 673 [2018-12-03 15:08:30,798 INFO L226 Difference]: Without dead ends: 468 [2018-12-03 15:08:30,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:08:30,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-12-03 15:08:30,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 412. [2018-12-03 15:08:30,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-12-03 15:08:30,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 469 transitions. [2018-12-03 15:08:30,813 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 469 transitions. Word has length 122 [2018-12-03 15:08:30,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:30,814 INFO L480 AbstractCegarLoop]: Abstraction has 412 states and 469 transitions. [2018-12-03 15:08:30,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:08:30,814 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 469 transitions. [2018-12-03 15:08:30,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 15:08:30,815 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:30,816 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:30,816 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 15:08:30,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:30,816 INFO L82 PathProgramCache]: Analyzing trace with hash -768532907, now seen corresponding path program 1 times [2018-12-03 15:08:30,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:30,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:30,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:30,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:30,817 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:31,097 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 202 proven. 50 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-03 15:08:31,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:31,097 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:31,098 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 124 with the following transitions: [2018-12-03 15:08:31,098 INFO L205 CegarAbsIntRunner]: [0], [2], [3], [6], [9], [11], [15], [17], [23], [26], [28], [33], [36], [38], [43], [46], [48], [51], [59], [62], [64], [67], [69], [72], [74], [77], [83], [85], [88], [90], [93], [95], [98], [106], [109], [111], [114], [116], [119], [121], [126], [129] [2018-12-03 15:08:31,100 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:31,100 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:31,388 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:31,388 INFO L272 AbstractInterpreter]: Visited 42 different actions 296 times. Merged at 38 different actions 163 times. Widened at 2 different actions 2 times. Found 71 fixpoints after 18 different actions. Largest state had 0 variables. [2018-12-03 15:08:31,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:31,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:31,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:31,428 INFO L192 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 [2018-12-03 15:08:31,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:31,444 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:31,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:32,612 WARN L180 SmtUtils]: Spent 716.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2018-12-03 15:08:32,734 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 139 proven. 131 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-03 15:08:32,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:33,229 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-12-03 15:08:33,450 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 79 proven. 191 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-03 15:08:33,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:33,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2018-12-03 15:08:33,470 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:33,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:08:33,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:08:33,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:08:33,471 INFO L87 Difference]: Start difference. First operand 412 states and 469 transitions. Second operand 9 states. [2018-12-03 15:08:33,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:33,974 INFO L93 Difference]: Finished difference Result 845 states and 962 transitions. [2018-12-03 15:08:33,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:08:33,974 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2018-12-03 15:08:33,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:33,980 INFO L225 Difference]: With dead ends: 845 [2018-12-03 15:08:33,980 INFO L226 Difference]: Without dead ends: 844 [2018-12-03 15:08:33,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 242 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:08:33,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2018-12-03 15:08:34,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 570. [2018-12-03 15:08:34,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-12-03 15:08:34,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 644 transitions. [2018-12-03 15:08:34,011 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 644 transitions. Word has length 123 [2018-12-03 15:08:34,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:34,012 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 644 transitions. [2018-12-03 15:08:34,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:08:34,012 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 644 transitions. [2018-12-03 15:08:34,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-03 15:08:34,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:34,014 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:34,015 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 15:08:34,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:34,015 INFO L82 PathProgramCache]: Analyzing trace with hash 242817106, now seen corresponding path program 3 times [2018-12-03 15:08:34,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:34,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:34,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:34,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:34,017 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:34,097 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2018-12-03 15:08:34,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:34,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:08:34,098 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:34,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:08:34,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:08:34,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:08:34,099 INFO L87 Difference]: Start difference. First operand 570 states and 644 transitions. Second operand 3 states. [2018-12-03 15:08:34,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:34,255 INFO L93 Difference]: Finished difference Result 1086 states and 1225 transitions. [2018-12-03 15:08:34,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:08:34,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2018-12-03 15:08:34,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:34,257 INFO L225 Difference]: With dead ends: 1086 [2018-12-03 15:08:34,258 INFO L226 Difference]: Without dead ends: 479 [2018-12-03 15:08:34,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:08:34,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-12-03 15:08:34,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 382. [2018-12-03 15:08:34,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-12-03 15:08:34,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 419 transitions. [2018-12-03 15:08:34,272 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 419 transitions. Word has length 159 [2018-12-03 15:08:34,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:34,272 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 419 transitions. [2018-12-03 15:08:34,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:08:34,272 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 419 transitions. [2018-12-03 15:08:34,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-03 15:08:34,274 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:34,274 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:34,274 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 15:08:34,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:34,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1109443822, now seen corresponding path program 1 times [2018-12-03 15:08:34,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:34,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:34,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:08:34,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:34,276 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:34,982 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 25 proven. 471 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-03 15:08:34,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:34,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:34,983 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 160 with the following transitions: [2018-12-03 15:08:34,983 INFO L205 CegarAbsIntRunner]: [0], [2], [3], [6], [9], [11], [15], [17], [23], [26], [28], [33], [36], [38], [41], [43], [46], [48], [51], [57], [59], [62], [64], [67], [69], [72], [74], [77], [83], [85], [88], [90], [93], [95], [98], [106], [109], [111], [114], [116], [119], [121], [126], [129] [2018-12-03 15:08:34,985 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:34,985 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:35,235 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:35,235 INFO L272 AbstractInterpreter]: Visited 44 different actions 277 times. Merged at 39 different actions 142 times. Widened at 1 different actions 1 times. Found 65 fixpoints after 19 different actions. Largest state had 0 variables. [2018-12-03 15:08:35,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:35,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:35,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:35,273 INFO L192 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 [2018-12-03 15:08:35,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:35,285 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:35,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:36,177 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 15:08:36,662 WARN L180 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-03 15:08:37,093 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 19 [2018-12-03 15:08:37,256 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 308 proven. 86 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-12-03 15:08:37,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:37,724 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-12-03 15:08:37,954 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2018-12-03 15:08:38,087 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 297 proven. 97 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-12-03 15:08:38,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:38,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 25 [2018-12-03 15:08:38,106 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:38,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 15:08:38,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 15:08:38,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:08:38,107 INFO L87 Difference]: Start difference. First operand 382 states and 419 transitions. Second operand 21 states. [2018-12-03 15:08:38,788 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 30 [2018-12-03 15:08:39,268 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 32 [2018-12-03 15:08:40,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:40,388 INFO L93 Difference]: Finished difference Result 1164 states and 1289 transitions. [2018-12-03 15:08:40,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:08:40,388 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 159 [2018-12-03 15:08:40,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:40,389 INFO L225 Difference]: With dead ends: 1164 [2018-12-03 15:08:40,389 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:08:40,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 323 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=462, Invalid=1518, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 15:08:40,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:08:40,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:08:40,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:08:40,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:08:40,392 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 159 [2018-12-03 15:08:40,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:40,392 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:08:40,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 15:08:40,392 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:08:40,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:08:40,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:08:40,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:40,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:40,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:40,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:40,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:40,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:40,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:40,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:40,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:40,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:40,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:40,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:40,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:41,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:41,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:41,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:41,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:41,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:41,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:41,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:41,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:08:42,076 WARN L180 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 552 DAG size of output: 441 [2018-12-03 15:08:49,693 WARN L180 SmtUtils]: Spent 7.61 s on a formula simplification. DAG size of input: 415 DAG size of output: 136 [2018-12-03 15:08:49,697 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 161) no Hoare annotation was computed. [2018-12-03 15:08:49,697 INFO L448 ceAbstractionStarter]: For program point L127(lines 127 138) no Hoare annotation was computed. [2018-12-03 15:08:49,697 INFO L448 ceAbstractionStarter]: For program point L70-1(lines 70 96) no Hoare annotation was computed. [2018-12-03 15:08:49,697 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 161) no Hoare annotation was computed. [2018-12-03 15:08:49,697 INFO L448 ceAbstractionStarter]: For program point L87(lines 87 96) no Hoare annotation was computed. [2018-12-03 15:08:49,697 INFO L448 ceAbstractionStarter]: For program point L112(lines 112 120) no Hoare annotation was computed. [2018-12-03 15:08:49,697 INFO L448 ceAbstractionStarter]: For program point L79(lines 79 96) no Hoare annotation was computed. [2018-12-03 15:08:49,697 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 161) no Hoare annotation was computed. [2018-12-03 15:08:49,697 INFO L448 ceAbstractionStarter]: For program point L47-1(lines 13 164) no Hoare annotation was computed. [2018-12-03 15:08:49,697 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 138) no Hoare annotation was computed. [2018-12-03 15:08:49,697 INFO L448 ceAbstractionStarter]: For program point L89(lines 89 96) no Hoare annotation was computed. [2018-12-03 15:08:49,697 INFO L448 ceAbstractionStarter]: For program point ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT(lines 48 55) no Hoare annotation was computed. [2018-12-03 15:08:49,698 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 161) no Hoare annotation was computed. [2018-12-03 15:08:49,698 INFO L444 ceAbstractionStarter]: At program point L156-2(lines 47 162) the Hoare annotation is: (let ((.cse32 (+ Elevator_dir 1))) (let ((.cse35 (+ Elevator_min 1)) (.cse23 (+ Elevator_dir Elevator_goal)) (.cse26 (= .cse32 0)) (.cse34 (+ Elevator_dir Elevator_current)) (.cse10 (<= Elevator_min Elevator_current)) (.cse11 (<= Elevator_current Elevator_max)) (.cse12 (= Elevator_qDC1 2)) (.cse36 (= Elevator_qCSP 1)) (.cse24 (= Elevator_dir 1))) (let ((.cse9 (= Elevator_qDC2 3)) (.cse14 (<= 3 Elevator_qCSP)) (.cse25 (<= Elevator_current Elevator_goal)) (.cse27 (or (<= Elevator_goal Elevator_current) .cse24)) (.cse28 (and .cse10 .cse11 .cse12 .cse36)) (.cse31 (= Elevator_min Elevator_current)) (.cse29 (<= Elevator_min .cse34)) (.cse30 (<= Elevator_dir 1)) (.cse0 (or (<= Elevator_current .cse23) .cse26)) (.cse1 (or (and .cse11 (<= .cse35 Elevator_current)) (and (<= (+ Elevator_current 1) Elevator_max) .cse10))) (.cse2 (or (<= (+ Elevator_min 2) .cse34) (<= (+ Elevator_current Elevator_min) (+ Elevator_dir (* 2 Elevator_goal) 2)))) (.cse33 (= Elevator_qDC2 1)) (.cse22 (<= Elevator_qDC1 1)) (.cse7 (not Elevator_passed)) (.cse13 (not Elevator_newgoal)) (.cse16 (not (= .cse23 Elevator_current))) (.cse17 (or (<= .cse23 Elevator_current) .cse24)) (.cse3 (<= Elevator_goal Elevator_max)) (.cse15 (<= Elevator_min Elevator_goal)) (.cse4 (<= Elevator_c2 2)) (.cse8 (not Elevator_stop)) (.cse19 (not (= Elevator_current Elevator_goal))) (.cse20 (not (= Elevator_qCSP 3))) (.cse21 (= Elevator_qDC2 2)) (.cse5 (<= Elevator_c2 Elevator_c3)) (.cse18 (not Elevator_start))) (or (and .cse0 .cse1 .cse2 .cse3 (and (and .cse4 .cse5 (and (let ((.cse6 (and .cse8 .cse9 (and .cse10 .cse11 .cse12)))) (or (and (<= 0 Elevator_c3) .cse6 (<= Elevator_c2 0)) (and .cse6 .cse7))) .cse13 .cse14)) .cse15) .cse16 .cse17 .cse18) (and .cse3 .cse15 (and (and .cse8 (and .cse19 .cse20 .cse21 .cse22 .cse7)) .cse10 .cse11 .cse5) .cse18) (and .cse13 .cse22 .cse14 .cse8 .cse5 (<= .cse23 (+ Elevator_max 1)) (= Elevator_current Elevator_min) .cse24 .cse21 (< Elevator_current Elevator_goal)) (and .cse8 .cse5 .cse12 (and .cse19 .cse10 .cse11) .cse9 .cse7) (and (and (and .cse4 (and (and .cse8 (and .cse19 .cse10 .cse11 .cse12 .cse21)) .cse13 .cse14)) .cse3 .cse15) (or .cse25 .cse26) .cse27) (and .cse8 .cse28 .cse5 .cse9 .cse7) (and .cse29 .cse30 (and .cse8 .cse5 (and (and (and .cse20 .cse31 .cse22) (not (= Elevator_min Elevator_goal))) .cse21)) .cse25 .cse3 .cse18) (and (and .cse3 (or .cse26 .cse24) .cse15 (and (and .cse8 (and .cse10 .cse11 .cse21 (and .cse19 .cse22 .cse7))) .cse13 .cse14)) (or (<= .cse32 0) .cse25) .cse27) (and .cse0 .cse1 .cse2 (and .cse4 .cse5 .cse15 (and .cse28 .cse33 .cse13)) .cse3 .cse16 .cse17 .cse18) (and (<= .cse34 Elevator_goal) (and .cse3 (and .cse33 (and .cse5 (and .cse31 (<= .cse35 Elevator_max) .cse22 .cse36)))) .cse29 .cse30) (and .cse0 .cse1 .cse2 (and .cse5 (and .cse33 (and .cse36 .cse22 .cse7) .cse13) .cse15) .cse3 .cse16 .cse17 .cse18) (and .cse3 .cse15 (and .cse4 (and .cse8 (and .cse19 .cse20 .cse12 .cse21)) .cse10 .cse11 .cse5) .cse18))))) [2018-12-03 15:08:49,698 INFO L448 ceAbstractionStarter]: For program point L115(lines 115 120) no Hoare annotation was computed. [2018-12-03 15:08:49,698 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 96) no Hoare annotation was computed. [2018-12-03 15:08:49,698 INFO L448 ceAbstractionStarter]: For program point L115-2(lines 99 138) no Hoare annotation was computed. [2018-12-03 15:08:49,698 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 120) no Hoare annotation was computed. [2018-12-03 15:08:49,699 INFO L448 ceAbstractionStarter]: For program point ElevatorEXIT(lines 13 164) no Hoare annotation was computed. [2018-12-03 15:08:49,699 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 96) no Hoare annotation was computed. [2018-12-03 15:08:49,699 INFO L448 ceAbstractionStarter]: For program point L91-2(lines 77 120) no Hoare annotation was computed. [2018-12-03 15:08:49,699 INFO L448 ceAbstractionStarter]: For program point L149(lines 149 161) no Hoare annotation was computed. [2018-12-03 15:08:49,699 INFO L448 ceAbstractionStarter]: For program point L133(lines 133 138) no Hoare annotation was computed. [2018-12-03 15:08:49,699 INFO L448 ceAbstractionStarter]: For program point L67(lines 67 69) no Hoare annotation was computed. [2018-12-03 15:08:49,699 INFO L448 ceAbstractionStarter]: For program point L133-2(lines 123 161) no Hoare annotation was computed. [2018-12-03 15:08:49,699 INFO L448 ceAbstractionStarter]: For program point L67-2(lines 67 72) no Hoare annotation was computed. [2018-12-03 15:08:49,699 INFO L448 ceAbstractionStarter]: For program point ElevatorENTRY(lines 13 164) no Hoare annotation was computed. [2018-12-03 15:08:49,699 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 96) no Hoare annotation was computed. [2018-12-03 15:08:49,699 INFO L448 ceAbstractionStarter]: For program point L101(lines 101 120) no Hoare annotation was computed. [2018-12-03 15:08:49,716 INFO L202 PluginConnector]: Adding new model ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:08:49 BoogieIcfgContainer [2018-12-03 15:08:49,717 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:08:49,718 INFO L168 Benchmark]: Toolchain (without parser) took 76406.69 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-12-03 15:08:49,719 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:08:49,719 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.13 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:08:49,719 INFO L168 Benchmark]: Boogie Preprocessor took 35.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:08:49,720 INFO L168 Benchmark]: RCFGBuilder took 633.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 15:08:49,721 INFO L168 Benchmark]: TraceAbstraction took 75693.07 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 984.1 MB. Max. memory is 7.1 GB. [2018-12-03 15:08:49,724 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.13 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 633.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 75693.07 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 984.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: loop invariant is valid and assertion always holds For all program executions holds that loop invariant is valid and assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((((((((((((((((current <= dir + goal || dir + 1 == 0) && ((current <= max && min + 1 <= current) || (current + 1 <= max && min <= current))) && (min + 2 <= dir + current || current + min <= dir + 2 * goal + 2)) && goal <= max) && ((c2 <= 2 && c2 <= c3) && ((((0 <= c3 && (!stop && qDC2 == 3) && (min <= current && current <= max) && qDC1 == 2) && c2 <= 0) || (((!stop && qDC2 == 3) && (min <= current && current <= max) && qDC1 == 2) && !passed)) && !newgoal) && 3 <= qCSP) && min <= goal) && !(dir + goal == current)) && (dir + goal <= current || dir == 1)) && !start) || (((goal <= max && min <= goal) && (((!stop && (((!(current == goal) && !(qCSP == 3)) && qDC2 == 2) && qDC1 <= 1) && !passed) && min <= current) && current <= max) && c2 <= c3) && !start)) || (((((((((!newgoal && qDC1 <= 1) && 3 <= qCSP) && !stop) && c2 <= c3) && dir + goal <= max + 1) && current == min) && dir == 1) && qDC2 == 2) && current < goal)) || (((((!stop && c2 <= c3) && qDC1 == 2) && (!(current == goal) && min <= current) && current <= max) && qDC2 == 3) && !passed)) || (((((c2 <= 2 && ((!stop && (((!(current == goal) && min <= current) && current <= max) && qDC1 == 2) && qDC2 == 2) && !newgoal) && 3 <= qCSP) && goal <= max) && min <= goal) && (current <= goal || dir + 1 == 0)) && (goal <= current || dir == 1))) || ((((!stop && ((min <= current && current <= max) && qDC1 == 2) && qCSP == 1) && c2 <= c3) && qDC2 == 3) && !passed)) || (((((min <= dir + current && dir <= 1) && (!stop && c2 <= c3) && (((!(qCSP == 3) && min == current) && qDC1 <= 1) && !(min == goal)) && qDC2 == 2) && current <= goal) && goal <= max) && !start)) || (((((goal <= max && (dir + 1 == 0 || dir == 1)) && min <= goal) && ((!stop && ((min <= current && current <= max) && qDC2 == 2) && (!(current == goal) && qDC1 <= 1) && !passed) && !newgoal) && 3 <= qCSP) && (dir + 1 <= 0 || current <= goal)) && (goal <= current || dir == 1))) || ((((((((current <= dir + goal || dir + 1 == 0) && ((current <= max && min + 1 <= current) || (current + 1 <= max && min <= current))) && (min + 2 <= dir + current || current + min <= dir + 2 * goal + 2)) && ((c2 <= 2 && c2 <= c3) && min <= goal) && ((((min <= current && current <= max) && qDC1 == 2) && qCSP == 1) && qDC2 == 1) && !newgoal) && goal <= max) && !(dir + goal == current)) && (dir + goal <= current || dir == 1)) && !start)) || (((dir + current <= goal && goal <= max && qDC2 == 1 && c2 <= c3 && ((min == current && min + 1 <= max) && qDC1 <= 1) && qCSP == 1) && min <= dir + current) && dir <= 1)) || ((((((((current <= dir + goal || dir + 1 == 0) && ((current <= max && min + 1 <= current) || (current + 1 <= max && min <= current))) && (min + 2 <= dir + current || current + min <= dir + 2 * goal + 2)) && (c2 <= c3 && (qDC2 == 1 && (qCSP == 1 && qDC1 <= 1) && !passed) && !newgoal) && min <= goal) && goal <= max) && !(dir + goal == current)) && (dir + goal <= current || dir == 1)) && !start)) || (((goal <= max && min <= goal) && (((c2 <= 2 && !stop && ((!(current == goal) && !(qCSP == 3)) && qDC1 == 2) && qDC2 == 2) && min <= current) && current <= max) && c2 <= c3) && !start) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. SAFE Result, 75.6s OverallTime, 26 OverallIterations, 9 TraceHistogramMax, 12.6s AutomataDifference, 0.0s DeadEndRemovalTime, 9.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1786 SDtfs, 4180 SDslu, 4736 SDs, 0 SdLazy, 2548 SolverSat, 348 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1639 GetRequests, 1447 SyntacticMatches, 13 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 49.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1612occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.3s AbstIntTime, 6 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 26 MinimizatonAttempts, 4291 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 68 NumberOfFragments, 680 HoareAnnotationTreeSize, 1 FomulaSimplifications, 527964 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 1 FomulaSimplificationsInter, 154448 FormulaSimplificationTreeSizeReductionInter, 7.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 48.8s InterpolantComputationTime, 2744 NumberOfCodeBlocks, 2744 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 3430 ConstructedInterpolants, 47 QuantifiedInterpolants, 3978092 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1847 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 40 InterpolantComputations, 21 PerfectInterpolantSequences, 5087/7371 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...