java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/real-life/Elevator.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f-m [2018-10-04 14:19:41,261 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 14:19:41,264 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 14:19:41,276 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 14:19:41,276 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 14:19:41,278 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 14:19:41,279 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 14:19:41,281 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 14:19:41,282 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 14:19:41,283 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 14:19:41,284 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 14:19:41,285 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 14:19:41,286 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 14:19:41,287 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 14:19:41,288 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 14:19:41,289 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 14:19:41,290 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 14:19:41,292 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 14:19:41,294 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 14:19:41,295 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 14:19:41,297 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 14:19:41,298 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 14:19:41,301 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 14:19:41,301 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 14:19:41,301 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 14:19:41,302 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 14:19:41,303 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 14:19:41,304 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 14:19:41,305 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 14:19:41,306 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 14:19:41,307 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 14:19:41,307 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 14:19:41,308 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 14:19:41,308 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 14:19:41,309 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 14:19:41,310 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 14:19:41,310 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 14:19:41,325 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 14:19:41,326 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 14:19:41,327 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 14:19:41,327 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 14:19:41,327 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 14:19:41,328 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 14:19:41,328 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 14:19:41,328 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 14:19:41,328 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 14:19:41,328 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 14:19:41,329 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 14:19:41,329 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 14:19:41,329 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 14:19:41,329 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 14:19:41,329 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 14:19:41,330 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 14:19:41,330 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 14:19:41,331 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 14:19:41,331 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 14:19:41,331 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 14:19:41,331 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 14:19:41,332 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 14:19:41,332 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:19:41,332 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 14:19:41,332 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 14:19:41,332 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 14:19:41,332 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 14:19:41,333 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 14:19:41,333 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 14:19:41,333 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 14:19:41,333 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 14:19:41,400 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 14:19:41,419 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 14:19:41,423 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 14:19:41,425 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 14:19:41,425 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 14:19:41,426 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator.bpl [2018-10-04 14:19:41,426 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator.bpl' [2018-10-04 14:19:41,481 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 14:19:41,483 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 14:19:41,483 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 14:19:41,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 14:19:41,484 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 14:19:41,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:41" (1/1) ... [2018-10-04 14:19:41,519 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:41" (1/1) ... [2018-10-04 14:19:41,524 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 14:19:41,524 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 14:19:41,524 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 14:19:41,527 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 14:19:41,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 14:19:41,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 14:19:41,528 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 14:19:41,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:41" (1/1) ... [2018-10-04 14:19:41,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:41" (1/1) ... [2018-10-04 14:19:41,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:41" (1/1) ... [2018-10-04 14:19:41,543 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:41" (1/1) ... [2018-10-04 14:19:41,556 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:41" (1/1) ... [2018-10-04 14:19:41,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:41" (1/1) ... [2018-10-04 14:19:41,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:41" (1/1) ... [2018-10-04 14:19:41,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 14:19:41,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 14:19:41,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 14:19:41,578 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 14:19:41,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:41" (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-10-04 14:19:41,636 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Elevator given in one single declaration [2018-10-04 14:19:41,637 INFO L130 BoogieDeclarations]: Found specification of procedure Elevator [2018-10-04 14:19:41,637 INFO L138 BoogieDeclarations]: Found implementation of procedure Elevator [2018-10-04 14:19:42,330 INFO L338 CfgBuilder]: Using library mode [2018-10-04 14:19:42,331 INFO L202 PluginConnector]: Adding new model Elevator.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:19:42 BoogieIcfgContainer [2018-10-04 14:19:42,331 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 14:19:42,332 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 14:19:42,332 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 14:19:42,338 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 14:19:42,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:41" (1/2) ... [2018-10-04 14:19:42,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693b2804 and model type Elevator.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 02:19:42, skipping insertion in model container [2018-10-04 14:19:42,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:19:42" (2/2) ... [2018-10-04 14:19:42,342 INFO L112 eAbstractionObserver]: Analyzing ICFG Elevator.bpl [2018-10-04 14:19:42,354 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 14:19:42,366 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 14:19:42,413 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 14:19:42,414 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 14:19:42,414 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 14:19:42,414 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 14:19:42,414 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 14:19:42,414 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 14:19:42,414 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 14:19:42,415 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 14:19:42,415 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 14:19:42,431 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-10-04 14:19:42,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 14:19:42,438 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:42,439 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 14:19:42,440 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:42,446 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:42,446 INFO L82 PathProgramCache]: Analyzing trace with hash 28755472, now seen corresponding path program 1 times [2018-10-04 14:19:42,448 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:42,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:42,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:42,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:42,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:42,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:42,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:42,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:19:42,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:19:42,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:19:42,614 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:42,616 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-10-04 14:19:42,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:42,717 INFO L93 Difference]: Finished difference Result 92 states and 168 transitions. [2018-10-04 14:19:42,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:19:42,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-10-04 14:19:42,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:42,733 INFO L225 Difference]: With dead ends: 92 [2018-10-04 14:19:42,733 INFO L226 Difference]: Without dead ends: 58 [2018-10-04 14:19:42,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:19:42,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-04 14:19:42,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-10-04 14:19:42,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-04 14:19:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 98 transitions. [2018-10-04 14:19:42,780 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 98 transitions. Word has length 5 [2018-10-04 14:19:42,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:42,781 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 98 transitions. [2018-10-04 14:19:42,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:19:42,781 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 98 transitions. [2018-10-04 14:19:42,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 14:19:42,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:42,782 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 14:19:42,782 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:42,782 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:42,782 INFO L82 PathProgramCache]: Analyzing trace with hash 28757394, now seen corresponding path program 1 times [2018-10-04 14:19:42,782 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:42,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:42,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:42,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:42,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:42,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:42,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:42,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-04 14:19:42,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:19:42,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:19:42,821 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:42,821 INFO L87 Difference]: Start difference. First operand 57 states and 98 transitions. Second operand 3 states. [2018-10-04 14:19:42,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:42,931 INFO L93 Difference]: Finished difference Result 64 states and 108 transitions. [2018-10-04 14:19:42,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:19:42,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-10-04 14:19:42,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:42,933 INFO L225 Difference]: With dead ends: 64 [2018-10-04 14:19:42,933 INFO L226 Difference]: Without dead ends: 63 [2018-10-04 14:19:42,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:19:42,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-04 14:19:42,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-10-04 14:19:42,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-04 14:19:42,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 107 transitions. [2018-10-04 14:19:42,948 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 107 transitions. Word has length 5 [2018-10-04 14:19:42,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:42,948 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 107 transitions. [2018-10-04 14:19:42,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:19:42,949 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 107 transitions. [2018-10-04 14:19:42,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:19:42,950 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:42,950 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:42,950 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:42,952 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:42,952 INFO L82 PathProgramCache]: Analyzing trace with hash 815749096, now seen corresponding path program 1 times [2018-10-04 14:19:42,952 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:42,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:42,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:42,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:42,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:42,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:43,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-04 14:19:43,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:43,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:19:43,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 14:19:43,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 14:19:43,146 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:43,146 INFO L87 Difference]: Start difference. First operand 63 states and 107 transitions. Second operand 4 states. [2018-10-04 14:19:43,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:43,500 INFO L93 Difference]: Finished difference Result 95 states and 160 transitions. [2018-10-04 14:19:43,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 14:19:43,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-10-04 14:19:43,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:43,506 INFO L225 Difference]: With dead ends: 95 [2018-10-04 14:19:43,506 INFO L226 Difference]: Without dead ends: 94 [2018-10-04 14:19:43,507 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 3 [2018-10-04 14:19:43,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-04 14:19:43,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2018-10-04 14:19:43,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-04 14:19:43,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 149 transitions. [2018-10-04 14:19:43,522 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 149 transitions. Word has length 16 [2018-10-04 14:19:43,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:43,524 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 149 transitions. [2018-10-04 14:19:43,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 14:19:43,524 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 149 transitions. [2018-10-04 14:19:43,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 14:19:43,528 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:43,528 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:43,529 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:43,529 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:43,529 INFO L82 PathProgramCache]: Analyzing trace with hash -2118172386, now seen corresponding path program 1 times [2018-10-04 14:19:43,530 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:43,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:43,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:43,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:43,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:43,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:43,599 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:43,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:43,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:19:43,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:19:43,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:19:43,604 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:43,604 INFO L87 Difference]: Start difference. First operand 88 states and 149 transitions. Second operand 3 states. [2018-10-04 14:19:43,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:43,789 INFO L93 Difference]: Finished difference Result 205 states and 347 transitions. [2018-10-04 14:19:43,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:19:43,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-04 14:19:43,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:43,792 INFO L225 Difference]: With dead ends: 205 [2018-10-04 14:19:43,793 INFO L226 Difference]: Without dead ends: 116 [2018-10-04 14:19:43,797 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:19:43,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-04 14:19:43,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 96. [2018-10-04 14:19:43,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-04 14:19:43,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 162 transitions. [2018-10-04 14:19:43,811 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 162 transitions. Word has length 20 [2018-10-04 14:19:43,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:43,811 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 162 transitions. [2018-10-04 14:19:43,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:19:43,811 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 162 transitions. [2018-10-04 14:19:43,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-04 14:19:43,812 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:43,813 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:43,813 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:43,813 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:43,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1426889970, now seen corresponding path program 1 times [2018-10-04 14:19:43,814 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:43,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:43,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:43,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:43,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:43,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:43,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:43,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 14:19:43,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 14:19:43,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 14:19:43,946 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:43,946 INFO L87 Difference]: Start difference. First operand 96 states and 162 transitions. Second operand 5 states. [2018-10-04 14:19:44,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:44,101 INFO L93 Difference]: Finished difference Result 297 states and 503 transitions. [2018-10-04 14:19:44,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 14:19:44,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-10-04 14:19:44,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:44,104 INFO L225 Difference]: With dead ends: 297 [2018-10-04 14:19:44,104 INFO L226 Difference]: Without dead ends: 186 [2018-10-04 14:19:44,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 3 [2018-10-04 14:19:44,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-10-04 14:19:44,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-10-04 14:19:44,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-04 14:19:44,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 310 transitions. [2018-10-04 14:19:44,125 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 310 transitions. Word has length 25 [2018-10-04 14:19:44,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:44,126 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 310 transitions. [2018-10-04 14:19:44,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 14:19:44,126 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 310 transitions. [2018-10-04 14:19:44,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-04 14:19:44,128 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:44,128 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:44,129 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:44,129 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:44,129 INFO L82 PathProgramCache]: Analyzing trace with hash -471363241, now seen corresponding path program 1 times [2018-10-04 14:19:44,129 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:44,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:44,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:44,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:44,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:44,181 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-04 14:19:44,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:44,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:19:44,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:19:44,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:19:44,183 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:44,183 INFO L87 Difference]: Start difference. First operand 186 states and 310 transitions. Second operand 3 states. [2018-10-04 14:19:44,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:44,269 INFO L93 Difference]: Finished difference Result 472 states and 783 transitions. [2018-10-04 14:19:44,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:19:44,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-10-04 14:19:44,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:44,273 INFO L225 Difference]: With dead ends: 472 [2018-10-04 14:19:44,273 INFO L226 Difference]: Without dead ends: 283 [2018-10-04 14:19:44,274 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:19:44,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-10-04 14:19:44,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 190. [2018-10-04 14:19:44,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-10-04 14:19:44,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 314 transitions. [2018-10-04 14:19:44,308 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 314 transitions. Word has length 51 [2018-10-04 14:19:44,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:44,309 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 314 transitions. [2018-10-04 14:19:44,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:19:44,309 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 314 transitions. [2018-10-04 14:19:44,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-04 14:19:44,312 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:44,312 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:44,314 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:44,315 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:44,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1611871285, now seen corresponding path program 1 times [2018-10-04 14:19:44,315 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:44,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:44,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:44,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:44,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-04 14:19:44,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:44,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:19:44,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:19:44,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:19:44,377 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:44,377 INFO L87 Difference]: Start difference. First operand 190 states and 314 transitions. Second operand 3 states. [2018-10-04 14:19:44,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:44,680 INFO L93 Difference]: Finished difference Result 480 states and 791 transitions. [2018-10-04 14:19:44,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:19:44,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-10-04 14:19:44,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:44,683 INFO L225 Difference]: With dead ends: 480 [2018-10-04 14:19:44,683 INFO L226 Difference]: Without dead ends: 289 [2018-10-04 14:19:44,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:19:44,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-10-04 14:19:44,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 196. [2018-10-04 14:19:44,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-04 14:19:44,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 320 transitions. [2018-10-04 14:19:44,697 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 320 transitions. Word has length 52 [2018-10-04 14:19:44,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:44,698 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 320 transitions. [2018-10-04 14:19:44,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:19:44,698 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 320 transitions. [2018-10-04 14:19:44,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-04 14:19:44,700 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:44,700 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:44,701 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:44,701 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:44,701 INFO L82 PathProgramCache]: Analyzing trace with hash -50759130, now seen corresponding path program 1 times [2018-10-04 14:19:44,701 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:44,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:44,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:44,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:44,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:44,802 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-04 14:19:44,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:44,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:19:44,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:19:44,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:19:44,803 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:44,803 INFO L87 Difference]: Start difference. First operand 196 states and 320 transitions. Second operand 3 states. [2018-10-04 14:19:45,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:45,026 INFO L93 Difference]: Finished difference Result 378 states and 617 transitions. [2018-10-04 14:19:45,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:19:45,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-10-04 14:19:45,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:45,029 INFO L225 Difference]: With dead ends: 378 [2018-10-04 14:19:45,029 INFO L226 Difference]: Without dead ends: 181 [2018-10-04 14:19:45,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:19:45,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-04 14:19:45,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 175. [2018-10-04 14:19:45,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-04 14:19:45,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 279 transitions. [2018-10-04 14:19:45,040 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 279 transitions. Word has length 54 [2018-10-04 14:19:45,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:45,041 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 279 transitions. [2018-10-04 14:19:45,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:19:45,041 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 279 transitions. [2018-10-04 14:19:45,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-04 14:19:45,043 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:45,043 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:45,043 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:45,043 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:45,044 INFO L82 PathProgramCache]: Analyzing trace with hash -860107678, now seen corresponding path program 1 times [2018-10-04 14:19:45,044 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:45,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:45,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:45,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:45,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:45,245 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-04 14:19:45,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:19:45,246 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP 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-10-04 14:19:45,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:45,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:19:45,622 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-04 14:19:45,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 14:19:45,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2018-10-04 14:19:45,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:19:45,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:19:45,646 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:45,646 INFO L87 Difference]: Start difference. First operand 175 states and 279 transitions. Second operand 9 states. [2018-10-04 14:19:46,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:46,405 INFO L93 Difference]: Finished difference Result 588 states and 937 transitions. [2018-10-04 14:19:46,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 14:19:46,406 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-10-04 14:19:46,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:46,408 INFO L225 Difference]: With dead ends: 588 [2018-10-04 14:19:46,409 INFO L226 Difference]: Without dead ends: 408 [2018-10-04 14:19:46,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 14 [2018-10-04 14:19:46,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-10-04 14:19:46,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 315. [2018-10-04 14:19:46,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-04 14:19:46,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 497 transitions. [2018-10-04 14:19:46,426 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 497 transitions. Word has length 54 [2018-10-04 14:19:46,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:46,427 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 497 transitions. [2018-10-04 14:19:46,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:19:46,427 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 497 transitions. [2018-10-04 14:19:46,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-04 14:19:46,429 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:46,429 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:46,430 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:46,430 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:46,430 INFO L82 PathProgramCache]: Analyzing trace with hash 928707300, now seen corresponding path program 1 times [2018-10-04 14:19:46,430 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:46,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:46,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:46,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:46,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:46,541 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-04 14:19:46,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:46,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:19:46,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:19:46,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:19:46,543 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:46,543 INFO L87 Difference]: Start difference. First operand 315 states and 497 transitions. Second operand 3 states. [2018-10-04 14:19:46,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:46,660 INFO L93 Difference]: Finished difference Result 797 states and 1238 transitions. [2018-10-04 14:19:46,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:19:46,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-10-04 14:19:46,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:46,664 INFO L225 Difference]: With dead ends: 797 [2018-10-04 14:19:46,664 INFO L226 Difference]: Without dead ends: 459 [2018-10-04 14:19:46,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:19:46,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-10-04 14:19:46,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 455. [2018-10-04 14:19:46,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-10-04 14:19:46,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 678 transitions. [2018-10-04 14:19:46,687 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 678 transitions. Word has length 57 [2018-10-04 14:19:46,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:46,687 INFO L480 AbstractCegarLoop]: Abstraction has 455 states and 678 transitions. [2018-10-04 14:19:46,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:19:46,688 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 678 transitions. [2018-10-04 14:19:46,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-04 14:19:46,689 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:46,689 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:46,689 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:46,690 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:46,690 INFO L82 PathProgramCache]: Analyzing trace with hash -139266043, now seen corresponding path program 1 times [2018-10-04 14:19:46,690 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:46,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:46,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:46,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:46,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:46,780 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-04 14:19:46,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:46,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:19:46,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:19:46,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:19:46,782 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:46,782 INFO L87 Difference]: Start difference. First operand 455 states and 678 transitions. Second operand 3 states. [2018-10-04 14:19:47,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:47,006 INFO L93 Difference]: Finished difference Result 909 states and 1355 transitions. [2018-10-04 14:19:47,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:19:47,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-10-04 14:19:47,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:47,010 INFO L225 Difference]: With dead ends: 909 [2018-10-04 14:19:47,010 INFO L226 Difference]: Without dead ends: 455 [2018-10-04 14:19:47,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:19:47,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-10-04 14:19:47,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2018-10-04 14:19:47,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-10-04 14:19:47,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 658 transitions. [2018-10-04 14:19:47,033 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 658 transitions. Word has length 57 [2018-10-04 14:19:47,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:47,034 INFO L480 AbstractCegarLoop]: Abstraction has 455 states and 658 transitions. [2018-10-04 14:19:47,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:19:47,034 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 658 transitions. [2018-10-04 14:19:47,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-04 14:19:47,035 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:47,035 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 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, 1, 1, 1] [2018-10-04 14:19:47,036 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:47,036 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:47,036 INFO L82 PathProgramCache]: Analyzing trace with hash 798403355, now seen corresponding path program 1 times [2018-10-04 14:19:47,036 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:47,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:47,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:47,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:47,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:48,226 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 12 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:48,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:19:48,226 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP 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-10-04 14:19:48,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:48,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:19:50,513 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 20 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:50,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:19:50,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-10-04 14:19:50,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 14:19:50,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 14:19:50,536 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:50,536 INFO L87 Difference]: Start difference. First operand 455 states and 658 transitions. Second operand 16 states. [2018-10-04 14:19:53,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:53,142 INFO L93 Difference]: Finished difference Result 1533 states and 2192 transitions. [2018-10-04 14:19:53,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 14:19:53,142 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2018-10-04 14:19:53,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:53,151 INFO L225 Difference]: With dead ends: 1533 [2018-10-04 14:19:53,151 INFO L226 Difference]: Without dead ends: 1532 [2018-10-04 14:19:53,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s Time 2.1s impTime 14 [2018-10-04 14:19:53,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2018-10-04 14:19:53,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 767. [2018-10-04 14:19:53,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2018-10-04 14:19:53,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1129 transitions. [2018-10-04 14:19:53,200 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1129 transitions. Word has length 59 [2018-10-04 14:19:53,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:53,201 INFO L480 AbstractCegarLoop]: Abstraction has 767 states and 1129 transitions. [2018-10-04 14:19:53,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 14:19:53,201 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1129 transitions. [2018-10-04 14:19:53,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-04 14:19:53,204 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:53,204 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:53,204 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:53,204 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:53,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1550465213, now seen corresponding path program 1 times [2018-10-04 14:19:53,205 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:53,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:53,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:53,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:53,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:53,359 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-04 14:19:53,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:53,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:19:53,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:19:53,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:19:53,360 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:53,360 INFO L87 Difference]: Start difference. First operand 767 states and 1129 transitions. Second operand 3 states. [2018-10-04 14:19:53,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:53,649 INFO L93 Difference]: Finished difference Result 1835 states and 2691 transitions. [2018-10-04 14:19:53,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:19:53,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-10-04 14:19:53,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:53,656 INFO L225 Difference]: With dead ends: 1835 [2018-10-04 14:19:53,656 INFO L226 Difference]: Without dead ends: 1069 [2018-10-04 14:19:53,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:19:53,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2018-10-04 14:19:53,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1018. [2018-10-04 14:19:53,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1018 states. [2018-10-04 14:19:53,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1471 transitions. [2018-10-04 14:19:53,711 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1471 transitions. Word has length 80 [2018-10-04 14:19:53,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:53,711 INFO L480 AbstractCegarLoop]: Abstraction has 1018 states and 1471 transitions. [2018-10-04 14:19:53,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:19:53,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1471 transitions. [2018-10-04 14:19:53,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-04 14:19:53,714 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:53,715 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:53,715 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:53,715 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:53,715 INFO L82 PathProgramCache]: Analyzing trace with hash -215528200, now seen corresponding path program 2 times [2018-10-04 14:19:53,715 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:53,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:53,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:53,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:53,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:53,914 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-04 14:19:53,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:53,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 14:19:53,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 14:19:53,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 14:19:53,915 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:53,915 INFO L87 Difference]: Start difference. First operand 1018 states and 1471 transitions. Second operand 4 states. [2018-10-04 14:19:54,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:54,119 INFO L93 Difference]: Finished difference Result 2065 states and 2971 transitions. [2018-10-04 14:19:54,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:19:54,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-10-04 14:19:54,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:54,125 INFO L225 Difference]: With dead ends: 2065 [2018-10-04 14:19:54,126 INFO L226 Difference]: Without dead ends: 1018 [2018-10-04 14:19:54,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 2 [2018-10-04 14:19:54,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2018-10-04 14:19:54,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1016. [2018-10-04 14:19:54,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1016 states. [2018-10-04 14:19:54,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1414 transitions. [2018-10-04 14:19:54,179 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1414 transitions. Word has length 81 [2018-10-04 14:19:54,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:54,180 INFO L480 AbstractCegarLoop]: Abstraction has 1016 states and 1414 transitions. [2018-10-04 14:19:54,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 14:19:54,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1414 transitions. [2018-10-04 14:19:54,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-04 14:19:54,182 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:54,182 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:54,183 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:54,186 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:54,186 INFO L82 PathProgramCache]: Analyzing trace with hash 571414056, now seen corresponding path program 1 times [2018-10-04 14:19:54,187 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:54,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:54,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:54,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:19:54,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:54,291 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-04 14:19:54,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:54,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:19:54,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:19:54,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:19:54,292 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:54,293 INFO L87 Difference]: Start difference. First operand 1016 states and 1414 transitions. Second operand 3 states. [2018-10-04 14:19:54,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:54,538 INFO L93 Difference]: Finished difference Result 1868 states and 2575 transitions. [2018-10-04 14:19:54,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:19:54,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-10-04 14:19:54,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:54,542 INFO L225 Difference]: With dead ends: 1868 [2018-10-04 14:19:54,543 INFO L226 Difference]: Without dead ends: 736 [2018-10-04 14:19:54,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:19:54,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2018-10-04 14:19:54,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 726. [2018-10-04 14:19:54,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-10-04 14:19:54,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 948 transitions. [2018-10-04 14:19:54,580 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 948 transitions. Word has length 97 [2018-10-04 14:19:54,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:54,581 INFO L480 AbstractCegarLoop]: Abstraction has 726 states and 948 transitions. [2018-10-04 14:19:54,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:19:54,581 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 948 transitions. [2018-10-04 14:19:54,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-04 14:19:54,583 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:54,583 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:54,583 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:54,583 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:54,584 INFO L82 PathProgramCache]: Analyzing trace with hash 856693736, now seen corresponding path program 1 times [2018-10-04 14:19:54,584 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:54,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:54,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:54,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:54,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:56,149 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 35 proven. 134 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-04 14:19:56,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:19:56,150 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP 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-10-04 14:19:56,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:56,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:19:58,033 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 75 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:58,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:19:58,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-10-04 14:19:58,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-04 14:19:58,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-04 14:19:58,055 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:58,055 INFO L87 Difference]: Start difference. First operand 726 states and 948 transitions. Second operand 26 states. [2018-10-04 14:20:06,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:06,043 INFO L93 Difference]: Finished difference Result 6073 states and 7615 transitions. [2018-10-04 14:20:06,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-04 14:20:06,044 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 99 [2018-10-04 14:20:06,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:06,068 INFO L225 Difference]: With dead ends: 6073 [2018-10-04 14:20:06,068 INFO L226 Difference]: Without dead ends: 6072 [2018-10-04 14:20:06,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s Time 6.4s impTime 30 [2018-10-04 14:20:06,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6072 states. [2018-10-04 14:20:06,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6072 to 1176. [2018-10-04 14:20:06,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-10-04 14:20:06,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1565 transitions. [2018-10-04 14:20:06,198 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1565 transitions. Word has length 99 [2018-10-04 14:20:06,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:06,198 INFO L480 AbstractCegarLoop]: Abstraction has 1176 states and 1565 transitions. [2018-10-04 14:20:06,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-04 14:20:06,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1565 transitions. [2018-10-04 14:20:06,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-04 14:20:06,200 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:06,201 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2018-10-04 14:20:06,201 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:06,201 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:06,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1497402593, now seen corresponding path program 1 times [2018-10-04 14:20:06,201 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:06,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:06,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:06,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:06,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:06,284 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-04 14:20:06,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:06,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:20:06,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:20:06,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:20:06,285 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:06,286 INFO L87 Difference]: Start difference. First operand 1176 states and 1565 transitions. Second operand 3 states. [2018-10-04 14:20:06,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:06,489 INFO L93 Difference]: Finished difference Result 2107 states and 2774 transitions. [2018-10-04 14:20:06,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:20:06,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-10-04 14:20:06,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:06,492 INFO L225 Difference]: With dead ends: 2107 [2018-10-04 14:20:06,492 INFO L226 Difference]: Without dead ends: 887 [2018-10-04 14:20:06,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:20:06,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-10-04 14:20:06,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 691. [2018-10-04 14:20:06,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2018-10-04 14:20:06,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 882 transitions. [2018-10-04 14:20:06,551 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 882 transitions. Word has length 99 [2018-10-04 14:20:06,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:06,551 INFO L480 AbstractCegarLoop]: Abstraction has 691 states and 882 transitions. [2018-10-04 14:20:06,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:20:06,551 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 882 transitions. [2018-10-04 14:20:06,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-04 14:20:06,553 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:06,553 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:06,554 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:06,554 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:06,554 INFO L82 PathProgramCache]: Analyzing trace with hash -2087266119, now seen corresponding path program 2 times [2018-10-04 14:20:06,554 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:06,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:06,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:06,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:06,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:06,631 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-10-04 14:20:06,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:06,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:20:06,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:20:06,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:20:06,632 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:06,632 INFO L87 Difference]: Start difference. First operand 691 states and 882 transitions. Second operand 3 states. [2018-10-04 14:20:06,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:06,709 INFO L93 Difference]: Finished difference Result 1137 states and 1433 transitions. [2018-10-04 14:20:06,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:20:06,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-10-04 14:20:06,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:06,710 INFO L225 Difference]: With dead ends: 1137 [2018-10-04 14:20:06,710 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 14:20:06,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:20:06,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 14:20:06,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 14:20:06,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 14:20:06,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 14:20:06,712 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 117 [2018-10-04 14:20:06,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:06,713 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 14:20:06,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:20:06,713 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 14:20:06,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 14:20:06,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 14:20:06,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:06,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:06,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:06,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:07,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:07,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:07,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:07,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:09,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:09,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:09,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:09,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:09,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:10,007 WARN L178 SmtUtils]: Spent 3.28 s on a formula simplification. DAG size of input: 586 DAG size of output: 493 [2018-10-04 14:20:17,470 WARN L178 SmtUtils]: Spent 7.45 s on a formula simplification. DAG size of input: 477 DAG size of output: 141 [2018-10-04 14:20:17,476 INFO L425 ceAbstractionStarter]: For program point L93(lines 93 110) no Hoare annotation was computed. [2018-10-04 14:20:17,476 INFO L425 ceAbstractionStarter]: For program point L118(lines 118 144) no Hoare annotation was computed. [2018-10-04 14:20:17,476 INFO L425 ceAbstractionStarter]: For program point ElevatorErr0ASSERT_VIOLATIONASSERT(line 79) no Hoare annotation was computed. [2018-10-04 14:20:17,476 INFO L425 ceAbstractionStarter]: For program point L168(lines 168 172) no Hoare annotation was computed. [2018-10-04 14:20:17,476 INFO L425 ceAbstractionStarter]: For program point L103(lines 103 110) no Hoare annotation was computed. [2018-10-04 14:20:17,476 INFO L425 ceAbstractionStarter]: For program point L137(lines 137 144) no Hoare annotation was computed. [2018-10-04 14:20:17,476 INFO L425 ceAbstractionStarter]: For program point L137-2(lines 113 164) no Hoare annotation was computed. [2018-10-04 14:20:17,477 INFO L425 ceAbstractionStarter]: For program point L96(lines 96 110) no Hoare annotation was computed. [2018-10-04 14:20:17,477 INFO L425 ceAbstractionStarter]: For program point L105(lines 105 110) no Hoare annotation was computed. [2018-10-04 14:20:17,477 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 77) no Hoare annotation was computed. [2018-10-04 14:20:17,477 INFO L425 ceAbstractionStarter]: For program point L105-2(lines 91 144) no Hoare annotation was computed. [2018-10-04 14:20:17,477 INFO L425 ceAbstractionStarter]: For program point L155(lines 155 164) no Hoare annotation was computed. [2018-10-04 14:20:17,477 INFO L425 ceAbstractionStarter]: For program point L155-1(lines 147 190) no Hoare annotation was computed. [2018-10-04 14:20:17,477 INFO L425 ceAbstractionStarter]: For program point L180(lines 180 190) no Hoare annotation was computed. [2018-10-04 14:20:17,477 INFO L425 ceAbstractionStarter]: For program point L180-1(lines 167 190) no Hoare annotation was computed. [2018-10-04 14:20:17,478 INFO L421 ceAbstractionStarter]: At program point L48-1(lines 13 197) the Hoare annotation is: (let ((.cse28 (<= Elevator_current Elevator_max)) (.cse38 (+ Elevator_current 1))) (let ((.cse8 (and .cse28 (< Elevator_min .cse38) (<= Elevator_qDC1 1))) (.cse29 (= Elevator_qCSP 1))) (let ((.cse14 (= |Elevator_dir'| 1)) (.cse19 (= Elevator_dir 1)) (.cse17 (= (+ Elevator_dir 1) 0)) (.cse3 (<= Elevator_min |Elevator_current'|)) (.cse2 (<= |Elevator_current'| Elevator_max)) (.cse20 (+ |Elevator_dir'| 1)) (.cse11 (= Elevator_qDC2 1)) (.cse26 (and .cse8 .cse29)) (.cse36 (+ Elevator_min 1)) (.cse27 (<= Elevator_min Elevator_current))) (let ((.cse9 (not (= Elevator_qCSP 3))) (.cse23 (and (<= .cse38 Elevator_max) .cse27)) (.cse22 (and .cse28 (<= .cse36 Elevator_current))) (.cse18 (let ((.cse37 (+ Elevator_dir Elevator_current))) (or (and (<= .cse37 Elevator_max) (<= 1 Elevator_dir)) (= Elevator_current Elevator_goal) (and (<= Elevator_min .cse37) (<= (+ Elevator_dir Elevator_current 2) Elevator_max))))) (.cse35 (and .cse11 .cse26)) (.cse31 (or (= .cse20 0) (<= |Elevator_current'| |Elevator_goal'|))) (.cse1 (= Elevator_qDC2 2)) (.cse24 (or (and (<= (+ |Elevator_current'| 1) Elevator_max) .cse3) (and .cse2 (<= .cse36 |Elevator_current'|)))) (.cse32 (or (<= Elevator_current Elevator_goal) .cse17)) (.cse33 (or (<= Elevator_goal Elevator_current) .cse19)) (.cse21 (= Elevator_qDC1 2)) (.cse34 (or .cse14 (<= |Elevator_goal'| |Elevator_current'|))) (.cse0 (not Elevator_stop)) (.cse13 (= Elevator_qDC2 3)) (.cse25 (not Elevator_newgoal)) (.cse10 (not (= Elevator_goal Elevator_current))) (.cse4 (<= |Elevator_goal'| Elevator_max)) (.cse5 (<= Elevator_min |Elevator_goal'|)) (.cse6 (<= Elevator_goal Elevator_max)) (.cse7 (<= Elevator_min Elevator_goal)) (.cse30 (not Elevator_passed)) (.cse12 (not (= |Elevator_current'| |Elevator_goal'|)))) (or (and .cse0 (and .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9)))) (and .cse2 .cse10 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse12) (and .cse2 .cse10 .cse3 .cse4 .cse5 .cse13 .cse6 .cse7 .cse8 .cse12) (and .cse0 (let ((.cse15 (+ |Elevator_goal'| |Elevator_dir'|)) (.cse16 (+ Elevator_dir Elevator_goal))) (and (or .cse14 (<= .cse15 |Elevator_current'|)) (or (<= Elevator_current .cse16) .cse17) (not (= .cse15 |Elevator_current'|)) .cse18 (or (<= .cse16 Elevator_current) .cse19) (or (<= 1 |Elevator_dir'|) (<= (+ |Elevator_current'| |Elevator_dir'| 2) Elevator_max)) (or (= 0 .cse20) (<= |Elevator_current'| .cse15)) .cse21 .cse1 (and (or .cse22 .cse23) .cse4 .cse5 .cse6 .cse7) (not (= .cse16 Elevator_current)) .cse24)) .cse25) (and .cse0 (and .cse26 .cse4 .cse5 .cse13 .cse6 .cse7)) (and .cse25 (and .cse2 .cse27 .cse28 .cse21 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse29 .cse30)) (and .cse0 (and .cse10 .cse4 .cse12 .cse31 .cse1 .cse5 .cse8 .cse24 .cse32 .cse6 .cse7 .cse33 .cse34) .cse25) (and (and .cse0 (and (or (and Elevator_passed .cse21 .cse13) (and .cse2 .cse27 .cse28 .cse21 .cse3 .cse13)) .cse4 .cse5 .cse6 .cse7)) .cse25) (and .cse4 .cse5 .cse35 .cse6 .cse7) (and .cse0 (and .cse21 (and .cse1 (and .cse2 .cse27 .cse28 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30)))) (and (or .cse23 .cse22) .cse18 .cse35 .cse6 .cse7) (and .cse0 (and .cse2 .cse27 .cse3 .cse4 .cse13 .cse6 .cse7 .cse29 .cse30 .cse28 .cse21 .cse5)) (and .cse0 (and .cse4 .cse5 .cse6 (and .cse1 .cse26) .cse7) .cse25) (and .cse2 .cse10 .cse27 .cse3 .cse4 .cse13 .cse6 .cse7 .cse30 .cse12 .cse28 .cse21 .cse5) (and .cse0 .cse25 (and .cse10 .cse4 .cse12 .cse31 .cse28 .cse1 .cse5 .cse24 .cse32 .cse27 .cse6 .cse7 .cse33 .cse30 .cse21 .cse34)) (and .cse0 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8) .cse25) (and .cse2 .cse10 .cse27 .cse28 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse12)))))) [2018-10-04 14:20:17,478 INFO L425 ceAbstractionStarter]: For program point L131(lines 131 144) no Hoare annotation was computed. [2018-10-04 14:20:17,479 INFO L425 ceAbstractionStarter]: For program point L98(lines 98 110) no Hoare annotation was computed. [2018-10-04 14:20:17,479 INFO L425 ceAbstractionStarter]: For program point L156(lines 156 161) no Hoare annotation was computed. [2018-10-04 14:20:17,479 INFO L425 ceAbstractionStarter]: For program point L181(lines 181 187) no Hoare annotation was computed. [2018-10-04 14:20:17,479 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 154) no Hoare annotation was computed. [2018-10-04 14:20:17,479 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 190) no Hoare annotation was computed. [2018-10-04 14:20:17,479 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 77) no Hoare annotation was computed. [2018-10-04 14:20:17,479 INFO L425 ceAbstractionStarter]: For program point L74-2(lines 70 77) no Hoare annotation was computed. [2018-10-04 14:20:17,479 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-10-04 14:20:17,479 INFO L425 ceAbstractionStarter]: For program point L66-2(lines 66 77) no Hoare annotation was computed. [2018-10-04 14:20:17,480 INFO L425 ceAbstractionStarter]: For program point ElevatorEXIT(lines 13 197) no Hoare annotation was computed. [2018-10-04 14:20:17,480 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 110) no Hoare annotation was computed. [2018-10-04 14:20:17,480 INFO L425 ceAbstractionStarter]: For program point L174(lines 174 179) no Hoare annotation was computed. [2018-10-04 14:20:17,480 INFO L425 ceAbstractionStarter]: For program point L125(lines 125 144) no Hoare annotation was computed. [2018-10-04 14:20:17,480 INFO L425 ceAbstractionStarter]: For program point ElevatorENTRY(lines 13 197) no Hoare annotation was computed. [2018-10-04 14:20:17,480 INFO L425 ceAbstractionStarter]: For program point L101(lines 101 110) no Hoare annotation was computed. [2018-10-04 14:20:17,504 INFO L202 PluginConnector]: Adding new model Elevator.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 02:20:17 BoogieIcfgContainer [2018-10-04 14:20:17,504 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 14:20:17,505 INFO L168 Benchmark]: Toolchain (without parser) took 36023.92 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 460.3 MB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -422.8 MB). Peak memory consumption was 858.2 MB. Max. memory is 7.1 GB. [2018-10-04 14:20:17,507 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:20:17,508 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:20:17,509 INFO L168 Benchmark]: Boogie Preprocessor took 49.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:20:17,509 INFO L168 Benchmark]: RCFGBuilder took 753.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-04 14:20:17,510 INFO L168 Benchmark]: TraceAbstraction took 35172.19 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 460.3 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -454.5 MB). Peak memory consumption was 826.4 MB. Max. memory is 7.1 GB. [2018-10-04 14:20:17,516 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.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 753.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 35172.19 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 460.3 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -454.5 MB). Peak memory consumption was 826.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 79]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: ((((((((((((((((!stop && qDC2 == 2 && (((((current' <= max && min <= current') && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && ((current <= max && min < current + 1) && qDC1 <= 1) && !(qCSP == 3)) || (((((((((current' <= max && !(goal == current)) && qDC2 == 1) && min <= current') && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && (current <= max && min < current + 1) && qDC1 <= 1) && !(current' == goal'))) || (((((((((current' <= max && !(goal == current)) && min <= current') && goal' <= max) && min <= goal') && qDC2 == 3) && goal <= max) && min <= goal) && (current <= max && min < current + 1) && qDC1 <= 1) && !(current' == goal'))) || ((!stop && (((((((((((dir' == 1 || goal' + dir' <= current') && (current <= dir + goal || dir + 1 == 0)) && !(goal' + dir' == current')) && (((dir + current <= max && 1 <= dir) || current == goal) || (min <= dir + current && dir + current + 2 <= max))) && (dir + goal <= current || dir == 1)) && (1 <= dir' || current' + dir' + 2 <= max)) && (0 == dir' + 1 || current' <= goal' + dir')) && qDC1 == 2) && qDC2 == 2) && (((((current <= max && min + 1 <= current) || (current + 1 <= max && min <= current)) && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && !(dir + goal == current)) && ((current' + 1 <= max && min <= current') || (current' <= max && min + 1 <= current'))) && !newgoal)) || (!stop && (((((((current <= max && min < current + 1) && qDC1 <= 1) && qCSP == 1) && goal' <= max) && min <= goal') && qDC2 == 3) && goal <= max) && min <= goal)) || (!newgoal && ((((((((((current' <= max && min <= current) && current <= max) && qDC1 == 2) && qDC2 == 1) && min <= current') && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && qCSP == 1) && !passed)) || ((!stop && (((((((((((!(goal == current) && goal' <= max) && !(current' == goal')) && (dir' + 1 == 0 || current' <= goal')) && qDC2 == 2) && min <= goal') && (current <= max && min < current + 1) && qDC1 <= 1) && ((current' + 1 <= max && min <= current') || (current' <= max && min + 1 <= current'))) && (current <= goal || dir + 1 == 0)) && goal <= max) && min <= goal) && (goal <= current || dir == 1)) && (dir' == 1 || goal' <= current')) && !newgoal)) || ((!stop && ((((((passed && qDC1 == 2) && qDC2 == 3) || (((((current' <= max && min <= current) && current <= max) && qDC1 == 2) && min <= current') && qDC2 == 3)) && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && !newgoal)) || ((((goal' <= max && min <= goal') && qDC2 == 1 && ((current <= max && min < current + 1) && qDC1 <= 1) && qCSP == 1) && goal <= max) && min <= goal)) || (!stop && qDC1 == 2 && qDC2 == 2 && ((((((((current' <= max && min <= current) && current <= max) && !(qCSP == 3)) && min <= current') && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && !passed)) || ((((((current + 1 <= max && min <= current) || (current <= max && min + 1 <= current)) && (((dir + current <= max && 1 <= dir) || current == goal) || (min <= dir + current && dir + current + 2 <= max))) && qDC2 == 1 && ((current <= max && min < current + 1) && qDC1 <= 1) && qCSP == 1) && goal <= max) && min <= goal)) || (!stop && ((((((((((current' <= max && min <= current) && min <= current') && goal' <= max) && qDC2 == 3) && goal <= max) && min <= goal) && qCSP == 1) && !passed) && current <= max) && qDC1 == 2) && min <= goal')) || ((!stop && (((goal' <= max && min <= goal') && goal <= max) && qDC2 == 2 && ((current <= max && min < current + 1) && qDC1 <= 1) && qCSP == 1) && min <= goal) && !newgoal)) || ((((((((((((current' <= max && !(goal == current)) && min <= current) && min <= current') && goal' <= max) && qDC2 == 3) && goal <= max) && min <= goal) && !passed) && !(current' == goal')) && current <= max) && qDC1 == 2) && min <= goal')) || ((!stop && !newgoal) && ((((((((((((((!(goal == current) && goal' <= max) && !(current' == goal')) && (dir' + 1 == 0 || current' <= goal')) && current <= max) && qDC2 == 2) && min <= goal') && ((current' + 1 <= max && min <= current') || (current' <= max && min + 1 <= current'))) && (current <= goal || dir + 1 == 0)) && min <= current) && goal <= max) && min <= goal) && (goal <= current || dir == 1)) && !passed) && qDC1 == 2) && (dir' == 1 || goal' <= current'))) || ((!stop && ((((((current' <= max && min <= current') && goal' <= max) && min <= goal') && goal <= max) && qDC2 == 3) && min <= goal) && (current <= max && min < current + 1) && qDC1 <= 1) && !newgoal)) || (((((((((((current' <= max && !(goal == current)) && min <= current) && current <= max) && qDC2 == 1) && min <= current') && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && !passed) && !(current' == goal')) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. SAFE Result, 35.0s OverallTime, 18 OverallIterations, 7 TraceHistogramMax, 14.3s AutomataDifference, 0.0s DeadEndRemovalTime, 10.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1306 SDtfs, 3574 SDslu, 4637 SDs, 0 SdLazy, 1501 SolverSat, 284 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 414 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1176occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 6236 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 42 NumberOfFragments, 923 HoareAnnotationTreeSize, 1 FomulaSimplifications, 140729 FormulaSimplificationTreeSizeReduction, 3.2s HoareSimplificationTime, 1 FomulaSimplificationsInter, 171797 FormulaSimplificationTreeSizeReductionInter, 7.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 1240 NumberOfCodeBlocks, 1240 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1219 ConstructedInterpolants, 0 QuantifiedInterpolants, 1053101 SizeOfPredicates, 35 NumberOfNonLiveVariables, 636 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 21 InterpolantComputations, 16 PerfectInterpolantSequences, 1304/1655 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Elevator.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_14-20-17-535.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Elevator.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_14-20-17-535.csv Received shutdown request...