java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf -i ../../../trunk/examples/programs/real-life/ElevatorWithAssignments.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:13:10,207 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:13:10,209 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:13:10,225 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:13:10,227 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:13:10,228 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:13:10,230 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:13:10,234 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:13:10,238 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:13:10,239 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:13:10,240 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:13:10,242 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:13:10,243 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:13:10,244 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:13:10,245 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:13:10,249 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:13:10,250 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:13:10,254 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:13:10,256 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:13:10,258 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:13:10,259 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:13:10,260 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:13:10,263 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:13:10,263 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:13:10,263 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:13:10,264 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:13:10,265 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:13:10,266 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:13:10,267 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:13:10,269 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:13:10,269 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:13:10,270 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:13:10,270 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:13:10,270 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:13:10,271 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:13:10,272 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:13:10,272 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 17:13:10,286 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:13:10,287 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:13:10,288 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:13:10,288 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:13:10,288 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:13:10,288 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:13:10,288 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:13:10,289 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:13:10,289 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:13:10,289 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:13:10,289 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:13:10,289 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:13:10,290 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:13:10,290 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:13:10,290 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:13:10,291 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:13:10,291 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:13:10,291 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:13:10,291 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:13:10,292 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:13:10,292 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:13:10,292 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:13:10,292 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:13:10,292 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:13:10,293 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:13:10,293 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:13:10,293 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:13:10,293 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:13:10,294 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:13:10,294 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:13:10,294 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:13:10,294 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:13:10,295 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:13:10,295 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:13:10,295 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:13:10,295 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:13:10,295 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:13:10,296 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:13:10,296 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:13:10,349 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:13:10,368 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:13:10,372 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:13:10,374 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:13:10,375 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:13:10,376 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 17:13:10,376 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/ElevatorWithAssignments.bpl' [2018-12-03 17:13:10,429 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:13:10,433 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:13:10,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:13:10,434 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:13:10,434 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:13:10,454 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 05:13:10" (1/1) ... [2018-12-03 17:13:10,468 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 05:13:10" (1/1) ... [2018-12-03 17:13:10,478 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 17:13:10,478 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 17:13:10,479 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 17:13:10,481 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:13:10,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:13:10,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:13:10,483 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:13:10,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:10" (1/1) ... [2018-12-03 17:13:10,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:10" (1/1) ... [2018-12-03 17:13:10,499 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:10" (1/1) ... [2018-12-03 17:13:10,499 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:10" (1/1) ... [2018-12-03 17:13:10,504 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:10" (1/1) ... [2018-12-03 17:13:10,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:10" (1/1) ... [2018-12-03 17:13:10,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:10" (1/1) ... [2018-12-03 17:13:10,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:13:10,525 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:13:10,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:13:10,529 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:13:10,530 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:10" (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 17:13:10,608 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Elevator given in one single declaration [2018-12-03 17:13:10,608 INFO L130 BoogieDeclarations]: Found specification of procedure Elevator [2018-12-03 17:13:10,608 INFO L138 BoogieDeclarations]: Found implementation of procedure Elevator [2018-12-03 17:13:11,171 INFO L272 CfgBuilder]: Using library mode [2018-12-03 17:13:11,172 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 17:13:11,172 INFO L202 PluginConnector]: Adding new model ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:13:11 BoogieIcfgContainer [2018-12-03 17:13:11,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:13:11,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:13:11,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:13:11,177 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:13:11,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:10" (1/2) ... [2018-12-03 17:13:11,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a81f331 and model type ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:13:11, skipping insertion in model container [2018-12-03 17:13:11,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:13:11" (2/2) ... [2018-12-03 17:13:11,181 INFO L112 eAbstractionObserver]: Analyzing ICFG ElevatorWithAssignments.bpl [2018-12-03 17:13:11,191 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:13:11,200 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:13:11,219 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:13:11,256 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:13:11,256 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:13:11,256 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:13:11,257 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:13:11,257 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:13:11,257 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:13:11,257 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:13:11,257 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:13:11,275 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-12-03 17:13:11,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-03 17:13:11,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:11,283 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-03 17:13:11,286 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 17:13:11,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:11,292 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-03 17:13:11,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:11,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:11,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:11,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:11,350 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:11,474 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 17:13:11,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:11,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-03 17:13:11,476 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:11,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:11,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:11,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:11,495 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2018-12-03 17:13:11,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:11,700 INFO L93 Difference]: Finished difference Result 84 states and 157 transitions. [2018-12-03 17:13:11,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:11,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-03 17:13:11,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:11,716 INFO L225 Difference]: With dead ends: 84 [2018-12-03 17:13:11,716 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 17:13:11,719 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 17:13:11,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 17:13:11,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-12-03 17:13:11,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 17:13:11,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 93 transitions. [2018-12-03 17:13:11,764 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 93 transitions. Word has length 2 [2018-12-03 17:13:11,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:11,764 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 93 transitions. [2018-12-03 17:13:11,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:11,765 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 93 transitions. [2018-12-03 17:13:11,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:13:11,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:11,766 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:11,766 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 17:13:11,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:11,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1770004619, now seen corresponding path program 1 times [2018-12-03 17:13:11,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:11,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:11,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:11,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:11,769 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:11,839 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 17:13:11,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:11,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:13:11,840 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:11,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:11,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:11,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:11,843 INFO L87 Difference]: Start difference. First operand 53 states and 93 transitions. Second operand 3 states. [2018-12-03 17:13:12,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:12,033 INFO L93 Difference]: Finished difference Result 157 states and 277 transitions. [2018-12-03 17:13:12,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:12,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 17:13:12,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:12,040 INFO L225 Difference]: With dead ends: 157 [2018-12-03 17:13:12,040 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 17:13:12,041 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 17:13:12,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 17:13:12,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-12-03 17:13:12,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 17:13:12,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 175 transitions. [2018-12-03 17:13:12,059 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 175 transitions. Word has length 14 [2018-12-03 17:13:12,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:12,060 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 175 transitions. [2018-12-03 17:13:12,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:12,060 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 175 transitions. [2018-12-03 17:13:12,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:13:12,061 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:12,061 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:13:12,062 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 17:13:12,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:12,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1068940041, now seen corresponding path program 1 times [2018-12-03 17:13:12,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:12,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:12,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:12,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:12,064 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:12,106 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 17:13:12,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:12,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:12,107 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:12,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:12,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:12,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:12,109 INFO L87 Difference]: Start difference. First operand 100 states and 175 transitions. Second operand 3 states. [2018-12-03 17:13:12,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:12,324 INFO L93 Difference]: Finished difference Result 205 states and 356 transitions. [2018-12-03 17:13:12,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:12,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 17:13:12,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:12,327 INFO L225 Difference]: With dead ends: 205 [2018-12-03 17:13:12,327 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 17:13:12,328 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 17:13:12,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 17:13:12,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 89. [2018-12-03 17:13:12,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 17:13:12,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 152 transitions. [2018-12-03 17:13:12,340 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 152 transitions. Word has length 14 [2018-12-03 17:13:12,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:12,341 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 152 transitions. [2018-12-03 17:13:12,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:12,341 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 152 transitions. [2018-12-03 17:13:12,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 17:13:12,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:12,343 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 17:13:12,346 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 17:13:12,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:12,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1940946465, now seen corresponding path program 1 times [2018-12-03 17:13:12,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:12,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:12,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:12,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:12,351 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:12,573 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 17:13:12,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:12,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:13:12,574 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:12,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 17:13:12,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 17:13:12,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:13:12,575 INFO L87 Difference]: Start difference. First operand 89 states and 152 transitions. Second operand 5 states. [2018-12-03 17:13:12,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:12,733 INFO L93 Difference]: Finished difference Result 321 states and 545 transitions. [2018-12-03 17:13:12,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 17:13:12,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-03 17:13:12,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:12,736 INFO L225 Difference]: With dead ends: 321 [2018-12-03 17:13:12,736 INFO L226 Difference]: Without dead ends: 209 [2018-12-03 17:13:12,737 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 17:13:12,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-12-03 17:13:12,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2018-12-03 17:13:12,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-12-03 17:13:12,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 346 transitions. [2018-12-03 17:13:12,760 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 346 transitions. Word has length 19 [2018-12-03 17:13:12,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:12,761 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 346 transitions. [2018-12-03 17:13:12,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 17:13:12,761 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 346 transitions. [2018-12-03 17:13:12,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 17:13:12,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:12,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] [2018-12-03 17:13:12,766 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 17:13:12,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:12,766 INFO L82 PathProgramCache]: Analyzing trace with hash 2002343284, now seen corresponding path program 1 times [2018-12-03 17:13:12,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:12,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:12,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:12,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:12,768 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:12,832 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 17:13:12,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:12,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:12,833 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:12,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:12,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:12,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:12,835 INFO L87 Difference]: Start difference. First operand 207 states and 346 transitions. Second operand 3 states. [2018-12-03 17:13:12,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:12,952 INFO L93 Difference]: Finished difference Result 522 states and 865 transitions. [2018-12-03 17:13:12,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:12,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-12-03 17:13:12,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:12,957 INFO L225 Difference]: With dead ends: 522 [2018-12-03 17:13:12,957 INFO L226 Difference]: Without dead ends: 310 [2018-12-03 17:13:12,958 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 17:13:12,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-12-03 17:13:12,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 213. [2018-12-03 17:13:12,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-03 17:13:12,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 352 transitions. [2018-12-03 17:13:12,981 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 352 transitions. Word has length 41 [2018-12-03 17:13:12,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:12,982 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 352 transitions. [2018-12-03 17:13:12,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:12,982 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 352 transitions. [2018-12-03 17:13:12,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 17:13:12,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:12,984 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 17:13:12,984 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 17:13:12,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:12,985 INFO L82 PathProgramCache]: Analyzing trace with hash 2074119508, now seen corresponding path program 1 times [2018-12-03 17:13:12,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:12,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:12,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:12,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:12,987 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:13,046 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 17:13:13,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:13,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:13,047 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:13,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:13,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:13,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:13,048 INFO L87 Difference]: Start difference. First operand 213 states and 352 transitions. Second operand 3 states. [2018-12-03 17:13:13,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:13,179 INFO L93 Difference]: Finished difference Result 588 states and 972 transitions. [2018-12-03 17:13:13,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:13,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-12-03 17:13:13,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:13,191 INFO L225 Difference]: With dead ends: 588 [2018-12-03 17:13:13,191 INFO L226 Difference]: Without dead ends: 367 [2018-12-03 17:13:13,192 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 17:13:13,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-12-03 17:13:13,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 354. [2018-12-03 17:13:13,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-12-03 17:13:13,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 570 transitions. [2018-12-03 17:13:13,216 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 570 transitions. Word has length 42 [2018-12-03 17:13:13,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:13,216 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 570 transitions. [2018-12-03 17:13:13,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:13,217 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 570 transitions. [2018-12-03 17:13:13,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 17:13:13,219 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:13,219 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 17:13:13,219 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 17:13:13,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:13,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1430938278, now seen corresponding path program 1 times [2018-12-03 17:13:13,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:13,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:13,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:13,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:13,221 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:13,282 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 17:13:13,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:13,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:13,283 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:13,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:13,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:13,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:13,284 INFO L87 Difference]: Start difference. First operand 354 states and 570 transitions. Second operand 3 states. [2018-12-03 17:13:13,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:13,416 INFO L93 Difference]: Finished difference Result 880 states and 1399 transitions. [2018-12-03 17:13:13,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:13,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-12-03 17:13:13,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:13,425 INFO L225 Difference]: With dead ends: 880 [2018-12-03 17:13:13,425 INFO L226 Difference]: Without dead ends: 542 [2018-12-03 17:13:13,426 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 17:13:13,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-12-03 17:13:13,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 366. [2018-12-03 17:13:13,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-12-03 17:13:13,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 582 transitions. [2018-12-03 17:13:13,458 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 582 transitions. Word has length 44 [2018-12-03 17:13:13,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:13,459 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 582 transitions. [2018-12-03 17:13:13,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:13,459 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 582 transitions. [2018-12-03 17:13:13,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 17:13:13,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:13,461 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 17:13:13,461 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 17:13:13,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:13,462 INFO L82 PathProgramCache]: Analyzing trace with hash -138883553, now seen corresponding path program 1 times [2018-12-03 17:13:13,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:13,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:13,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:13,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:13,464 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:13,600 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 17:13:13,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:13,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:13:13,600 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:13,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:13:13,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:13:13,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:13:13,605 INFO L87 Difference]: Start difference. First operand 366 states and 582 transitions. Second operand 4 states. [2018-12-03 17:13:13,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:13,987 INFO L93 Difference]: Finished difference Result 1096 states and 1744 transitions. [2018-12-03 17:13:13,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:13,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-03 17:13:13,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:13,992 INFO L225 Difference]: With dead ends: 1096 [2018-12-03 17:13:13,993 INFO L226 Difference]: Without dead ends: 731 [2018-12-03 17:13:13,994 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 17:13:13,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-12-03 17:13:14,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 666. [2018-12-03 17:13:14,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2018-12-03 17:13:14,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1037 transitions. [2018-12-03 17:13:14,028 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1037 transitions. Word has length 46 [2018-12-03 17:13:14,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:14,029 INFO L480 AbstractCegarLoop]: Abstraction has 666 states and 1037 transitions. [2018-12-03 17:13:14,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:13:14,029 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1037 transitions. [2018-12-03 17:13:14,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 17:13:14,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:14,033 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 17:13:14,033 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 17:13:14,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:14,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1242691348, now seen corresponding path program 1 times [2018-12-03 17:13:14,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:14,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:14,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:14,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:14,035 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:14,490 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 17:13:14,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:14,491 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:14,492 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-12-03 17:13:14,494 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 17:13:14,560 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:13:14,561 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:13:15,454 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:13:15,455 INFO L272 AbstractInterpreter]: Visited 28 different actions 151 times. Merged at 26 different actions 88 times. Never widened. Found 21 fixpoints after 10 different actions. Largest state had 0 variables. [2018-12-03 17:13:15,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:15,490 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:13:15,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:15,490 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 17:13:15,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:15,500 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:13:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:15,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:13:15,751 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 17:13:15,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:13:16,082 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 17:13:16,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:13:16,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2018-12-03 17:13:16,105 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:13:16,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:13:16,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:13:16,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-03 17:13:16,106 INFO L87 Difference]: Start difference. First operand 666 states and 1037 transitions. Second operand 8 states. [2018-12-03 17:13:16,741 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-03 17:13:17,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:17,377 INFO L93 Difference]: Finished difference Result 1293 states and 2002 transitions. [2018-12-03 17:13:17,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 17:13:17,378 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-12-03 17:13:17,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:17,388 INFO L225 Difference]: With dead ends: 1293 [2018-12-03 17:13:17,388 INFO L226 Difference]: Without dead ends: 1292 [2018-12-03 17:13:17,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-12-03 17:13:17,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2018-12-03 17:13:17,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1176. [2018-12-03 17:13:17,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-12-03 17:13:17,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1825 transitions. [2018-12-03 17:13:17,449 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1825 transitions. Word has length 49 [2018-12-03 17:13:17,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:17,449 INFO L480 AbstractCegarLoop]: Abstraction has 1176 states and 1825 transitions. [2018-12-03 17:13:17,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:13:17,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1825 transitions. [2018-12-03 17:13:17,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 17:13:17,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:17,457 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 17:13:17,457 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 17:13:17,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:17,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1557173637, now seen corresponding path program 1 times [2018-12-03 17:13:17,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:17,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:17,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:17,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:17,461 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:17,668 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 17:13:17,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:17,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:13:17,668 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:17,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:13:17,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:13:17,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:13:17,670 INFO L87 Difference]: Start difference. First operand 1176 states and 1825 transitions. Second operand 4 states. [2018-12-03 17:13:17,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:17,979 INFO L93 Difference]: Finished difference Result 2655 states and 4085 transitions. [2018-12-03 17:13:17,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 17:13:17,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-03 17:13:17,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:17,987 INFO L225 Difference]: With dead ends: 2655 [2018-12-03 17:13:17,988 INFO L226 Difference]: Without dead ends: 1510 [2018-12-03 17:13:17,990 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 17:13:17,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-12-03 17:13:18,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1468. [2018-12-03 17:13:18,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1468 states. [2018-12-03 17:13:18,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 2236 transitions. [2018-12-03 17:13:18,046 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 2236 transitions. Word has length 67 [2018-12-03 17:13:18,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:18,047 INFO L480 AbstractCegarLoop]: Abstraction has 1468 states and 2236 transitions. [2018-12-03 17:13:18,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:13:18,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 2236 transitions. [2018-12-03 17:13:18,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 17:13:18,049 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:18,050 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 17:13:18,050 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 17:13:18,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:18,050 INFO L82 PathProgramCache]: Analyzing trace with hash -423460397, now seen corresponding path program 1 times [2018-12-03 17:13:18,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:18,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:18,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:18,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:18,052 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:18,213 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 17:13:18,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:18,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:13:18,213 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:18,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:13:18,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:13:18,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:13:18,215 INFO L87 Difference]: Start difference. First operand 1468 states and 2236 transitions. Second operand 4 states. [2018-12-03 17:13:18,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:18,286 INFO L93 Difference]: Finished difference Result 2726 states and 4172 transitions. [2018-12-03 17:13:18,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:18,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-03 17:13:18,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:18,303 INFO L225 Difference]: With dead ends: 2726 [2018-12-03 17:13:18,303 INFO L226 Difference]: Without dead ends: 1469 [2018-12-03 17:13:18,306 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 17:13:18,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2018-12-03 17:13:18,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1466. [2018-12-03 17:13:18,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1466 states. [2018-12-03 17:13:18,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 2172 transitions. [2018-12-03 17:13:18,362 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 2172 transitions. Word has length 68 [2018-12-03 17:13:18,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:18,362 INFO L480 AbstractCegarLoop]: Abstraction has 1466 states and 2172 transitions. [2018-12-03 17:13:18,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:13:18,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 2172 transitions. [2018-12-03 17:13:18,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 17:13:18,365 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:18,365 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 17:13:18,366 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 17:13:18,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:18,366 INFO L82 PathProgramCache]: Analyzing trace with hash -734626103, now seen corresponding path program 2 times [2018-12-03 17:13:18,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:18,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:18,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:18,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:18,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:18,457 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 17:13:18,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:18,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:18,457 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:18,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:18,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:18,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:18,459 INFO L87 Difference]: Start difference. First operand 1466 states and 2172 transitions. Second operand 3 states. [2018-12-03 17:13:18,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:18,883 INFO L93 Difference]: Finished difference Result 2942 states and 4353 transitions. [2018-12-03 17:13:18,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:18,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-03 17:13:18,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:18,892 INFO L225 Difference]: With dead ends: 2942 [2018-12-03 17:13:18,892 INFO L226 Difference]: Without dead ends: 1457 [2018-12-03 17:13:18,895 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 17:13:18,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2018-12-03 17:13:18,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1397. [2018-12-03 17:13:18,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1397 states. [2018-12-03 17:13:18,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 2012 transitions. [2018-12-03 17:13:18,945 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 2012 transitions. Word has length 69 [2018-12-03 17:13:18,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:18,945 INFO L480 AbstractCegarLoop]: Abstraction has 1397 states and 2012 transitions. [2018-12-03 17:13:18,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:18,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 2012 transitions. [2018-12-03 17:13:18,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 17:13:18,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:18,949 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 17:13:18,949 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 17:13:18,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:18,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1023158359, now seen corresponding path program 1 times [2018-12-03 17:13:18,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:18,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:18,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:13:18,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:18,952 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:19,024 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 17:13:19,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:19,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:19,025 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:19,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:19,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:19,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:19,026 INFO L87 Difference]: Start difference. First operand 1397 states and 2012 transitions. Second operand 3 states. [2018-12-03 17:13:19,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:19,115 INFO L93 Difference]: Finished difference Result 3297 states and 4763 transitions. [2018-12-03 17:13:19,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:19,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-12-03 17:13:19,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:19,125 INFO L225 Difference]: With dead ends: 3297 [2018-12-03 17:13:19,125 INFO L226 Difference]: Without dead ends: 1830 [2018-12-03 17:13:19,128 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 17:13:19,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2018-12-03 17:13:19,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1612. [2018-12-03 17:13:19,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1612 states. [2018-12-03 17:13:19,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2296 transitions. [2018-12-03 17:13:19,187 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2296 transitions. Word has length 84 [2018-12-03 17:13:19,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:19,187 INFO L480 AbstractCegarLoop]: Abstraction has 1612 states and 2296 transitions. [2018-12-03 17:13:19,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:19,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2296 transitions. [2018-12-03 17:13:19,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 17:13:19,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:19,191 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 17:13:19,191 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 17:13:19,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:19,191 INFO L82 PathProgramCache]: Analyzing trace with hash -147951611, now seen corresponding path program 1 times [2018-12-03 17:13:19,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:19,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:19,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:19,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:19,193 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:19,653 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 17:13:19,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:19,654 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:19,654 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 86 with the following transitions: [2018-12-03 17:13:19,654 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 17:13:19,657 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:13:19,657 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:13:20,163 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:13:20,163 INFO L272 AbstractInterpreter]: Visited 34 different actions 209 times. Merged at 31 different actions 108 times. Never widened. Found 36 fixpoints after 17 different actions. Largest state had 0 variables. [2018-12-03 17:13:20,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:20,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:13:20,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:20,201 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 17:13:20,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:20,216 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:13:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:20,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:13:20,655 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 17:13:20,656 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:13:33,545 WARN L180 SmtUtils]: Spent 12.49 s on a formula simplification that was a NOOP. DAG size: 33 [2018-12-03 17:13:34,021 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 9 [2018-12-03 17:13:34,084 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 17:13:34,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:13:34,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2018-12-03 17:13:34,103 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:13:34,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:13:34,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:13:34,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:13:34,104 INFO L87 Difference]: Start difference. First operand 1612 states and 2296 transitions. Second operand 13 states. [2018-12-03 17:13:35,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:35,551 INFO L93 Difference]: Finished difference Result 3128 states and 4425 transitions. [2018-12-03 17:13:35,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:13:35,552 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 85 [2018-12-03 17:13:35,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:35,565 INFO L225 Difference]: With dead ends: 3128 [2018-12-03 17:13:35,566 INFO L226 Difference]: Without dead ends: 3127 [2018-12-03 17:13:35,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 158 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:13:35,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3127 states. [2018-12-03 17:13:35,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3127 to 1270. [2018-12-03 17:13:35,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1270 states. [2018-12-03 17:13:35,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1805 transitions. [2018-12-03 17:13:35,618 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1805 transitions. Word has length 85 [2018-12-03 17:13:35,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:35,618 INFO L480 AbstractCegarLoop]: Abstraction has 1270 states and 1805 transitions. [2018-12-03 17:13:35,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:13:35,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1805 transitions. [2018-12-03 17:13:35,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 17:13:35,621 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:35,622 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 17:13:35,622 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 17:13:35,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:35,622 INFO L82 PathProgramCache]: Analyzing trace with hash -2004113356, now seen corresponding path program 1 times [2018-12-03 17:13:35,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:35,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:35,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:35,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:35,624 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:35,674 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 17:13:35,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:35,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:35,674 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:35,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:35,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:35,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:35,675 INFO L87 Difference]: Start difference. First operand 1270 states and 1805 transitions. Second operand 3 states. [2018-12-03 17:13:35,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:35,737 INFO L93 Difference]: Finished difference Result 2399 states and 3394 transitions. [2018-12-03 17:13:35,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:35,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-12-03 17:13:35,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:35,743 INFO L225 Difference]: With dead ends: 2399 [2018-12-03 17:13:35,743 INFO L226 Difference]: Without dead ends: 1130 [2018-12-03 17:13:35,745 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 17:13:35,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2018-12-03 17:13:35,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1129. [2018-12-03 17:13:35,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1129 states. [2018-12-03 17:13:35,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1537 transitions. [2018-12-03 17:13:35,779 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1537 transitions. Word has length 87 [2018-12-03 17:13:35,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:35,779 INFO L480 AbstractCegarLoop]: Abstraction has 1129 states and 1537 transitions. [2018-12-03 17:13:35,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:35,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1537 transitions. [2018-12-03 17:13:35,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 17:13:35,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:35,782 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 17:13:35,782 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 17:13:35,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:35,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1082348105, now seen corresponding path program 1 times [2018-12-03 17:13:35,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:35,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:35,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:35,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:35,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:35,867 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 17:13:35,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:35,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:35,867 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:35,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:35,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:35,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:35,868 INFO L87 Difference]: Start difference. First operand 1129 states and 1537 transitions. Second operand 3 states. [2018-12-03 17:13:36,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:36,247 INFO L93 Difference]: Finished difference Result 2013 states and 2713 transitions. [2018-12-03 17:13:36,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:36,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-12-03 17:13:36,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:36,252 INFO L225 Difference]: With dead ends: 2013 [2018-12-03 17:13:36,252 INFO L226 Difference]: Without dead ends: 850 [2018-12-03 17:13:36,254 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 17:13:36,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2018-12-03 17:13:36,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 700. [2018-12-03 17:13:36,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2018-12-03 17:13:36,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 909 transitions. [2018-12-03 17:13:36,277 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 909 transitions. Word has length 87 [2018-12-03 17:13:36,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:36,277 INFO L480 AbstractCegarLoop]: Abstraction has 700 states and 909 transitions. [2018-12-03 17:13:36,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:36,278 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 909 transitions. [2018-12-03 17:13:36,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 17:13:36,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:36,279 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 17:13:36,281 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 17:13:36,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:36,281 INFO L82 PathProgramCache]: Analyzing trace with hash -951849668, now seen corresponding path program 1 times [2018-12-03 17:13:36,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:36,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:36,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:36,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:36,283 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:36,418 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 17:13:36,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:36,419 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:36,419 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 91 with the following transitions: [2018-12-03 17:13:36,419 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 17:13:36,422 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:13:36,422 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:13:36,875 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:13:36,876 INFO L272 AbstractInterpreter]: Visited 39 different actions 338 times. Merged at 36 different actions 181 times. Widened at 2 different actions 3 times. Found 70 fixpoints after 23 different actions. Largest state had 0 variables. [2018-12-03 17:13:36,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:36,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:13:36,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:36,915 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 17:13:36,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:36,930 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:13:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:36,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:13:37,074 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 17:13:37,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:13:37,170 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 17:13:37,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:13:37,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2018-12-03 17:13:37,200 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:13:37,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:13:37,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:13:37,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:13:37,202 INFO L87 Difference]: Start difference. First operand 700 states and 909 transitions. Second operand 11 states. [2018-12-03 17:13:37,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:37,957 INFO L93 Difference]: Finished difference Result 1537 states and 1981 transitions. [2018-12-03 17:13:37,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:13:37,958 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2018-12-03 17:13:37,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:37,962 INFO L225 Difference]: With dead ends: 1537 [2018-12-03 17:13:37,962 INFO L226 Difference]: Without dead ends: 1017 [2018-12-03 17:13:37,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:13:37,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2018-12-03 17:13:37,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 761. [2018-12-03 17:13:37,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2018-12-03 17:13:37,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 978 transitions. [2018-12-03 17:13:37,989 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 978 transitions. Word has length 90 [2018-12-03 17:13:37,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:37,990 INFO L480 AbstractCegarLoop]: Abstraction has 761 states and 978 transitions. [2018-12-03 17:13:37,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:13:37,990 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 978 transitions. [2018-12-03 17:13:37,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 17:13:37,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:37,992 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 17:13:37,992 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 17:13:37,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:37,993 INFO L82 PathProgramCache]: Analyzing trace with hash 21511062, now seen corresponding path program 1 times [2018-12-03 17:13:37,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:37,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:37,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:37,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:37,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:38,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:38,110 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 17:13:38,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:38,110 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:38,110 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2018-12-03 17:13:38,111 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 17:13:38,113 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:13:38,113 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:13:38,390 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:13:38,390 INFO L272 AbstractInterpreter]: Visited 32 different actions 195 times. Merged at 29 different actions 108 times. Never widened. Found 30 fixpoints after 14 different actions. Largest state had 0 variables. [2018-12-03 17:13:38,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:38,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:13:38,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:38,430 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 17:13:38,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:38,442 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:13:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:38,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:13:38,600 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 17:13:38,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:13:38,703 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 17:13:38,722 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 17:13:38,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2018-12-03 17:13:38,722 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:38,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:38,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:38,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:13:38,723 INFO L87 Difference]: Start difference. First operand 761 states and 978 transitions. Second operand 3 states. [2018-12-03 17:13:38,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:38,765 INFO L93 Difference]: Finished difference Result 1396 states and 1798 transitions. [2018-12-03 17:13:38,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:38,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-12-03 17:13:38,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:38,768 INFO L225 Difference]: With dead ends: 1396 [2018-12-03 17:13:38,768 INFO L226 Difference]: Without dead ends: 661 [2018-12-03 17:13:38,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:13:38,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2018-12-03 17:13:38,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2018-12-03 17:13:38,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2018-12-03 17:13:38,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 804 transitions. [2018-12-03 17:13:38,793 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 804 transitions. Word has length 99 [2018-12-03 17:13:38,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:38,794 INFO L480 AbstractCegarLoop]: Abstraction has 661 states and 804 transitions. [2018-12-03 17:13:38,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:38,794 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 804 transitions. [2018-12-03 17:13:38,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 17:13:38,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:38,796 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 17:13:38,797 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 17:13:38,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:38,797 INFO L82 PathProgramCache]: Analyzing trace with hash -224853863, now seen corresponding path program 1 times [2018-12-03 17:13:38,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:38,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:38,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:38,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:38,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:38,883 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 17:13:38,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:38,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:38,884 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:38,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:38,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:38,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:38,885 INFO L87 Difference]: Start difference. First operand 661 states and 804 transitions. Second operand 3 states. [2018-12-03 17:13:39,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:39,230 INFO L93 Difference]: Finished difference Result 1306 states and 1576 transitions. [2018-12-03 17:13:39,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:39,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2018-12-03 17:13:39,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:39,233 INFO L225 Difference]: With dead ends: 1306 [2018-12-03 17:13:39,233 INFO L226 Difference]: Without dead ends: 667 [2018-12-03 17:13:39,234 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 17:13:39,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-12-03 17:13:39,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 607. [2018-12-03 17:13:39,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2018-12-03 17:13:39,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 712 transitions. [2018-12-03 17:13:39,261 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 712 transitions. Word has length 103 [2018-12-03 17:13:39,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:39,262 INFO L480 AbstractCegarLoop]: Abstraction has 607 states and 712 transitions. [2018-12-03 17:13:39,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:39,262 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 712 transitions. [2018-12-03 17:13:39,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 17:13:39,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:39,264 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 17:13:39,264 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 17:13:39,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:39,265 INFO L82 PathProgramCache]: Analyzing trace with hash 707364856, now seen corresponding path program 1 times [2018-12-03 17:13:39,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:39,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:39,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:39,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:39,266 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:39,491 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 17:13:39,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:39,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:13:39,492 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:39,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 17:13:39,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 17:13:39,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:13:39,493 INFO L87 Difference]: Start difference. First operand 607 states and 712 transitions. Second operand 5 states. [2018-12-03 17:13:39,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:39,630 INFO L93 Difference]: Finished difference Result 930 states and 1090 transitions. [2018-12-03 17:13:39,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 17:13:39,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2018-12-03 17:13:39,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:39,632 INFO L225 Difference]: With dead ends: 930 [2018-12-03 17:13:39,632 INFO L226 Difference]: Without dead ends: 336 [2018-12-03 17:13:39,633 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 17:13:39,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-12-03 17:13:39,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 335. [2018-12-03 17:13:39,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-12-03 17:13:39,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 388 transitions. [2018-12-03 17:13:39,648 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 388 transitions. Word has length 108 [2018-12-03 17:13:39,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:39,648 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 388 transitions. [2018-12-03 17:13:39,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 17:13:39,649 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 388 transitions. [2018-12-03 17:13:39,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-03 17:13:39,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:39,650 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 17:13:39,651 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 17:13:39,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:39,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1140799292, now seen corresponding path program 1 times [2018-12-03 17:13:39,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:39,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:39,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:39,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:39,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:39,738 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 17:13:39,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:39,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:13:39,739 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:39,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:13:39,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:13:39,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:13:39,740 INFO L87 Difference]: Start difference. First operand 335 states and 388 transitions. Second operand 3 states. [2018-12-03 17:13:40,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:40,044 INFO L93 Difference]: Finished difference Result 663 states and 769 transitions. [2018-12-03 17:13:40,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:13:40,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-12-03 17:13:40,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:40,046 INFO L225 Difference]: With dead ends: 663 [2018-12-03 17:13:40,046 INFO L226 Difference]: Without dead ends: 335 [2018-12-03 17:13:40,047 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 17:13:40,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-12-03 17:13:40,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 331. [2018-12-03 17:13:40,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-12-03 17:13:40,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 379 transitions. [2018-12-03 17:13:40,060 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 379 transitions. Word has length 116 [2018-12-03 17:13:40,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:40,061 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 379 transitions. [2018-12-03 17:13:40,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:13:40,061 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 379 transitions. [2018-12-03 17:13:40,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-03 17:13:40,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:40,063 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 17:13:40,063 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 17:13:40,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:40,064 INFO L82 PathProgramCache]: Analyzing trace with hash 166395550, now seen corresponding path program 2 times [2018-12-03 17:13:40,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:40,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:40,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:40,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:40,065 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:40,683 WARN L180 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 17:13:40,884 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 15 [2018-12-03 17:13:41,034 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 17 [2018-12-03 17:13:41,338 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 17:13:41,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:41,338 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:41,338 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:13:41,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:13:41,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:41,339 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 17:13:41,349 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:13:41,349 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:13:41,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 17:13:41,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:13:41,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:13:42,012 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 17:13:42,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:06,557 WARN L180 SmtUtils]: Spent 24.24 s on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-12-03 17:14:06,749 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 17:14:06,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:06,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2018-12-03 17:14:06,768 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:06,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 17:14:06,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 17:14:06,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2018-12-03 17:14:06,770 INFO L87 Difference]: Start difference. First operand 331 states and 379 transitions. Second operand 19 states. [2018-12-03 17:14:08,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:08,208 INFO L93 Difference]: Finished difference Result 1146 states and 1314 transitions. [2018-12-03 17:14:08,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 17:14:08,211 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 121 [2018-12-03 17:14:08,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:08,216 INFO L225 Difference]: With dead ends: 1146 [2018-12-03 17:14:08,216 INFO L226 Difference]: Without dead ends: 1145 [2018-12-03 17:14:08,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 224 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 26.6s TimeCoverageRelationStatistics Valid=271, Invalid=1135, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 17:14:08,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2018-12-03 17:14:08,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 419. [2018-12-03 17:14:08,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-12-03 17:14:08,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 477 transitions. [2018-12-03 17:14:08,233 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 477 transitions. Word has length 121 [2018-12-03 17:14:08,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:08,233 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 477 transitions. [2018-12-03 17:14:08,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 17:14:08,234 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 477 transitions. [2018-12-03 17:14:08,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-03 17:14:08,235 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:08,235 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 17:14:08,235 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 17:14:08,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:08,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1620918566, now seen corresponding path program 1 times [2018-12-03 17:14:08,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:08,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:08,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:14:08,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:08,237 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:08,406 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 17:14:08,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:08,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 17:14:08,406 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:08,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 17:14:08,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 17:14:08,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:14:08,407 INFO L87 Difference]: Start difference. First operand 419 states and 477 transitions. Second operand 5 states. [2018-12-03 17:14:08,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:08,482 INFO L93 Difference]: Finished difference Result 673 states and 765 transitions. [2018-12-03 17:14:08,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 17:14:08,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2018-12-03 17:14:08,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:08,484 INFO L225 Difference]: With dead ends: 673 [2018-12-03 17:14:08,484 INFO L226 Difference]: Without dead ends: 468 [2018-12-03 17:14:08,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:14:08,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-12-03 17:14:08,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 412. [2018-12-03 17:14:08,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-12-03 17:14:08,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 469 transitions. [2018-12-03 17:14:08,501 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 469 transitions. Word has length 122 [2018-12-03 17:14:08,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:08,501 INFO L480 AbstractCegarLoop]: Abstraction has 412 states and 469 transitions. [2018-12-03 17:14:08,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 17:14:08,502 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 469 transitions. [2018-12-03 17:14:08,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 17:14:08,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:08,503 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 17:14:08,503 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 17:14:08,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:08,504 INFO L82 PathProgramCache]: Analyzing trace with hash -768532907, now seen corresponding path program 1 times [2018-12-03 17:14:08,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:08,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:08,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:08,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:08,505 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:08,963 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-03 17:14:08,990 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 17:14:08,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:08,990 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:08,990 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 124 with the following transitions: [2018-12-03 17:14:08,991 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 17:14:08,993 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:08,993 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:09,625 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:14:09,625 INFO L272 AbstractInterpreter]: Visited 42 different actions 507 times. Merged at 39 different actions 292 times. Widened at 4 different actions 6 times. Found 124 fixpoints after 28 different actions. Largest state had 0 variables. [2018-12-03 17:14:09,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:09,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:14:09,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:09,661 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 17:14:09,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:09,678 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:09,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:10,022 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 17:14:10,022 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:10,343 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 17:14:10,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:10,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2018-12-03 17:14:10,362 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:10,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:14:10,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:14:10,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-12-03 17:14:10,363 INFO L87 Difference]: Start difference. First operand 412 states and 469 transitions. Second operand 9 states. [2018-12-03 17:14:10,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:10,830 INFO L93 Difference]: Finished difference Result 845 states and 962 transitions. [2018-12-03 17:14:10,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 17:14:10,831 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2018-12-03 17:14:10,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:10,833 INFO L225 Difference]: With dead ends: 845 [2018-12-03 17:14:10,834 INFO L226 Difference]: Without dead ends: 844 [2018-12-03 17:14:10,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 242 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:14:10,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2018-12-03 17:14:10,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 570. [2018-12-03 17:14:10,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-12-03 17:14:10,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 644 transitions. [2018-12-03 17:14:10,858 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 644 transitions. Word has length 123 [2018-12-03 17:14:10,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:10,859 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 644 transitions. [2018-12-03 17:14:10,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:14:10,859 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 644 transitions. [2018-12-03 17:14:10,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-03 17:14:10,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:10,861 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 17:14:10,861 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 17:14:10,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:10,862 INFO L82 PathProgramCache]: Analyzing trace with hash 242817106, now seen corresponding path program 3 times [2018-12-03 17:14:10,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:10,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:10,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:10,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:10,863 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:10,942 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 17:14:10,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:14:10,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:14:10,943 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:14:10,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:14:10,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:14:10,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:14:10,943 INFO L87 Difference]: Start difference. First operand 570 states and 644 transitions. Second operand 3 states. [2018-12-03 17:14:10,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:10,998 INFO L93 Difference]: Finished difference Result 1086 states and 1225 transitions. [2018-12-03 17:14:10,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:14:10,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2018-12-03 17:14:10,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:11,000 INFO L225 Difference]: With dead ends: 1086 [2018-12-03 17:14:11,000 INFO L226 Difference]: Without dead ends: 479 [2018-12-03 17:14:11,003 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 17:14:11,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-12-03 17:14:11,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 382. [2018-12-03 17:14:11,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-12-03 17:14:11,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 419 transitions. [2018-12-03 17:14:11,017 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 419 transitions. Word has length 159 [2018-12-03 17:14:11,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:11,018 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 419 transitions. [2018-12-03 17:14:11,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:14:11,018 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 419 transitions. [2018-12-03 17:14:11,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-03 17:14:11,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:11,020 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 17:14:11,020 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-12-03 17:14:11,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:11,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1109443822, now seen corresponding path program 1 times [2018-12-03 17:14:11,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:11,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:11,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:14:11,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:11,021 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:11,769 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 17:14:11,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:11,769 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:11,770 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 160 with the following transitions: [2018-12-03 17:14:11,770 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 17:14:11,777 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:14:11,777 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:14:12,387 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:14:12,387 INFO L272 AbstractInterpreter]: Visited 44 different actions 550 times. Merged at 42 different actions 299 times. Widened at 4 different actions 6 times. Found 152 fixpoints after 30 different actions. Largest state had 0 variables. [2018-12-03 17:14:12,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:12,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:14:12,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:12,425 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 17:14:12,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:12,437 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:12,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:12,993 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 17:14:12,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:13,357 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2018-12-03 17:14:13,516 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 17:14:13,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:13,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 25 [2018-12-03 17:14:13,535 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:13,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 17:14:13,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 17:14:13,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:14:13,537 INFO L87 Difference]: Start difference. First operand 382 states and 419 transitions. Second operand 21 states. [2018-12-03 17:14:14,234 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 30 [2018-12-03 17:14:14,686 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 32 [2018-12-03 17:14:15,143 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2018-12-03 17:14:15,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:15,644 INFO L93 Difference]: Finished difference Result 1164 states and 1289 transitions. [2018-12-03 17:14:15,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:14:15,645 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 159 [2018-12-03 17:14:15,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:15,645 INFO L225 Difference]: With dead ends: 1164 [2018-12-03 17:14:15,645 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 17:14:15,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 323 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=462, Invalid=1518, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 17:14:15,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 17:14:15,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 17:14:15,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 17:14:15,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 17:14:15,648 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 159 [2018-12-03 17:14:15,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:15,648 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 17:14:15,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 17:14:15,648 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 17:14:15,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 17:14:15,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 17:14:15,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:14:15,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:14:15,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:14:15,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:14:15,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:14:15,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:14:15,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:14:15,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:14:15,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:14:15,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:14:15,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:14:15,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:14:16,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:14:16,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:14:16,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:14:16,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:14:16,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:14:16,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:14:16,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:14:16,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:14:17,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:14:17,156 WARN L180 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 552 DAG size of output: 441 [2018-12-03 17:14:24,815 WARN L180 SmtUtils]: Spent 7.65 s on a formula simplification. DAG size of input: 415 DAG size of output: 136 [2018-12-03 17:14:24,819 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 161) no Hoare annotation was computed. [2018-12-03 17:14:24,819 INFO L448 ceAbstractionStarter]: For program point L127(lines 127 138) no Hoare annotation was computed. [2018-12-03 17:14:24,819 INFO L448 ceAbstractionStarter]: For program point L70-1(lines 70 96) no Hoare annotation was computed. [2018-12-03 17:14:24,819 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 161) no Hoare annotation was computed. [2018-12-03 17:14:24,819 INFO L448 ceAbstractionStarter]: For program point L87(lines 87 96) no Hoare annotation was computed. [2018-12-03 17:14:24,819 INFO L448 ceAbstractionStarter]: For program point L112(lines 112 120) no Hoare annotation was computed. [2018-12-03 17:14:24,819 INFO L448 ceAbstractionStarter]: For program point L79(lines 79 96) no Hoare annotation was computed. [2018-12-03 17:14:24,820 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 161) no Hoare annotation was computed. [2018-12-03 17:14:24,820 INFO L448 ceAbstractionStarter]: For program point L47-1(lines 13 164) no Hoare annotation was computed. [2018-12-03 17:14:24,820 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 138) no Hoare annotation was computed. [2018-12-03 17:14:24,820 INFO L448 ceAbstractionStarter]: For program point L89(lines 89 96) no Hoare annotation was computed. [2018-12-03 17:14:24,820 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 161) no Hoare annotation was computed. [2018-12-03 17:14:24,820 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 17:14:24,821 INFO L448 ceAbstractionStarter]: For program point ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT(lines 48 55) no Hoare annotation was computed. [2018-12-03 17:14:24,821 INFO L448 ceAbstractionStarter]: For program point L115(lines 115 120) no Hoare annotation was computed. [2018-12-03 17:14:24,821 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 96) no Hoare annotation was computed. [2018-12-03 17:14:24,821 INFO L448 ceAbstractionStarter]: For program point L115-2(lines 99 138) no Hoare annotation was computed. [2018-12-03 17:14:24,821 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 120) no Hoare annotation was computed. [2018-12-03 17:14:24,821 INFO L448 ceAbstractionStarter]: For program point ElevatorEXIT(lines 13 164) no Hoare annotation was computed. [2018-12-03 17:14:24,821 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 96) no Hoare annotation was computed. [2018-12-03 17:14:24,821 INFO L448 ceAbstractionStarter]: For program point L91-2(lines 77 120) no Hoare annotation was computed. [2018-12-03 17:14:24,821 INFO L448 ceAbstractionStarter]: For program point L149(lines 149 161) no Hoare annotation was computed. [2018-12-03 17:14:24,821 INFO L448 ceAbstractionStarter]: For program point L133(lines 133 138) no Hoare annotation was computed. [2018-12-03 17:14:24,821 INFO L448 ceAbstractionStarter]: For program point L67(lines 67 69) no Hoare annotation was computed. [2018-12-03 17:14:24,821 INFO L448 ceAbstractionStarter]: For program point L133-2(lines 123 161) no Hoare annotation was computed. [2018-12-03 17:14:24,821 INFO L448 ceAbstractionStarter]: For program point L67-2(lines 67 72) no Hoare annotation was computed. [2018-12-03 17:14:24,821 INFO L448 ceAbstractionStarter]: For program point ElevatorENTRY(lines 13 164) no Hoare annotation was computed. [2018-12-03 17:14:24,822 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 96) no Hoare annotation was computed. [2018-12-03 17:14:24,822 INFO L448 ceAbstractionStarter]: For program point L101(lines 101 120) no Hoare annotation was computed. [2018-12-03 17:14:24,838 INFO L202 PluginConnector]: Adding new model ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 05:14:24 BoogieIcfgContainer [2018-12-03 17:14:24,838 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 17:14:24,839 INFO L168 Benchmark]: Toolchain (without parser) took 74408.93 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.2 GB in the end (delta: -798.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-12-03 17:14:24,840 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 17:14:24,840 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.08 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 17:14:24,841 INFO L168 Benchmark]: Boogie Preprocessor took 42.86 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 17:14:24,841 INFO L168 Benchmark]: RCFGBuilder took 647.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 17:14:24,842 INFO L168 Benchmark]: TraceAbstraction took 73664.45 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.2 GB in the end (delta: -829.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-12-03 17:14:24,845 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.08 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.86 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 647.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 73664.45 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.2 GB in the end (delta: -829.8 MB). Peak memory consumption was 1.1 GB. 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, 73.5s OverallTime, 26 OverallIterations, 9 TraceHistogramMax, 11.5s AutomataDifference, 0.0s DeadEndRemovalTime, 9.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1786 SDtfs, 4180 SDslu, 4736 SDs, 0 SdLazy, 2548 SolverSat, 348 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1639 GetRequests, 1447 SyntacticMatches, 13 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 47.6s 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, 3.6s 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.5s HoareSimplificationTime, 1 FomulaSimplificationsInter, 154448 FormulaSimplificationTreeSizeReductionInter, 7.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 46.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...