java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/real-life/Elevator-Integer.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f-m [2018-10-04 14:19:41,072 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 14:19:41,074 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 14:19:41,088 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 14:19:41,088 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 14:19:41,091 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 14:19:41,092 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 14:19:41,094 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 14:19:41,096 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 14:19:41,096 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 14:19:41,097 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 14:19:41,098 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 14:19:41,098 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 14:19:41,099 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 14:19:41,101 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 14:19:41,101 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 14:19:41,102 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 14:19:41,104 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 14:19:41,106 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 14:19:41,107 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 14:19:41,109 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 14:19:41,110 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 14:19:41,112 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 14:19:41,112 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 14:19:41,113 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 14:19:41,113 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 14:19:41,114 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 14:19:41,115 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 14:19:41,116 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 14:19:41,117 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 14:19:41,117 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 14:19:41,118 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 14:19:41,118 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 14:19:41,119 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 14:19:41,120 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 14:19:41,120 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 14:19:41,121 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 14:19:41,151 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 14:19:41,151 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 14:19:41,152 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 14:19:41,152 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 14:19:41,153 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 14:19:41,153 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 14:19:41,153 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 14:19:41,153 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 14:19:41,153 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 14:19:41,154 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 14:19:41,154 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 14:19:41,154 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 14:19:41,154 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 14:19:41,154 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 14:19:41,155 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 14:19:41,156 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 14:19:41,156 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 14:19:41,156 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 14:19:41,156 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 14:19:41,157 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 14:19:41,157 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 14:19:41,158 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 14:19:41,159 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:19:41,159 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 14:19:41,159 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 14:19:41,159 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 14:19:41,159 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 14:19:41,160 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 14:19:41,160 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 14:19:41,160 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 14:19:41,160 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 14:19:41,238 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 14:19:41,255 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 14:19:41,261 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 14:19:41,263 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 14:19:41,264 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 14:19:41,265 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator-Integer.bpl [2018-10-04 14:19:41,265 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator-Integer.bpl' [2018-10-04 14:19:41,332 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 14:19:41,334 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 14:19:41,335 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 14:19:41,335 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 14:19:41,335 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 14:19:41,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:41" (1/1) ... [2018-10-04 14:19:41,370 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:41" (1/1) ... [2018-10-04 14:19:41,376 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 14:19:41,376 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 14:19:41,377 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 14:19:41,379 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 14:19:41,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 14:19:41,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 14:19:41,380 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 14:19:41,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:41" (1/1) ... [2018-10-04 14:19:41,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:41" (1/1) ... [2018-10-04 14:19:41,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:41" (1/1) ... [2018-10-04 14:19:41,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:41" (1/1) ... [2018-10-04 14:19:41,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:41" (1/1) ... [2018-10-04 14:19:41,407 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:41" (1/1) ... [2018-10-04 14:19:41,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:41" (1/1) ... [2018-10-04 14:19:41,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 14:19:41,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 14:19:41,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 14:19:41,413 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 14:19:41,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:19:41,493 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Elevator given in one single declaration [2018-10-04 14:19:41,494 INFO L130 BoogieDeclarations]: Found specification of procedure Elevator [2018-10-04 14:19:41,494 INFO L138 BoogieDeclarations]: Found implementation of procedure Elevator [2018-10-04 14:19:42,189 INFO L338 CfgBuilder]: Using library mode [2018-10-04 14:19:42,190 INFO L202 PluginConnector]: Adding new model Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:19:42 BoogieIcfgContainer [2018-10-04 14:19:42,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 14:19:42,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 14:19:42,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 14:19:42,195 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 14:19:42,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:41" (1/2) ... [2018-10-04 14:19:42,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a4c056b and model type Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 02:19:42, skipping insertion in model container [2018-10-04 14:19:42,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:19:42" (2/2) ... [2018-10-04 14:19:42,198 INFO L112 eAbstractionObserver]: Analyzing ICFG Elevator-Integer.bpl [2018-10-04 14:19:42,208 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 14:19:42,219 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 14:19:42,271 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 14:19:42,272 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 14:19:42,272 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 14:19:42,272 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 14:19:42,273 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 14:19:42,273 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 14:19:42,273 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 14:19:42,273 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 14:19:42,273 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 14:19:42,290 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-10-04 14:19:42,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 14:19:42,297 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:42,298 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:42,300 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:42,310 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:42,310 INFO L82 PathProgramCache]: Analyzing trace with hash 493797215, now seen corresponding path program 1 times [2018-10-04 14:19:42,312 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:42,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:42,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:42,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:42,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:42,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:42,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:42,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:19:42,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:19:42,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:19:42,505 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:42,507 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2018-10-04 14:19:42,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:42,619 INFO L93 Difference]: Finished difference Result 85 states and 157 transitions. [2018-10-04 14:19:42,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:19:42,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-10-04 14:19:42,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:42,634 INFO L225 Difference]: With dead ends: 85 [2018-10-04 14:19:42,635 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 14:19:42,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:19:42,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 14:19:42,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-10-04 14:19:42,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-04 14:19:42,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 90 transitions. [2018-10-04 14:19:42,682 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 90 transitions. Word has length 9 [2018-10-04 14:19:42,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:42,682 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 90 transitions. [2018-10-04 14:19:42,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:19:42,683 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 90 transitions. [2018-10-04 14:19:42,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 14:19:42,684 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:42,684 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:42,684 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:42,685 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:42,685 INFO L82 PathProgramCache]: Analyzing trace with hash -2026162719, now seen corresponding path program 1 times [2018-10-04 14:19:42,685 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:42,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:42,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:42,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:42,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:42,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:42,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:42,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:19:42,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:19:42,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:19:42,729 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:42,729 INFO L87 Difference]: Start difference. First operand 52 states and 90 transitions. Second operand 3 states. [2018-10-04 14:19:42,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:42,930 INFO L93 Difference]: Finished difference Result 154 states and 268 transitions. [2018-10-04 14:19:42,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:19:42,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-10-04 14:19:42,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:42,934 INFO L225 Difference]: With dead ends: 154 [2018-10-04 14:19:42,934 INFO L226 Difference]: Without dead ends: 95 [2018-10-04 14:19:42,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:19:42,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-04 14:19:42,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-10-04 14:19:42,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-04 14:19:42,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 161 transitions. [2018-10-04 14:19:42,967 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 161 transitions. Word has length 9 [2018-10-04 14:19:42,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:42,970 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 161 transitions. [2018-10-04 14:19:42,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:19:42,970 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 161 transitions. [2018-10-04 14:19:42,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 14:19:42,971 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:42,971 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:42,971 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:42,971 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:42,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1968904417, now seen corresponding path program 1 times [2018-10-04 14:19:42,972 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:42,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:42,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:42,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:42,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:43,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:43,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:43,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:19:43,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:19:43,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:19:43,090 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:43,090 INFO L87 Difference]: Start difference. First operand 94 states and 161 transitions. Second operand 3 states. [2018-10-04 14:19:43,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:43,418 INFO L93 Difference]: Finished difference Result 233 states and 398 transitions. [2018-10-04 14:19:43,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:19:43,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-10-04 14:19:43,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:43,421 INFO L225 Difference]: With dead ends: 233 [2018-10-04 14:19:43,421 INFO L226 Difference]: Without dead ends: 136 [2018-10-04 14:19:43,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:19:43,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-10-04 14:19:43,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 114. [2018-10-04 14:19:43,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-04 14:19:43,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 193 transitions. [2018-10-04 14:19:43,436 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 193 transitions. Word has length 9 [2018-10-04 14:19:43,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:43,437 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 193 transitions. [2018-10-04 14:19:43,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:19:43,437 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 193 transitions. [2018-10-04 14:19:43,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 14:19:43,438 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:43,438 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:43,439 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:43,439 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:43,439 INFO L82 PathProgramCache]: Analyzing trace with hash -906451345, now seen corresponding path program 1 times [2018-10-04 14:19:43,439 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:43,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:43,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:43,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:43,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:43,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:43,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:43,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:19:43,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 14:19:43,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 14:19:43,561 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:43,561 INFO L87 Difference]: Start difference. First operand 114 states and 193 transitions. Second operand 4 states. [2018-10-04 14:19:43,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:43,701 INFO L93 Difference]: Finished difference Result 144 states and 242 transitions. [2018-10-04 14:19:43,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 14:19:43,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-10-04 14:19:43,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:43,705 INFO L225 Difference]: With dead ends: 144 [2018-10-04 14:19:43,705 INFO L226 Difference]: Without dead ends: 143 [2018-10-04 14:19:43,706 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 3 [2018-10-04 14:19:43,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-04 14:19:43,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2018-10-04 14:19:43,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-10-04 14:19:43,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 237 transitions. [2018-10-04 14:19:43,721 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 237 transitions. Word has length 10 [2018-10-04 14:19:43,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:43,722 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 237 transitions. [2018-10-04 14:19:43,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 14:19:43,722 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 237 transitions. [2018-10-04 14:19:43,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:19:43,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:43,723 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:43,724 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:43,724 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:43,724 INFO L82 PathProgramCache]: Analyzing trace with hash -464230043, now seen corresponding path program 1 times [2018-10-04 14:19:43,724 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:43,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:43,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:43,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:43,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:43,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:43,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:43,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 14:19:43,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 14:19:43,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 14:19:43,898 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:43,898 INFO L87 Difference]: Start difference. First operand 142 states and 237 transitions. Second operand 5 states. [2018-10-04 14:19:44,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:44,331 INFO L93 Difference]: Finished difference Result 459 states and 761 transitions. [2018-10-04 14:19:44,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 14:19:44,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-10-04 14:19:44,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:44,338 INFO L225 Difference]: With dead ends: 459 [2018-10-04 14:19:44,338 INFO L226 Difference]: Without dead ends: 286 [2018-10-04 14:19:44,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-04 14:19:44,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-04 14:19:44,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2018-10-04 14:19:44,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-10-04 14:19:44,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 461 transitions. [2018-10-04 14:19:44,374 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 461 transitions. Word has length 18 [2018-10-04 14:19:44,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:44,375 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 461 transitions. [2018-10-04 14:19:44,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 14:19:44,375 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 461 transitions. [2018-10-04 14:19:44,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-04 14:19:44,379 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:44,379 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:44,380 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:44,380 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:44,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1761001012, now seen corresponding path program 1 times [2018-10-04 14:19:44,380 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:44,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:44,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:44,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:44,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:44,441 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-04 14:19:44,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:44,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:19:44,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:19:44,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:19:44,442 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:44,442 INFO L87 Difference]: Start difference. First operand 286 states and 461 transitions. Second operand 3 states. [2018-10-04 14:19:44,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:44,531 INFO L93 Difference]: Finished difference Result 695 states and 1105 transitions. [2018-10-04 14:19:44,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:19:44,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-10-04 14:19:44,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:44,538 INFO L225 Difference]: With dead ends: 695 [2018-10-04 14:19:44,538 INFO L226 Difference]: Without dead ends: 402 [2018-10-04 14:19:44,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:19:44,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-10-04 14:19:44,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 294. [2018-10-04 14:19:44,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-10-04 14:19:44,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 469 transitions. [2018-10-04 14:19:44,576 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 469 transitions. Word has length 40 [2018-10-04 14:19:44,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:44,576 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 469 transitions. [2018-10-04 14:19:44,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:19:44,577 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 469 transitions. [2018-10-04 14:19:44,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-04 14:19:44,579 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:44,581 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:44,581 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:44,581 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:44,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1151060372, now seen corresponding path program 1 times [2018-10-04 14:19:44,582 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:44,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:44,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:44,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:44,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:44,640 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-04 14:19:44,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:44,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:19:44,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:19:44,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:19:44,641 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:44,641 INFO L87 Difference]: Start difference. First operand 294 states and 469 transitions. Second operand 3 states. [2018-10-04 14:19:44,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:44,765 INFO L93 Difference]: Finished difference Result 711 states and 1121 transitions. [2018-10-04 14:19:44,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:19:44,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-04 14:19:44,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:44,774 INFO L225 Difference]: With dead ends: 711 [2018-10-04 14:19:44,775 INFO L226 Difference]: Without dead ends: 414 [2018-10-04 14:19:44,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:19:44,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-10-04 14:19:44,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 306. [2018-10-04 14:19:44,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-10-04 14:19:44,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 481 transitions. [2018-10-04 14:19:44,790 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 481 transitions. Word has length 41 [2018-10-04 14:19:44,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:44,790 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 481 transitions. [2018-10-04 14:19:44,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:19:44,791 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 481 transitions. [2018-10-04 14:19:44,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-04 14:19:44,793 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:44,793 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:44,793 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:44,793 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:44,794 INFO L82 PathProgramCache]: Analyzing trace with hash 221883911, now seen corresponding path program 1 times [2018-10-04 14:19:44,794 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:44,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:44,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:44,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:44,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:44,942 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-04 14:19:44,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:19:44,943 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:19:44,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:45,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:19:45,298 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-04 14:19:45,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 14:19:45,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-04 14:19:45,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:19:45,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:19:45,345 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:45,345 INFO L87 Difference]: Start difference. First operand 306 states and 481 transitions. Second operand 7 states. [2018-10-04 14:19:46,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:46,456 INFO L93 Difference]: Finished difference Result 834 states and 1286 transitions. [2018-10-04 14:19:46,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:19:46,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-10-04 14:19:46,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:46,461 INFO L225 Difference]: With dead ends: 834 [2018-10-04 14:19:46,461 INFO L226 Difference]: Without dead ends: 523 [2018-10-04 14:19:46,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 8 [2018-10-04 14:19:46,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-10-04 14:19:46,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 432. [2018-10-04 14:19:46,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-10-04 14:19:46,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 649 transitions. [2018-10-04 14:19:46,484 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 649 transitions. Word has length 43 [2018-10-04 14:19:46,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:46,485 INFO L480 AbstractCegarLoop]: Abstraction has 432 states and 649 transitions. [2018-10-04 14:19:46,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:19:46,485 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 649 transitions. [2018-10-04 14:19:46,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-04 14:19:46,487 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:46,487 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:46,487 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:46,487 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:46,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1437736339, now seen corresponding path program 1 times [2018-10-04 14:19:46,488 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:46,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:46,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:46,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:46,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:46,626 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-04 14:19:46,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:46,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:19:46,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:19:46,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:19:46,629 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:46,629 INFO L87 Difference]: Start difference. First operand 432 states and 649 transitions. Second operand 3 states. [2018-10-04 14:19:46,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:46,987 INFO L93 Difference]: Finished difference Result 1110 states and 1680 transitions. [2018-10-04 14:19:46,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:19:46,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-10-04 14:19:46,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:46,994 INFO L225 Difference]: With dead ends: 1110 [2018-10-04 14:19:46,995 INFO L226 Difference]: Without dead ends: 657 [2018-10-04 14:19:46,996 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:19:46,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2018-10-04 14:19:47,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 654. [2018-10-04 14:19:47,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-10-04 14:19:47,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 980 transitions. [2018-10-04 14:19:47,023 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 980 transitions. Word has length 45 [2018-10-04 14:19:47,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:47,024 INFO L480 AbstractCegarLoop]: Abstraction has 654 states and 980 transitions. [2018-10-04 14:19:47,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:19:47,024 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 980 transitions. [2018-10-04 14:19:47,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-04 14:19:47,026 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:47,026 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:47,026 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:47,026 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:47,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1460368593, now seen corresponding path program 1 times [2018-10-04 14:19:47,027 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:47,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:47,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:47,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:47,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:47,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:47,139 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:19:47,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:47,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:19:47,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:19:47,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:19:47,141 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:47,141 INFO L87 Difference]: Start difference. First operand 654 states and 980 transitions. Second operand 3 states. [2018-10-04 14:19:47,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:47,323 INFO L93 Difference]: Finished difference Result 1308 states and 1959 transitions. [2018-10-04 14:19:47,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:19:47,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-10-04 14:19:47,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:47,327 INFO L225 Difference]: With dead ends: 1308 [2018-10-04 14:19:47,327 INFO L226 Difference]: Without dead ends: 655 [2018-10-04 14:19:47,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:19:47,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2018-10-04 14:19:47,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 654. [2018-10-04 14:19:47,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-10-04 14:19:47,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 924 transitions. [2018-10-04 14:19:47,355 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 924 transitions. Word has length 45 [2018-10-04 14:19:47,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:47,355 INFO L480 AbstractCegarLoop]: Abstraction has 654 states and 924 transitions. [2018-10-04 14:19:47,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:19:47,355 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 924 transitions. [2018-10-04 14:19:47,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-04 14:19:47,357 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:47,357 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:47,357 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:47,357 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:47,358 INFO L82 PathProgramCache]: Analyzing trace with hash -477421396, now seen corresponding path program 1 times [2018-10-04 14:19:47,358 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:47,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:47,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:47,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:47,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:47,888 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:47,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:19:47,889 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:19:47,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:47,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:47,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:19:49,590 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:49,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:19:49,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-10-04 14:19:49,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 14:19:49,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 14:19:49,616 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:49,616 INFO L87 Difference]: Start difference. First operand 654 states and 924 transitions. Second operand 16 states. [2018-10-04 14:19:52,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:52,191 INFO L93 Difference]: Finished difference Result 2731 states and 3833 transitions. [2018-10-04 14:19:52,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 14:19:52,194 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 48 [2018-10-04 14:19:52,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:52,204 INFO L225 Difference]: With dead ends: 2731 [2018-10-04 14:19:52,204 INFO L226 Difference]: Without dead ends: 2018 [2018-10-04 14:19:52,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time 1.3s impTime 21 [2018-10-04 14:19:52,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2018-10-04 14:19:52,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 916. [2018-10-04 14:19:52,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-10-04 14:19:52,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1353 transitions. [2018-10-04 14:19:52,265 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1353 transitions. Word has length 48 [2018-10-04 14:19:52,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:52,265 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 1353 transitions. [2018-10-04 14:19:52,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 14:19:52,265 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1353 transitions. [2018-10-04 14:19:52,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-04 14:19:52,267 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:52,267 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-04 14:19:52,268 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:52,268 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:52,268 INFO L82 PathProgramCache]: Analyzing trace with hash -253604652, now seen corresponding path program 1 times [2018-10-04 14:19:52,268 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:52,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:52,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:52,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:52,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:52,458 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-04 14:19:52,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:52,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 14:19:52,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 14:19:52,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 14:19:52,459 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:52,460 INFO L87 Difference]: Start difference. First operand 916 states and 1353 transitions. Second operand 4 states. [2018-10-04 14:19:52,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:52,629 INFO L93 Difference]: Finished difference Result 1832 states and 2705 transitions. [2018-10-04 14:19:52,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:19:52,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-10-04 14:19:52,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:52,635 INFO L225 Difference]: With dead ends: 1832 [2018-10-04 14:19:52,635 INFO L226 Difference]: Without dead ends: 917 [2018-10-04 14:19:52,637 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 2 [2018-10-04 14:19:52,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-10-04 14:19:52,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 914. [2018-10-04 14:19:52,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2018-10-04 14:19:52,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1297 transitions. [2018-10-04 14:19:52,682 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1297 transitions. Word has length 67 [2018-10-04 14:19:52,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:52,683 INFO L480 AbstractCegarLoop]: Abstraction has 914 states and 1297 transitions. [2018-10-04 14:19:52,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 14:19:52,683 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1297 transitions. [2018-10-04 14:19:52,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-04 14:19:52,685 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:52,685 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:52,685 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:52,685 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:52,685 INFO L82 PathProgramCache]: Analyzing trace with hash 597366310, now seen corresponding path program 2 times [2018-10-04 14:19:52,686 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:52,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:52,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:52,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:52,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:52,745 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-04 14:19:52,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:52,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:19:52,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:19:52,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:19:52,747 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:52,747 INFO L87 Difference]: Start difference. First operand 914 states and 1297 transitions. Second operand 3 states. [2018-10-04 14:19:52,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:52,881 INFO L93 Difference]: Finished difference Result 1833 states and 2596 transitions. [2018-10-04 14:19:52,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:19:52,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-10-04 14:19:52,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:52,886 INFO L225 Difference]: With dead ends: 1833 [2018-10-04 14:19:52,886 INFO L226 Difference]: Without dead ends: 852 [2018-10-04 14:19:52,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:19:52,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2018-10-04 14:19:52,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 827. [2018-10-04 14:19:52,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2018-10-04 14:19:52,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1131 transitions. [2018-10-04 14:19:52,931 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1131 transitions. Word has length 68 [2018-10-04 14:19:52,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:52,932 INFO L480 AbstractCegarLoop]: Abstraction has 827 states and 1131 transitions. [2018-10-04 14:19:52,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:19:52,932 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1131 transitions. [2018-10-04 14:19:52,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-04 14:19:52,936 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:52,936 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:52,937 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:52,937 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:52,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1297357211, now seen corresponding path program 1 times [2018-10-04 14:19:52,937 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:52,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:52,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:52,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:19:52,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:53,719 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 27 proven. 101 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-04 14:19:53,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:19:53,720 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:19:53,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:53,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:19:54,736 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 109 proven. 19 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-04 14:19:54,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:19:54,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 27 [2018-10-04 14:19:54,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-04 14:19:54,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-04 14:19:54,759 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:54,759 INFO L87 Difference]: Start difference. First operand 827 states and 1131 transitions. Second operand 28 states. [2018-10-04 14:19:58,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:58,427 INFO L93 Difference]: Finished difference Result 2306 states and 2951 transitions. [2018-10-04 14:19:58,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-04 14:19:58,427 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 84 [2018-10-04 14:19:58,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:58,436 INFO L225 Difference]: With dead ends: 2306 [2018-10-04 14:19:58,436 INFO L226 Difference]: Without dead ends: 2305 [2018-10-04 14:19:58,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s Time 1.9s impTime 32 [2018-10-04 14:19:58,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2018-10-04 14:19:58,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 951. [2018-10-04 14:19:58,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2018-10-04 14:19:58,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1304 transitions. [2018-10-04 14:19:58,514 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1304 transitions. Word has length 84 [2018-10-04 14:19:58,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:58,515 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 1304 transitions. [2018-10-04 14:19:58,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-04 14:19:58,515 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1304 transitions. [2018-10-04 14:19:58,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-04 14:19:58,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:58,518 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2018-10-04 14:19:58,518 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:58,518 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:58,518 INFO L82 PathProgramCache]: Analyzing trace with hash -604514526, now seen corresponding path program 1 times [2018-10-04 14:19:58,519 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:58,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:58,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:58,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:58,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:58,655 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-10-04 14:19:58,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:58,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:19:58,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:19:58,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:19:58,657 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:58,657 INFO L87 Difference]: Start difference. First operand 951 states and 1304 transitions. Second operand 3 states. [2018-10-04 14:19:58,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:58,905 INFO L93 Difference]: Finished difference Result 1902 states and 2607 transitions. [2018-10-04 14:19:58,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:19:58,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-10-04 14:19:58,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:58,910 INFO L225 Difference]: With dead ends: 1902 [2018-10-04 14:19:58,910 INFO L226 Difference]: Without dead ends: 952 [2018-10-04 14:19:58,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:19:58,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2018-10-04 14:19:58,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 896. [2018-10-04 14:19:58,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-10-04 14:19:58,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1202 transitions. [2018-10-04 14:19:58,976 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1202 transitions. Word has length 85 [2018-10-04 14:19:58,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:58,976 INFO L480 AbstractCegarLoop]: Abstraction has 896 states and 1202 transitions. [2018-10-04 14:19:58,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:19:58,977 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1202 transitions. [2018-10-04 14:19:58,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-04 14:19:58,979 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:58,979 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:58,979 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:58,979 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:58,979 INFO L82 PathProgramCache]: Analyzing trace with hash 722130188, now seen corresponding path program 1 times [2018-10-04 14:19:58,979 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:58,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:58,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:58,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:58,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:59,057 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-04 14:19:59,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:59,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:19:59,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:19:59,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:19:59,058 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:59,058 INFO L87 Difference]: Start difference. First operand 896 states and 1202 transitions. Second operand 3 states. [2018-10-04 14:19:59,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:59,139 INFO L93 Difference]: Finished difference Result 1560 states and 2084 transitions. [2018-10-04 14:19:59,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:19:59,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-10-04 14:19:59,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:59,142 INFO L225 Difference]: With dead ends: 1560 [2018-10-04 14:19:59,142 INFO L226 Difference]: Without dead ends: 640 [2018-10-04 14:19:59,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:19:59,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-10-04 14:19:59,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 554. [2018-10-04 14:19:59,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-10-04 14:19:59,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 719 transitions. [2018-10-04 14:19:59,183 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 719 transitions. Word has length 87 [2018-10-04 14:19:59,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:59,183 INFO L480 AbstractCegarLoop]: Abstraction has 554 states and 719 transitions. [2018-10-04 14:19:59,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:19:59,183 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 719 transitions. [2018-10-04 14:19:59,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-04 14:19:59,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:59,185 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:59,185 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:59,185 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:59,186 INFO L82 PathProgramCache]: Analyzing trace with hash 818701568, now seen corresponding path program 1 times [2018-10-04 14:19:59,186 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:59,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:59,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:59,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:59,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:59,315 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 104 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-04 14:19:59,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:19:59,316 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:19:59,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:59,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:19:59,467 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 104 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-04 14:19:59,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:19:59,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-10-04 14:19:59,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:19:59,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:19:59,488 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:59,488 INFO L87 Difference]: Start difference. First operand 554 states and 719 transitions. Second operand 7 states. [2018-10-04 14:19:59,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:59,612 INFO L93 Difference]: Finished difference Result 1394 states and 1802 transitions. [2018-10-04 14:19:59,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:19:59,613 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-10-04 14:19:59,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:59,616 INFO L225 Difference]: With dead ends: 1394 [2018-10-04 14:19:59,616 INFO L226 Difference]: Without dead ends: 724 [2018-10-04 14:19:59,617 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 14:19:59,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2018-10-04 14:19:59,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 323. [2018-10-04 14:19:59,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-10-04 14:19:59,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 408 transitions. [2018-10-04 14:19:59,645 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 408 transitions. Word has length 89 [2018-10-04 14:19:59,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:59,645 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 408 transitions. [2018-10-04 14:19:59,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:19:59,645 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 408 transitions. [2018-10-04 14:19:59,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-04 14:19:59,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:59,647 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:59,647 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:59,647 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:59,647 INFO L82 PathProgramCache]: Analyzing trace with hash -199349933, now seen corresponding path program 2 times [2018-10-04 14:19:59,648 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:59,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:59,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:59,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:59,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:59,732 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-10-04 14:19:59,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:59,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:19:59,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:19:59,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:19:59,733 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:59,734 INFO L87 Difference]: Start difference. First operand 323 states and 408 transitions. Second operand 3 states. [2018-10-04 14:20:00,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:00,058 INFO L93 Difference]: Finished difference Result 566 states and 704 transitions. [2018-10-04 14:20:00,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:20:00,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2018-10-04 14:20:00,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:00,058 INFO L225 Difference]: With dead ends: 566 [2018-10-04 14:20:00,058 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 14:20:00,059 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:20:00,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 14:20:00,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 14:20:00,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 14:20:00,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 14:20:00,060 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2018-10-04 14:20:00,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:00,060 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 14:20:00,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:20:00,061 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 14:20:00,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 14:20:00,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 14:20:00,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:00,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:00,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:00,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:01,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:01,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:01,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:01,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:01,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:01,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:01,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:01,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:01,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:20:02,187 WARN L178 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 547 DAG size of output: 474 [2018-10-04 14:20:06,395 WARN L178 SmtUtils]: Spent 4.20 s on a formula simplification. DAG size of input: 457 DAG size of output: 114 [2018-10-04 14:20:06,399 INFO L425 ceAbstractionStarter]: For program point L168(lines 168 183) no Hoare annotation was computed. [2018-10-04 14:20:06,399 INFO L425 ceAbstractionStarter]: For program point L135(lines 135 142) no Hoare annotation was computed. [2018-10-04 14:20:06,399 INFO L425 ceAbstractionStarter]: For program point L135-2(lines 111 160) no Hoare annotation was computed. [2018-10-04 14:20:06,399 INFO L425 ceAbstractionStarter]: For program point L94(lines 94 108) no Hoare annotation was computed. [2018-10-04 14:20:06,399 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 160) no Hoare annotation was computed. [2018-10-04 14:20:06,399 INFO L425 ceAbstractionStarter]: For program point L103(lines 103 108) no Hoare annotation was computed. [2018-10-04 14:20:06,399 INFO L425 ceAbstractionStarter]: For program point L103-2(lines 89 142) no Hoare annotation was computed. [2018-10-04 14:20:06,400 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 183) no Hoare annotation was computed. [2018-10-04 14:20:06,400 INFO L425 ceAbstractionStarter]: For program point L178-2(lines 163 183) no Hoare annotation was computed. [2018-10-04 14:20:06,400 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 142) no Hoare annotation was computed. [2018-10-04 14:20:06,400 INFO L425 ceAbstractionStarter]: For program point L96(lines 96 108) no Hoare annotation was computed. [2018-10-04 14:20:06,400 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 82) no Hoare annotation was computed. [2018-10-04 14:20:06,400 INFO L425 ceAbstractionStarter]: For program point L80-2(lines 80 85) no Hoare annotation was computed. [2018-10-04 14:20:06,400 INFO L425 ceAbstractionStarter]: For program point L171(lines 171 183) no Hoare annotation was computed. [2018-10-04 14:20:06,400 INFO L425 ceAbstractionStarter]: For program point L155(lines 155 160) no Hoare annotation was computed. [2018-10-04 14:20:06,400 INFO L425 ceAbstractionStarter]: For program point L155-2(lines 145 183) no Hoare annotation was computed. [2018-10-04 14:20:06,401 INFO L421 ceAbstractionStarter]: At program point L48-1(lines 13 188) the Hoare annotation is: (let ((.cse30 (+ |Elevator_goal'| 1))) (let ((.cse9 (< |Elevator_current'| |Elevator_goal'|)) (.cse10 (<= .cse30 |Elevator_current'|)) (.cse1 (<= Elevator_c2 Elevator_c3)) (.cse13 (<= |Elevator_current'| Elevator_max)) (.cse15 (<= Elevator_min |Elevator_current'|)) (.cse29 (<= |Elevator_goal'| |Elevator_current'|)) (.cse32 (<= |Elevator_current'| |Elevator_goal'|))) (let ((.cse23 (not Elevator_passed)) (.cse26 (not (= |Elevator_current'| |Elevator_goal'|))) (.cse17 (not Elevator_newgoal)) (.cse24 (or (= (+ |Elevator_dir'| 1) 0) .cse32)) (.cse25 (or (= |Elevator_dir'| 1) .cse29)) (.cse7 (or (and .cse13 (<= (+ Elevator_min 1) |Elevator_current'|)) (and (<= (+ |Elevator_current'| 1) Elevator_max) .cse15))) (.cse14 (<= Elevator_qDC2 1)) (.cse22 (<= Elevator_qDC1 1)) (.cse2 (= Elevator_qDC2 3)) (.cse16 (= Elevator_qCSP 1)) (.cse0 (not Elevator_stop)) (.cse27 (or (<= Elevator_c2 2) .cse1)) (.cse3 (= Elevator_qDC1 2)) (.cse18 (or .cse9 .cse10)) (.cse19 (<= Elevator_qDC2 2)) (.cse4 (<= Elevator_min Elevator_current)) (.cse5 (<= Elevator_current Elevator_max)) (.cse21 (not (= Elevator_qCSP 3))) (.cse8 (<= |Elevator_goal'| Elevator_max)) (.cse20 (<= 2 Elevator_qDC2)) (.cse6 (<= Elevator_goal Elevator_max)) (.cse12 (<= Elevator_min Elevator_goal)) (.cse11 (<= Elevator_min |Elevator_goal'|))) (or (and .cse0 .cse1 .cse2 (and .cse3 (and .cse4 .cse5 .cse6 .cse7) (or (and .cse8 .cse9) .cse10) .cse11 .cse12)) (and .cse1 (and (and .cse13 .cse4 .cse5 .cse14 .cse15 .cse16) .cse3 .cse8 .cse11 .cse6 .cse12) .cse17) (and .cse0 (and (and .cse18 .cse19 .cse20 (and .cse13 .cse4 .cse5 .cse21 .cse15 .cse8 .cse6 .cse12 .cse22 .cse23)) .cse11)) (and (and .cse13 .cse4 .cse15 .cse8 .cse6 .cse2 .cse12 .cse0 .cse5 .cse1 .cse3 .cse11) .cse17) (and (and .cse0 (and .cse24 (and .cse19 .cse20 (and .cse13 .cse4 .cse5 .cse15 .cse8 .cse6 .cse12 .cse22 .cse23)) .cse25 .cse11 .cse26)) .cse17) (and (and .cse0 .cse27 (and .cse24 .cse3 .cse25 (and .cse13 .cse19 .cse4 .cse20 .cse15 .cse8 .cse6 .cse12 .cse5 .cse11) .cse26)) .cse17) (and (let ((.cse28 (let ((.cse31 (let ((.cse33 (and .cse16 (and .cse13 .cse14 .cse15 .cse22)))) (or (and .cse32 .cse33 .cse29) (and .cse8 .cse11 .cse6 .cse12 .cse33))))) (or (and .cse24 .cse25 .cse7 .cse31) (and .cse4 .cse5 .cse6 .cse12 .cse31))))) (or (and .cse5 .cse28) (and .cse28 (or (and (<= (+ |Elevator_current'| |Elevator_dir'| 2) Elevator_max) .cse29) (= |Elevator_goal'| |Elevator_current'|) (and (< |Elevator_current'| .cse30) (<= (+ Elevator_min 2) (+ |Elevator_current'| |Elevator_dir'|))))))) .cse1) (and .cse1 (and .cse13 .cse4 .cse15 .cse8 .cse6 .cse2 .cse12 .cse16 .cse0 .cse5 .cse3 .cse11)) (and .cse0 .cse27 (and .cse3 (and .cse18 .cse19 (and .cse13 .cse4 .cse5 .cse21 .cse15 .cse8) .cse20 .cse6 .cse12) .cse11)))))) [2018-10-04 14:20:06,401 INFO L425 ceAbstractionStarter]: For program point ElevatorErr0ASSERT_VIOLATIONASSERT(line 185) no Hoare annotation was computed. [2018-10-04 14:20:06,401 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 142) no Hoare annotation was computed. [2018-10-04 14:20:06,401 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 183) no Hoare annotation was computed. [2018-10-04 14:20:06,401 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 108) no Hoare annotation was computed. [2018-10-04 14:20:06,401 INFO L425 ceAbstractionStarter]: For program point ElevatorEXIT(lines 13 188) no Hoare annotation was computed. [2018-10-04 14:20:06,401 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 108) no Hoare annotation was computed. [2018-10-04 14:20:06,401 INFO L425 ceAbstractionStarter]: For program point L149(lines 149 160) no Hoare annotation was computed. [2018-10-04 14:20:06,402 INFO L425 ceAbstractionStarter]: For program point L116(lines 116 142) no Hoare annotation was computed. [2018-10-04 14:20:06,402 INFO L425 ceAbstractionStarter]: For program point L83-1(lines 83 108) no Hoare annotation was computed. [2018-10-04 14:20:06,402 INFO L425 ceAbstractionStarter]: For program point ElevatorENTRY(lines 13 188) no Hoare annotation was computed. [2018-10-04 14:20:06,402 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 183) no Hoare annotation was computed. [2018-10-04 14:20:06,402 INFO L425 ceAbstractionStarter]: For program point L101(lines 101 108) no Hoare annotation was computed. [2018-10-04 14:20:06,422 INFO L202 PluginConnector]: Adding new model Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 02:20:06 BoogieIcfgContainer [2018-10-04 14:20:06,422 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 14:20:06,423 INFO L168 Benchmark]: Toolchain (without parser) took 25090.03 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 296.2 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 401.0 MB). Peak memory consumption was 720.8 MB. Max. memory is 7.1 GB. [2018-10-04 14:20:06,425 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:20:06,425 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.60 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:20:06,426 INFO L168 Benchmark]: Boogie Preprocessor took 32.04 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:20:06,427 INFO L168 Benchmark]: RCFGBuilder took 777.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-04 14:20:06,428 INFO L168 Benchmark]: TraceAbstraction took 24230.86 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 296.2 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 369.3 MB). Peak memory consumption was 689.1 MB. Max. memory is 7.1 GB. [2018-10-04 14:20:06,433 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.60 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.04 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 777.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24230.86 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 296.2 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 369.3 MB). Peak memory consumption was 689.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 185]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: ((((((((((!stop && c2 <= c3) && qDC2 == 3) && (((qDC1 == 2 && ((min <= current && current <= max) && goal <= max) && ((current' <= max && min + 1 <= current') || (current' + 1 <= max && min <= current'))) && ((goal' <= max && current' < goal') || goal' + 1 <= current')) && min <= goal') && min <= goal) || ((c2 <= c3 && (((((((((current' <= max && min <= current) && current <= max) && qDC2 <= 1) && min <= current') && qCSP == 1) && qDC1 == 2) && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && !newgoal)) || (!stop && ((((current' < goal' || goal' + 1 <= current') && qDC2 <= 2) && 2 <= qDC2) && ((((((((current' <= max && min <= current) && current <= max) && !(qCSP == 3)) && min <= current') && goal' <= max) && goal <= max) && min <= goal) && qDC1 <= 1) && !passed) && min <= goal')) || ((((((((((((current' <= max && min <= current) && min <= current') && goal' <= max) && goal <= max) && qDC2 == 3) && min <= goal) && !stop) && current <= max) && c2 <= c3) && qDC1 == 2) && min <= goal') && !newgoal)) || ((!stop && ((((dir' + 1 == 0 || current' <= goal') && (qDC2 <= 2 && 2 <= qDC2) && (((((((current' <= max && min <= current) && current <= max) && min <= current') && goal' <= max) && goal <= max) && min <= goal) && qDC1 <= 1) && !passed) && (dir' == 1 || goal' <= current')) && min <= goal') && !(current' == goal')) && !newgoal)) || (((!stop && (c2 <= 2 || c2 <= c3)) && ((((dir' + 1 == 0 || current' <= goal') && qDC1 == 2) && (dir' == 1 || goal' <= current')) && ((((((((current' <= max && qDC2 <= 2) && min <= current) && 2 <= qDC2) && min <= current') && goal' <= max) && goal <= max) && min <= goal) && current <= max) && min <= goal') && !(current' == goal')) && !newgoal)) || (((current <= max && (((((dir' + 1 == 0 || current' <= goal') && (dir' == 1 || goal' <= current')) && ((current' <= max && min + 1 <= current') || (current' + 1 <= max && min <= current'))) && (((current' <= goal' && qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1) && goal' <= current') || ((((goal' <= max && min <= goal') && goal <= max) && min <= goal) && qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1))) || ((((min <= current && current <= max) && goal <= max) && min <= goal) && (((current' <= goal' && qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1) && goal' <= current') || ((((goal' <= max && min <= goal') && goal <= max) && min <= goal) && qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1))))) || ((((((dir' + 1 == 0 || current' <= goal') && (dir' == 1 || goal' <= current')) && ((current' <= max && min + 1 <= current') || (current' + 1 <= max && min <= current'))) && (((current' <= goal' && qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1) && goal' <= current') || ((((goal' <= max && min <= goal') && goal <= max) && min <= goal) && qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1))) || ((((min <= current && current <= max) && goal <= max) && min <= goal) && (((current' <= goal' && qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1) && goal' <= current') || ((((goal' <= max && min <= goal') && goal <= max) && min <= goal) && qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1)))) && (((current' + dir' + 2 <= max && goal' <= current') || goal' == current') || (current' < goal' + 1 && min + 2 <= current' + dir')))) && c2 <= c3)) || (c2 <= c3 && ((((((((((current' <= max && min <= current) && min <= current') && goal' <= max) && goal <= max) && qDC2 == 3) && min <= goal) && qCSP == 1) && !stop) && current <= max) && qDC1 == 2) && min <= goal')) || ((!stop && (c2 <= 2 || c2 <= c3)) && (qDC1 == 2 && (((((current' < goal' || goal' + 1 <= current') && qDC2 <= 2) && ((((current' <= max && min <= current) && current <= max) && !(qCSP == 3)) && min <= current') && goal' <= max) && 2 <= qDC2) && goal <= max) && min <= goal) && min <= goal') - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. SAFE Result, 24.1s OverallTime, 18 OverallIterations, 6 TraceHistogramMax, 10.5s AutomataDifference, 0.0s DeadEndRemovalTime, 6.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1068 SDtfs, 1922 SDslu, 2976 SDs, 0 SdLazy, 2047 SolverSat, 244 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 410 GetRequests, 272 SyntacticMatches, 5 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=951occurred in iteration=14, 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.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 3363 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 18 NumberOfFragments, 784 HoareAnnotationTreeSize, 1 FomulaSimplifications, 583815 FormulaSimplificationTreeSizeReduction, 2.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 351775 FormulaSimplificationTreeSizeReductionInter, 4.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 1161 NumberOfCodeBlocks, 1161 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1139 ConstructedInterpolants, 0 QuantifiedInterpolants, 621580 SizeOfPredicates, 23 NumberOfNonLiveVariables, 862 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 22 InterpolantComputations, 15 PerfectInterpolantSequences, 1300/1473 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-Integer.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_14-20-06-450.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Elevator-Integer.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_14-20-06-450.csv Received shutdown request...