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-2eb0a67 [2018-10-03 09:02:55,348 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-03 09:02:55,350 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-03 09:02:55,362 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-03 09:02:55,362 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-03 09:02:55,363 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-03 09:02:55,365 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-03 09:02:55,367 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-03 09:02:55,368 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-03 09:02:55,369 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-03 09:02:55,370 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-03 09:02:55,371 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-03 09:02:55,372 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-03 09:02:55,373 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-03 09:02:55,374 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-03 09:02:55,374 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-03 09:02:55,375 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-03 09:02:55,377 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-03 09:02:55,379 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-03 09:02:55,381 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-03 09:02:55,382 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-03 09:02:55,384 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-03 09:02:55,386 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-03 09:02:55,386 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-03 09:02:55,387 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-03 09:02:55,388 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-03 09:02:55,389 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-03 09:02:55,390 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-03 09:02:55,391 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-03 09:02:55,392 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-03 09:02:55,392 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-03 09:02:55,393 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-03 09:02:55,393 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-03 09:02:55,393 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-03 09:02:55,394 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-03 09:02:55,395 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-03 09:02:55,395 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-03 09:02:55,424 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-03 09:02:55,425 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-03 09:02:55,425 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-03 09:02:55,426 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-03 09:02:55,426 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-03 09:02:55,426 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-03 09:02:55,427 INFO L133 SettingsManager]: * Use SBE=true [2018-10-03 09:02:55,427 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-03 09:02:55,427 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-03 09:02:55,427 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-03 09:02:55,428 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-03 09:02:55,429 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-03 09:02:55,429 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-03 09:02:55,429 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-03 09:02:55,429 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-03 09:02:55,429 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-03 09:02:55,430 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-03 09:02:55,430 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-03 09:02:55,430 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-03 09:02:55,430 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-03 09:02:55,430 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-03 09:02:55,432 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-03 09:02:55,432 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-03 09:02:55,432 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-03 09:02:55,432 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-03 09:02:55,433 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-03 09:02:55,433 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-03 09:02:55,433 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-03 09:02:55,433 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-03 09:02:55,434 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-03 09:02:55,435 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-03 09:02:55,493 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-03 09:02:55,507 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-03 09:02:55,511 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-03 09:02:55,513 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-03 09:02:55,514 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-03 09:02:55,515 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator-Integer.bpl [2018-10-03 09:02:55,515 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator-Integer.bpl' [2018-10-03 09:02:55,600 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-03 09:02:55,606 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-03 09:02:55,607 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-03 09:02:55,608 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-03 09:02:55,608 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-03 09:02:55,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:02:55" (1/1) ... [2018-10-03 09:02:55,652 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:02:55" (1/1) ... [2018-10-03 09:02:55,657 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-03 09:02:55,658 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-03 09:02:55,658 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-03 09:02:55,660 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-03 09:02:55,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-03 09:02:55,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-03 09:02:55,662 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-03 09:02:55,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:02:55" (1/1) ... [2018-10-03 09:02:55,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:02:55" (1/1) ... [2018-10-03 09:02:55,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:02:55" (1/1) ... [2018-10-03 09:02:55,682 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:02:55" (1/1) ... [2018-10-03 09:02:55,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:02:55" (1/1) ... [2018-10-03 09:02:55,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:02:55" (1/1) ... [2018-10-03 09:02:55,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:02:55" (1/1) ... [2018-10-03 09:02:55,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-03 09:02:55,722 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-03 09:02:55,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-03 09:02:55,722 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-03 09:02:55,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:02:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-03 09:02:55,820 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Elevator given in one single declaration [2018-10-03 09:02:55,820 INFO L130 BoogieDeclarations]: Found specification of procedure Elevator [2018-10-03 09:02:55,820 INFO L138 BoogieDeclarations]: Found implementation of procedure Elevator [2018-10-03 09:02:56,413 INFO L337 CfgBuilder]: Using library mode [2018-10-03 09:02:56,413 INFO L202 PluginConnector]: Adding new model Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 09:02:56 BoogieIcfgContainer [2018-10-03 09:02:56,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-03 09:02:56,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-03 09:02:56,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-03 09:02:56,418 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-03 09:02:56,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:02:55" (1/2) ... [2018-10-03 09:02:56,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a517e5 and model type Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 09:02:56, skipping insertion in model container [2018-10-03 09:02:56,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 09:02:56" (2/2) ... [2018-10-03 09:02:56,423 INFO L112 eAbstractionObserver]: Analyzing ICFG Elevator-Integer.bpl [2018-10-03 09:02:56,432 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-03 09:02:56,444 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-03 09:02:56,498 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-03 09:02:56,499 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-03 09:02:56,499 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-03 09:02:56,499 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-03 09:02:56,500 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-03 09:02:56,500 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-03 09:02:56,500 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-03 09:02:56,500 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-03 09:02:56,500 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-03 09:02:56,518 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-10-03 09:02:56,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-03 09:02:56,525 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:02:56,526 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:02:56,527 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:02:56,534 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:02:56,535 INFO L82 PathProgramCache]: Analyzing trace with hash 493797215, now seen corresponding path program 1 times [2018-10-03 09:02:56,537 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:02:56,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:02:56,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:56,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:02:56,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:02:56,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:02:56,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:02:56,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 09:02:56,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:02:56,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:02:56,830 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:02:56,832 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2018-10-03 09:02:56,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:02:56,977 INFO L93 Difference]: Finished difference Result 85 states and 157 transitions. [2018-10-03 09:02:56,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:02:56,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-10-03 09:02:56,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:02:56,995 INFO L225 Difference]: With dead ends: 85 [2018-10-03 09:02:56,996 INFO L226 Difference]: Without dead ends: 53 [2018-10-03 09:02:56,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:02:57,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-03 09:02:57,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-10-03 09:02:57,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-03 09:02:57,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 90 transitions. [2018-10-03 09:02:57,045 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 90 transitions. Word has length 9 [2018-10-03 09:02:57,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:02:57,045 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 90 transitions. [2018-10-03 09:02:57,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:02:57,046 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 90 transitions. [2018-10-03 09:02:57,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-03 09:02:57,046 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:02:57,047 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:02:57,047 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:02:57,047 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:02:57,047 INFO L82 PathProgramCache]: Analyzing trace with hash -2026162719, now seen corresponding path program 1 times [2018-10-03 09:02:57,048 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:02:57,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:02:57,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:57,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:02:57,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:02:57,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:02:57,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:02:57,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 09:02:57,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:02:57,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:02:57,102 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:02:57,103 INFO L87 Difference]: Start difference. First operand 52 states and 90 transitions. Second operand 3 states. [2018-10-03 09:02:57,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:02:57,266 INFO L93 Difference]: Finished difference Result 154 states and 268 transitions. [2018-10-03 09:02:57,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:02:57,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-10-03 09:02:57,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:02:57,274 INFO L225 Difference]: With dead ends: 154 [2018-10-03 09:02:57,275 INFO L226 Difference]: Without dead ends: 95 [2018-10-03 09:02:57,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:02:57,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-03 09:02:57,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-10-03 09:02:57,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-03 09:02:57,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 161 transitions. [2018-10-03 09:02:57,297 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 161 transitions. Word has length 9 [2018-10-03 09:02:57,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:02:57,298 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 161 transitions. [2018-10-03 09:02:57,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:02:57,298 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 161 transitions. [2018-10-03 09:02:57,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-03 09:02:57,299 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:02:57,299 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:02:57,300 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:02:57,300 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:02:57,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1968904417, now seen corresponding path program 1 times [2018-10-03 09:02:57,300 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:02:57,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:02:57,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:57,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:02:57,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:02:57,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:02:57,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:02:57,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:02:57,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:02:57,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:02:57,424 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:02:57,425 INFO L87 Difference]: Start difference. First operand 94 states and 161 transitions. Second operand 3 states. [2018-10-03 09:02:57,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:02:57,676 INFO L93 Difference]: Finished difference Result 233 states and 398 transitions. [2018-10-03 09:02:57,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:02:57,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-10-03 09:02:57,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:02:57,678 INFO L225 Difference]: With dead ends: 233 [2018-10-03 09:02:57,679 INFO L226 Difference]: Without dead ends: 136 [2018-10-03 09:02:57,680 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:02:57,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-10-03 09:02:57,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 114. [2018-10-03 09:02:57,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-03 09:02:57,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 193 transitions. [2018-10-03 09:02:57,694 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 193 transitions. Word has length 9 [2018-10-03 09:02:57,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:02:57,698 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 193 transitions. [2018-10-03 09:02:57,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:02:57,698 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 193 transitions. [2018-10-03 09:02:57,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-03 09:02:57,699 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:02:57,699 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:02:57,700 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:02:57,700 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:02:57,700 INFO L82 PathProgramCache]: Analyzing trace with hash -906451345, now seen corresponding path program 1 times [2018-10-03 09:02:57,700 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:02:57,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:02:57,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:57,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:02:57,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:02:57,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:02:57,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:02:57,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 09:02:57,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-03 09:02:57,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-03 09:02:57,831 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:02:57,831 INFO L87 Difference]: Start difference. First operand 114 states and 193 transitions. Second operand 4 states. [2018-10-03 09:02:58,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:02:58,056 INFO L93 Difference]: Finished difference Result 144 states and 242 transitions. [2018-10-03 09:02:58,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-03 09:02:58,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-10-03 09:02:58,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:02:58,061 INFO L225 Difference]: With dead ends: 144 [2018-10-03 09:02:58,062 INFO L226 Difference]: Without dead ends: 143 [2018-10-03 09:02:58,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 3 [2018-10-03 09:02:58,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-03 09:02:58,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2018-10-03 09:02:58,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-10-03 09:02:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 237 transitions. [2018-10-03 09:02:58,086 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 237 transitions. Word has length 10 [2018-10-03 09:02:58,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:02:58,086 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 237 transitions. [2018-10-03 09:02:58,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-03 09:02:58,087 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 237 transitions. [2018-10-03 09:02:58,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-03 09:02:58,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:02:58,088 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:02:58,089 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:02:58,089 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:02:58,089 INFO L82 PathProgramCache]: Analyzing trace with hash -464230043, now seen corresponding path program 1 times [2018-10-03 09:02:58,089 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:02:58,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:02:58,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:58,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:02:58,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:02:58,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:02:58,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:02:58,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-03 09:02:58,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-03 09:02:58,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-03 09:02:58,168 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:02:58,169 INFO L87 Difference]: Start difference. First operand 142 states and 237 transitions. Second operand 5 states. [2018-10-03 09:02:58,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:02:58,542 INFO L93 Difference]: Finished difference Result 459 states and 761 transitions. [2018-10-03 09:02:58,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-03 09:02:58,544 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-10-03 09:02:58,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:02:58,547 INFO L225 Difference]: With dead ends: 459 [2018-10-03 09:02:58,547 INFO L226 Difference]: Without dead ends: 286 [2018-10-03 09:02:58,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 3 [2018-10-03 09:02:58,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-03 09:02:58,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2018-10-03 09:02:58,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-10-03 09:02:58,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 461 transitions. [2018-10-03 09:02:58,597 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 461 transitions. Word has length 18 [2018-10-03 09:02:58,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:02:58,597 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 461 transitions. [2018-10-03 09:02:58,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-03 09:02:58,598 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 461 transitions. [2018-10-03 09:02:58,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-03 09:02:58,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:02:58,600 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:02:58,600 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:02:58,604 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:02:58,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1761001012, now seen corresponding path program 1 times [2018-10-03 09:02:58,605 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:02:58,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:02:58,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:58,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:02:58,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:02:58,665 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-03 09:02:58,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:02:58,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:02:58,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:02:58,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:02:58,667 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:02:58,667 INFO L87 Difference]: Start difference. First operand 286 states and 461 transitions. Second operand 3 states. [2018-10-03 09:02:58,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:02:58,910 INFO L93 Difference]: Finished difference Result 695 states and 1105 transitions. [2018-10-03 09:02:58,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:02:58,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-10-03 09:02:58,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:02:58,915 INFO L225 Difference]: With dead ends: 695 [2018-10-03 09:02:58,915 INFO L226 Difference]: Without dead ends: 402 [2018-10-03 09:02:58,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:02:58,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-10-03 09:02:58,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 294. [2018-10-03 09:02:58,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-10-03 09:02:58,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 469 transitions. [2018-10-03 09:02:58,947 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 469 transitions. Word has length 40 [2018-10-03 09:02:58,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:02:58,947 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 469 transitions. [2018-10-03 09:02:58,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:02:58,947 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 469 transitions. [2018-10-03 09:02:58,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-03 09:02:58,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:02:58,955 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:02:58,955 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:02:58,955 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:02:58,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1151060372, now seen corresponding path program 1 times [2018-10-03 09:02:58,956 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:02:58,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:02:58,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:58,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:02:58,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:02:59,059 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-03 09:02:59,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:02:59,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:02:59,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:02:59,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:02:59,061 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:02:59,061 INFO L87 Difference]: Start difference. First operand 294 states and 469 transitions. Second operand 3 states. [2018-10-03 09:02:59,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:02:59,286 INFO L93 Difference]: Finished difference Result 711 states and 1121 transitions. [2018-10-03 09:02:59,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:02:59,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-03 09:02:59,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:02:59,292 INFO L225 Difference]: With dead ends: 711 [2018-10-03 09:02:59,292 INFO L226 Difference]: Without dead ends: 414 [2018-10-03 09:02:59,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:02:59,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-10-03 09:02:59,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 306. [2018-10-03 09:02:59,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-10-03 09:02:59,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 481 transitions. [2018-10-03 09:02:59,307 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 481 transitions. Word has length 41 [2018-10-03 09:02:59,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:02:59,308 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 481 transitions. [2018-10-03 09:02:59,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:02:59,308 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 481 transitions. [2018-10-03 09:02:59,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-03 09:02:59,310 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:02:59,310 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:02:59,310 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:02:59,311 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:02:59,311 INFO L82 PathProgramCache]: Analyzing trace with hash 221883911, now seen corresponding path program 1 times [2018-10-03 09:02:59,311 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:02:59,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:02:59,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:59,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:02:59,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:02:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:02:59,480 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-03 09:02:59,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:02:59,481 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:02:59,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:02:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:02:59,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:02:59,715 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-03 09:02:59,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-03 09:02:59,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-03 09:02:59,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-03 09:02:59,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-03 09:02:59,748 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:02:59,748 INFO L87 Difference]: Start difference. First operand 306 states and 481 transitions. Second operand 7 states. [2018-10-03 09:03:00,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:00,195 INFO L93 Difference]: Finished difference Result 834 states and 1286 transitions. [2018-10-03 09:03:00,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-03 09:03:00,197 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-10-03 09:03:00,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:00,200 INFO L225 Difference]: With dead ends: 834 [2018-10-03 09:03:00,200 INFO L226 Difference]: Without dead ends: 523 [2018-10-03 09:03:00,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 8 [2018-10-03 09:03:00,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-10-03 09:03:00,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 432. [2018-10-03 09:03:00,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-10-03 09:03:00,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 649 transitions. [2018-10-03 09:03:00,223 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 649 transitions. Word has length 43 [2018-10-03 09:03:00,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:00,223 INFO L480 AbstractCegarLoop]: Abstraction has 432 states and 649 transitions. [2018-10-03 09:03:00,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-03 09:03:00,223 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 649 transitions. [2018-10-03 09:03:00,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-03 09:03:00,225 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:00,226 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:00,226 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:00,226 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:00,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1437736339, now seen corresponding path program 1 times [2018-10-03 09:03:00,226 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:00,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:00,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:00,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:00,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:00,357 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-03 09:03:00,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:03:00,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:03:00,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:03:00,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:03:00,359 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:00,360 INFO L87 Difference]: Start difference. First operand 432 states and 649 transitions. Second operand 3 states. [2018-10-03 09:03:00,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:00,722 INFO L93 Difference]: Finished difference Result 1110 states and 1680 transitions. [2018-10-03 09:03:00,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:03:00,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-10-03 09:03:00,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:00,732 INFO L225 Difference]: With dead ends: 1110 [2018-10-03 09:03:00,732 INFO L226 Difference]: Without dead ends: 657 [2018-10-03 09:03:00,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:03:00,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2018-10-03 09:03:00,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 654. [2018-10-03 09:03:00,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-10-03 09:03:00,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 980 transitions. [2018-10-03 09:03:00,761 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 980 transitions. Word has length 45 [2018-10-03 09:03:00,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:00,762 INFO L480 AbstractCegarLoop]: Abstraction has 654 states and 980 transitions. [2018-10-03 09:03:00,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:03:00,762 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 980 transitions. [2018-10-03 09:03:00,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-03 09:03:00,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:00,764 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:00,764 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:00,766 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:00,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1460368593, now seen corresponding path program 1 times [2018-10-03 09:03:00,767 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:00,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:00,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:00,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:00,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:00,870 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 09:03:00,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:03:00,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:03:00,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:03:00,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:03:00,872 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:00,872 INFO L87 Difference]: Start difference. First operand 654 states and 980 transitions. Second operand 3 states. [2018-10-03 09:03:01,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:01,069 INFO L93 Difference]: Finished difference Result 1308 states and 1959 transitions. [2018-10-03 09:03:01,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:03:01,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-10-03 09:03:01,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:01,074 INFO L225 Difference]: With dead ends: 1308 [2018-10-03 09:03:01,075 INFO L226 Difference]: Without dead ends: 655 [2018-10-03 09:03:01,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:03:01,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2018-10-03 09:03:01,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 654. [2018-10-03 09:03:01,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-10-03 09:03:01,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 924 transitions. [2018-10-03 09:03:01,103 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 924 transitions. Word has length 45 [2018-10-03 09:03:01,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:01,104 INFO L480 AbstractCegarLoop]: Abstraction has 654 states and 924 transitions. [2018-10-03 09:03:01,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:03:01,104 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 924 transitions. [2018-10-03 09:03:01,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-03 09:03:01,105 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:01,105 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:01,106 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:01,106 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:01,106 INFO L82 PathProgramCache]: Analyzing trace with hash -477421396, now seen corresponding path program 1 times [2018-10-03 09:03:01,106 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:01,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:01,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:01,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:01,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:01,503 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:01,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:03:01,504 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:03:01,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:01,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:03:03,180 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:03,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:03:03,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-10-03 09:03:03,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-03 09:03:03,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-03 09:03:03,208 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:03,208 INFO L87 Difference]: Start difference. First operand 654 states and 924 transitions. Second operand 16 states. [2018-10-03 09:03:05,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:05,652 INFO L93 Difference]: Finished difference Result 2731 states and 3833 transitions. [2018-10-03 09:03:05,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-03 09:03:05,652 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 48 [2018-10-03 09:03:05,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:05,663 INFO L225 Difference]: With dead ends: 2731 [2018-10-03 09:03:05,663 INFO L226 Difference]: Without dead ends: 2018 [2018-10-03 09:03:05,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s Time 1.3s impTime 21 [2018-10-03 09:03:05,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2018-10-03 09:03:05,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 916. [2018-10-03 09:03:05,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-10-03 09:03:05,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1353 transitions. [2018-10-03 09:03:05,725 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1353 transitions. Word has length 48 [2018-10-03 09:03:05,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:05,725 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 1353 transitions. [2018-10-03 09:03:05,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-03 09:03:05,725 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1353 transitions. [2018-10-03 09:03:05,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-03 09:03:05,728 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:05,728 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:05,729 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:05,729 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:05,729 INFO L82 PathProgramCache]: Analyzing trace with hash -253604652, now seen corresponding path program 1 times [2018-10-03 09:03:05,729 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:05,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:05,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:05,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:05,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:05,858 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-03 09:03:05,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:03:05,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-03 09:03:05,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-03 09:03:05,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-03 09:03:05,859 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:05,859 INFO L87 Difference]: Start difference. First operand 916 states and 1353 transitions. Second operand 4 states. [2018-10-03 09:03:05,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:05,969 INFO L93 Difference]: Finished difference Result 1832 states and 2705 transitions. [2018-10-03 09:03:05,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:03:05,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-10-03 09:03:05,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:05,978 INFO L225 Difference]: With dead ends: 1832 [2018-10-03 09:03:05,978 INFO L226 Difference]: Without dead ends: 917 [2018-10-03 09:03:05,979 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 2 [2018-10-03 09:03:05,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-10-03 09:03:06,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 914. [2018-10-03 09:03:06,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2018-10-03 09:03:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1297 transitions. [2018-10-03 09:03:06,025 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1297 transitions. Word has length 67 [2018-10-03 09:03:06,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:06,026 INFO L480 AbstractCegarLoop]: Abstraction has 914 states and 1297 transitions. [2018-10-03 09:03:06,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-03 09:03:06,026 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1297 transitions. [2018-10-03 09:03:06,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-03 09:03:06,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:06,028 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:06,028 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:06,028 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:06,028 INFO L82 PathProgramCache]: Analyzing trace with hash 597366310, now seen corresponding path program 2 times [2018-10-03 09:03:06,028 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:06,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:06,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:06,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:06,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:06,106 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-03 09:03:06,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:03:06,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:03:06,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:03:06,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:03:06,107 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:06,107 INFO L87 Difference]: Start difference. First operand 914 states and 1297 transitions. Second operand 3 states. [2018-10-03 09:03:06,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:06,232 INFO L93 Difference]: Finished difference Result 1833 states and 2596 transitions. [2018-10-03 09:03:06,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:03:06,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-10-03 09:03:06,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:06,238 INFO L225 Difference]: With dead ends: 1833 [2018-10-03 09:03:06,238 INFO L226 Difference]: Without dead ends: 852 [2018-10-03 09:03:06,240 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:03:06,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2018-10-03 09:03:06,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 827. [2018-10-03 09:03:06,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2018-10-03 09:03:06,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1131 transitions. [2018-10-03 09:03:06,288 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1131 transitions. Word has length 68 [2018-10-03 09:03:06,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:06,289 INFO L480 AbstractCegarLoop]: Abstraction has 827 states and 1131 transitions. [2018-10-03 09:03:06,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:03:06,289 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1131 transitions. [2018-10-03 09:03:06,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-03 09:03:06,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:06,292 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:06,292 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:06,293 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:06,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1297357211, now seen corresponding path program 1 times [2018-10-03 09:03:06,293 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:06,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:06,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:06,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:03:06,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:06,852 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 27 proven. 101 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-03 09:03:06,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:03:06,852 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:03:06,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:06,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:03:07,802 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 109 proven. 19 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-03 09:03:07,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:03:07,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 27 [2018-10-03 09:03:07,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-03 09:03:07,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-03 09:03:07,824 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:07,824 INFO L87 Difference]: Start difference. First operand 827 states and 1131 transitions. Second operand 28 states. [2018-10-03 09:03:11,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:11,512 INFO L93 Difference]: Finished difference Result 2306 states and 2951 transitions. [2018-10-03 09:03:11,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-03 09:03:11,512 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 84 [2018-10-03 09:03:11,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:11,521 INFO L225 Difference]: With dead ends: 2306 [2018-10-03 09:03:11,521 INFO L226 Difference]: Without dead ends: 2305 [2018-10-03 09:03:11,522 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s Time 1.7s impTime 32 [2018-10-03 09:03:11,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2018-10-03 09:03:11,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 951. [2018-10-03 09:03:11,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2018-10-03 09:03:11,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1304 transitions. [2018-10-03 09:03:11,603 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1304 transitions. Word has length 84 [2018-10-03 09:03:11,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:11,603 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 1304 transitions. [2018-10-03 09:03:11,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-03 09:03:11,603 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1304 transitions. [2018-10-03 09:03:11,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-03 09:03:11,605 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:11,605 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:11,606 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:11,606 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:11,606 INFO L82 PathProgramCache]: Analyzing trace with hash -604514526, now seen corresponding path program 1 times [2018-10-03 09:03:11,606 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:11,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:11,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:11,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:11,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:11,736 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-10-03 09:03:11,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:03:11,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:03:11,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:03:11,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:03:11,737 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:11,737 INFO L87 Difference]: Start difference. First operand 951 states and 1304 transitions. Second operand 3 states. [2018-10-03 09:03:11,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:11,826 INFO L93 Difference]: Finished difference Result 1902 states and 2607 transitions. [2018-10-03 09:03:11,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:03:11,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-10-03 09:03:11,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:11,830 INFO L225 Difference]: With dead ends: 1902 [2018-10-03 09:03:11,830 INFO L226 Difference]: Without dead ends: 952 [2018-10-03 09:03:11,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:03:11,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2018-10-03 09:03:11,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 896. [2018-10-03 09:03:11,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-10-03 09:03:11,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1202 transitions. [2018-10-03 09:03:11,897 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1202 transitions. Word has length 85 [2018-10-03 09:03:11,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:11,897 INFO L480 AbstractCegarLoop]: Abstraction has 896 states and 1202 transitions. [2018-10-03 09:03:11,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:03:11,898 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1202 transitions. [2018-10-03 09:03:11,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-03 09:03:11,900 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:11,900 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:11,900 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:11,900 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:11,900 INFO L82 PathProgramCache]: Analyzing trace with hash 722130188, now seen corresponding path program 1 times [2018-10-03 09:03:11,900 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:11,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:11,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:11,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:11,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:11,990 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-03 09:03:11,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:03:11,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:03:11,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:03:11,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:03:11,991 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:11,991 INFO L87 Difference]: Start difference. First operand 896 states and 1202 transitions. Second operand 3 states. [2018-10-03 09:03:12,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:12,135 INFO L93 Difference]: Finished difference Result 1560 states and 2084 transitions. [2018-10-03 09:03:12,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:03:12,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-10-03 09:03:12,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:12,138 INFO L225 Difference]: With dead ends: 1560 [2018-10-03 09:03:12,138 INFO L226 Difference]: Without dead ends: 640 [2018-10-03 09:03:12,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:03:12,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-10-03 09:03:12,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 554. [2018-10-03 09:03:12,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-10-03 09:03:12,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 719 transitions. [2018-10-03 09:03:12,180 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 719 transitions. Word has length 87 [2018-10-03 09:03:12,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:12,181 INFO L480 AbstractCegarLoop]: Abstraction has 554 states and 719 transitions. [2018-10-03 09:03:12,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:03:12,181 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 719 transitions. [2018-10-03 09:03:12,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-03 09:03:12,182 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:12,183 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:12,183 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:12,183 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:12,183 INFO L82 PathProgramCache]: Analyzing trace with hash 818701568, now seen corresponding path program 1 times [2018-10-03 09:03:12,183 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:12,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:12,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:12,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:12,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:12,458 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 104 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-03 09:03:12,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:03:12,459 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:03:12,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:12,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:03:12,595 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 104 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-03 09:03:12,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:03:12,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-10-03 09:03:12,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-03 09:03:12,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-03 09:03:12,618 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:12,618 INFO L87 Difference]: Start difference. First operand 554 states and 719 transitions. Second operand 7 states. [2018-10-03 09:03:12,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:12,779 INFO L93 Difference]: Finished difference Result 1394 states and 1802 transitions. [2018-10-03 09:03:12,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-03 09:03:12,780 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-10-03 09:03:12,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:12,783 INFO L225 Difference]: With dead ends: 1394 [2018-10-03 09:03:12,783 INFO L226 Difference]: Without dead ends: 724 [2018-10-03 09:03:12,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 5 [2018-10-03 09:03:12,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2018-10-03 09:03:12,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 323. [2018-10-03 09:03:12,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-10-03 09:03:12,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 408 transitions. [2018-10-03 09:03:12,814 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 408 transitions. Word has length 89 [2018-10-03 09:03:12,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:12,814 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 408 transitions. [2018-10-03 09:03:12,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-03 09:03:12,814 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 408 transitions. [2018-10-03 09:03:12,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-03 09:03:12,816 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:12,816 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:12,816 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:12,816 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:12,816 INFO L82 PathProgramCache]: Analyzing trace with hash -199349933, now seen corresponding path program 2 times [2018-10-03 09:03:12,817 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:12,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:12,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:12,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:12,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:12,904 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-10-03 09:03:12,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:03:12,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:03:12,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:03:12,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:03:12,906 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:12,906 INFO L87 Difference]: Start difference. First operand 323 states and 408 transitions. Second operand 3 states. [2018-10-03 09:03:13,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:13,238 INFO L93 Difference]: Finished difference Result 566 states and 704 transitions. [2018-10-03 09:03:13,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:03:13,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2018-10-03 09:03:13,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:13,239 INFO L225 Difference]: With dead ends: 566 [2018-10-03 09:03:13,240 INFO L226 Difference]: Without dead ends: 0 [2018-10-03 09:03:13,240 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:03:13,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-03 09:03:13,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-03 09:03:13,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-03 09:03:13,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-03 09:03:13,241 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2018-10-03 09:03:13,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:13,241 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-03 09:03:13,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:03:13,242 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-03 09:03:13,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-03 09:03:13,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-03 09:03:13,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:03:13,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:03:13,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:03:13,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:03:14,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:03:14,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:03:14,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:03:14,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:03:14,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:03:14,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:03:14,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:03:14,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:03:14,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:03:15,468 WARN L178 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 547 DAG size of output: 474 [2018-10-03 09:03:20,154 WARN L178 SmtUtils]: Spent 4.67 s on a formula simplification. DAG size of input: 457 DAG size of output: 114 [2018-10-03 09:03:20,159 INFO L425 ceAbstractionStarter]: For program point L168(lines 168 183) no Hoare annotation was computed. [2018-10-03 09:03:20,159 INFO L425 ceAbstractionStarter]: For program point L135(lines 135 142) no Hoare annotation was computed. [2018-10-03 09:03:20,159 INFO L425 ceAbstractionStarter]: For program point L135-2(lines 111 160) no Hoare annotation was computed. [2018-10-03 09:03:20,160 INFO L425 ceAbstractionStarter]: For program point ElevatorErr0ASSERT_VIOLATIONASSERT(line 185) no Hoare annotation was computed. [2018-10-03 09:03:20,160 INFO L425 ceAbstractionStarter]: For program point L94(lines 94 108) no Hoare annotation was computed. [2018-10-03 09:03:20,160 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 160) no Hoare annotation was computed. [2018-10-03 09:03:20,160 INFO L425 ceAbstractionStarter]: For program point L103(lines 103 108) no Hoare annotation was computed. [2018-10-03 09:03:20,160 INFO L425 ceAbstractionStarter]: For program point L103-2(lines 89 142) no Hoare annotation was computed. [2018-10-03 09:03:20,160 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 183) no Hoare annotation was computed. [2018-10-03 09:03:20,160 INFO L425 ceAbstractionStarter]: For program point L178-2(lines 163 183) no Hoare annotation was computed. [2018-10-03 09:03:20,160 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 142) no Hoare annotation was computed. [2018-10-03 09:03:20,161 INFO L425 ceAbstractionStarter]: For program point L96(lines 96 108) no Hoare annotation was computed. [2018-10-03 09:03:20,161 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 82) no Hoare annotation was computed. [2018-10-03 09:03:20,161 INFO L425 ceAbstractionStarter]: For program point L80-2(lines 80 85) no Hoare annotation was computed. [2018-10-03 09:03:20,161 INFO L425 ceAbstractionStarter]: For program point L171(lines 171 183) no Hoare annotation was computed. [2018-10-03 09:03:20,161 INFO L425 ceAbstractionStarter]: For program point L155(lines 155 160) no Hoare annotation was computed. [2018-10-03 09:03:20,161 INFO L425 ceAbstractionStarter]: For program point L155-2(lines 145 183) no Hoare annotation was computed. [2018-10-03 09:03:20,162 INFO L421 ceAbstractionStarter]: At program point L48-1(lines 13 188) the Hoare annotation is: (let ((.cse30 (+ |Elevator_goal'| 1))) (let ((.cse9 (< |Elevator_current'| |Elevator_goal'|)) (.cse10 (<= .cse30 |Elevator_current'|)) (.cse1 (<= Elevator_c2 Elevator_c3)) (.cse13 (<= |Elevator_current'| Elevator_max)) (.cse15 (<= Elevator_min |Elevator_current'|)) (.cse29 (<= |Elevator_goal'| |Elevator_current'|)) (.cse32 (<= |Elevator_current'| |Elevator_goal'|))) (let ((.cse23 (not Elevator_passed)) (.cse26 (not (= |Elevator_current'| |Elevator_goal'|))) (.cse17 (not Elevator_newgoal)) (.cse24 (or (= (+ |Elevator_dir'| 1) 0) .cse32)) (.cse25 (or (= |Elevator_dir'| 1) .cse29)) (.cse7 (or (and .cse13 (<= (+ Elevator_min 1) |Elevator_current'|)) (and (<= (+ |Elevator_current'| 1) Elevator_max) .cse15))) (.cse14 (<= Elevator_qDC2 1)) (.cse22 (<= Elevator_qDC1 1)) (.cse2 (= Elevator_qDC2 3)) (.cse16 (= Elevator_qCSP 1)) (.cse0 (not Elevator_stop)) (.cse27 (or (<= Elevator_c2 2) .cse1)) (.cse3 (= Elevator_qDC1 2)) (.cse18 (or .cse9 .cse10)) (.cse19 (<= Elevator_qDC2 2)) (.cse4 (<= Elevator_min Elevator_current)) (.cse5 (<= Elevator_current Elevator_max)) (.cse21 (not (= Elevator_qCSP 3))) (.cse8 (<= |Elevator_goal'| Elevator_max)) (.cse20 (<= 2 Elevator_qDC2)) (.cse6 (<= Elevator_goal Elevator_max)) (.cse12 (<= Elevator_min Elevator_goal)) (.cse11 (<= Elevator_min |Elevator_goal'|))) (or (and .cse0 .cse1 .cse2 (and .cse3 (and .cse4 .cse5 .cse6 .cse7) (or (and .cse8 .cse9) .cse10) .cse11 .cse12)) (and .cse1 (and (and .cse13 .cse4 .cse5 .cse14 .cse15 .cse16) .cse3 .cse8 .cse11 .cse6 .cse12) .cse17) (and .cse0 (and (and .cse18 .cse19 .cse20 (and .cse13 .cse4 .cse5 .cse21 .cse15 .cse8 .cse6 .cse12 .cse22 .cse23)) .cse11)) (and (and .cse13 .cse4 .cse15 .cse8 .cse6 .cse2 .cse12 .cse0 .cse5 .cse1 .cse3 .cse11) .cse17) (and (and .cse0 (and .cse24 (and .cse19 .cse20 (and .cse13 .cse4 .cse5 .cse15 .cse8 .cse6 .cse12 .cse22 .cse23)) .cse25 .cse11 .cse26)) .cse17) (and (and .cse0 .cse27 (and .cse24 .cse3 .cse25 (and .cse13 .cse19 .cse4 .cse20 .cse15 .cse8 .cse6 .cse12 .cse5 .cse11) .cse26)) .cse17) (and (let ((.cse28 (let ((.cse31 (let ((.cse33 (and .cse16 (and .cse13 .cse14 .cse15 .cse22)))) (or (and .cse32 .cse33 .cse29) (and .cse8 .cse11 .cse6 .cse12 .cse33))))) (or (and .cse24 .cse25 .cse7 .cse31) (and .cse4 .cse5 .cse6 .cse12 .cse31))))) (or (and .cse5 .cse28) (and .cse28 (or (and (<= (+ |Elevator_current'| |Elevator_dir'| 2) Elevator_max) .cse29) (= |Elevator_goal'| |Elevator_current'|) (and (< |Elevator_current'| .cse30) (<= (+ Elevator_min 2) (+ |Elevator_current'| |Elevator_dir'|))))))) .cse1) (and .cse1 (and .cse13 .cse4 .cse15 .cse8 .cse6 .cse2 .cse12 .cse16 .cse0 .cse5 .cse3 .cse11)) (and .cse0 .cse27 (and .cse3 (and .cse18 .cse19 (and .cse13 .cse4 .cse5 .cse21 .cse15 .cse8) .cse20 .cse6 .cse12) .cse11)))))) [2018-10-03 09:03:20,162 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 142) no Hoare annotation was computed. [2018-10-03 09:03:20,162 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 183) no Hoare annotation was computed. [2018-10-03 09:03:20,162 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 108) no Hoare annotation was computed. [2018-10-03 09:03:20,162 INFO L425 ceAbstractionStarter]: For program point ElevatorEXIT(lines 13 188) no Hoare annotation was computed. [2018-10-03 09:03:20,162 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 108) no Hoare annotation was computed. [2018-10-03 09:03:20,162 INFO L425 ceAbstractionStarter]: For program point L149(lines 149 160) no Hoare annotation was computed. [2018-10-03 09:03:20,162 INFO L425 ceAbstractionStarter]: For program point L116(lines 116 142) no Hoare annotation was computed. [2018-10-03 09:03:20,163 INFO L425 ceAbstractionStarter]: For program point L83-1(lines 83 108) no Hoare annotation was computed. [2018-10-03 09:03:20,163 INFO L425 ceAbstractionStarter]: For program point ElevatorENTRY(lines 13 188) no Hoare annotation was computed. [2018-10-03 09:03:20,163 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 183) no Hoare annotation was computed. [2018-10-03 09:03:20,163 INFO L425 ceAbstractionStarter]: For program point L101(lines 101 108) no Hoare annotation was computed. [2018-10-03 09:03:20,183 INFO L202 PluginConnector]: Adding new model Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 09:03:20 BoogieIcfgContainer [2018-10-03 09:03:20,184 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-03 09:03:20,185 INFO L168 Benchmark]: Toolchain (without parser) took 24584.02 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 213.9 MB). Free memory was 1.5 GB in the beginning and 946.7 MB in the end (delta: 527.3 MB). Peak memory consumption was 742.7 MB. Max. memory is 7.1 GB. [2018-10-03 09:03:20,186 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 09:03:20,187 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 09:03:20,188 INFO L168 Benchmark]: Boogie Preprocessor took 60.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 09:03:20,189 INFO L168 Benchmark]: RCFGBuilder took 691.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-03 09:03:20,190 INFO L168 Benchmark]: TraceAbstraction took 23769.41 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 213.9 MB). Free memory was 1.4 GB in the beginning and 946.7 MB in the end (delta: 495.6 MB). Peak memory consumption was 711.0 MB. Max. memory is 7.1 GB. [2018-10-03 09:03:20,196 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.22 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 53.22 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 60.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 691.75 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 23769.41 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 213.9 MB). Free memory was 1.4 GB in the beginning and 946.7 MB in the end (delta: 495.6 MB). Peak memory consumption was 711.0 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, 23.6s OverallTime, 18 OverallIterations, 6 TraceHistogramMax, 9.8s AutomataDifference, 0.0s DeadEndRemovalTime, 6.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1068 SDtfs, 1922 SDslu, 2976 SDs, 0 SdLazy, 2047 SolverSat, 244 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 410 GetRequests, 272 SyntacticMatches, 5 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=951occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 3363 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 18 NumberOfFragments, 784 HoareAnnotationTreeSize, 1 FomulaSimplifications, 583815 FormulaSimplificationTreeSizeReduction, 2.2s HoareSimplificationTime, 1 FomulaSimplificationsInter, 351775 FormulaSimplificationTreeSizeReductionInter, 4.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s 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, 1300/1473 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Elevator-Integer.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-03_09-03-20-214.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Elevator-Integer.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-03_09-03-20-214.csv Received shutdown request...