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-b2fde6a [2018-09-28 10:23:50,263 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-28 10:23:50,266 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-28 10:23:50,278 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-28 10:23:50,278 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-28 10:23:50,280 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-28 10:23:50,281 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-28 10:23:50,283 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-28 10:23:50,285 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-28 10:23:50,286 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-28 10:23:50,287 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-28 10:23:50,287 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-28 10:23:50,288 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-28 10:23:50,289 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-28 10:23:50,290 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-28 10:23:50,291 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-28 10:23:50,292 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-28 10:23:50,294 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-28 10:23:50,301 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-28 10:23:50,307 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-28 10:23:50,308 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-28 10:23:50,312 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-28 10:23:50,316 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-28 10:23:50,317 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-28 10:23:50,317 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-28 10:23:50,318 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-28 10:23:50,322 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-28 10:23:50,323 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-28 10:23:50,324 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-28 10:23:50,328 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-28 10:23:50,329 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-28 10:23:50,329 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-28 10:23:50,331 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-28 10:23:50,331 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-28 10:23:50,334 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-28 10:23:50,335 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-28 10:23:50,335 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-09-28 10:23:50,364 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-28 10:23:50,364 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-28 10:23:50,366 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-28 10:23:50,366 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-28 10:23:50,367 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-28 10:23:50,367 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-28 10:23:50,367 INFO L133 SettingsManager]: * Use SBE=true [2018-09-28 10:23:50,368 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-28 10:23:50,368 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-28 10:23:50,368 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-28 10:23:50,369 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-28 10:23:50,369 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-28 10:23:50,369 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-28 10:23:50,369 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-28 10:23:50,369 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-28 10:23:50,369 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-28 10:23:50,370 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-28 10:23:50,370 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-28 10:23:50,370 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-28 10:23:50,370 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-28 10:23:50,371 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-28 10:23:50,372 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-28 10:23:50,372 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-28 10:23:50,372 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-28 10:23:50,372 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-28 10:23:50,372 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-28 10:23:50,373 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-28 10:23:50,373 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-28 10:23:50,373 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-28 10:23:50,373 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-28 10:23:50,373 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-28 10:23:50,436 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-28 10:23:50,449 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-28 10:23:50,454 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-28 10:23:50,456 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-28 10:23:50,456 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-28 10:23:50,457 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-09-28 10:23:50,458 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator-Integer.bpl' [2018-09-28 10:23:50,524 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-28 10:23:50,527 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-28 10:23:50,528 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-28 10:23:50,528 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-28 10:23:50,528 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-28 10:23:50,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:23:50" (1/1) ... [2018-09-28 10:23:50,566 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:23:50" (1/1) ... [2018-09-28 10:23:50,572 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-28 10:23:50,572 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-28 10:23:50,572 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-28 10:23:50,575 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-28 10:23:50,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-28 10:23:50,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-28 10:23:50,576 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-28 10:23:50,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:23:50" (1/1) ... [2018-09-28 10:23:50,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:23:50" (1/1) ... [2018-09-28 10:23:50,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:23:50" (1/1) ... [2018-09-28 10:23:50,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:23:50" (1/1) ... [2018-09-28 10:23:50,609 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:23:50" (1/1) ... [2018-09-28 10:23:50,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:23:50" (1/1) ... [2018-09-28 10:23:50,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:23:50" (1/1) ... [2018-09-28 10:23:50,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-28 10:23:50,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-28 10:23:50,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-28 10:23:50,633 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-28 10:23:50,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:23:50" (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-09-28 10:23:50,719 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Elevator given in one single declaration [2018-09-28 10:23:50,720 INFO L130 BoogieDeclarations]: Found specification of procedure Elevator [2018-09-28 10:23:50,720 INFO L138 BoogieDeclarations]: Found implementation of procedure Elevator [2018-09-28 10:23:51,303 INFO L350 CfgBuilder]: Using library mode [2018-09-28 10:23:51,303 INFO L202 PluginConnector]: Adding new model Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.09 10:23:51 BoogieIcfgContainer [2018-09-28 10:23:51,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-28 10:23:51,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-28 10:23:51,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-28 10:23:51,308 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-28 10:23:51,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 10:23:50" (1/2) ... [2018-09-28 10:23:51,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b44f477 and model type Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.09 10:23:51, skipping insertion in model container [2018-09-28 10:23:51,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.09 10:23:51" (2/2) ... [2018-09-28 10:23:51,312 INFO L112 eAbstractionObserver]: Analyzing ICFG Elevator-Integer.bpl [2018-09-28 10:23:51,322 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-28 10:23:51,331 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-28 10:23:51,384 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-28 10:23:51,384 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-28 10:23:51,385 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-28 10:23:51,385 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-28 10:23:51,385 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-28 10:23:51,385 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-28 10:23:51,385 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-28 10:23:51,385 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-28 10:23:51,386 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-28 10:23:51,403 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-09-28 10:23:51,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-28 10:23:51,410 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:23:51,411 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 10:23:51,412 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:23:51,420 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:23:51,420 INFO L82 PathProgramCache]: Analyzing trace with hash 493797215, now seen corresponding path program 1 times [2018-09-28 10:23:51,423 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:23:51,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:23:51,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:23:51,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:23:51,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:23:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:23:51,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:23:51,613 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:23:51,614 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:23:51,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:23:51,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:23:51,635 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:23:51,637 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2018-09-28 10:23:51,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:23:51,933 INFO L93 Difference]: Finished difference Result 85 states and 157 transitions. [2018-09-28 10:23:51,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:23:51,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-09-28 10:23:51,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:23:51,950 INFO L225 Difference]: With dead ends: 85 [2018-09-28 10:23:51,950 INFO L226 Difference]: Without dead ends: 53 [2018-09-28 10:23:51,954 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:23:51,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-28 10:23:51,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-09-28 10:23:51,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-28 10:23:52,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 90 transitions. [2018-09-28 10:23:52,002 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 90 transitions. Word has length 9 [2018-09-28 10:23:52,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:23:52,003 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 90 transitions. [2018-09-28 10:23:52,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:23:52,003 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 90 transitions. [2018-09-28 10:23:52,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-28 10:23:52,004 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:23:52,004 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 10:23:52,005 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:23:52,005 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:23:52,005 INFO L82 PathProgramCache]: Analyzing trace with hash -2026162719, now seen corresponding path program 1 times [2018-09-28 10:23:52,005 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:23:52,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:23:52,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:23:52,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:23:52,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:23:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:23:52,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:23:52,091 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:23:52,091 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:23:52,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:23:52,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:23:52,094 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:23:52,094 INFO L87 Difference]: Start difference. First operand 52 states and 90 transitions. Second operand 3 states. [2018-09-28 10:23:52,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:23:52,462 INFO L93 Difference]: Finished difference Result 154 states and 268 transitions. [2018-09-28 10:23:52,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:23:52,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-09-28 10:23:52,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:23:52,465 INFO L225 Difference]: With dead ends: 154 [2018-09-28 10:23:52,466 INFO L226 Difference]: Without dead ends: 95 [2018-09-28 10:23:52,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:23:52,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-28 10:23:52,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-09-28 10:23:52,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-09-28 10:23:52,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 161 transitions. [2018-09-28 10:23:52,481 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 161 transitions. Word has length 9 [2018-09-28 10:23:52,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:23:52,482 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 161 transitions. [2018-09-28 10:23:52,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:23:52,482 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 161 transitions. [2018-09-28 10:23:52,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-28 10:23:52,483 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:23:52,483 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 10:23:52,486 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:23:52,486 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:23:52,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1968904417, now seen corresponding path program 1 times [2018-09-28 10:23:52,486 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:23:52,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:23:52,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:23:52,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:23:52,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:23:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:23:52,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:23:52,538 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:23:52,539 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:23:52,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:23:52,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:23:52,540 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:23:52,540 INFO L87 Difference]: Start difference. First operand 94 states and 161 transitions. Second operand 3 states. [2018-09-28 10:23:53,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:23:53,159 INFO L93 Difference]: Finished difference Result 233 states and 398 transitions. [2018-09-28 10:23:53,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:23:53,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-09-28 10:23:53,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:23:53,168 INFO L225 Difference]: With dead ends: 233 [2018-09-28 10:23:53,168 INFO L226 Difference]: Without dead ends: 136 [2018-09-28 10:23:53,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:23:53,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-09-28 10:23:53,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 114. [2018-09-28 10:23:53,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-09-28 10:23:53,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 193 transitions. [2018-09-28 10:23:53,200 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 193 transitions. Word has length 9 [2018-09-28 10:23:53,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:23:53,201 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 193 transitions. [2018-09-28 10:23:53,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:23:53,201 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 193 transitions. [2018-09-28 10:23:53,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-28 10:23:53,202 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:23:53,202 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 10:23:53,205 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:23:53,205 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:23:53,205 INFO L82 PathProgramCache]: Analyzing trace with hash -906451345, now seen corresponding path program 1 times [2018-09-28 10:23:53,205 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:23:53,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:23:53,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:23:53,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:23:53,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:23:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:23:53,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:23:53,344 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:23:53,344 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 10:23:53,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-28 10:23:53,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-28 10:23:53,346 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:23:53,346 INFO L87 Difference]: Start difference. First operand 114 states and 193 transitions. Second operand 4 states. [2018-09-28 10:23:53,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:23:53,924 INFO L93 Difference]: Finished difference Result 144 states and 242 transitions. [2018-09-28 10:23:53,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-28 10:23:53,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-09-28 10:23:53,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:23:53,929 INFO L225 Difference]: With dead ends: 144 [2018-09-28 10:23:53,929 INFO L226 Difference]: Without dead ends: 143 [2018-09-28 10:23:53,929 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:23:53,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-28 10:23:53,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2018-09-28 10:23:53,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-09-28 10:23:53,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 237 transitions. [2018-09-28 10:23:53,945 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 237 transitions. Word has length 10 [2018-09-28 10:23:53,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:23:53,945 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 237 transitions. [2018-09-28 10:23:53,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-28 10:23:53,945 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 237 transitions. [2018-09-28 10:23:53,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-28 10:23:53,946 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:23:53,947 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-28 10:23:53,947 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:23:53,947 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:23:53,947 INFO L82 PathProgramCache]: Analyzing trace with hash -464230043, now seen corresponding path program 1 times [2018-09-28 10:23:53,948 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:23:53,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:23:53,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:23:53,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:23:53,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:23:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:23:54,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:23:54,037 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:23:54,037 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-28 10:23:54,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-28 10:23:54,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-28 10:23:54,038 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:23:54,038 INFO L87 Difference]: Start difference. First operand 142 states and 237 transitions. Second operand 5 states. [2018-09-28 10:23:54,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:23:54,475 INFO L93 Difference]: Finished difference Result 459 states and 761 transitions. [2018-09-28 10:23:54,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-28 10:23:54,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-09-28 10:23:54,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:23:54,478 INFO L225 Difference]: With dead ends: 459 [2018-09-28 10:23:54,478 INFO L226 Difference]: Without dead ends: 286 [2018-09-28 10:23:54,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:23:54,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-09-28 10:23:54,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2018-09-28 10:23:54,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-09-28 10:23:54,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 461 transitions. [2018-09-28 10:23:54,504 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 461 transitions. Word has length 18 [2018-09-28 10:23:54,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:23:54,505 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 461 transitions. [2018-09-28 10:23:54,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-28 10:23:54,505 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 461 transitions. [2018-09-28 10:23:54,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-28 10:23:54,507 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:23:54,507 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-09-28 10:23:54,507 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:23:54,508 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:23:54,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1761001012, now seen corresponding path program 1 times [2018-09-28 10:23:54,508 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:23:54,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:23:54,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:23:54,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:23:54,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:23:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:23:54,547 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-28 10:23:54,547 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:23:54,548 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:23:54,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:23:54,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:23:54,549 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:23:54,549 INFO L87 Difference]: Start difference. First operand 286 states and 461 transitions. Second operand 3 states. [2018-09-28 10:23:55,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:23:55,133 INFO L93 Difference]: Finished difference Result 695 states and 1105 transitions. [2018-09-28 10:23:55,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:23:55,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-09-28 10:23:55,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:23:55,137 INFO L225 Difference]: With dead ends: 695 [2018-09-28 10:23:55,138 INFO L226 Difference]: Without dead ends: 402 [2018-09-28 10:23:55,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:23:55,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-09-28 10:23:55,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 294. [2018-09-28 10:23:55,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-09-28 10:23:55,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 469 transitions. [2018-09-28 10:23:55,174 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 469 transitions. Word has length 40 [2018-09-28 10:23:55,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:23:55,175 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 469 transitions. [2018-09-28 10:23:55,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:23:55,175 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 469 transitions. [2018-09-28 10:23:55,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-28 10:23:55,177 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:23:55,178 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-09-28 10:23:55,178 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:23:55,178 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:23:55,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1151060372, now seen corresponding path program 1 times [2018-09-28 10:23:55,179 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:23:55,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:23:55,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:23:55,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:23:55,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:23:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:23:55,239 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-28 10:23:55,239 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:23:55,239 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:23:55,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:23:55,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:23:55,240 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:23:55,240 INFO L87 Difference]: Start difference. First operand 294 states and 469 transitions. Second operand 3 states. [2018-09-28 10:23:55,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:23:55,414 INFO L93 Difference]: Finished difference Result 711 states and 1121 transitions. [2018-09-28 10:23:55,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:23:55,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-09-28 10:23:55,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:23:55,417 INFO L225 Difference]: With dead ends: 711 [2018-09-28 10:23:55,417 INFO L226 Difference]: Without dead ends: 414 [2018-09-28 10:23:55,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:23:55,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-09-28 10:23:55,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 306. [2018-09-28 10:23:55,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-09-28 10:23:55,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 481 transitions. [2018-09-28 10:23:55,439 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 481 transitions. Word has length 41 [2018-09-28 10:23:55,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:23:55,440 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 481 transitions. [2018-09-28 10:23:55,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:23:55,440 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 481 transitions. [2018-09-28 10:23:55,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-28 10:23:55,447 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:23:55,448 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-09-28 10:23:55,448 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:23:55,448 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:23:55,451 INFO L82 PathProgramCache]: Analyzing trace with hash 221883911, now seen corresponding path program 1 times [2018-09-28 10:23:55,451 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:23:55,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:23:55,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:23:55,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:23:55,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:23:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:23:55,590 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-28 10:23:55,591 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:23:55,591 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-09-28 10:23:55,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:23:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:23:55,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:23:55,795 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-28 10:23:55,826 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-28 10:23:55,826 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-09-28 10:23:55,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-28 10:23:55,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-28 10:23:55,827 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:23:55,828 INFO L87 Difference]: Start difference. First operand 306 states and 481 transitions. Second operand 7 states. [2018-09-28 10:23:56,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:23:56,897 INFO L93 Difference]: Finished difference Result 834 states and 1286 transitions. [2018-09-28 10:23:56,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-28 10:23:56,900 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-09-28 10:23:56,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:23:56,903 INFO L225 Difference]: With dead ends: 834 [2018-09-28 10:23:56,903 INFO L226 Difference]: Without dead ends: 523 [2018-09-28 10:23:56,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:23:56,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-09-28 10:23:56,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 432. [2018-09-28 10:23:56,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-09-28 10:23:56,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 649 transitions. [2018-09-28 10:23:56,925 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 649 transitions. Word has length 43 [2018-09-28 10:23:56,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:23:56,925 INFO L480 AbstractCegarLoop]: Abstraction has 432 states and 649 transitions. [2018-09-28 10:23:56,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-28 10:23:56,925 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 649 transitions. [2018-09-28 10:23:56,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-28 10:23:56,927 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:23:56,927 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-09-28 10:23:56,928 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:23:56,928 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:23:56,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1437736339, now seen corresponding path program 1 times [2018-09-28 10:23:56,928 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:23:56,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:23:56,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:23:56,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:23:56,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:23:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:23:57,007 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-28 10:23:57,008 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:23:57,008 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:23:57,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:23:57,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:23:57,009 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:23:57,010 INFO L87 Difference]: Start difference. First operand 432 states and 649 transitions. Second operand 3 states. [2018-09-28 10:23:57,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:23:57,794 INFO L93 Difference]: Finished difference Result 1110 states and 1680 transitions. [2018-09-28 10:23:57,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:23:57,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-09-28 10:23:57,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:23:57,800 INFO L225 Difference]: With dead ends: 1110 [2018-09-28 10:23:57,801 INFO L226 Difference]: Without dead ends: 657 [2018-09-28 10:23:57,802 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:23:57,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2018-09-28 10:23:57,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 654. [2018-09-28 10:23:57,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-09-28 10:23:57,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 980 transitions. [2018-09-28 10:23:57,826 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 980 transitions. Word has length 45 [2018-09-28 10:23:57,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:23:57,827 INFO L480 AbstractCegarLoop]: Abstraction has 654 states and 980 transitions. [2018-09-28 10:23:57,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:23:57,827 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 980 transitions. [2018-09-28 10:23:57,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-28 10:23:57,829 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:23:57,829 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-09-28 10:23:57,829 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:23:57,830 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:23:57,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1460368593, now seen corresponding path program 1 times [2018-09-28 10:23:57,830 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:23:57,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:23:57,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:23:57,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:23:57,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:23:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:23:57,887 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-28 10:23:57,888 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:23:57,888 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:23:57,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:23:57,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:23:57,889 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:23:57,889 INFO L87 Difference]: Start difference. First operand 654 states and 980 transitions. Second operand 3 states. [2018-09-28 10:23:58,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:23:58,241 INFO L93 Difference]: Finished difference Result 1308 states and 1959 transitions. [2018-09-28 10:23:58,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:23:58,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-09-28 10:23:58,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:23:58,249 INFO L225 Difference]: With dead ends: 1308 [2018-09-28 10:23:58,250 INFO L226 Difference]: Without dead ends: 655 [2018-09-28 10:23:58,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:23:58,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2018-09-28 10:23:58,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 654. [2018-09-28 10:23:58,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-09-28 10:23:58,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 924 transitions. [2018-09-28 10:23:58,274 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 924 transitions. Word has length 45 [2018-09-28 10:23:58,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:23:58,274 INFO L480 AbstractCegarLoop]: Abstraction has 654 states and 924 transitions. [2018-09-28 10:23:58,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:23:58,274 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 924 transitions. [2018-09-28 10:23:58,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-28 10:23:58,276 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:23:58,276 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-09-28 10:23:58,276 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:23:58,276 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:23:58,277 INFO L82 PathProgramCache]: Analyzing trace with hash -477421396, now seen corresponding path program 1 times [2018-09-28 10:23:58,277 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:23:58,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:23:58,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:23:58,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:23:58,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:23:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:23:58,719 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:23:58,719 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:23:58,719 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-09-28 10:23:58,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:23:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:23:58,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:23:59,995 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:24:00,028 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:24:00,029 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-09-28 10:24:00,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-28 10:24:00,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-28 10:24:00,030 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:24:00,030 INFO L87 Difference]: Start difference. First operand 654 states and 924 transitions. Second operand 16 states. [2018-09-28 10:24:05,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:24:05,281 INFO L93 Difference]: Finished difference Result 2731 states and 3833 transitions. [2018-09-28 10:24:05,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-28 10:24:05,283 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 48 [2018-09-28 10:24:05,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:24:05,292 INFO L225 Difference]: With dead ends: 2731 [2018-09-28 10:24:05,292 INFO L226 Difference]: Without dead ends: 2018 [2018-09-28 10:24:05,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:24:05,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2018-09-28 10:24:05,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 916. [2018-09-28 10:24:05,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-09-28 10:24:05,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1353 transitions. [2018-09-28 10:24:05,358 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1353 transitions. Word has length 48 [2018-09-28 10:24:05,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:24:05,358 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 1353 transitions. [2018-09-28 10:24:05,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-28 10:24:05,358 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1353 transitions. [2018-09-28 10:24:05,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-28 10:24:05,360 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:24:05,360 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-09-28 10:24:05,361 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:24:05,361 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:24:05,361 INFO L82 PathProgramCache]: Analyzing trace with hash -253604652, now seen corresponding path program 1 times [2018-09-28 10:24:05,361 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:24:05,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:24:05,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:24:05,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:24:05,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:24:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:24:05,541 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-09-28 10:24:05,542 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:24:05,542 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-28 10:24:05,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-28 10:24:05,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-28 10:24:05,543 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:24:05,543 INFO L87 Difference]: Start difference. First operand 916 states and 1353 transitions. Second operand 4 states. [2018-09-28 10:24:05,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:24:05,721 INFO L93 Difference]: Finished difference Result 1832 states and 2705 transitions. [2018-09-28 10:24:05,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:24:05,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-09-28 10:24:05,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:24:05,726 INFO L225 Difference]: With dead ends: 1832 [2018-09-28 10:24:05,726 INFO L226 Difference]: Without dead ends: 917 [2018-09-28 10:24:05,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:24:05,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-09-28 10:24:05,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 914. [2018-09-28 10:24:05,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2018-09-28 10:24:05,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1297 transitions. [2018-09-28 10:24:05,776 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1297 transitions. Word has length 67 [2018-09-28 10:24:05,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:24:05,776 INFO L480 AbstractCegarLoop]: Abstraction has 914 states and 1297 transitions. [2018-09-28 10:24:05,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-28 10:24:05,777 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1297 transitions. [2018-09-28 10:24:05,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-28 10:24:05,779 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:24:05,779 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-09-28 10:24:05,779 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:24:05,779 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:24:05,780 INFO L82 PathProgramCache]: Analyzing trace with hash 597366310, now seen corresponding path program 2 times [2018-09-28 10:24:05,780 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:24:05,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:24:05,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:24:05,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:24:05,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:24:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:24:05,881 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-09-28 10:24:05,882 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:24:05,882 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:24:05,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:24:05,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:24:05,883 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:24:05,883 INFO L87 Difference]: Start difference. First operand 914 states and 1297 transitions. Second operand 3 states. [2018-09-28 10:24:06,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:24:06,116 INFO L93 Difference]: Finished difference Result 1833 states and 2596 transitions. [2018-09-28 10:24:06,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:24:06,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-09-28 10:24:06,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:24:06,120 INFO L225 Difference]: With dead ends: 1833 [2018-09-28 10:24:06,120 INFO L226 Difference]: Without dead ends: 852 [2018-09-28 10:24:06,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:24:06,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2018-09-28 10:24:06,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 827. [2018-09-28 10:24:06,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2018-09-28 10:24:06,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1131 transitions. [2018-09-28 10:24:06,171 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1131 transitions. Word has length 68 [2018-09-28 10:24:06,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:24:06,172 INFO L480 AbstractCegarLoop]: Abstraction has 827 states and 1131 transitions. [2018-09-28 10:24:06,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:24:06,172 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1131 transitions. [2018-09-28 10:24:06,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-28 10:24:06,175 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:24:06,175 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-09-28 10:24:06,175 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:24:06,175 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:24:06,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1297357211, now seen corresponding path program 1 times [2018-09-28 10:24:06,176 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:24:06,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:24:06,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:24:06,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 10:24:06,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:24:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:24:07,141 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 27 proven. 101 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-28 10:24:07,142 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:24:07,142 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-09-28 10:24:07,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:24:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:24:07,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:24:08,360 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 108 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-28 10:24:08,381 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:24:08,381 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 28 [2018-09-28 10:24:08,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-28 10:24:08,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-28 10:24:08,382 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:24:08,382 INFO L87 Difference]: Start difference. First operand 827 states and 1131 transitions. Second operand 29 states. [2018-09-28 10:24:18,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:24:18,905 INFO L93 Difference]: Finished difference Result 2306 states and 2951 transitions. [2018-09-28 10:24:18,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-28 10:24:18,905 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 84 [2018-09-28 10:24:18,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:24:18,913 INFO L225 Difference]: With dead ends: 2306 [2018-09-28 10:24:18,913 INFO L226 Difference]: Without dead ends: 2305 [2018-09-28 10:24:18,913 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:24:18,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2018-09-28 10:24:18,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 951. [2018-09-28 10:24:18,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2018-09-28 10:24:18,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1304 transitions. [2018-09-28 10:24:18,999 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1304 transitions. Word has length 84 [2018-09-28 10:24:18,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:24:18,999 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 1304 transitions. [2018-09-28 10:24:19,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-28 10:24:19,000 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1304 transitions. [2018-09-28 10:24:19,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-28 10:24:19,002 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:24:19,003 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-09-28 10:24:19,003 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:24:19,003 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:24:19,003 INFO L82 PathProgramCache]: Analyzing trace with hash -604514526, now seen corresponding path program 1 times [2018-09-28 10:24:19,004 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:24:19,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:24:19,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:24:19,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:24:19,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:24:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:24:19,142 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-09-28 10:24:19,143 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:24:19,143 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:24:19,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:24:19,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:24:19,144 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:24:19,144 INFO L87 Difference]: Start difference. First operand 951 states and 1304 transitions. Second operand 3 states. [2018-09-28 10:24:19,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:24:19,924 INFO L93 Difference]: Finished difference Result 1902 states and 2607 transitions. [2018-09-28 10:24:19,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:24:19,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-09-28 10:24:19,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:24:19,929 INFO L225 Difference]: With dead ends: 1902 [2018-09-28 10:24:19,929 INFO L226 Difference]: Without dead ends: 952 [2018-09-28 10:24:19,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:24:19,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2018-09-28 10:24:19,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 896. [2018-09-28 10:24:19,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-09-28 10:24:19,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1202 transitions. [2018-09-28 10:24:19,993 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1202 transitions. Word has length 85 [2018-09-28 10:24:19,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:24:19,993 INFO L480 AbstractCegarLoop]: Abstraction has 896 states and 1202 transitions. [2018-09-28 10:24:19,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:24:19,994 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1202 transitions. [2018-09-28 10:24:19,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-28 10:24:19,996 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:24:19,996 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-09-28 10:24:19,996 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:24:19,996 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:24:19,997 INFO L82 PathProgramCache]: Analyzing trace with hash 722130188, now seen corresponding path program 1 times [2018-09-28 10:24:19,997 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:24:19,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:24:19,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:24:19,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:24:19,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:24:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:24:20,092 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-09-28 10:24:20,092 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:24:20,092 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:24:20,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:24:20,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:24:20,093 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:24:20,093 INFO L87 Difference]: Start difference. First operand 896 states and 1202 transitions. Second operand 3 states. [2018-09-28 10:24:20,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:24:20,305 INFO L93 Difference]: Finished difference Result 1560 states and 2084 transitions. [2018-09-28 10:24:20,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:24:20,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-09-28 10:24:20,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:24:20,308 INFO L225 Difference]: With dead ends: 1560 [2018-09-28 10:24:20,308 INFO L226 Difference]: Without dead ends: 640 [2018-09-28 10:24:20,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:24:20,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-09-28 10:24:20,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 554. [2018-09-28 10:24:20,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-09-28 10:24:20,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 719 transitions. [2018-09-28 10:24:20,348 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 719 transitions. Word has length 87 [2018-09-28 10:24:20,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:24:20,348 INFO L480 AbstractCegarLoop]: Abstraction has 554 states and 719 transitions. [2018-09-28 10:24:20,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:24:20,348 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 719 transitions. [2018-09-28 10:24:20,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-28 10:24:20,350 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:24:20,350 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-09-28 10:24:20,351 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:24:20,351 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:24:20,351 INFO L82 PathProgramCache]: Analyzing trace with hash 818701568, now seen corresponding path program 1 times [2018-09-28 10:24:20,351 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:24:20,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:24:20,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:24:20,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:24:20,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:24:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:24:20,609 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 104 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-09-28 10:24:20,609 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 10:24:20,609 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-09-28 10:24:20,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:24:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:24:20,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 10:24:20,771 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 104 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-09-28 10:24:20,791 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 10:24:20,792 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-09-28 10:24:20,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-28 10:24:20,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-28 10:24:20,792 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:24:20,793 INFO L87 Difference]: Start difference. First operand 554 states and 719 transitions. Second operand 7 states. [2018-09-28 10:24:21,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:24:21,070 INFO L93 Difference]: Finished difference Result 1394 states and 1802 transitions. [2018-09-28 10:24:21,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-28 10:24:21,071 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-09-28 10:24:21,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:24:21,074 INFO L225 Difference]: With dead ends: 1394 [2018-09-28 10:24:21,074 INFO L226 Difference]: Without dead ends: 724 [2018-09-28 10:24:21,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:24:21,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2018-09-28 10:24:21,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 323. [2018-09-28 10:24:21,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-09-28 10:24:21,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 408 transitions. [2018-09-28 10:24:21,096 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 408 transitions. Word has length 89 [2018-09-28 10:24:21,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:24:21,097 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 408 transitions. [2018-09-28 10:24:21,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-28 10:24:21,097 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 408 transitions. [2018-09-28 10:24:21,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-28 10:24:21,098 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 10:24:21,098 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-09-28 10:24:21,098 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 10:24:21,099 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-28 10:24:21,099 INFO L82 PathProgramCache]: Analyzing trace with hash -199349933, now seen corresponding path program 2 times [2018-09-28 10:24:21,099 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 10:24:21,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 10:24:21,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:24:21,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 10:24:21,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 10:24:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 10:24:21,175 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-09-28 10:24:21,175 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 10:24:21,175 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-28 10:24:21,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-28 10:24:21,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-28 10:24:21,176 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-28 10:24:21,176 INFO L87 Difference]: Start difference. First operand 323 states and 408 transitions. Second operand 3 states. [2018-09-28 10:24:21,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 10:24:21,308 INFO L93 Difference]: Finished difference Result 566 states and 704 transitions. [2018-09-28 10:24:21,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-28 10:24:21,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2018-09-28 10:24:21,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 10:24:21,309 INFO L225 Difference]: With dead ends: 566 [2018-09-28 10:24:21,309 INFO L226 Difference]: Without dead ends: 0 [2018-09-28 10:24:21,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-28 10:24:21,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-28 10:24:21,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-28 10:24:21,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-28 10:24:21,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-28 10:24:21,310 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2018-09-28 10:24:21,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 10:24:21,310 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-28 10:24:21,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-28 10:24:21,310 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-28 10:24:21,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-28 10:24:21,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-28 10:24:21,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:24:21,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:24:21,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:24:21,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:24:22,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:24:22,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:24:22,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:24:22,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:24:22,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:24:22,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:24:22,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:24:22,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:24:22,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-28 10:24:23,265 WARN L178 SmtUtils]: Spent 1.94 s on a formula simplification. DAG size of input: 547 DAG size of output: 474 [2018-09-28 10:24:27,993 WARN L178 SmtUtils]: Spent 4.72 s on a formula simplification. DAG size of input: 457 DAG size of output: 114 [2018-09-28 10:24:27,997 INFO L426 ceAbstractionStarter]: For program point L168(lines 168 183) no Hoare annotation was computed. [2018-09-28 10:24:27,998 INFO L426 ceAbstractionStarter]: For program point L135(lines 135 142) no Hoare annotation was computed. [2018-09-28 10:24:27,998 INFO L426 ceAbstractionStarter]: For program point L135-2(lines 111 160) no Hoare annotation was computed. [2018-09-28 10:24:27,998 INFO L426 ceAbstractionStarter]: For program point L94(lines 94 108) no Hoare annotation was computed. [2018-09-28 10:24:27,998 INFO L426 ceAbstractionStarter]: For program point L152(lines 152 160) no Hoare annotation was computed. [2018-09-28 10:24:27,998 INFO L426 ceAbstractionStarter]: For program point L103(lines 103 108) no Hoare annotation was computed. [2018-09-28 10:24:27,998 INFO L426 ceAbstractionStarter]: For program point L103-2(lines 89 142) no Hoare annotation was computed. [2018-09-28 10:24:27,998 INFO L426 ceAbstractionStarter]: For program point L178(lines 178 183) no Hoare annotation was computed. [2018-09-28 10:24:27,998 INFO L426 ceAbstractionStarter]: For program point L178-2(lines 163 183) no Hoare annotation was computed. [2018-09-28 10:24:27,998 INFO L426 ceAbstractionStarter]: For program point L129(lines 129 142) no Hoare annotation was computed. [2018-09-28 10:24:27,999 INFO L426 ceAbstractionStarter]: For program point L96(lines 96 108) no Hoare annotation was computed. [2018-09-28 10:24:27,999 INFO L426 ceAbstractionStarter]: For program point L80(lines 80 82) no Hoare annotation was computed. [2018-09-28 10:24:27,999 INFO L426 ceAbstractionStarter]: For program point L80-2(lines 80 85) no Hoare annotation was computed. [2018-09-28 10:24:27,999 INFO L426 ceAbstractionStarter]: For program point L171(lines 171 183) no Hoare annotation was computed. [2018-09-28 10:24:27,999 INFO L426 ceAbstractionStarter]: For program point L155(lines 155 160) no Hoare annotation was computed. [2018-09-28 10:24:27,999 INFO L426 ceAbstractionStarter]: For program point L155-2(lines 145 183) no Hoare annotation was computed. [2018-09-28 10:24:28,000 INFO L422 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-09-28 10:24:28,000 INFO L426 ceAbstractionStarter]: For program point L123(lines 123 142) no Hoare annotation was computed. [2018-09-28 10:24:28,000 INFO L426 ceAbstractionStarter]: For program point L165(lines 165 183) no Hoare annotation was computed. [2018-09-28 10:24:28,000 INFO L426 ceAbstractionStarter]: For program point L99(lines 99 108) no Hoare annotation was computed. [2018-09-28 10:24:28,000 INFO L426 ceAbstractionStarter]: For program point ElevatorEXIT(lines 13 188) no Hoare annotation was computed. [2018-09-28 10:24:28,000 INFO L426 ceAbstractionStarter]: For program point L91(lines 91 108) no Hoare annotation was computed. [2018-09-28 10:24:28,001 INFO L426 ceAbstractionStarter]: For program point L149(lines 149 160) no Hoare annotation was computed. [2018-09-28 10:24:28,001 INFO L426 ceAbstractionStarter]: For program point L116(lines 116 142) no Hoare annotation was computed. [2018-09-28 10:24:28,001 INFO L426 ceAbstractionStarter]: For program point L83-1(lines 83 108) no Hoare annotation was computed. [2018-09-28 10:24:28,001 INFO L426 ceAbstractionStarter]: For program point ElevatorENTRY(lines 13 188) no Hoare annotation was computed. [2018-09-28 10:24:28,001 INFO L426 ceAbstractionStarter]: For program point L175(lines 175 183) no Hoare annotation was computed. [2018-09-28 10:24:28,001 INFO L426 ceAbstractionStarter]: For program point ElevatorErr0ASSERT_VIOLATIONASSERT(line 185) no Hoare annotation was computed. [2018-09-28 10:24:28,001 INFO L426 ceAbstractionStarter]: For program point L101(lines 101 108) no Hoare annotation was computed. [2018-09-28 10:24:28,020 INFO L202 PluginConnector]: Adding new model Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.09 10:24:28 BoogieIcfgContainer [2018-09-28 10:24:28,020 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-28 10:24:28,021 INFO L168 Benchmark]: Toolchain (without parser) took 37496.40 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 373.8 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 79.8 MB). Peak memory consumption was 842.3 MB. Max. memory is 7.1 GB. [2018-09-28 10:24:28,022 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-28 10:24:28,023 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-28 10:24:28,024 INFO L168 Benchmark]: Boogie Preprocessor took 55.97 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-28 10:24:28,024 INFO L168 Benchmark]: RCFGBuilder took 671.38 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-28 10:24:28,026 INFO L168 Benchmark]: TraceAbstraction took 36715.29 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 373.8 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 48.1 MB). Peak memory consumption was 810.6 MB. Max. memory is 7.1 GB. [2018-09-28 10:24:28,031 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.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.97 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 671.38 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 36715.29 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 373.8 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 48.1 MB). Peak memory consumption was 810.6 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, 36.6s OverallTime, 18 OverallIterations, 6 TraceHistogramMax, 23.0s AutomataDifference, 0.0s DeadEndRemovalTime, 6.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 1068 SDtfs, 1929 SDslu, 3010 SDs, 0 SdLazy, 2071 SolverSat, 241 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 410 GetRequests, 271 SyntacticMatches, 5 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s 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, 1.9s HoareSimplificationTime, 1 FomulaSimplificationsInter, 351775 FormulaSimplificationTreeSizeReductionInter, 4.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 1161 NumberOfCodeBlocks, 1161 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1139 ConstructedInterpolants, 0 QuantifiedInterpolants, 621580 SizeOfPredicates, 23 NumberOfNonLiveVariables, 862 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 22 InterpolantComputations, 15 PerfectInterpolantSequences, 1291/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-09-28_10-24-28-049.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-09-28_10-24-28-049.csv Received shutdown request...