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.epf -i ../../../trunk/examples/programs/real-life/Elevator.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:07:55,644 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:07:55,646 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:07:55,659 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:07:55,659 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:07:55,660 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:07:55,661 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:07:55,663 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:07:55,665 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:07:55,666 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:07:55,666 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:07:55,667 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:07:55,668 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:07:55,668 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:07:55,670 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:07:55,670 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:07:55,671 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:07:55,673 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:07:55,675 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:07:55,677 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:07:55,678 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:07:55,679 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:07:55,682 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:07:55,682 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:07:55,683 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:07:55,683 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:07:55,684 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:07:55,685 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:07:55,686 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:07:55,687 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:07:55,687 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:07:55,688 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:07:55,688 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:07:55,689 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:07:55,690 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:07:55,690 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:07:55,691 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 09:07:55,715 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:07:55,715 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:07:55,716 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:07:55,716 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:07:55,719 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:07:55,719 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:07:55,720 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:07:55,721 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:07:55,721 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:07:55,721 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:07:55,721 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:07:55,722 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:07:55,722 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:07:55,722 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:07:55,722 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:07:55,722 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:07:55,723 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:07:55,724 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:07:55,724 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:07:55,724 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:07:55,724 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:07:55,725 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:07:55,725 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:07:55,725 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:07:55,725 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:07:55,726 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:07:55,726 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:07:55,726 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:07:55,727 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:07:55,727 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:07:55,798 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:07:55,811 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:07:55,815 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:07:55,818 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:07:55,818 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:07:55,819 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 09:07:55,820 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator.bpl' [2018-10-04 09:07:55,888 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:07:55,890 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:07:55,891 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:07:55,891 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:07:55,892 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:07:55,916 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 09:07:55" (1/1) ... [2018-10-04 09:07:55,932 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 09:07:55" (1/1) ... [2018-10-04 09:07:55,937 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 09:07:55,937 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 09:07:55,938 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 09:07:55,940 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:07:55,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:07:55,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:07:55,942 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:07:55,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:07:55" (1/1) ... [2018-10-04 09:07:55,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:07:55" (1/1) ... [2018-10-04 09:07:55,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:07:55" (1/1) ... [2018-10-04 09:07:55,967 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:07:55" (1/1) ... [2018-10-04 09:07:55,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:07:55" (1/1) ... [2018-10-04 09:07:55,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:07:55" (1/1) ... [2018-10-04 09:07:55,990 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:07:55" (1/1) ... [2018-10-04 09:07:55,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:07:55,999 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:07:56,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:07:56,003 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:07:56,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:07:55" (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 09:07:56,083 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Elevator given in one single declaration [2018-10-04 09:07:56,084 INFO L130 BoogieDeclarations]: Found specification of procedure Elevator [2018-10-04 09:07:56,084 INFO L138 BoogieDeclarations]: Found implementation of procedure Elevator [2018-10-04 09:07:56,787 INFO L338 CfgBuilder]: Using library mode [2018-10-04 09:07:56,788 INFO L202 PluginConnector]: Adding new model Elevator.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:07:56 BoogieIcfgContainer [2018-10-04 09:07:56,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:07:56,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:07:56,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:07:56,793 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:07:56,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:07:55" (1/2) ... [2018-10-04 09:07:56,794 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 09:07:56, skipping insertion in model container [2018-10-04 09:07:56,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:07:56" (2/2) ... [2018-10-04 09:07:56,796 INFO L112 eAbstractionObserver]: Analyzing ICFG Elevator.bpl [2018-10-04 09:07:56,806 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:07:56,815 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:07:56,864 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:07:56,865 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:07:56,865 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:07:56,865 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:07:56,866 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:07:56,866 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:07:56,866 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:07:56,866 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:07:56,866 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:07:56,883 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-10-04 09:07:56,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 09:07:56,889 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:07:56,891 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 09:07:56,892 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:07:56,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:07:56,897 INFO L82 PathProgramCache]: Analyzing trace with hash 28755472, now seen corresponding path program 1 times [2018-10-04 09:07:56,899 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:07:56,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:07:56,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:07:56,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:07:56,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:07:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:07:57,036 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 09:07:57,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:07:57,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:07:57,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:07:57,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:07:57,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:07:57,059 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-10-04 09:07:57,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:07:57,149 INFO L93 Difference]: Finished difference Result 92 states and 168 transitions. [2018-10-04 09:07:57,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:07:57,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-10-04 09:07:57,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:07:57,165 INFO L225 Difference]: With dead ends: 92 [2018-10-04 09:07:57,165 INFO L226 Difference]: Without dead ends: 58 [2018-10-04 09:07:57,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:07:57,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-04 09:07:57,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-10-04 09:07:57,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-04 09:07:57,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 98 transitions. [2018-10-04 09:07:57,215 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 98 transitions. Word has length 5 [2018-10-04 09:07:57,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:07:57,215 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 98 transitions. [2018-10-04 09:07:57,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:07:57,216 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 98 transitions. [2018-10-04 09:07:57,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 09:07:57,216 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:07:57,217 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 09:07:57,217 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:07:57,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:07:57,217 INFO L82 PathProgramCache]: Analyzing trace with hash 28757394, now seen corresponding path program 1 times [2018-10-04 09:07:57,218 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:07:57,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:07:57,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:07:57,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:07:57,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:07:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:07:57,271 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 09:07:57,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:07:57,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-04 09:07:57,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:07:57,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:07:57,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:07:57,275 INFO L87 Difference]: Start difference. First operand 57 states and 98 transitions. Second operand 3 states. [2018-10-04 09:07:57,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:07:57,411 INFO L93 Difference]: Finished difference Result 64 states and 108 transitions. [2018-10-04 09:07:57,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:07:57,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-10-04 09:07:57,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:07:57,414 INFO L225 Difference]: With dead ends: 64 [2018-10-04 09:07:57,414 INFO L226 Difference]: Without dead ends: 63 [2018-10-04 09:07:57,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:07:57,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-04 09:07:57,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-10-04 09:07:57,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-04 09:07:57,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 107 transitions. [2018-10-04 09:07:57,425 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 107 transitions. Word has length 5 [2018-10-04 09:07:57,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:07:57,426 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 107 transitions. [2018-10-04 09:07:57,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:07:57,426 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 107 transitions. [2018-10-04 09:07:57,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:07:57,427 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:07:57,428 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:07:57,428 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:07:57,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:07:57,429 INFO L82 PathProgramCache]: Analyzing trace with hash 815749096, now seen corresponding path program 1 times [2018-10-04 09:07:57,429 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:07:57,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:07:57,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:07:57,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:07:57,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:07:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:07:57,567 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 09:07:57,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:07:57,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:07:57,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:07:57,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:07:57,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 09:07:57,569 INFO L87 Difference]: Start difference. First operand 63 states and 107 transitions. Second operand 4 states. [2018-10-04 09:07:57,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:07:57,753 INFO L93 Difference]: Finished difference Result 95 states and 160 transitions. [2018-10-04 09:07:57,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 09:07:57,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-10-04 09:07:57,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:07:57,756 INFO L225 Difference]: With dead ends: 95 [2018-10-04 09:07:57,757 INFO L226 Difference]: Without dead ends: 94 [2018-10-04 09:07:57,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 09:07:57,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-04 09:07:57,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2018-10-04 09:07:57,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-04 09:07:57,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 149 transitions. [2018-10-04 09:07:57,772 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 149 transitions. Word has length 16 [2018-10-04 09:07:57,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:07:57,772 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 149 transitions. [2018-10-04 09:07:57,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:07:57,773 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 149 transitions. [2018-10-04 09:07:57,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 09:07:57,774 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:07:57,774 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 09:07:57,775 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:07:57,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:07:57,775 INFO L82 PathProgramCache]: Analyzing trace with hash -2118172386, now seen corresponding path program 1 times [2018-10-04 09:07:57,775 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:07:57,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:07:57,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:07:57,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:07:57,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:07:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:07:57,851 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 09:07:57,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:07:57,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:07:57,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:07:57,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:07:57,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:07:57,854 INFO L87 Difference]: Start difference. First operand 88 states and 149 transitions. Second operand 3 states. [2018-10-04 09:07:58,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:07:58,089 INFO L93 Difference]: Finished difference Result 205 states and 347 transitions. [2018-10-04 09:07:58,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:07:58,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-04 09:07:58,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:07:58,091 INFO L225 Difference]: With dead ends: 205 [2018-10-04 09:07:58,092 INFO L226 Difference]: Without dead ends: 116 [2018-10-04 09:07:58,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:07:58,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-04 09:07:58,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 96. [2018-10-04 09:07:58,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-04 09:07:58,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 162 transitions. [2018-10-04 09:07:58,106 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 162 transitions. Word has length 20 [2018-10-04 09:07:58,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:07:58,106 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 162 transitions. [2018-10-04 09:07:58,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:07:58,107 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 162 transitions. [2018-10-04 09:07:58,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-04 09:07:58,109 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:07:58,109 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 09:07:58,110 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:07:58,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:07:58,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1426889970, now seen corresponding path program 1 times [2018-10-04 09:07:58,110 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:07:58,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:07:58,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:07:58,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:07:58,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:07:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:07:58,200 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 09:07:58,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:07:58,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:07:58,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 09:07:58,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 09:07:58,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-04 09:07:58,202 INFO L87 Difference]: Start difference. First operand 96 states and 162 transitions. Second operand 5 states. [2018-10-04 09:07:58,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:07:58,343 INFO L93 Difference]: Finished difference Result 297 states and 503 transitions. [2018-10-04 09:07:58,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 09:07:58,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-10-04 09:07:58,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:07:58,347 INFO L225 Difference]: With dead ends: 297 [2018-10-04 09:07:58,347 INFO L226 Difference]: Without dead ends: 186 [2018-10-04 09:07:58,348 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-04 09:07:58,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-10-04 09:07:58,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-10-04 09:07:58,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-04 09:07:58,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 310 transitions. [2018-10-04 09:07:58,368 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 310 transitions. Word has length 25 [2018-10-04 09:07:58,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:07:58,369 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 310 transitions. [2018-10-04 09:07:58,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 09:07:58,369 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 310 transitions. [2018-10-04 09:07:58,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-04 09:07:58,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:07:58,371 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 09:07:58,371 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:07:58,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:07:58,372 INFO L82 PathProgramCache]: Analyzing trace with hash -471363241, now seen corresponding path program 1 times [2018-10-04 09:07:58,372 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:07:58,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:07:58,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:07:58,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:07:58,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:07:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:07:58,448 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 09:07:58,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:07:58,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:07:58,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:07:58,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:07:58,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:07:58,450 INFO L87 Difference]: Start difference. First operand 186 states and 310 transitions. Second operand 3 states. [2018-10-04 09:07:58,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:07:58,569 INFO L93 Difference]: Finished difference Result 472 states and 783 transitions. [2018-10-04 09:07:58,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:07:58,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-10-04 09:07:58,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:07:58,574 INFO L225 Difference]: With dead ends: 472 [2018-10-04 09:07:58,575 INFO L226 Difference]: Without dead ends: 283 [2018-10-04 09:07:58,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:07:58,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-10-04 09:07:58,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 190. [2018-10-04 09:07:58,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-10-04 09:07:58,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 314 transitions. [2018-10-04 09:07:58,621 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 314 transitions. Word has length 51 [2018-10-04 09:07:58,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:07:58,621 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 314 transitions. [2018-10-04 09:07:58,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:07:58,621 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 314 transitions. [2018-10-04 09:07:58,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-04 09:07:58,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:07:58,624 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 09:07:58,627 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:07:58,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:07:58,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1611871285, now seen corresponding path program 1 times [2018-10-04 09:07:58,628 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:07:58,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:07:58,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:07:58,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:07:58,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:07:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:07:58,708 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 09:07:58,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:07:58,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:07:58,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:07:58,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:07:58,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:07:58,711 INFO L87 Difference]: Start difference. First operand 190 states and 314 transitions. Second operand 3 states. [2018-10-04 09:07:58,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:07:58,903 INFO L93 Difference]: Finished difference Result 480 states and 791 transitions. [2018-10-04 09:07:58,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:07:58,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-10-04 09:07:58,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:07:58,908 INFO L225 Difference]: With dead ends: 480 [2018-10-04 09:07:58,908 INFO L226 Difference]: Without dead ends: 289 [2018-10-04 09:07:58,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:07:58,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-10-04 09:07:58,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 196. [2018-10-04 09:07:58,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-04 09:07:58,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 320 transitions. [2018-10-04 09:07:58,924 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 320 transitions. Word has length 52 [2018-10-04 09:07:58,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:07:58,925 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 320 transitions. [2018-10-04 09:07:58,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:07:58,925 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 320 transitions. [2018-10-04 09:07:58,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-04 09:07:58,927 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:07:58,927 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 09:07:58,928 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:07:58,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:07:58,928 INFO L82 PathProgramCache]: Analyzing trace with hash -50759130, now seen corresponding path program 1 times [2018-10-04 09:07:58,928 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:07:58,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:07:58,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:07:58,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:07:58,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:07:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:07:59,000 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 09:07:59,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:07:59,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:07:59,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:07:59,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:07:59,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:07:59,002 INFO L87 Difference]: Start difference. First operand 196 states and 320 transitions. Second operand 3 states. [2018-10-04 09:07:59,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:07:59,326 INFO L93 Difference]: Finished difference Result 378 states and 617 transitions. [2018-10-04 09:07:59,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:07:59,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-10-04 09:07:59,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:07:59,329 INFO L225 Difference]: With dead ends: 378 [2018-10-04 09:07:59,329 INFO L226 Difference]: Without dead ends: 181 [2018-10-04 09:07:59,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:07:59,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-04 09:07:59,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 175. [2018-10-04 09:07:59,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-04 09:07:59,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 279 transitions. [2018-10-04 09:07:59,340 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 279 transitions. Word has length 54 [2018-10-04 09:07:59,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:07:59,341 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 279 transitions. [2018-10-04 09:07:59,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:07:59,341 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 279 transitions. [2018-10-04 09:07:59,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-04 09:07:59,343 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:07:59,343 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 09:07:59,344 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:07:59,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:07:59,344 INFO L82 PathProgramCache]: Analyzing trace with hash -860107678, now seen corresponding path program 1 times [2018-10-04 09:07:59,344 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:07:59,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:07:59,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:07:59,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:07:59,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:07:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:07:59,620 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 09:07:59,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:07:59,621 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 09:07:59,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:07:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:07:59,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:07:59,921 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 09:07:59,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 09:07:59,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2018-10-04 09:07:59,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:07:59,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:07:59,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-04 09:07:59,946 INFO L87 Difference]: Start difference. First operand 175 states and 279 transitions. Second operand 9 states. [2018-10-04 09:08:00,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:08:00,878 INFO L93 Difference]: Finished difference Result 588 states and 937 transitions. [2018-10-04 09:08:00,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 09:08:00,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-10-04 09:08:00,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:08:00,886 INFO L225 Difference]: With dead ends: 588 [2018-10-04 09:08:00,886 INFO L226 Difference]: Without dead ends: 408 [2018-10-04 09:08:00,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2018-10-04 09:08:00,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-10-04 09:08:00,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 315. [2018-10-04 09:08:00,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-04 09:08:00,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 497 transitions. [2018-10-04 09:08:00,910 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 497 transitions. Word has length 54 [2018-10-04 09:08:00,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:08:00,910 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 497 transitions. [2018-10-04 09:08:00,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:08:00,911 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 497 transitions. [2018-10-04 09:08:00,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-04 09:08:00,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:08:00,913 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 09:08:00,914 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:08:00,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:08:00,914 INFO L82 PathProgramCache]: Analyzing trace with hash 928707300, now seen corresponding path program 1 times [2018-10-04 09:08:00,914 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:08:00,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:08:00,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:00,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:08:00,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:08:00,976 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 09:08:00,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:08:00,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:08:00,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:08:00,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:08:00,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:08:00,978 INFO L87 Difference]: Start difference. First operand 315 states and 497 transitions. Second operand 3 states. [2018-10-04 09:08:01,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:08:01,042 INFO L93 Difference]: Finished difference Result 797 states and 1238 transitions. [2018-10-04 09:08:01,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:08:01,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-10-04 09:08:01,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:08:01,045 INFO L225 Difference]: With dead ends: 797 [2018-10-04 09:08:01,046 INFO L226 Difference]: Without dead ends: 459 [2018-10-04 09:08:01,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:08:01,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-10-04 09:08:01,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 455. [2018-10-04 09:08:01,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-10-04 09:08:01,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 678 transitions. [2018-10-04 09:08:01,069 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 678 transitions. Word has length 57 [2018-10-04 09:08:01,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:08:01,069 INFO L480 AbstractCegarLoop]: Abstraction has 455 states and 678 transitions. [2018-10-04 09:08:01,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:08:01,069 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 678 transitions. [2018-10-04 09:08:01,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-04 09:08:01,070 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:08:01,071 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 09:08:01,071 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:08:01,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:08:01,071 INFO L82 PathProgramCache]: Analyzing trace with hash -139266043, now seen corresponding path program 1 times [2018-10-04 09:08:01,072 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:08:01,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:08:01,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:01,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:08:01,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:08:01,142 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 09:08:01,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:08:01,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:08:01,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:08:01,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:08:01,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:08:01,145 INFO L87 Difference]: Start difference. First operand 455 states and 678 transitions. Second operand 3 states. [2018-10-04 09:08:01,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:08:01,209 INFO L93 Difference]: Finished difference Result 909 states and 1355 transitions. [2018-10-04 09:08:01,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:08:01,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-10-04 09:08:01,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:08:01,214 INFO L225 Difference]: With dead ends: 909 [2018-10-04 09:08:01,215 INFO L226 Difference]: Without dead ends: 455 [2018-10-04 09:08:01,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:08:01,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-10-04 09:08:01,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2018-10-04 09:08:01,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-10-04 09:08:01,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 658 transitions. [2018-10-04 09:08:01,236 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 658 transitions. Word has length 57 [2018-10-04 09:08:01,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:08:01,237 INFO L480 AbstractCegarLoop]: Abstraction has 455 states and 658 transitions. [2018-10-04 09:08:01,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:08:01,237 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 658 transitions. [2018-10-04 09:08:01,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-04 09:08:01,238 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:08:01,238 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 09:08:01,238 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:08:01,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:08:01,239 INFO L82 PathProgramCache]: Analyzing trace with hash 798403355, now seen corresponding path program 1 times [2018-10-04 09:08:01,239 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:08:01,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:08:01,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:01,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:08:01,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:08:01,756 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 09:08:01,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:08:01,757 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 09:08:01,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:08:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:08:01,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:08:02,605 WARN L178 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2018-10-04 09:08:02,794 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 09:08:02,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:08:02,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-10-04 09:08:02,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 09:08:02,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 09:08:02,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-10-04 09:08:02,821 INFO L87 Difference]: Start difference. First operand 455 states and 658 transitions. Second operand 16 states. [2018-10-04 09:08:04,036 WARN L178 SmtUtils]: Spent 688.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2018-10-04 09:08:04,222 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-04 09:08:04,656 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-10-04 09:08:06,139 WARN L178 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-10-04 09:08:06,380 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2018-10-04 09:08:08,143 WARN L178 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-10-04 09:08:08,605 WARN L178 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-04 09:08:08,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:08:08,993 INFO L93 Difference]: Finished difference Result 1533 states and 2192 transitions. [2018-10-04 09:08:08,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 09:08:08,994 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2018-10-04 09:08:08,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:08:09,005 INFO L225 Difference]: With dead ends: 1533 [2018-10-04 09:08:09,006 INFO L226 Difference]: Without dead ends: 1532 [2018-10-04 09:08:09,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2018-10-04 09:08:09,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2018-10-04 09:08:09,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 767. [2018-10-04 09:08:09,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2018-10-04 09:08:09,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1129 transitions. [2018-10-04 09:08:09,052 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1129 transitions. Word has length 59 [2018-10-04 09:08:09,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:08:09,052 INFO L480 AbstractCegarLoop]: Abstraction has 767 states and 1129 transitions. [2018-10-04 09:08:09,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 09:08:09,052 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1129 transitions. [2018-10-04 09:08:09,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-04 09:08:09,056 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:08:09,056 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 09:08:09,057 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:08:09,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:08:09,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1550465213, now seen corresponding path program 1 times [2018-10-04 09:08:09,057 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:08:09,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:08:09,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:09,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:08:09,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:08:09,181 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 09:08:09,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:08:09,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:08:09,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:08:09,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:08:09,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:08:09,183 INFO L87 Difference]: Start difference. First operand 767 states and 1129 transitions. Second operand 3 states. [2018-10-04 09:08:09,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:08:09,470 INFO L93 Difference]: Finished difference Result 1835 states and 2691 transitions. [2018-10-04 09:08:09,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:08:09,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-10-04 09:08:09,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:08:09,476 INFO L225 Difference]: With dead ends: 1835 [2018-10-04 09:08:09,476 INFO L226 Difference]: Without dead ends: 1069 [2018-10-04 09:08:09,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:08:09,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2018-10-04 09:08:09,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1018. [2018-10-04 09:08:09,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1018 states. [2018-10-04 09:08:09,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1471 transitions. [2018-10-04 09:08:09,531 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1471 transitions. Word has length 80 [2018-10-04 09:08:09,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:08:09,532 INFO L480 AbstractCegarLoop]: Abstraction has 1018 states and 1471 transitions. [2018-10-04 09:08:09,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:08:09,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1471 transitions. [2018-10-04 09:08:09,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-04 09:08:09,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:08:09,535 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 09:08:09,536 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:08:09,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:08:09,536 INFO L82 PathProgramCache]: Analyzing trace with hash -215528200, now seen corresponding path program 2 times [2018-10-04 09:08:09,536 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:08:09,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:08:09,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:09,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:08:09,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:08:09,697 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 09:08:09,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:08:09,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 09:08:09,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:08:09,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:08:09,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 09:08:09,699 INFO L87 Difference]: Start difference. First operand 1018 states and 1471 transitions. Second operand 4 states. [2018-10-04 09:08:09,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:08:09,901 INFO L93 Difference]: Finished difference Result 2065 states and 2971 transitions. [2018-10-04 09:08:09,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:08:09,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-10-04 09:08:09,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:08:09,907 INFO L225 Difference]: With dead ends: 2065 [2018-10-04 09:08:09,907 INFO L226 Difference]: Without dead ends: 1018 [2018-10-04 09:08:09,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 09:08:09,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2018-10-04 09:08:09,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1016. [2018-10-04 09:08:09,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1016 states. [2018-10-04 09:08:09,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1414 transitions. [2018-10-04 09:08:09,960 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1414 transitions. Word has length 81 [2018-10-04 09:08:09,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:08:09,960 INFO L480 AbstractCegarLoop]: Abstraction has 1016 states and 1414 transitions. [2018-10-04 09:08:09,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:08:09,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1414 transitions. [2018-10-04 09:08:09,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-04 09:08:09,963 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:08:09,964 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 09:08:09,964 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:08:09,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:08:09,964 INFO L82 PathProgramCache]: Analyzing trace with hash 571414056, now seen corresponding path program 1 times [2018-10-04 09:08:09,964 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:08:09,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:08:09,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:09,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:08:09,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:08:10,051 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 09:08:10,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:08:10,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:08:10,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:08:10,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:08:10,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:08:10,052 INFO L87 Difference]: Start difference. First operand 1016 states and 1414 transitions. Second operand 3 states. [2018-10-04 09:08:10,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:08:10,308 INFO L93 Difference]: Finished difference Result 1868 states and 2575 transitions. [2018-10-04 09:08:10,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:08:10,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-10-04 09:08:10,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:08:10,313 INFO L225 Difference]: With dead ends: 1868 [2018-10-04 09:08:10,314 INFO L226 Difference]: Without dead ends: 736 [2018-10-04 09:08:10,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:08:10,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2018-10-04 09:08:10,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 726. [2018-10-04 09:08:10,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-10-04 09:08:10,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 948 transitions. [2018-10-04 09:08:10,358 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 948 transitions. Word has length 97 [2018-10-04 09:08:10,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:08:10,358 INFO L480 AbstractCegarLoop]: Abstraction has 726 states and 948 transitions. [2018-10-04 09:08:10,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:08:10,359 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 948 transitions. [2018-10-04 09:08:10,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-04 09:08:10,360 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:08:10,361 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 09:08:10,361 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:08:10,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:08:10,361 INFO L82 PathProgramCache]: Analyzing trace with hash 856693736, now seen corresponding path program 1 times [2018-10-04 09:08:10,362 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:08:10,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:08:10,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:10,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:08:10,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:10,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:08:10,993 WARN L178 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-10-04 09:08:11,479 WARN L178 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-10-04 09:08:11,868 WARN L178 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-04 09:08:12,271 WARN L178 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-04 09:08:12,708 WARN L178 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-10-04 09:08:13,025 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 09:08:13,214 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 09:08:13,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:08:13,215 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 09:08:13,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:08:13,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:08:13,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:08:14,401 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 09:08:14,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:08:14,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-10-04 09:08:14,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-04 09:08:14,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-04 09:08:14,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2018-10-04 09:08:14,423 INFO L87 Difference]: Start difference. First operand 726 states and 948 transitions. Second operand 26 states. [2018-10-04 09:08:15,682 WARN L178 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2018-10-04 09:08:16,366 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-04 09:08:17,014 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2018-10-04 09:08:17,258 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 47 [2018-10-04 09:08:17,633 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 41 [2018-10-04 09:08:17,887 WARN L178 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 45 [2018-10-04 09:08:18,202 WARN L178 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 53 [2018-10-04 09:08:18,521 WARN L178 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 48 [2018-10-04 09:08:18,682 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 28 [2018-10-04 09:08:19,082 WARN L178 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 44 [2018-10-04 09:08:19,379 WARN L178 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 55 [2018-10-04 09:08:19,637 WARN L178 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2018-10-04 09:08:19,841 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2018-10-04 09:08:20,121 WARN L178 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2018-10-04 09:08:20,442 WARN L178 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2018-10-04 09:08:21,117 WARN L178 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2018-10-04 09:08:21,632 WARN L178 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2018-10-04 09:08:21,887 WARN L178 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 49 [2018-10-04 09:08:22,063 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2018-10-04 09:08:22,375 WARN L178 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 54 [2018-10-04 09:08:23,066 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 57 [2018-10-04 09:08:23,305 WARN L178 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 58 [2018-10-04 09:08:23,751 WARN L178 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 54 [2018-10-04 09:08:23,917 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2018-10-04 09:08:24,087 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 34 [2018-10-04 09:08:24,837 WARN L178 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 50 [2018-10-04 09:08:25,362 WARN L178 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 56 [2018-10-04 09:08:25,550 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2018-10-04 09:08:25,990 WARN L178 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 56 [2018-10-04 09:08:26,186 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2018-10-04 09:08:26,515 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2018-10-04 09:08:26,727 WARN L178 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2018-10-04 09:08:26,904 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2018-10-04 09:08:27,099 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 53 [2018-10-04 09:08:27,600 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2018-10-04 09:08:27,816 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2018-10-04 09:08:27,961 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-10-04 09:08:28,138 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2018-10-04 09:08:28,544 WARN L178 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 50 [2018-10-04 09:08:28,800 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2018-10-04 09:08:28,986 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2018-10-04 09:08:29,133 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 36 [2018-10-04 09:08:29,701 WARN L178 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 51 [2018-10-04 09:08:29,968 WARN L178 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 63 [2018-10-04 09:08:30,181 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2018-10-04 09:08:30,489 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 56 [2018-10-04 09:08:30,663 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2018-10-04 09:08:30,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:08:30,764 INFO L93 Difference]: Finished difference Result 6073 states and 7615 transitions. [2018-10-04 09:08:30,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-04 09:08:30,764 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 99 [2018-10-04 09:08:30,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:08:30,791 INFO L225 Difference]: With dead ends: 6073 [2018-10-04 09:08:30,791 INFO L226 Difference]: Without dead ends: 6072 [2018-10-04 09:08:30,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3572 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=2220, Invalid=9552, Unknown=0, NotChecked=0, Total=11772 [2018-10-04 09:08:30,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6072 states. [2018-10-04 09:08:30,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6072 to 1176. [2018-10-04 09:08:30,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-10-04 09:08:30,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1565 transitions. [2018-10-04 09:08:30,912 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1565 transitions. Word has length 99 [2018-10-04 09:08:30,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:08:30,913 INFO L480 AbstractCegarLoop]: Abstraction has 1176 states and 1565 transitions. [2018-10-04 09:08:30,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-04 09:08:30,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1565 transitions. [2018-10-04 09:08:30,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-04 09:08:30,915 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:08:30,915 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 09:08:30,916 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:08:30,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:08:30,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1497402593, now seen corresponding path program 1 times [2018-10-04 09:08:30,916 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:08:30,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:08:30,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:30,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:08:30,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:08:30,996 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 09:08:30,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:08:30,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:08:30,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:08:30,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:08:30,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:08:30,997 INFO L87 Difference]: Start difference. First operand 1176 states and 1565 transitions. Second operand 3 states. [2018-10-04 09:08:31,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:08:31,198 INFO L93 Difference]: Finished difference Result 2107 states and 2774 transitions. [2018-10-04 09:08:31,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:08:31,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-10-04 09:08:31,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:08:31,202 INFO L225 Difference]: With dead ends: 2107 [2018-10-04 09:08:31,202 INFO L226 Difference]: Without dead ends: 887 [2018-10-04 09:08:31,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:08:31,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-10-04 09:08:31,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 691. [2018-10-04 09:08:31,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2018-10-04 09:08:31,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 882 transitions. [2018-10-04 09:08:31,246 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 882 transitions. Word has length 99 [2018-10-04 09:08:31,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:08:31,247 INFO L480 AbstractCegarLoop]: Abstraction has 691 states and 882 transitions. [2018-10-04 09:08:31,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:08:31,247 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 882 transitions. [2018-10-04 09:08:31,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-04 09:08:31,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:08:31,249 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 09:08:31,249 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:08:31,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:08:31,250 INFO L82 PathProgramCache]: Analyzing trace with hash -2087266119, now seen corresponding path program 2 times [2018-10-04 09:08:31,250 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:08:31,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:08:31,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:31,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:08:31,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:08:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:08:31,324 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 09:08:31,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:08:31,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:08:31,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:08:31,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:08:31,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:08:31,325 INFO L87 Difference]: Start difference. First operand 691 states and 882 transitions. Second operand 3 states. [2018-10-04 09:08:31,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:08:31,381 INFO L93 Difference]: Finished difference Result 1137 states and 1433 transitions. [2018-10-04 09:08:31,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:08:31,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-10-04 09:08:31,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:08:31,382 INFO L225 Difference]: With dead ends: 1137 [2018-10-04 09:08:31,382 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 09:08:31,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:08:31,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 09:08:31,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 09:08:31,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 09:08:31,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 09:08:31,384 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 117 [2018-10-04 09:08:31,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:08:31,384 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 09:08:31,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:08:31,385 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 09:08:31,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 09:08:31,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 09:08:31,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:08:32,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:08:32,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:08:32,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:08:32,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:08:32,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:08:33,486 WARN L178 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 502 DAG size of output: 432 [2018-10-04 09:08:41,236 WARN L178 SmtUtils]: Spent 7.74 s on a formula simplification. DAG size of input: 414 DAG size of output: 142 [2018-10-04 09:08:41,241 INFO L425 ceAbstractionStarter]: For program point L93(lines 93 110) no Hoare annotation was computed. [2018-10-04 09:08:41,241 INFO L425 ceAbstractionStarter]: For program point L118(lines 118 144) no Hoare annotation was computed. [2018-10-04 09:08:41,242 INFO L425 ceAbstractionStarter]: For program point ElevatorErr0ASSERT_VIOLATIONASSERT(line 79) no Hoare annotation was computed. [2018-10-04 09:08:41,242 INFO L425 ceAbstractionStarter]: For program point L168(lines 168 172) no Hoare annotation was computed. [2018-10-04 09:08:41,242 INFO L425 ceAbstractionStarter]: For program point L103(lines 103 110) no Hoare annotation was computed. [2018-10-04 09:08:41,242 INFO L425 ceAbstractionStarter]: For program point L137(lines 137 144) no Hoare annotation was computed. [2018-10-04 09:08:41,242 INFO L425 ceAbstractionStarter]: For program point L137-2(lines 113 164) no Hoare annotation was computed. [2018-10-04 09:08:41,242 INFO L425 ceAbstractionStarter]: For program point L96(lines 96 110) no Hoare annotation was computed. [2018-10-04 09:08:41,242 INFO L425 ceAbstractionStarter]: For program point L105(lines 105 110) no Hoare annotation was computed. [2018-10-04 09:08:41,242 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 77) no Hoare annotation was computed. [2018-10-04 09:08:41,242 INFO L425 ceAbstractionStarter]: For program point L105-2(lines 91 144) no Hoare annotation was computed. [2018-10-04 09:08:41,242 INFO L425 ceAbstractionStarter]: For program point L155(lines 155 164) no Hoare annotation was computed. [2018-10-04 09:08:41,243 INFO L425 ceAbstractionStarter]: For program point L155-1(lines 147 190) no Hoare annotation was computed. [2018-10-04 09:08:41,243 INFO L425 ceAbstractionStarter]: For program point L180(lines 180 190) no Hoare annotation was computed. [2018-10-04 09:08:41,243 INFO L425 ceAbstractionStarter]: For program point L180-1(lines 167 190) no Hoare annotation was computed. [2018-10-04 09:08:41,244 INFO L421 ceAbstractionStarter]: At program point L48-1(lines 13 197) the Hoare annotation is: (let ((.cse16 (<= Elevator_current Elevator_max)) (.cse40 (+ Elevator_current 1))) (let ((.cse9 (and .cse16 (< Elevator_min .cse40) (<= Elevator_qDC1 1))) (.cse14 (= Elevator_qCSP 1)) (.cse7 (<= Elevator_goal Elevator_max)) (.cse8 (<= Elevator_min Elevator_goal))) (let ((.cse6 (<= Elevator_min |Elevator_current'|)) (.cse31 (= |Elevator_dir'| 1)) (.cse35 (+ |Elevator_dir'| 1)) (.cse37 (+ Elevator_dir Elevator_goal)) (.cse38 (+ Elevator_min 1)) (.cse13 (<= Elevator_min Elevator_current)) (.cse5 (= Elevator_qDC2 1)) (.cse39 (and (and .cse9 .cse14) .cse7 .cse8))) (let ((.cse1 (and .cse5 .cse39)) (.cse26 (or (and .cse16 (<= .cse38 Elevator_current)) (and (<= .cse40 Elevator_max) .cse13))) (.cse29 (= Elevator_current Elevator_goal)) (.cse30 (<= (+ Elevator_dir Elevator_current 2) Elevator_max)) (.cse28 (<= 1 Elevator_dir)) (.cse36 (and (not .cse5) .cse39)) (.cse21 (or (<= Elevator_current .cse37) (= (+ Elevator_dir 1) 0))) (.cse22 (or (<= .cse37 Elevator_current) (= Elevator_dir 1))) (.cse23 (or (= .cse35 0) (<= |Elevator_current'| |Elevator_goal'|))) (.cse24 (or .cse31 (<= |Elevator_goal'| |Elevator_current'|))) (.cse33 (<= .cse38 |Elevator_current'|)) (.cse34 (and (<= (+ |Elevator_current'| 1) Elevator_max) .cse6)) (.cse25 (not (= .cse37 Elevator_current))) (.cse20 (not Elevator_newgoal)) (.cse11 (= Elevator_qDC2 3)) (.cse17 (= Elevator_qDC1 2)) (.cse12 (not Elevator_stop)) (.cse19 (= Elevator_qDC2 2)) (.cse18 (not (= Elevator_qCSP 3))) (.cse3 (<= |Elevator_current'| Elevator_max)) (.cse4 (not (= Elevator_goal Elevator_current))) (.cse0 (<= |Elevator_goal'| Elevator_max)) (.cse2 (<= Elevator_min |Elevator_goal'|)) (.cse15 (not Elevator_passed)) (.cse10 (not (= |Elevator_current'| |Elevator_goal'|)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse0 .cse2 .cse7 .cse8 .cse9 .cse10) (and .cse3 .cse4 .cse6 .cse0 .cse2 .cse11 .cse7 .cse8 .cse9 .cse10) (and .cse12 (and .cse3 .cse13 .cse6 .cse0 .cse11 .cse7 .cse8 .cse14 .cse15 .cse16 .cse17 .cse2)) (and .cse12 (and .cse17 (and (and .cse3 .cse18 .cse13 .cse16 .cse6 .cse0 .cse2 .cse7 .cse8 .cse15) .cse19))) (and .cse12 .cse20 (and .cse3 .cse21 .cse4 .cse6 .cse0 .cse7 .cse8 .cse22 .cse10 .cse23 .cse24 .cse19 .cse2 .cse25 .cse9)) (and .cse26 .cse1 (let ((.cse27 (+ Elevator_dir Elevator_current))) (or (and (<= .cse27 Elevator_max) .cse28) .cse29 (and (<= Elevator_min .cse27) .cse30)))) (and .cse12 (and .cse3 .cse6 .cse0 .cse2 .cse11 .cse7 .cse8 .cse9) .cse20) (and .cse12 (let ((.cse32 (+ |Elevator_goal'| |Elevator_dir'|))) (and (or .cse31 (<= .cse32 |Elevator_current'|)) .cse21 (and .cse26 .cse0 .cse7 .cse8) (not (= .cse32 |Elevator_current'|)) (or (<= 1 |Elevator_dir'|) (<= (+ |Elevator_current'| |Elevator_dir'| 2) Elevator_max)) (or .cse33 .cse34) .cse22 (or (= 0 .cse35) (<= |Elevator_current'| .cse32)) .cse17 .cse19 .cse2 .cse25 (or .cse29 .cse30 .cse28))) .cse20) (and .cse20 (and .cse3 .cse13 .cse16 .cse17 .cse5 .cse6 .cse0 .cse2 .cse7 .cse8 .cse14 .cse15)) (and .cse12 (and .cse36 .cse0 .cse2 .cse11)) (and .cse12 (and (and .cse19 .cse36) .cse0 .cse2) .cse20) (and .cse12 (and .cse21 .cse4 .cse13 .cse0 .cse7 .cse8 .cse22 .cse15 .cse10 .cse23 .cse16 .cse17 .cse24 .cse19 .cse2 (or (and .cse3 .cse33) .cse34) .cse25) .cse20) (and (and .cse12 (and (or (and Elevator_passed .cse17 .cse11) (and .cse3 .cse13 .cse16 .cse17 .cse6 .cse11)) .cse0 .cse2 .cse7 .cse8)) .cse20) (and .cse3 .cse4 .cse13 .cse6 .cse0 .cse11 .cse7 .cse8 .cse15 .cse10 .cse16 .cse17 .cse2) (and .cse12 (and .cse2 (and .cse19 (and .cse3 (and .cse18 .cse9) .cse6 .cse0 .cse7 .cse8)))) (and .cse3 .cse4 .cse13 .cse16 .cse5 .cse6 .cse0 .cse2 .cse7 .cse8 .cse15 .cse10)))))) [2018-10-04 09:08:41,244 INFO L425 ceAbstractionStarter]: For program point L131(lines 131 144) no Hoare annotation was computed. [2018-10-04 09:08:41,244 INFO L425 ceAbstractionStarter]: For program point L98(lines 98 110) no Hoare annotation was computed. [2018-10-04 09:08:41,244 INFO L425 ceAbstractionStarter]: For program point L156(lines 156 161) no Hoare annotation was computed. [2018-10-04 09:08:41,244 INFO L425 ceAbstractionStarter]: For program point L181(lines 181 187) no Hoare annotation was computed. [2018-10-04 09:08:41,244 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 154) no Hoare annotation was computed. [2018-10-04 09:08:41,244 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 190) no Hoare annotation was computed. [2018-10-04 09:08:41,245 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 77) no Hoare annotation was computed. [2018-10-04 09:08:41,245 INFO L425 ceAbstractionStarter]: For program point L74-2(lines 70 77) no Hoare annotation was computed. [2018-10-04 09:08:41,245 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-10-04 09:08:41,245 INFO L425 ceAbstractionStarter]: For program point L66-2(lines 66 77) no Hoare annotation was computed. [2018-10-04 09:08:41,245 INFO L425 ceAbstractionStarter]: For program point ElevatorEXIT(lines 13 197) no Hoare annotation was computed. [2018-10-04 09:08:41,245 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 110) no Hoare annotation was computed. [2018-10-04 09:08:41,245 INFO L425 ceAbstractionStarter]: For program point L174(lines 174 179) no Hoare annotation was computed. [2018-10-04 09:08:41,245 INFO L425 ceAbstractionStarter]: For program point L125(lines 125 144) no Hoare annotation was computed. [2018-10-04 09:08:41,245 INFO L425 ceAbstractionStarter]: For program point ElevatorENTRY(lines 13 197) no Hoare annotation was computed. [2018-10-04 09:08:41,245 INFO L425 ceAbstractionStarter]: For program point L101(lines 101 110) no Hoare annotation was computed. [2018-10-04 09:08:41,268 INFO L202 PluginConnector]: Adding new model Elevator.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:08:41 BoogieIcfgContainer [2018-10-04 09:08:41,268 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:08:41,269 INFO L168 Benchmark]: Toolchain (without parser) took 45379.78 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 371.7 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 105.6 MB). Peak memory consumption was 846.1 MB. Max. memory is 7.1 GB. [2018-10-04 09:08:41,270 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 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 09:08:41,270 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.66 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 09:08:41,271 INFO L168 Benchmark]: Boogie Preprocessor took 57.39 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 09:08:41,271 INFO L168 Benchmark]: RCFGBuilder took 788.89 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 09:08:41,272 INFO L168 Benchmark]: TraceAbstraction took 44478.69 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 371.7 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 73.8 MB). Peak memory consumption was 814.4 MB. Max. memory is 7.1 GB. [2018-10-04 09:08:41,275 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.24 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 49.66 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 57.39 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 788.89 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 44478.69 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 371.7 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 73.8 MB). Peak memory consumption was 814.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: (((((((((((((((((goal' <= max && qDC2 == 1 && ((((current <= max && min < current + 1) && qDC1 <= 1) && qCSP == 1) && goal <= max) && min <= goal) && min <= goal') || (((((((((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 && ((((((((((current' <= max && min <= current) && min <= current') && goal' <= max) && qDC2 == 3) && goal <= max) && min <= goal) && qCSP == 1) && !passed) && current <= max) && qDC1 == 2) && min <= goal')) || (!stop && qDC1 == 2 && (((((((((current' <= max && !(qCSP == 3)) && min <= current) && current <= max) && min <= current') && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && !passed) && qDC2 == 2)) || ((!stop && !newgoal) && (((((((((((((current' <= max && (current <= dir + goal || dir + 1 == 0)) && !(goal == current)) && min <= current') && goal' <= max) && goal <= max) && min <= goal) && (dir + goal <= current || dir == 1)) && !(current' == goal')) && (dir' + 1 == 0 || current' <= goal')) && (dir' == 1 || goal' <= current')) && qDC2 == 2) && min <= goal') && !(dir + goal == current)) && (current <= max && min < current + 1) && qDC1 <= 1)) || ((((current <= max && min + 1 <= current) || (current + 1 <= max && min <= current)) && qDC2 == 1 && ((((current <= max && min < current + 1) && qDC1 <= 1) && qCSP == 1) && goal <= max) && min <= goal) && (((dir + current <= max && 1 <= dir) || current == goal) || (min <= dir + current && dir + current + 2 <= max)))) || ((!stop && ((((((current' <= max && min <= current') && goal' <= max) && min <= goal') && qDC2 == 3) && goal <= max) && min <= goal) && (current <= max && min < current + 1) && qDC1 <= 1) && !newgoal)) || ((!stop && ((((((((((((dir' == 1 || goal' + dir' <= current') && (current <= dir + goal || dir + 1 == 0)) && ((((current <= max && min + 1 <= current) || (current + 1 <= max && min <= current)) && goal' <= max) && goal <= max) && min <= goal) && !(goal' + dir' == current')) && (1 <= dir' || current' + dir' + 2 <= max)) && (min + 1 <= current' || (current' + 1 <= max && min <= current'))) && (dir + goal <= current || dir == 1)) && (0 == dir' + 1 || current' <= goal' + dir')) && qDC1 == 2) && qDC2 == 2) && min <= goal') && !(dir + goal == current)) && ((current == goal || dir + current + 2 <= max) || 1 <= dir)) && !newgoal)) || (!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 && (((!(qDC2 == 1) && ((((current <= max && min < current + 1) && qDC1 <= 1) && qCSP == 1) && goal <= max) && min <= goal) && goal' <= max) && min <= goal') && qDC2 == 3)) || ((!stop && ((qDC2 == 2 && !(qDC2 == 1) && ((((current <= max && min < current + 1) && qDC1 <= 1) && qCSP == 1) && goal <= max) && min <= goal) && goal' <= max) && min <= goal') && !newgoal)) || ((!stop && ((((((((((((((((current <= dir + goal || dir + 1 == 0) && !(goal == current)) && min <= current) && goal' <= max) && goal <= max) && min <= goal) && (dir + goal <= current || dir == 1)) && !passed) && !(current' == goal')) && (dir' + 1 == 0 || current' <= goal')) && current <= max) && qDC1 == 2) && (dir' == 1 || goal' <= current')) && qDC2 == 2) && min <= goal') && ((current' <= max && min + 1 <= current') || (current' + 1 <= max && min <= current'))) && !(dir + 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)) || ((((((((((((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 && min <= goal' && qDC2 == 2 && ((((current' <= max && !(qCSP == 3) && (current <= max && min < current + 1) && qDC1 <= 1) && min <= current') && goal' <= max) && goal <= max) && min <= goal)) || (((((((((((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, 44.3s OverallTime, 18 OverallIterations, 7 TraceHistogramMax, 26.1s AutomataDifference, 0.0s DeadEndRemovalTime, 9.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 1306 SDtfs, 3380 SDslu, 5274 SDs, 0 SdLazy, 1671 SolverSat, 276 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 436 GetRequests, 266 SyntacticMatches, 1 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3703 ImplicationChecksByTransitivity, 24.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, 929 HoareAnnotationTreeSize, 1 FomulaSimplifications, 49544 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 211987 FormulaSimplificationTreeSizeReductionInter, 7.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 1240 NumberOfCodeBlocks, 1240 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1219 ConstructedInterpolants, 0 QuantifiedInterpolants, 755265 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.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-08-41-290.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Elevator.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-08-41-290.csv Received shutdown request...