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-1cc990c [2018-09-30 20:06:04,928 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:06:04,930 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:06:04,943 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:06:04,943 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:06:04,944 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:06:04,945 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:06:04,947 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:06:04,949 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:06:04,950 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:06:04,951 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:06:04,951 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:06:04,952 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:06:04,953 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:06:04,955 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:06:04,955 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:06:04,956 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:06:04,958 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:06:04,961 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:06:04,962 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:06:04,964 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:06:04,965 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:06:04,968 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:06:04,968 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:06:04,968 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:06:04,970 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:06:04,971 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:06:04,972 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:06:04,973 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:06:04,974 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:06:04,974 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:06:04,977 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:06:04,978 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:06:04,978 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:06:04,979 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:06:04,983 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:06:04,984 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 20:06:05,013 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:06:05,013 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:06:05,015 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:06:05,015 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:06:05,015 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:06:05,016 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:06:05,016 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:06:05,016 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:06:05,017 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:06:05,017 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:06:05,018 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:06:05,018 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:06:05,018 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:06:05,018 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:06:05,019 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:06:05,019 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:06:05,019 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:06:05,019 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:06:05,020 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:06:05,020 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:06:05,020 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:06:05,020 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:06:05,020 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:06:05,021 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:06:05,021 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:06:05,021 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:06:05,021 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:06:05,023 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:06:05,023 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:06:05,023 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:06:05,073 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:06:05,089 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:06:05,098 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:06:05,099 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:06:05,100 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:06:05,101 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 20:06:05,101 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator-Integer.bpl' [2018-09-30 20:06:05,187 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:06:05,194 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:06:05,195 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:06:05,195 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:06:05,196 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:06:05,216 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 08:06:05" (1/1) ... [2018-09-30 20:06:05,231 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 08:06:05" (1/1) ... [2018-09-30 20:06:05,237 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 20:06:05,237 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 20:06:05,237 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 20:06:05,239 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:06:05,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:06:05,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:06:05,241 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:06:05,251 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 08:06:05" (1/1) ... [2018-09-30 20:06:05,251 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 08:06:05" (1/1) ... [2018-09-30 20:06:05,253 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 08:06:05" (1/1) ... [2018-09-30 20:06:05,254 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 08:06:05" (1/1) ... [2018-09-30 20:06:05,259 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 08:06:05" (1/1) ... [2018-09-30 20:06:05,265 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 08:06:05" (1/1) ... [2018-09-30 20:06:05,267 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 08:06:05" (1/1) ... [2018-09-30 20:06:05,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:06:05,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:06:05,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:06:05,271 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:06:05,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:05" (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 20:06:05,353 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Elevator given in one single declaration [2018-09-30 20:06:05,353 INFO L130 BoogieDeclarations]: Found specification of procedure Elevator [2018-09-30 20:06:05,353 INFO L138 BoogieDeclarations]: Found implementation of procedure Elevator [2018-09-30 20:06:06,082 INFO L345 CfgBuilder]: Using library mode [2018-09-30 20:06:06,083 INFO L202 PluginConnector]: Adding new model Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:06:06 BoogieIcfgContainer [2018-09-30 20:06:06,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:06:06,084 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:06:06,084 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:06:06,088 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:06:06,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:05" (1/2) ... [2018-09-30 20:06:06,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae99f8 and model type Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:06:06, skipping insertion in model container [2018-09-30 20:06:06,089 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 08:06:06" (2/2) ... [2018-09-30 20:06:06,091 INFO L112 eAbstractionObserver]: Analyzing ICFG Elevator-Integer.bpl [2018-09-30 20:06:06,102 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:06:06,112 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 20:06:06,167 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:06:06,168 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:06:06,168 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:06:06,168 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:06:06,168 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:06:06,168 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:06:06,169 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:06:06,169 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:06:06,169 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:06:06,187 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-09-30 20:06:06,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:06:06,194 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:06,196 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:06,197 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:06,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:06,204 INFO L82 PathProgramCache]: Analyzing trace with hash 493797215, now seen corresponding path program 1 times [2018-09-30 20:06:06,207 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:06,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:06,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:06,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:06,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:06,429 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 20:06:06,431 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:06,432 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:06:06,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:06:06,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:06:06,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:06:06,457 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2018-09-30 20:06:06,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:06,604 INFO L93 Difference]: Finished difference Result 85 states and 157 transitions. [2018-09-30 20:06:06,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:06:06,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-09-30 20:06:06,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:06,631 INFO L225 Difference]: With dead ends: 85 [2018-09-30 20:06:06,631 INFO L226 Difference]: Without dead ends: 53 [2018-09-30 20:06:06,644 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 20:06:06,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-30 20:06:06,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-09-30 20:06:06,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-30 20:06:06,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 90 transitions. [2018-09-30 20:06:06,689 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 90 transitions. Word has length 9 [2018-09-30 20:06:06,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:06,690 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 90 transitions. [2018-09-30 20:06:06,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:06:06,690 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 90 transitions. [2018-09-30 20:06:06,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:06:06,691 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:06,691 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:06,692 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:06,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:06,692 INFO L82 PathProgramCache]: Analyzing trace with hash -2026162719, now seen corresponding path program 1 times [2018-09-30 20:06:06,692 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:06,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:06,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:06,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:06,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:06,737 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 20:06:06,738 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:06,738 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:06:06,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:06:06,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:06:06,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:06:06,741 INFO L87 Difference]: Start difference. First operand 52 states and 90 transitions. Second operand 3 states. [2018-09-30 20:06:06,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:06,929 INFO L93 Difference]: Finished difference Result 154 states and 268 transitions. [2018-09-30 20:06:06,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:06:06,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-09-30 20:06:06,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:06,932 INFO L225 Difference]: With dead ends: 154 [2018-09-30 20:06:06,932 INFO L226 Difference]: Without dead ends: 95 [2018-09-30 20:06:06,935 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 20:06:06,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-30 20:06:06,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-09-30 20:06:06,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-09-30 20:06:06,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 161 transitions. [2018-09-30 20:06:06,961 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 161 transitions. Word has length 9 [2018-09-30 20:06:06,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:06,962 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 161 transitions. [2018-09-30 20:06:06,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:06:06,962 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 161 transitions. [2018-09-30 20:06:06,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:06:06,963 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:06,963 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:06,964 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:06,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:06,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1968904417, now seen corresponding path program 1 times [2018-09-30 20:06:06,964 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:06,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:06,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:06,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:06,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:07,028 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 20:06:07,029 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:07,029 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:06:07,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:06:07,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:06:07,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:06:07,030 INFO L87 Difference]: Start difference. First operand 94 states and 161 transitions. Second operand 3 states. [2018-09-30 20:06:07,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:07,319 INFO L93 Difference]: Finished difference Result 233 states and 398 transitions. [2018-09-30 20:06:07,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:06:07,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-09-30 20:06:07,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:07,322 INFO L225 Difference]: With dead ends: 233 [2018-09-30 20:06:07,322 INFO L226 Difference]: Without dead ends: 136 [2018-09-30 20:06:07,323 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 20:06:07,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-09-30 20:06:07,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 114. [2018-09-30 20:06:07,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-09-30 20:06:07,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 193 transitions. [2018-09-30 20:06:07,353 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 193 transitions. Word has length 9 [2018-09-30 20:06:07,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:07,354 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 193 transitions. [2018-09-30 20:06:07,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:06:07,354 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 193 transitions. [2018-09-30 20:06:07,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 20:06:07,360 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:07,360 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:07,360 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:07,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:07,361 INFO L82 PathProgramCache]: Analyzing trace with hash -906451345, now seen corresponding path program 1 times [2018-09-30 20:06:07,361 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:07,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:07,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:07,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:07,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:07,439 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 20:06:07,440 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:07,440 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:06:07,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 20:06:07,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 20:06:07,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 20:06:07,441 INFO L87 Difference]: Start difference. First operand 114 states and 193 transitions. Second operand 4 states. [2018-09-30 20:06:07,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:07,701 INFO L93 Difference]: Finished difference Result 144 states and 242 transitions. [2018-09-30 20:06:07,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 20:06:07,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-09-30 20:06:07,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:07,706 INFO L225 Difference]: With dead ends: 144 [2018-09-30 20:06:07,706 INFO L226 Difference]: Without dead ends: 143 [2018-09-30 20:06:07,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-30 20:06:07,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-30 20:06:07,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2018-09-30 20:06:07,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-09-30 20:06:07,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 237 transitions. [2018-09-30 20:06:07,738 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 237 transitions. Word has length 10 [2018-09-30 20:06:07,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:07,738 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 237 transitions. [2018-09-30 20:06:07,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 20:06:07,739 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 237 transitions. [2018-09-30 20:06:07,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:06:07,740 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:07,740 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 20:06:07,740 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:07,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:07,743 INFO L82 PathProgramCache]: Analyzing trace with hash -464230043, now seen corresponding path program 1 times [2018-09-30 20:06:07,743 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:07,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:07,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:07,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:07,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:07,835 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 20:06:07,835 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:07,836 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:06:07,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:06:07,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:06:07,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-30 20:06:07,837 INFO L87 Difference]: Start difference. First operand 142 states and 237 transitions. Second operand 5 states. [2018-09-30 20:06:08,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:08,007 INFO L93 Difference]: Finished difference Result 459 states and 761 transitions. [2018-09-30 20:06:08,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 20:06:08,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-09-30 20:06:08,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:08,010 INFO L225 Difference]: With dead ends: 459 [2018-09-30 20:06:08,010 INFO L226 Difference]: Without dead ends: 286 [2018-09-30 20:06:08,012 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 20:06:08,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-09-30 20:06:08,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2018-09-30 20:06:08,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-09-30 20:06:08,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 461 transitions. [2018-09-30 20:06:08,033 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 461 transitions. Word has length 18 [2018-09-30 20:06:08,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:08,034 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 461 transitions. [2018-09-30 20:06:08,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:06:08,034 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 461 transitions. [2018-09-30 20:06:08,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-30 20:06:08,036 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:08,037 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 20:06:08,037 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:08,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:08,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1761001012, now seen corresponding path program 1 times [2018-09-30 20:06:08,038 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:08,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:08,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:08,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:08,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:08,073 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 20:06:08,073 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:08,073 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:06:08,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:06:08,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:06:08,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:06:08,075 INFO L87 Difference]: Start difference. First operand 286 states and 461 transitions. Second operand 3 states. [2018-09-30 20:06:08,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:08,432 INFO L93 Difference]: Finished difference Result 695 states and 1105 transitions. [2018-09-30 20:06:08,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:06:08,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-09-30 20:06:08,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:08,435 INFO L225 Difference]: With dead ends: 695 [2018-09-30 20:06:08,436 INFO L226 Difference]: Without dead ends: 402 [2018-09-30 20:06:08,439 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 20:06:08,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-09-30 20:06:08,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 294. [2018-09-30 20:06:08,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-09-30 20:06:08,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 469 transitions. [2018-09-30 20:06:08,466 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 469 transitions. Word has length 40 [2018-09-30 20:06:08,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:08,466 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 469 transitions. [2018-09-30 20:06:08,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:06:08,467 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 469 transitions. [2018-09-30 20:06:08,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-30 20:06:08,469 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:08,469 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 20:06:08,469 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:08,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:08,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1151060372, now seen corresponding path program 1 times [2018-09-30 20:06:08,470 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:08,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:08,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:08,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:08,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:08,520 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 20:06:08,520 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:08,520 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:06:08,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:06:08,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:06:08,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:06:08,523 INFO L87 Difference]: Start difference. First operand 294 states and 469 transitions. Second operand 3 states. [2018-09-30 20:06:08,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:08,637 INFO L93 Difference]: Finished difference Result 711 states and 1121 transitions. [2018-09-30 20:06:08,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:06:08,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-09-30 20:06:08,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:08,644 INFO L225 Difference]: With dead ends: 711 [2018-09-30 20:06:08,644 INFO L226 Difference]: Without dead ends: 414 [2018-09-30 20:06:08,645 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 20:06:08,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-09-30 20:06:08,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 306. [2018-09-30 20:06:08,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-09-30 20:06:08,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 481 transitions. [2018-09-30 20:06:08,660 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 481 transitions. Word has length 41 [2018-09-30 20:06:08,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:08,660 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 481 transitions. [2018-09-30 20:06:08,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:06:08,661 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 481 transitions. [2018-09-30 20:06:08,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-30 20:06:08,663 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:08,663 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 20:06:08,664 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:08,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:08,664 INFO L82 PathProgramCache]: Analyzing trace with hash 221883911, now seen corresponding path program 1 times [2018-09-30 20:06:08,664 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:08,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:08,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:08,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:08,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:08,860 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 20:06:08,860 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:08,861 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 20:06:08,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:08,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:09,058 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 20:06:09,096 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 20:06:09,097 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-09-30 20:06:09,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:06:09,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:06:09,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 20:06:09,099 INFO L87 Difference]: Start difference. First operand 306 states and 481 transitions. Second operand 7 states. [2018-09-30 20:06:09,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:09,605 INFO L93 Difference]: Finished difference Result 834 states and 1286 transitions. [2018-09-30 20:06:09,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 20:06:09,608 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-09-30 20:06:09,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:09,611 INFO L225 Difference]: With dead ends: 834 [2018-09-30 20:06:09,611 INFO L226 Difference]: Without dead ends: 523 [2018-09-30 20:06:09,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-09-30 20:06:09,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-09-30 20:06:09,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 432. [2018-09-30 20:06:09,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-09-30 20:06:09,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 649 transitions. [2018-09-30 20:06:09,634 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 649 transitions. Word has length 43 [2018-09-30 20:06:09,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:09,634 INFO L480 AbstractCegarLoop]: Abstraction has 432 states and 649 transitions. [2018-09-30 20:06:09,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:06:09,634 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 649 transitions. [2018-09-30 20:06:09,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-30 20:06:09,636 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:09,637 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 20:06:09,637 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:09,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:09,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1437736339, now seen corresponding path program 1 times [2018-09-30 20:06:09,637 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:09,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:09,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:09,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:09,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:09,755 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 20:06:09,756 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:09,756 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:06:09,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:06:09,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:06:09,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:06:09,758 INFO L87 Difference]: Start difference. First operand 432 states and 649 transitions. Second operand 3 states. [2018-09-30 20:06:10,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:10,083 INFO L93 Difference]: Finished difference Result 1110 states and 1680 transitions. [2018-09-30 20:06:10,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:06:10,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-09-30 20:06:10,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:10,087 INFO L225 Difference]: With dead ends: 1110 [2018-09-30 20:06:10,088 INFO L226 Difference]: Without dead ends: 657 [2018-09-30 20:06:10,089 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 20:06:10,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2018-09-30 20:06:10,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 654. [2018-09-30 20:06:10,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-09-30 20:06:10,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 980 transitions. [2018-09-30 20:06:10,114 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 980 transitions. Word has length 45 [2018-09-30 20:06:10,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:10,115 INFO L480 AbstractCegarLoop]: Abstraction has 654 states and 980 transitions. [2018-09-30 20:06:10,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:06:10,115 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 980 transitions. [2018-09-30 20:06:10,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-30 20:06:10,117 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:10,117 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 20:06:10,118 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:10,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:10,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1460368593, now seen corresponding path program 1 times [2018-09-30 20:06:10,118 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:10,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:10,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:10,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:10,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:10,168 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 20:06:10,168 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:10,168 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:06:10,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:06:10,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:06:10,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:06:10,170 INFO L87 Difference]: Start difference. First operand 654 states and 980 transitions. Second operand 3 states. [2018-09-30 20:06:10,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:10,362 INFO L93 Difference]: Finished difference Result 1308 states and 1959 transitions. [2018-09-30 20:06:10,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:06:10,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-09-30 20:06:10,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:10,368 INFO L225 Difference]: With dead ends: 1308 [2018-09-30 20:06:10,368 INFO L226 Difference]: Without dead ends: 655 [2018-09-30 20:06:10,369 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 20:06:10,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2018-09-30 20:06:10,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 654. [2018-09-30 20:06:10,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-09-30 20:06:10,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 924 transitions. [2018-09-30 20:06:10,395 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 924 transitions. Word has length 45 [2018-09-30 20:06:10,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:10,396 INFO L480 AbstractCegarLoop]: Abstraction has 654 states and 924 transitions. [2018-09-30 20:06:10,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:06:10,396 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 924 transitions. [2018-09-30 20:06:10,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-30 20:06:10,397 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:10,397 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 20:06:10,398 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:10,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:10,398 INFO L82 PathProgramCache]: Analyzing trace with hash -477421396, now seen corresponding path program 1 times [2018-09-30 20:06:10,398 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:10,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:10,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:10,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:10,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:10,915 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 20:06:10,916 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:10,916 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 20:06:10,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:10,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:12,342 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-30 20:06:12,394 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 20:06:12,423 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:06:12,423 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-09-30 20:06:12,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 20:06:12,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 20:06:12,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-09-30 20:06:12,425 INFO L87 Difference]: Start difference. First operand 654 states and 924 transitions. Second operand 16 states. [2018-09-30 20:06:13,019 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2018-09-30 20:06:13,743 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2018-09-30 20:06:13,918 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-09-30 20:06:14,252 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-09-30 20:06:14,742 WARN L178 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-09-30 20:06:14,930 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-09-30 20:06:15,083 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-09-30 20:06:16,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:16,268 INFO L93 Difference]: Finished difference Result 2731 states and 3833 transitions. [2018-09-30 20:06:16,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 20:06:16,268 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 48 [2018-09-30 20:06:16,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:16,279 INFO L225 Difference]: With dead ends: 2731 [2018-09-30 20:06:16,280 INFO L226 Difference]: Without dead ends: 2018 [2018-09-30 20:06:16,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=322, Invalid=868, Unknown=0, NotChecked=0, Total=1190 [2018-09-30 20:06:16,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2018-09-30 20:06:16,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 916. [2018-09-30 20:06:16,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-09-30 20:06:16,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1353 transitions. [2018-09-30 20:06:16,334 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1353 transitions. Word has length 48 [2018-09-30 20:06:16,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:16,335 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 1353 transitions. [2018-09-30 20:06:16,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 20:06:16,335 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1353 transitions. [2018-09-30 20:06:16,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-30 20:06:16,338 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:16,338 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 20:06:16,339 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:16,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:16,339 INFO L82 PathProgramCache]: Analyzing trace with hash -253604652, now seen corresponding path program 1 times [2018-09-30 20:06:16,341 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:16,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:16,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:16,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:16,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:16,514 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 20:06:16,514 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:16,514 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:06:16,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 20:06:16,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 20:06:16,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-30 20:06:16,515 INFO L87 Difference]: Start difference. First operand 916 states and 1353 transitions. Second operand 4 states. [2018-09-30 20:06:16,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:16,693 INFO L93 Difference]: Finished difference Result 1832 states and 2705 transitions. [2018-09-30 20:06:16,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:06:16,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-09-30 20:06:16,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:16,699 INFO L225 Difference]: With dead ends: 1832 [2018-09-30 20:06:16,700 INFO L226 Difference]: Without dead ends: 917 [2018-09-30 20:06:16,701 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 20:06:16,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-09-30 20:06:16,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 914. [2018-09-30 20:06:16,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2018-09-30 20:06:16,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1297 transitions. [2018-09-30 20:06:16,740 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1297 transitions. Word has length 67 [2018-09-30 20:06:16,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:16,741 INFO L480 AbstractCegarLoop]: Abstraction has 914 states and 1297 transitions. [2018-09-30 20:06:16,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 20:06:16,741 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1297 transitions. [2018-09-30 20:06:16,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-30 20:06:16,743 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:16,743 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 20:06:16,743 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:16,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:16,743 INFO L82 PathProgramCache]: Analyzing trace with hash 597366310, now seen corresponding path program 2 times [2018-09-30 20:06:16,744 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:16,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:16,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:16,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:16,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:16,810 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 20:06:16,810 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:16,810 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:06:16,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:06:16,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:06:16,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:06:16,811 INFO L87 Difference]: Start difference. First operand 914 states and 1297 transitions. Second operand 3 states. [2018-09-30 20:06:16,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:16,899 INFO L93 Difference]: Finished difference Result 1833 states and 2596 transitions. [2018-09-30 20:06:16,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:06:16,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-09-30 20:06:16,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:16,903 INFO L225 Difference]: With dead ends: 1833 [2018-09-30 20:06:16,904 INFO L226 Difference]: Without dead ends: 852 [2018-09-30 20:06:16,905 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 20:06:16,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2018-09-30 20:06:16,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 827. [2018-09-30 20:06:16,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2018-09-30 20:06:16,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1131 transitions. [2018-09-30 20:06:16,941 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1131 transitions. Word has length 68 [2018-09-30 20:06:16,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:16,941 INFO L480 AbstractCegarLoop]: Abstraction has 827 states and 1131 transitions. [2018-09-30 20:06:16,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:06:16,941 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1131 transitions. [2018-09-30 20:06:16,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-30 20:06:16,943 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:16,944 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 20:06:16,944 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:16,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:16,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1297357211, now seen corresponding path program 1 times [2018-09-30 20:06:16,945 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:16,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:16,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:16,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:06:16,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:18,016 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 20:06:18,016 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:18,016 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 20:06:18,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:18,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:18,833 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 20:06:18,855 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:06:18,855 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 26 [2018-09-30 20:06:18,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-30 20:06:18,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-30 20:06:18,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2018-09-30 20:06:18,857 INFO L87 Difference]: Start difference. First operand 827 states and 1131 transitions. Second operand 27 states. [2018-09-30 20:06:19,960 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2018-09-30 20:06:20,928 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2018-09-30 20:06:21,145 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2018-09-30 20:06:21,529 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2018-09-30 20:06:21,695 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2018-09-30 20:06:22,617 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2018-09-30 20:06:22,794 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2018-09-30 20:06:23,243 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2018-09-30 20:06:23,625 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2018-09-30 20:06:24,005 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2018-09-30 20:06:24,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:24,473 INFO L93 Difference]: Finished difference Result 2306 states and 2951 transitions. [2018-09-30 20:06:24,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-30 20:06:24,474 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 84 [2018-09-30 20:06:24,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:24,482 INFO L225 Difference]: With dead ends: 2306 [2018-09-30 20:06:24,482 INFO L226 Difference]: Without dead ends: 2305 [2018-09-30 20:06:24,484 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 20:06:24,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2018-09-30 20:06:24,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 951. [2018-09-30 20:06:24,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2018-09-30 20:06:24,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1304 transitions. [2018-09-30 20:06:24,550 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1304 transitions. Word has length 84 [2018-09-30 20:06:24,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:24,551 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 1304 transitions. [2018-09-30 20:06:24,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-30 20:06:24,551 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1304 transitions. [2018-09-30 20:06:24,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-30 20:06:24,553 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:24,554 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 20:06:24,554 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:24,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:24,554 INFO L82 PathProgramCache]: Analyzing trace with hash -604514526, now seen corresponding path program 1 times [2018-09-30 20:06:24,554 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:24,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:24,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:24,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:24,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:24,652 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 20:06:24,652 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:24,653 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:06:24,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:06:24,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:06:24,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:06:24,654 INFO L87 Difference]: Start difference. First operand 951 states and 1304 transitions. Second operand 3 states. [2018-09-30 20:06:24,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:24,940 INFO L93 Difference]: Finished difference Result 1902 states and 2607 transitions. [2018-09-30 20:06:24,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:06:24,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-09-30 20:06:24,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:24,944 INFO L225 Difference]: With dead ends: 1902 [2018-09-30 20:06:24,944 INFO L226 Difference]: Without dead ends: 952 [2018-09-30 20:06:24,946 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 20:06:24,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2018-09-30 20:06:25,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 896. [2018-09-30 20:06:25,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-09-30 20:06:25,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1202 transitions. [2018-09-30 20:06:25,003 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1202 transitions. Word has length 85 [2018-09-30 20:06:25,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:25,003 INFO L480 AbstractCegarLoop]: Abstraction has 896 states and 1202 transitions. [2018-09-30 20:06:25,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:06:25,004 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1202 transitions. [2018-09-30 20:06:25,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-30 20:06:25,006 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:25,006 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 20:06:25,006 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:25,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:25,006 INFO L82 PathProgramCache]: Analyzing trace with hash 722130188, now seen corresponding path program 1 times [2018-09-30 20:06:25,007 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:25,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:25,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:25,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:25,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:25,086 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 20:06:25,086 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:25,086 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:06:25,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:06:25,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:06:25,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:06:25,087 INFO L87 Difference]: Start difference. First operand 896 states and 1202 transitions. Second operand 3 states. [2018-09-30 20:06:25,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:25,176 INFO L93 Difference]: Finished difference Result 1560 states and 2084 transitions. [2018-09-30 20:06:25,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:06:25,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-09-30 20:06:25,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:25,179 INFO L225 Difference]: With dead ends: 1560 [2018-09-30 20:06:25,179 INFO L226 Difference]: Without dead ends: 640 [2018-09-30 20:06:25,180 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 20:06:25,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-09-30 20:06:25,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 554. [2018-09-30 20:06:25,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-09-30 20:06:25,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 719 transitions. [2018-09-30 20:06:25,226 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 719 transitions. Word has length 87 [2018-09-30 20:06:25,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:25,226 INFO L480 AbstractCegarLoop]: Abstraction has 554 states and 719 transitions. [2018-09-30 20:06:25,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:06:25,226 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 719 transitions. [2018-09-30 20:06:25,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-30 20:06:25,228 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:25,228 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 20:06:25,229 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:25,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:25,229 INFO L82 PathProgramCache]: Analyzing trace with hash 818701568, now seen corresponding path program 1 times [2018-09-30 20:06:25,229 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:25,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:25,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:25,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:25,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:25,634 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 20:06:25,634 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:06:25,634 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 20:06:25,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:25,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:06:25,847 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 20:06:25,883 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:06:25,884 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-09-30 20:06:25,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:06:25,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:06:25,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-09-30 20:06:25,885 INFO L87 Difference]: Start difference. First operand 554 states and 719 transitions. Second operand 7 states. [2018-09-30 20:06:26,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:26,072 INFO L93 Difference]: Finished difference Result 1394 states and 1802 transitions. [2018-09-30 20:06:26,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 20:06:26,072 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-09-30 20:06:26,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:26,075 INFO L225 Difference]: With dead ends: 1394 [2018-09-30 20:06:26,075 INFO L226 Difference]: Without dead ends: 724 [2018-09-30 20:06:26,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:06:26,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2018-09-30 20:06:26,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 323. [2018-09-30 20:06:26,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-09-30 20:06:26,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 408 transitions. [2018-09-30 20:06:26,101 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 408 transitions. Word has length 89 [2018-09-30 20:06:26,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:26,102 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 408 transitions. [2018-09-30 20:06:26,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:06:26,102 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 408 transitions. [2018-09-30 20:06:26,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-30 20:06:26,103 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:26,103 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 20:06:26,103 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:26,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:26,104 INFO L82 PathProgramCache]: Analyzing trace with hash -199349933, now seen corresponding path program 2 times [2018-09-30 20:06:26,104 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:26,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:26,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:26,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:26,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:26,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:26,182 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 20:06:26,183 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:26,183 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:06:26,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:06:26,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:06:26,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:06:26,184 INFO L87 Difference]: Start difference. First operand 323 states and 408 transitions. Second operand 3 states. [2018-09-30 20:06:26,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:26,514 INFO L93 Difference]: Finished difference Result 566 states and 704 transitions. [2018-09-30 20:06:26,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:06:26,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2018-09-30 20:06:26,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:26,515 INFO L225 Difference]: With dead ends: 566 [2018-09-30 20:06:26,515 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 20:06:26,516 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 20:06:26,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 20:06:26,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 20:06:26,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 20:06:26,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 20:06:26,517 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2018-09-30 20:06:26,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:26,518 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 20:06:26,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:06:26,518 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 20:06:26,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 20:06:26,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 20:06:26,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:26,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:26,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:26,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:27,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:27,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:27,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:06:28,237 WARN L178 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 509 DAG size of output: 449 [2018-09-30 20:06:34,922 WARN L178 SmtUtils]: Spent 6.68 s on a formula simplification. DAG size of input: 436 DAG size of output: 113 [2018-09-30 20:06:34,925 INFO L426 ceAbstractionStarter]: For program point ElevatorErr0ASSERT_VIOLATIONASSERT(line 185) no Hoare annotation was computed. [2018-09-30 20:06:34,926 INFO L426 ceAbstractionStarter]: For program point L168(lines 168 183) no Hoare annotation was computed. [2018-09-30 20:06:34,926 INFO L426 ceAbstractionStarter]: For program point L135(lines 135 142) no Hoare annotation was computed. [2018-09-30 20:06:34,926 INFO L426 ceAbstractionStarter]: For program point L135-2(lines 111 160) no Hoare annotation was computed. [2018-09-30 20:06:34,926 INFO L426 ceAbstractionStarter]: For program point L94(lines 94 108) no Hoare annotation was computed. [2018-09-30 20:06:34,926 INFO L426 ceAbstractionStarter]: For program point L152(lines 152 160) no Hoare annotation was computed. [2018-09-30 20:06:34,926 INFO L426 ceAbstractionStarter]: For program point L103(lines 103 108) no Hoare annotation was computed. [2018-09-30 20:06:34,926 INFO L426 ceAbstractionStarter]: For program point L103-2(lines 89 142) no Hoare annotation was computed. [2018-09-30 20:06:34,926 INFO L426 ceAbstractionStarter]: For program point L178(lines 178 183) no Hoare annotation was computed. [2018-09-30 20:06:34,927 INFO L426 ceAbstractionStarter]: For program point L178-2(lines 163 183) no Hoare annotation was computed. [2018-09-30 20:06:34,927 INFO L426 ceAbstractionStarter]: For program point L129(lines 129 142) no Hoare annotation was computed. [2018-09-30 20:06:34,927 INFO L426 ceAbstractionStarter]: For program point L96(lines 96 108) no Hoare annotation was computed. [2018-09-30 20:06:34,927 INFO L426 ceAbstractionStarter]: For program point L80(lines 80 82) no Hoare annotation was computed. [2018-09-30 20:06:34,927 INFO L426 ceAbstractionStarter]: For program point L80-2(lines 80 85) no Hoare annotation was computed. [2018-09-30 20:06:34,927 INFO L426 ceAbstractionStarter]: For program point L171(lines 171 183) no Hoare annotation was computed. [2018-09-30 20:06:34,927 INFO L426 ceAbstractionStarter]: For program point L155(lines 155 160) no Hoare annotation was computed. [2018-09-30 20:06:34,927 INFO L426 ceAbstractionStarter]: For program point L155-2(lines 145 183) no Hoare annotation was computed. [2018-09-30 20:06:34,928 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 20:06:34,929 INFO L426 ceAbstractionStarter]: For program point L123(lines 123 142) no Hoare annotation was computed. [2018-09-30 20:06:34,929 INFO L426 ceAbstractionStarter]: For program point L165(lines 165 183) no Hoare annotation was computed. [2018-09-30 20:06:34,929 INFO L426 ceAbstractionStarter]: For program point L99(lines 99 108) no Hoare annotation was computed. [2018-09-30 20:06:34,929 INFO L426 ceAbstractionStarter]: For program point ElevatorEXIT(lines 13 188) no Hoare annotation was computed. [2018-09-30 20:06:34,929 INFO L426 ceAbstractionStarter]: For program point L91(lines 91 108) no Hoare annotation was computed. [2018-09-30 20:06:34,929 INFO L426 ceAbstractionStarter]: For program point L149(lines 149 160) no Hoare annotation was computed. [2018-09-30 20:06:34,929 INFO L426 ceAbstractionStarter]: For program point L116(lines 116 142) no Hoare annotation was computed. [2018-09-30 20:06:34,929 INFO L426 ceAbstractionStarter]: For program point L83-1(lines 83 108) no Hoare annotation was computed. [2018-09-30 20:06:34,929 INFO L426 ceAbstractionStarter]: For program point ElevatorENTRY(lines 13 188) no Hoare annotation was computed. [2018-09-30 20:06:34,930 INFO L426 ceAbstractionStarter]: For program point L175(lines 175 183) no Hoare annotation was computed. [2018-09-30 20:06:34,930 INFO L426 ceAbstractionStarter]: For program point L101(lines 101 108) no Hoare annotation was computed. [2018-09-30 20:06:34,952 INFO L202 PluginConnector]: Adding new model Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 08:06:34 BoogieIcfgContainer [2018-09-30 20:06:34,952 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 20:06:34,953 INFO L168 Benchmark]: Toolchain (without parser) took 29765.90 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: -180.8 MB). Peak memory consumption was 780.6 MB. Max. memory is 7.1 GB. [2018-09-30 20:06:34,954 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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 20:06:34,955 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.65 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 20:06:34,955 INFO L168 Benchmark]: Boogie Preprocessor took 29.92 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 20:06:34,956 INFO L168 Benchmark]: RCFGBuilder took 812.29 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 20:06:34,957 INFO L168 Benchmark]: TraceAbstraction took 28868.44 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: -212.5 MB). Peak memory consumption was 748.9 MB. Max. memory is 7.1 GB. [2018-09-30 20:06:34,960 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.21 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 44.65 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 29.92 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 812.29 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 28868.44 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: -212.5 MB). Peak memory consumption was 748.9 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, 28.7s OverallTime, 18 OverallIterations, 6 TraceHistogramMax, 13.3s AutomataDifference, 0.0s DeadEndRemovalTime, 8.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1068 SDtfs, 1946 SDslu, 2970 SDs, 0 SdLazy, 2059 SolverSat, 235 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 417 GetRequests, 280 SyntacticMatches, 5 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 10.5s 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.7s HoareSimplificationTime, 1 FomulaSimplificationsInter, 246468 FormulaSimplificationTreeSizeReductionInter, 6.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.4s 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_20-06-34-976.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_20-06-34-976.csv Received shutdown request...