java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/real-life/Elevator-Integer.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-00a8621 [2018-09-30 10:14:28,617 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:14:28,619 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:14:28,632 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:14:28,633 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:14:28,634 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:14:28,635 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:14:28,637 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:14:28,639 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:14:28,640 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:14:28,641 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:14:28,641 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:14:28,642 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:14:28,643 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:14:28,645 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:14:28,645 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:14:28,646 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:14:28,648 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:14:28,650 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:14:28,652 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:14:28,653 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:14:28,654 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:14:28,657 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:14:28,657 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:14:28,658 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:14:28,659 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:14:28,660 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:14:28,661 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:14:28,662 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:14:28,663 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:14:28,663 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:14:28,664 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:14:28,664 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:14:28,664 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:14:28,666 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:14:28,666 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:14:28,667 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-30 10:14:28,684 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:14:28,684 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:14:28,685 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:14:28,686 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:14:28,686 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:14:28,687 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:14:28,687 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:14:28,687 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:14:28,687 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:14:28,687 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:14:28,688 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:14:28,688 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:14:28,688 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:14:28,688 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:14:28,689 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:14:28,689 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:14:28,689 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:14:28,689 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:14:28,689 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:14:28,690 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:14:28,690 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:14:28,690 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:14:28,690 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:14:28,691 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:14:28,691 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:14:28,691 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:14:28,691 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:14:28,691 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:14:28,692 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:14:28,692 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:14:28,758 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:14:28,774 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:14:28,779 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:14:28,780 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:14:28,781 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:14:28,782 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator-Integer.bpl [2018-09-30 10:14:28,782 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator-Integer.bpl' [2018-09-30 10:14:28,866 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:14:28,869 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:14:28,871 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:14:28,872 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:14:28,872 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:14:28,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:28" (1/1) ... [2018-09-30 10:14:28,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:28" (1/1) ... [2018-09-30 10:14:28,915 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 10:14:28,915 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 10:14:28,915 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 10:14:28,918 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:14:28,919 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:14:28,919 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:14:28,919 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:14:28,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:28" (1/1) ... [2018-09-30 10:14:28,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:28" (1/1) ... [2018-09-30 10:14:28,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:28" (1/1) ... [2018-09-30 10:14:28,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:28" (1/1) ... [2018-09-30 10:14:28,949 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:28" (1/1) ... [2018-09-30 10:14:28,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:28" (1/1) ... [2018-09-30 10:14:28,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:28" (1/1) ... [2018-09-30 10:14:28,975 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:14:28,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:14:28,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:14:28,977 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:14:28,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:14:29,076 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Elevator given in one single declaration [2018-09-30 10:14:29,076 INFO L130 BoogieDeclarations]: Found specification of procedure Elevator [2018-09-30 10:14:29,076 INFO L138 BoogieDeclarations]: Found implementation of procedure Elevator [2018-09-30 10:14:29,619 INFO L345 CfgBuilder]: Using library mode [2018-09-30 10:14:29,619 INFO L202 PluginConnector]: Adding new model Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:14:29 BoogieIcfgContainer [2018-09-30 10:14:29,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:14:29,621 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:14:29,621 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:14:29,624 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:14:29,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:28" (1/2) ... [2018-09-30 10:14:29,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b70993 and model type Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:14:29, skipping insertion in model container [2018-09-30 10:14:29,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:14:29" (2/2) ... [2018-09-30 10:14:29,628 INFO L112 eAbstractionObserver]: Analyzing ICFG Elevator-Integer.bpl [2018-09-30 10:14:29,637 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:14:29,646 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 10:14:29,698 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:14:29,699 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:14:29,699 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:14:29,700 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:14:29,700 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:14:29,700 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:14:29,700 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:14:29,700 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:14:29,700 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:14:29,717 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-09-30 10:14:29,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 10:14:29,724 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:29,726 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:29,727 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:29,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:29,736 INFO L82 PathProgramCache]: Analyzing trace with hash 493797215, now seen corresponding path program 1 times [2018-09-30 10:14:29,738 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:29,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:29,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:29,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:29,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:29,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:29,926 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:29,927 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:14:29,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:14:29,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:14:29,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:29,945 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2018-09-30 10:14:30,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:30,077 INFO L93 Difference]: Finished difference Result 85 states and 157 transitions. [2018-09-30 10:14:30,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:14:30,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-09-30 10:14:30,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:30,097 INFO L225 Difference]: With dead ends: 85 [2018-09-30 10:14:30,098 INFO L226 Difference]: Without dead ends: 53 [2018-09-30 10:14:30,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:30,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-30 10:14:30,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-09-30 10:14:30,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-30 10:14:30,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 90 transitions. [2018-09-30 10:14:30,147 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 90 transitions. Word has length 9 [2018-09-30 10:14:30,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:30,148 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 90 transitions. [2018-09-30 10:14:30,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:14:30,148 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 90 transitions. [2018-09-30 10:14:30,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 10:14:30,149 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:30,149 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:30,149 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:30,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:30,150 INFO L82 PathProgramCache]: Analyzing trace with hash -2026162719, now seen corresponding path program 1 times [2018-09-30 10:14:30,150 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:30,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:30,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:30,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:30,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:30,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:30,197 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:30,197 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:14:30,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:14:30,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:14:30,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:30,200 INFO L87 Difference]: Start difference. First operand 52 states and 90 transitions. Second operand 3 states. [2018-09-30 10:14:30,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:30,399 INFO L93 Difference]: Finished difference Result 154 states and 268 transitions. [2018-09-30 10:14:30,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:14:30,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-09-30 10:14:30,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:30,402 INFO L225 Difference]: With dead ends: 154 [2018-09-30 10:14:30,402 INFO L226 Difference]: Without dead ends: 95 [2018-09-30 10:14:30,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:30,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-30 10:14:30,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-09-30 10:14:30,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-09-30 10:14:30,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 161 transitions. [2018-09-30 10:14:30,417 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 161 transitions. Word has length 9 [2018-09-30 10:14:30,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:30,418 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 161 transitions. [2018-09-30 10:14:30,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:14:30,418 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 161 transitions. [2018-09-30 10:14:30,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 10:14:30,419 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:30,419 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:30,419 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:30,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:30,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1968904417, now seen corresponding path program 1 times [2018-09-30 10:14:30,420 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:30,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:30,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:30,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:30,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:30,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:30,501 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:30,501 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:14:30,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:14:30,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:14:30,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:30,502 INFO L87 Difference]: Start difference. First operand 94 states and 161 transitions. Second operand 3 states. [2018-09-30 10:14:30,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:30,739 INFO L93 Difference]: Finished difference Result 233 states and 398 transitions. [2018-09-30 10:14:30,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:14:30,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-09-30 10:14:30,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:30,745 INFO L225 Difference]: With dead ends: 233 [2018-09-30 10:14:30,745 INFO L226 Difference]: Without dead ends: 136 [2018-09-30 10:14:30,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:30,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-09-30 10:14:30,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 114. [2018-09-30 10:14:30,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-09-30 10:14:30,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 193 transitions. [2018-09-30 10:14:30,778 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 193 transitions. Word has length 9 [2018-09-30 10:14:30,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:30,778 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 193 transitions. [2018-09-30 10:14:30,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:14:30,779 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 193 transitions. [2018-09-30 10:14:30,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 10:14:30,785 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:30,785 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:30,789 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:30,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:30,790 INFO L82 PathProgramCache]: Analyzing trace with hash -906451345, now seen corresponding path program 1 times [2018-09-30 10:14:30,790 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:30,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:30,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:30,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:30,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:30,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:30,881 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:30,881 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:14:30,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:14:30,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:14:30,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 10:14:30,882 INFO L87 Difference]: Start difference. First operand 114 states and 193 transitions. Second operand 4 states. [2018-09-30 10:14:31,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:31,102 INFO L93 Difference]: Finished difference Result 144 states and 242 transitions. [2018-09-30 10:14:31,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:14:31,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-09-30 10:14:31,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:31,108 INFO L225 Difference]: With dead ends: 144 [2018-09-30 10:14:31,108 INFO L226 Difference]: Without dead ends: 143 [2018-09-30 10:14:31,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-30 10:14:31,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-30 10:14:31,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2018-09-30 10:14:31,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-09-30 10:14:31,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 237 transitions. [2018-09-30 10:14:31,122 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 237 transitions. Word has length 10 [2018-09-30 10:14:31,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:31,123 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 237 transitions. [2018-09-30 10:14:31,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:14:31,123 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 237 transitions. [2018-09-30 10:14:31,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:14:31,124 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:31,124 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:31,124 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:31,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:31,125 INFO L82 PathProgramCache]: Analyzing trace with hash -464230043, now seen corresponding path program 1 times [2018-09-30 10:14:31,125 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:31,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:31,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:31,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:31,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:31,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:31,204 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:31,204 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:14:31,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:14:31,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:14:31,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-30 10:14:31,205 INFO L87 Difference]: Start difference. First operand 142 states and 237 transitions. Second operand 5 states. [2018-09-30 10:14:31,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:31,367 INFO L93 Difference]: Finished difference Result 459 states and 761 transitions. [2018-09-30 10:14:31,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 10:14:31,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-09-30 10:14:31,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:31,370 INFO L225 Difference]: With dead ends: 459 [2018-09-30 10:14:31,370 INFO L226 Difference]: Without dead ends: 286 [2018-09-30 10:14:31,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-30 10:14:31,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-09-30 10:14:31,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2018-09-30 10:14:31,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-09-30 10:14:31,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 461 transitions. [2018-09-30 10:14:31,398 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 461 transitions. Word has length 18 [2018-09-30 10:14:31,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:31,399 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 461 transitions. [2018-09-30 10:14:31,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:14:31,399 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 461 transitions. [2018-09-30 10:14:31,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-30 10:14:31,401 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:31,402 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:31,402 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:31,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:31,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1761001012, now seen corresponding path program 1 times [2018-09-30 10:14:31,403 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:31,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:31,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:31,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:31,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:31,449 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-30 10:14:31,450 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:31,450 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:14:31,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:14:31,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:14:31,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:31,451 INFO L87 Difference]: Start difference. First operand 286 states and 461 transitions. Second operand 3 states. [2018-09-30 10:14:31,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:31,819 INFO L93 Difference]: Finished difference Result 695 states and 1105 transitions. [2018-09-30 10:14:31,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:14:31,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-09-30 10:14:31,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:31,824 INFO L225 Difference]: With dead ends: 695 [2018-09-30 10:14:31,824 INFO L226 Difference]: Without dead ends: 402 [2018-09-30 10:14:31,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:31,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-09-30 10:14:31,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 294. [2018-09-30 10:14:31,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-09-30 10:14:31,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 469 transitions. [2018-09-30 10:14:31,850 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 469 transitions. Word has length 40 [2018-09-30 10:14:31,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:31,850 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 469 transitions. [2018-09-30 10:14:31,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:14:31,851 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 469 transitions. [2018-09-30 10:14:31,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-30 10:14:31,853 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:31,853 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:31,853 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:31,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:31,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1151060372, now seen corresponding path program 1 times [2018-09-30 10:14:31,854 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:31,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:31,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:31,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:31,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:31,922 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-30 10:14:31,922 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:31,922 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:14:31,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:14:31,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:14:31,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:31,923 INFO L87 Difference]: Start difference. First operand 294 states and 469 transitions. Second operand 3 states. [2018-09-30 10:14:32,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:32,044 INFO L93 Difference]: Finished difference Result 711 states and 1121 transitions. [2018-09-30 10:14:32,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:14:32,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-09-30 10:14:32,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:32,050 INFO L225 Difference]: With dead ends: 711 [2018-09-30 10:14:32,051 INFO L226 Difference]: Without dead ends: 414 [2018-09-30 10:14:32,052 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:32,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-09-30 10:14:32,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 306. [2018-09-30 10:14:32,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-09-30 10:14:32,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 481 transitions. [2018-09-30 10:14:32,070 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 481 transitions. Word has length 41 [2018-09-30 10:14:32,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:32,070 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 481 transitions. [2018-09-30 10:14:32,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:14:32,070 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 481 transitions. [2018-09-30 10:14:32,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-30 10:14:32,073 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:32,073 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:32,073 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:32,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:32,074 INFO L82 PathProgramCache]: Analyzing trace with hash 221883911, now seen corresponding path program 1 times [2018-09-30 10:14:32,074 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:32,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:32,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:32,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:32,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:32,280 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-30 10:14:32,280 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:14:32,280 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:14:32,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:32,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:14:32,500 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-30 10:14:32,533 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 10:14:32,533 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-09-30 10:14:32,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:14:32,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:14:32,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:14:32,535 INFO L87 Difference]: Start difference. First operand 306 states and 481 transitions. Second operand 7 states. [2018-09-30 10:14:33,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:33,098 INFO L93 Difference]: Finished difference Result 834 states and 1286 transitions. [2018-09-30 10:14:33,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 10:14:33,100 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-09-30 10:14:33,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:33,103 INFO L225 Difference]: With dead ends: 834 [2018-09-30 10:14:33,103 INFO L226 Difference]: Without dead ends: 523 [2018-09-30 10:14:33,104 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-09-30 10:14:33,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-09-30 10:14:33,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 432. [2018-09-30 10:14:33,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-09-30 10:14:33,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 649 transitions. [2018-09-30 10:14:33,125 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 649 transitions. Word has length 43 [2018-09-30 10:14:33,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:33,126 INFO L480 AbstractCegarLoop]: Abstraction has 432 states and 649 transitions. [2018-09-30 10:14:33,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:14:33,126 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 649 transitions. [2018-09-30 10:14:33,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-30 10:14:33,129 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:33,129 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:33,129 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:33,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:33,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1437736339, now seen corresponding path program 1 times [2018-09-30 10:14:33,130 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:33,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:33,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:33,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:33,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:33,232 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-30 10:14:33,232 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:33,232 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:14:33,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:14:33,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:14:33,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:33,234 INFO L87 Difference]: Start difference. First operand 432 states and 649 transitions. Second operand 3 states. [2018-09-30 10:14:33,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:33,574 INFO L93 Difference]: Finished difference Result 1110 states and 1680 transitions. [2018-09-30 10:14:33,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:14:33,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-09-30 10:14:33,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:33,584 INFO L225 Difference]: With dead ends: 1110 [2018-09-30 10:14:33,584 INFO L226 Difference]: Without dead ends: 657 [2018-09-30 10:14:33,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:33,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2018-09-30 10:14:33,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 654. [2018-09-30 10:14:33,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-09-30 10:14:33,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 980 transitions. [2018-09-30 10:14:33,616 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 980 transitions. Word has length 45 [2018-09-30 10:14:33,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:33,616 INFO L480 AbstractCegarLoop]: Abstraction has 654 states and 980 transitions. [2018-09-30 10:14:33,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:14:33,617 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 980 transitions. [2018-09-30 10:14:33,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-30 10:14:33,619 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:33,619 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:33,624 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:33,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:33,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1460368593, now seen corresponding path program 1 times [2018-09-30 10:14:33,625 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:33,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:33,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:33,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:33,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:33,729 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 10:14:33,729 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:33,729 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:14:33,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:14:33,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:14:33,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:33,731 INFO L87 Difference]: Start difference. First operand 654 states and 980 transitions. Second operand 3 states. [2018-09-30 10:14:33,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:33,934 INFO L93 Difference]: Finished difference Result 1308 states and 1959 transitions. [2018-09-30 10:14:33,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:14:33,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-09-30 10:14:33,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:33,938 INFO L225 Difference]: With dead ends: 1308 [2018-09-30 10:14:33,939 INFO L226 Difference]: Without dead ends: 655 [2018-09-30 10:14:33,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:33,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2018-09-30 10:14:33,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 654. [2018-09-30 10:14:33,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-09-30 10:14:33,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 924 transitions. [2018-09-30 10:14:33,966 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 924 transitions. Word has length 45 [2018-09-30 10:14:33,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:33,966 INFO L480 AbstractCegarLoop]: Abstraction has 654 states and 924 transitions. [2018-09-30 10:14:33,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:14:33,966 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 924 transitions. [2018-09-30 10:14:33,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-30 10:14:33,968 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:33,968 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:33,968 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:33,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:33,969 INFO L82 PathProgramCache]: Analyzing trace with hash -477421396, now seen corresponding path program 1 times [2018-09-30 10:14:33,969 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:33,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:33,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:33,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:33,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:34,443 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:34,443 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:14:34,443 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:14:34,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:34,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:14:35,865 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-30 10:14:35,929 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:35,955 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:14:35,955 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-09-30 10:14:35,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 10:14:35,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 10:14:35,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-09-30 10:14:35,957 INFO L87 Difference]: Start difference. First operand 654 states and 924 transitions. Second operand 16 states. [2018-09-30 10:14:36,596 WARN L178 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2018-09-30 10:14:36,943 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-09-30 10:14:37,651 WARN L178 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2018-09-30 10:14:37,820 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2018-09-30 10:14:37,977 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2018-09-30 10:14:38,200 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-09-30 10:14:38,383 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-09-30 10:14:38,816 WARN L178 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-09-30 10:14:39,027 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-09-30 10:14:39,214 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-09-30 10:14:40,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:40,216 INFO L93 Difference]: Finished difference Result 2731 states and 3833 transitions. [2018-09-30 10:14:40,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 10:14:40,217 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 48 [2018-09-30 10:14:40,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:40,226 INFO L225 Difference]: With dead ends: 2731 [2018-09-30 10:14:40,227 INFO L226 Difference]: Without dead ends: 2018 [2018-09-30 10:14:40,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=322, Invalid=868, Unknown=0, NotChecked=0, Total=1190 [2018-09-30 10:14:40,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2018-09-30 10:14:40,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 916. [2018-09-30 10:14:40,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-09-30 10:14:40,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1353 transitions. [2018-09-30 10:14:40,283 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1353 transitions. Word has length 48 [2018-09-30 10:14:40,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:40,284 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 1353 transitions. [2018-09-30 10:14:40,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 10:14:40,284 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1353 transitions. [2018-09-30 10:14:40,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-30 10:14:40,286 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:40,286 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:40,286 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:40,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:40,287 INFO L82 PathProgramCache]: Analyzing trace with hash -253604652, now seen corresponding path program 1 times [2018-09-30 10:14:40,287 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:40,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:40,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:40,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:40,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:40,436 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-09-30 10:14:40,437 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:40,437 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:14:40,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:14:40,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:14:40,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-30 10:14:40,438 INFO L87 Difference]: Start difference. First operand 916 states and 1353 transitions. Second operand 4 states. [2018-09-30 10:14:40,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:40,633 INFO L93 Difference]: Finished difference Result 1832 states and 2705 transitions. [2018-09-30 10:14:40,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:14:40,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-09-30 10:14:40,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:40,638 INFO L225 Difference]: With dead ends: 1832 [2018-09-30 10:14:40,638 INFO L226 Difference]: Without dead ends: 917 [2018-09-30 10:14:40,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-30 10:14:40,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-09-30 10:14:40,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 914. [2018-09-30 10:14:40,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2018-09-30 10:14:40,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1297 transitions. [2018-09-30 10:14:40,683 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1297 transitions. Word has length 67 [2018-09-30 10:14:40,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:40,683 INFO L480 AbstractCegarLoop]: Abstraction has 914 states and 1297 transitions. [2018-09-30 10:14:40,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:14:40,683 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1297 transitions. [2018-09-30 10:14:40,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-30 10:14:40,685 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:40,685 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:40,685 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:40,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:40,686 INFO L82 PathProgramCache]: Analyzing trace with hash 597366310, now seen corresponding path program 2 times [2018-09-30 10:14:40,686 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:40,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:40,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:40,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:40,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:40,760 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-09-30 10:14:40,761 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:40,761 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:14:40,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:14:40,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:14:40,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:40,762 INFO L87 Difference]: Start difference. First operand 914 states and 1297 transitions. Second operand 3 states. [2018-09-30 10:14:41,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:41,074 INFO L93 Difference]: Finished difference Result 1833 states and 2596 transitions. [2018-09-30 10:14:41,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:14:41,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-09-30 10:14:41,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:41,079 INFO L225 Difference]: With dead ends: 1833 [2018-09-30 10:14:41,079 INFO L226 Difference]: Without dead ends: 852 [2018-09-30 10:14:41,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:41,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2018-09-30 10:14:41,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 827. [2018-09-30 10:14:41,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2018-09-30 10:14:41,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1131 transitions. [2018-09-30 10:14:41,119 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1131 transitions. Word has length 68 [2018-09-30 10:14:41,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:41,120 INFO L480 AbstractCegarLoop]: Abstraction has 827 states and 1131 transitions. [2018-09-30 10:14:41,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:14:41,120 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1131 transitions. [2018-09-30 10:14:41,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-30 10:14:41,123 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:41,123 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:41,123 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:41,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:41,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1297357211, now seen corresponding path program 1 times [2018-09-30 10:14:41,124 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:41,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:41,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:41,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:14:41,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:42,031 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 27 proven. 101 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-30 10:14:42,031 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:14:42,031 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:14:42,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:42,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:14:42,929 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 108 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-30 10:14:42,950 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:14:42,950 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 26 [2018-09-30 10:14:42,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-30 10:14:42,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-30 10:14:42,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2018-09-30 10:14:42,952 INFO L87 Difference]: Start difference. First operand 827 states and 1131 transitions. Second operand 27 states. [2018-09-30 10:14:44,146 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2018-09-30 10:14:45,109 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2018-09-30 10:14:45,331 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2018-09-30 10:14:45,722 WARN L178 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2018-09-30 10:14:45,900 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2018-09-30 10:14:46,723 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2018-09-30 10:14:46,900 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2018-09-30 10:14:47,307 WARN L178 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2018-09-30 10:14:47,696 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2018-09-30 10:14:47,895 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2018-09-30 10:14:48,177 WARN L178 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2018-09-30 10:14:48,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:48,638 INFO L93 Difference]: Finished difference Result 2306 states and 2951 transitions. [2018-09-30 10:14:48,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-30 10:14:48,639 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 84 [2018-09-30 10:14:48,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:48,648 INFO L225 Difference]: With dead ends: 2306 [2018-09-30 10:14:48,648 INFO L226 Difference]: Without dead ends: 2305 [2018-09-30 10:14:48,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=838, Invalid=3194, Unknown=0, NotChecked=0, Total=4032 [2018-09-30 10:14:48,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2018-09-30 10:14:48,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 951. [2018-09-30 10:14:48,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2018-09-30 10:14:48,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1304 transitions. [2018-09-30 10:14:48,717 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1304 transitions. Word has length 84 [2018-09-30 10:14:48,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:48,717 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 1304 transitions. [2018-09-30 10:14:48,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-30 10:14:48,717 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1304 transitions. [2018-09-30 10:14:48,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-30 10:14:48,720 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:48,720 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:48,720 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:48,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:48,721 INFO L82 PathProgramCache]: Analyzing trace with hash -604514526, now seen corresponding path program 1 times [2018-09-30 10:14:48,721 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:48,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:48,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:48,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:48,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:48,822 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-09-30 10:14:48,822 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:48,822 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:14:48,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:14:48,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:14:48,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:48,824 INFO L87 Difference]: Start difference. First operand 951 states and 1304 transitions. Second operand 3 states. [2018-09-30 10:14:49,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:49,094 INFO L93 Difference]: Finished difference Result 1902 states and 2607 transitions. [2018-09-30 10:14:49,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:14:49,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-09-30 10:14:49,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:49,098 INFO L225 Difference]: With dead ends: 1902 [2018-09-30 10:14:49,099 INFO L226 Difference]: Without dead ends: 952 [2018-09-30 10:14:49,100 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:49,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2018-09-30 10:14:49,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 896. [2018-09-30 10:14:49,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-09-30 10:14:49,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1202 transitions. [2018-09-30 10:14:49,161 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1202 transitions. Word has length 85 [2018-09-30 10:14:49,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:49,161 INFO L480 AbstractCegarLoop]: Abstraction has 896 states and 1202 transitions. [2018-09-30 10:14:49,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:14:49,162 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1202 transitions. [2018-09-30 10:14:49,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-30 10:14:49,164 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:49,164 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:49,164 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:49,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:49,165 INFO L82 PathProgramCache]: Analyzing trace with hash 722130188, now seen corresponding path program 1 times [2018-09-30 10:14:49,165 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:49,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:49,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:49,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:49,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:49,263 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-09-30 10:14:49,264 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:49,264 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:14:49,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:14:49,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:14:49,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:49,265 INFO L87 Difference]: Start difference. First operand 896 states and 1202 transitions. Second operand 3 states. [2018-09-30 10:14:49,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:49,587 INFO L93 Difference]: Finished difference Result 1560 states and 2084 transitions. [2018-09-30 10:14:49,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:14:49,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-09-30 10:14:49,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:49,589 INFO L225 Difference]: With dead ends: 1560 [2018-09-30 10:14:49,590 INFO L226 Difference]: Without dead ends: 640 [2018-09-30 10:14:49,591 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:49,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-09-30 10:14:49,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 554. [2018-09-30 10:14:49,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-09-30 10:14:49,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 719 transitions. [2018-09-30 10:14:49,631 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 719 transitions. Word has length 87 [2018-09-30 10:14:49,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:49,632 INFO L480 AbstractCegarLoop]: Abstraction has 554 states and 719 transitions. [2018-09-30 10:14:49,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:14:49,632 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 719 transitions. [2018-09-30 10:14:49,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-30 10:14:49,634 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:49,634 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:49,634 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:49,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:49,635 INFO L82 PathProgramCache]: Analyzing trace with hash 818701568, now seen corresponding path program 1 times [2018-09-30 10:14:49,635 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:49,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:49,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:49,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:49,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:49,749 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 104 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-09-30 10:14:49,749 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:14:49,750 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:14:49,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:49,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:14:49,997 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 104 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-09-30 10:14:50,025 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:14:50,026 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-09-30 10:14:50,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:14:50,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:14:50,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:14:50,027 INFO L87 Difference]: Start difference. First operand 554 states and 719 transitions. Second operand 7 states. [2018-09-30 10:14:50,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:50,186 INFO L93 Difference]: Finished difference Result 1394 states and 1802 transitions. [2018-09-30 10:14:50,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 10:14:50,187 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-09-30 10:14:50,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:50,190 INFO L225 Difference]: With dead ends: 1394 [2018-09-30 10:14:50,190 INFO L226 Difference]: Without dead ends: 724 [2018-09-30 10:14:50,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:14:50,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2018-09-30 10:14:50,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 323. [2018-09-30 10:14:50,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-09-30 10:14:50,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 408 transitions. [2018-09-30 10:14:50,215 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 408 transitions. Word has length 89 [2018-09-30 10:14:50,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:50,216 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 408 transitions. [2018-09-30 10:14:50,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:14:50,216 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 408 transitions. [2018-09-30 10:14:50,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-30 10:14:50,217 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:50,217 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:14:50,218 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:50,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:50,218 INFO L82 PathProgramCache]: Analyzing trace with hash -199349933, now seen corresponding path program 2 times [2018-09-30 10:14:50,218 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:50,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:50,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:50,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:50,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:50,288 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-09-30 10:14:50,289 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:50,289 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:14:50,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:14:50,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:14:50,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:50,290 INFO L87 Difference]: Start difference. First operand 323 states and 408 transitions. Second operand 3 states. [2018-09-30 10:14:50,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:50,612 INFO L93 Difference]: Finished difference Result 566 states and 704 transitions. [2018-09-30 10:14:50,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:14:50,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2018-09-30 10:14:50,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:50,613 INFO L225 Difference]: With dead ends: 566 [2018-09-30 10:14:50,613 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 10:14:50,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:14:50,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 10:14:50,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 10:14:50,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 10:14:50,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 10:14:50,615 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2018-09-30 10:14:50,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:50,615 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 10:14:50,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:14:50,615 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 10:14:50,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 10:14:50,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 10:14:50,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:50,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:50,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:50,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:51,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:51,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:51,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:14:52,456 WARN L178 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 509 DAG size of output: 449 [2018-09-30 10:14:59,849 WARN L178 SmtUtils]: Spent 7.38 s on a formula simplification. DAG size of input: 436 DAG size of output: 113 [2018-09-30 10:14:59,853 INFO L426 ceAbstractionStarter]: For program point L168(lines 168 183) no Hoare annotation was computed. [2018-09-30 10:14:59,853 INFO L426 ceAbstractionStarter]: For program point L135(lines 135 142) no Hoare annotation was computed. [2018-09-30 10:14:59,853 INFO L426 ceAbstractionStarter]: For program point L135-2(lines 111 160) no Hoare annotation was computed. [2018-09-30 10:14:59,853 INFO L426 ceAbstractionStarter]: For program point L94(lines 94 108) no Hoare annotation was computed. [2018-09-30 10:14:59,853 INFO L426 ceAbstractionStarter]: For program point L152(lines 152 160) no Hoare annotation was computed. [2018-09-30 10:14:59,853 INFO L426 ceAbstractionStarter]: For program point L103(lines 103 108) no Hoare annotation was computed. [2018-09-30 10:14:59,854 INFO L426 ceAbstractionStarter]: For program point L103-2(lines 89 142) no Hoare annotation was computed. [2018-09-30 10:14:59,854 INFO L426 ceAbstractionStarter]: For program point L178(lines 178 183) no Hoare annotation was computed. [2018-09-30 10:14:59,854 INFO L426 ceAbstractionStarter]: For program point L178-2(lines 163 183) no Hoare annotation was computed. [2018-09-30 10:14:59,854 INFO L426 ceAbstractionStarter]: For program point L129(lines 129 142) no Hoare annotation was computed. [2018-09-30 10:14:59,854 INFO L426 ceAbstractionStarter]: For program point L96(lines 96 108) no Hoare annotation was computed. [2018-09-30 10:14:59,854 INFO L426 ceAbstractionStarter]: For program point L80(lines 80 82) no Hoare annotation was computed. [2018-09-30 10:14:59,854 INFO L426 ceAbstractionStarter]: For program point L80-2(lines 80 85) no Hoare annotation was computed. [2018-09-30 10:14:59,854 INFO L426 ceAbstractionStarter]: For program point L171(lines 171 183) no Hoare annotation was computed. [2018-09-30 10:14:59,854 INFO L426 ceAbstractionStarter]: For program point ElevatorErr0ASSERT_VIOLATIONASSERT(line 185) no Hoare annotation was computed. [2018-09-30 10:14:59,854 INFO L426 ceAbstractionStarter]: For program point L155(lines 155 160) no Hoare annotation was computed. [2018-09-30 10:14:59,855 INFO L426 ceAbstractionStarter]: For program point L155-2(lines 145 183) no Hoare annotation was computed. [2018-09-30 10:14:59,855 INFO L422 ceAbstractionStarter]: At program point L48-1(lines 13 188) the Hoare annotation is: (let ((.cse2 (<= Elevator_min Elevator_current)) (.cse6 (<= Elevator_current Elevator_max)) (.cse28 (<= |Elevator_goal'| |Elevator_current'|)) (.cse31 (<= |Elevator_current'| |Elevator_goal'|)) (.cse0 (<= Elevator_c2 Elevator_c3)) (.cse1 (<= |Elevator_current'| Elevator_max)) (.cse4 (<= Elevator_min |Elevator_current'|)) (.cse29 (+ |Elevator_goal'| 1))) (let ((.cse3 (<= Elevator_qDC2 1)) (.cse14 (or (< |Elevator_current'| |Elevator_goal'|) (<= .cse29 |Elevator_current'|))) (.cse21 (<= Elevator_qDC1 1)) (.cse22 (not Elevator_passed)) (.cse25 (not (= Elevator_qCSP 3))) (.cse26 (or (and .cse1 (<= (+ Elevator_min 1) |Elevator_current'|)) (and (<= (+ |Elevator_current'| 1) Elevator_max) .cse4))) (.cse16 (= Elevator_qDC2 3)) (.cse5 (= Elevator_qCSP 1)) (.cse13 (not Elevator_stop)) (.cse24 (or (<= Elevator_c2 2) .cse0)) (.cse17 (or (= (+ |Elevator_dir'| 1) 0) .cse31)) (.cse7 (= Elevator_qDC1 2)) (.cse18 (or (= |Elevator_dir'| 1) .cse28)) (.cse19 (<= Elevator_qDC2 2)) (.cse20 (<= 2 Elevator_qDC2)) (.cse8 (<= |Elevator_goal'| Elevator_max)) (.cse10 (<= Elevator_goal Elevator_max)) (.cse11 (<= Elevator_min Elevator_goal)) (.cse15 (and .cse1 .cse2 .cse6 .cse4)) (.cse9 (<= Elevator_min |Elevator_goal'|)) (.cse23 (not (= |Elevator_current'| |Elevator_goal'|))) (.cse12 (not Elevator_newgoal))) (or (and .cse0 (and (and .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12) (and .cse13 .cse0 (and (and .cse14 .cse8 .cse15) .cse7 .cse9 .cse10 .cse11) .cse16) (and (and .cse13 (and .cse17 .cse18 (and .cse19 .cse20 (and .cse1 .cse2 .cse6 .cse4 .cse8 .cse9 .cse10 .cse11 .cse21 .cse22)) .cse23)) .cse12) (and .cse13 .cse24 (and (and .cse25 .cse19 .cse2 .cse6 .cse14 .cse20 .cse8 .cse10 .cse26 .cse11) .cse7 .cse9)) (and (let ((.cse27 (let ((.cse30 (let ((.cse32 (and .cse5 (and .cse1 .cse3 .cse4 .cse21)))) (or (and .cse31 .cse32 .cse28) (and .cse8 .cse9 .cse10 .cse11 .cse32))))) (or (and .cse17 .cse18 .cse26 .cse30) (and .cse2 .cse6 .cse10 .cse11 .cse30))))) (or (and .cse6 .cse27) (and (or (and (<= (+ |Elevator_current'| |Elevator_dir'| 2) Elevator_max) .cse28) (= |Elevator_goal'| |Elevator_current'|) (and (< |Elevator_current'| .cse29) (<= (+ Elevator_min 2) (+ |Elevator_current'| |Elevator_dir'|)))) .cse27))) .cse0) (and (and .cse13 .cse0 (and .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse15)) .cse16) .cse12) (and .cse13 (and .cse9 (and .cse2 .cse19 .cse14 .cse20 .cse8 .cse10 .cse21 .cse22 .cse25 .cse6 .cse26) .cse11)) (and .cse0 (and .cse1 .cse2 .cse4 .cse8 .cse16 .cse10 .cse11 .cse5 .cse13 .cse6 .cse7 .cse9)) (and (and .cse13 .cse24 (and .cse17 .cse7 .cse18 (and .cse19 .cse20 .cse8 .cse10 .cse11 .cse15) .cse9 .cse23)) .cse12)))) [2018-09-30 10:14:59,856 INFO L426 ceAbstractionStarter]: For program point L123(lines 123 142) no Hoare annotation was computed. [2018-09-30 10:14:59,856 INFO L426 ceAbstractionStarter]: For program point L165(lines 165 183) no Hoare annotation was computed. [2018-09-30 10:14:59,856 INFO L426 ceAbstractionStarter]: For program point L99(lines 99 108) no Hoare annotation was computed. [2018-09-30 10:14:59,856 INFO L426 ceAbstractionStarter]: For program point ElevatorEXIT(lines 13 188) no Hoare annotation was computed. [2018-09-30 10:14:59,856 INFO L426 ceAbstractionStarter]: For program point L91(lines 91 108) no Hoare annotation was computed. [2018-09-30 10:14:59,856 INFO L426 ceAbstractionStarter]: For program point L149(lines 149 160) no Hoare annotation was computed. [2018-09-30 10:14:59,856 INFO L426 ceAbstractionStarter]: For program point L116(lines 116 142) no Hoare annotation was computed. [2018-09-30 10:14:59,856 INFO L426 ceAbstractionStarter]: For program point L83-1(lines 83 108) no Hoare annotation was computed. [2018-09-30 10:14:59,856 INFO L426 ceAbstractionStarter]: For program point ElevatorENTRY(lines 13 188) no Hoare annotation was computed. [2018-09-30 10:14:59,857 INFO L426 ceAbstractionStarter]: For program point L175(lines 175 183) no Hoare annotation was computed. [2018-09-30 10:14:59,857 INFO L426 ceAbstractionStarter]: For program point L101(lines 101 108) no Hoare annotation was computed. [2018-09-30 10:14:59,876 INFO L202 PluginConnector]: Adding new model Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:14:59 BoogieIcfgContainer [2018-09-30 10:14:59,876 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:14:59,877 INFO L168 Benchmark]: Toolchain (without parser) took 31010.78 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 359.7 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -148.0 MB). Peak memory consumption was 764.3 MB. Max. memory is 7.1 GB. [2018-09-30 10:14:59,878 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:14:59,879 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.93 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:14:59,879 INFO L168 Benchmark]: Boogie Preprocessor took 57.07 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:14:59,880 INFO L168 Benchmark]: RCFGBuilder took 643.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-30 10:14:59,881 INFO L168 Benchmark]: TraceAbstraction took 30255.75 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 359.7 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -179.8 MB). Peak memory consumption was 732.6 MB. Max. memory is 7.1 GB. [2018-09-30 10:14:59,884 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 46.93 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.07 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 643.26 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 30255.75 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 359.7 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -179.8 MB). Peak memory consumption was 732.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 185]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: (((((((((c2 <= c3 && (((((((((current' <= max && min <= current) && qDC2 <= 1) && min <= current') && qCSP == 1) && current <= max) && qDC1 == 2) && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && !newgoal) || (((!stop && c2 <= c3) && ((((((current' < goal' || goal' + 1 <= current') && goal' <= max) && ((current' <= max && min <= current) && current <= max) && min <= current') && qDC1 == 2) && min <= goal') && goal <= max) && min <= goal) && qDC2 == 3)) || ((!stop && (((dir' + 1 == 0 || current' <= goal') && (dir' == 1 || goal' <= current')) && (qDC2 <= 2 && 2 <= qDC2) && ((((((((current' <= max && min <= current) && current <= max) && min <= current') && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && qDC1 <= 1) && !passed) && !(current' == goal')) && !newgoal)) || ((!stop && (c2 <= 2 || c2 <= c3)) && ((((((((((!(qCSP == 3) && qDC2 <= 2) && min <= current) && current <= max) && (current' < goal' || goal' + 1 <= current')) && 2 <= qDC2) && goal' <= max) && goal <= max) && ((current' <= max && min + 1 <= current') || (current' + 1 <= max && min <= current'))) && min <= goal) && qDC1 == 2) && min <= goal')) || (((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))))) || ((((current' + dir' + 2 <= max && goal' <= current') || goal' == current') || (current' < goal' + 1 && min + 2 <= current' + dir')) && (((((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)))))) && c2 <= c3)) || ((((!stop && c2 <= c3) && qDC1 == 2 && (((goal' <= max && min <= goal') && goal <= max) && min <= goal) && ((current' <= max && min <= current) && current <= max) && min <= current') && qDC2 == 3) && !newgoal)) || (!stop && (min <= goal' && (((((((((min <= current && qDC2 <= 2) && (current' < goal' || goal' + 1 <= current')) && 2 <= qDC2) && goal' <= max) && goal <= max) && qDC1 <= 1) && !passed) && !(qCSP == 3)) && current <= max) && ((current' <= max && min + 1 <= current') || (current' + 1 <= max && min <= current'))) && min <= goal)) || (c2 <= c3 && ((((((((((current' <= max && min <= current) && min <= current') && goal' <= max) && qDC2 == 3) && goal <= max) && min <= goal) && qCSP == 1) && !stop) && current <= max) && qDC1 == 2) && min <= goal')) || (((!stop && (c2 <= 2 || c2 <= c3)) && (((((dir' + 1 == 0 || current' <= goal') && qDC1 == 2) && (dir' == 1 || goal' <= current')) && ((((qDC2 <= 2 && 2 <= qDC2) && goal' <= max) && goal <= max) && min <= goal) && ((current' <= max && min <= current) && current <= max) && min <= current') && min <= goal') && !(current' == goal')) && !newgoal) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. SAFE Result, 30.1s OverallTime, 18 OverallIterations, 6 TraceHistogramMax, 14.2s AutomataDifference, 0.0s DeadEndRemovalTime, 9.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1068 SDtfs, 1946 SDslu, 2970 SDs, 0 SdLazy, 2059 SolverSat, 235 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 417 GetRequests, 280 SyntacticMatches, 5 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 10.9s 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.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 3363 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 18 NumberOfFragments, 799 HoareAnnotationTreeSize, 1 FomulaSimplifications, 494164 FormulaSimplificationTreeSizeReduction, 1.8s HoareSimplificationTime, 1 FomulaSimplificationsInter, 246468 FormulaSimplificationTreeSizeReductionInter, 7.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1161 NumberOfCodeBlocks, 1161 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1139 ConstructedInterpolants, 0 QuantifiedInterpolants, 554405 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.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-14-59-899.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Elevator-Integer.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_10-14-59-899.csv Received shutdown request...