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/ElevatorWithAssignments.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 23:06:06,198 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 23:06:06,200 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 23:06:06,212 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 23:06:06,213 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 23:06:06,214 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 23:06:06,215 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 23:06:06,217 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 23:06:06,219 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 23:06:06,220 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 23:06:06,221 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 23:06:06,221 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 23:06:06,222 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 23:06:06,223 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 23:06:06,225 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 23:06:06,225 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 23:06:06,226 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 23:06:06,228 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 23:06:06,230 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 23:06:06,232 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 23:06:06,234 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 23:06:06,235 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 23:06:06,238 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 23:06:06,239 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 23:06:06,239 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 23:06:06,240 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 23:06:06,241 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 23:06:06,242 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 23:06:06,243 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 23:06:06,244 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 23:06:06,245 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 23:06:06,246 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 23:06:06,246 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 23:06:06,246 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 23:06:06,247 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 23:06:06,248 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 23:06:06,248 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 23:06:06,264 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 23:06:06,265 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 23:06:06,266 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 23:06:06,266 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 23:06:06,267 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 23:06:06,267 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 23:06:06,267 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 23:06:06,267 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 23:06:06,270 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 23:06:06,270 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 23:06:06,271 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 23:06:06,271 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 23:06:06,271 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 23:06:06,271 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 23:06:06,271 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 23:06:06,271 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 23:06:06,272 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 23:06:06,272 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 23:06:06,272 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 23:06:06,272 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 23:06:06,273 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 23:06:06,273 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 23:06:06,273 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 23:06:06,273 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 23:06:06,273 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 23:06:06,273 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 23:06:06,274 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 23:06:06,274 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 23:06:06,274 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 23:06:06,274 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 23:06:06,348 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 23:06:06,361 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 23:06:06,364 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 23:06:06,366 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 23:06:06,367 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 23:06:06,368 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/ElevatorWithAssignments.bpl [2018-09-30 23:06:06,368 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/ElevatorWithAssignments.bpl' [2018-09-30 23:06:06,434 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 23:06:06,437 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 23:06:06,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 23:06:06,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 23:06:06,440 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 23:06:06,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:06" (1/1) ... [2018-09-30 23:06:06,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:06" (1/1) ... [2018-09-30 23:06:06,482 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 23:06:06,483 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 23:06:06,483 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 23:06:06,486 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 23:06:06,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 23:06:06,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 23:06:06,487 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 23:06:06,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:06" (1/1) ... [2018-09-30 23:06:06,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:06" (1/1) ... [2018-09-30 23:06:06,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:06" (1/1) ... [2018-09-30 23:06:06,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:06" (1/1) ... [2018-09-30 23:06:06,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:06" (1/1) ... [2018-09-30 23:06:06,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:06" (1/1) ... [2018-09-30 23:06:06,530 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:06" (1/1) ... [2018-09-30 23:06:06,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 23:06:06,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 23:06:06,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 23:06:06,533 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 23:06:06,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:06" (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 23:06:06,603 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Elevator given in one single declaration [2018-09-30 23:06:06,603 INFO L130 BoogieDeclarations]: Found specification of procedure Elevator [2018-09-30 23:06:06,603 INFO L138 BoogieDeclarations]: Found implementation of procedure Elevator [2018-09-30 23:06:07,206 INFO L345 CfgBuilder]: Using library mode [2018-09-30 23:06:07,206 INFO L202 PluginConnector]: Adding new model ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 11:06:07 BoogieIcfgContainer [2018-09-30 23:06:07,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 23:06:07,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 23:06:07,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 23:06:07,211 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 23:06:07,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 11:06:06" (1/2) ... [2018-09-30 23:06:07,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26231340 and model type ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 11:06:07, skipping insertion in model container [2018-09-30 23:06:07,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 11:06:07" (2/2) ... [2018-09-30 23:06:07,215 INFO L112 eAbstractionObserver]: Analyzing ICFG ElevatorWithAssignments.bpl [2018-09-30 23:06:07,225 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 23:06:07,234 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 23:06:07,283 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 23:06:07,283 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 23:06:07,284 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 23:06:07,284 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 23:06:07,284 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 23:06:07,284 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 23:06:07,284 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 23:06:07,284 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 23:06:07,285 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 23:06:07,300 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-09-30 23:06:07,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-09-30 23:06:07,307 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:07,307 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-09-30 23:06:07,308 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 23:06:07,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:07,314 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-09-30 23:06:07,315 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:07,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:07,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:07,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:07,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:07,458 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 23:06:07,460 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:07,460 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-09-30 23:06:07,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:06:07,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:06:07,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:06:07,483 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2018-09-30 23:06:07,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:07,694 INFO L93 Difference]: Finished difference Result 84 states and 157 transitions. [2018-09-30 23:06:07,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:06:07,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-09-30 23:06:07,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:07,718 INFO L225 Difference]: With dead ends: 84 [2018-09-30 23:06:07,718 INFO L226 Difference]: Without dead ends: 54 [2018-09-30 23:06:07,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 23:06:07,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-30 23:06:07,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-09-30 23:06:07,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-30 23:06:07,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 93 transitions. [2018-09-30 23:06:07,772 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 93 transitions. Word has length 2 [2018-09-30 23:06:07,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:07,772 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 93 transitions. [2018-09-30 23:06:07,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:06:07,772 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 93 transitions. [2018-09-30 23:06:07,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 23:06:07,773 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:07,773 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:07,774 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 23:06:07,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:07,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1770004619, now seen corresponding path program 1 times [2018-09-30 23:06:07,774 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:07,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:07,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:07,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:07,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:07,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:07,842 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:07,842 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 23:06:07,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:06:07,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:06:07,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:06:07,845 INFO L87 Difference]: Start difference. First operand 53 states and 93 transitions. Second operand 3 states. [2018-09-30 23:06:08,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:08,047 INFO L93 Difference]: Finished difference Result 157 states and 277 transitions. [2018-09-30 23:06:08,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:06:08,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-09-30 23:06:08,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:08,054 INFO L225 Difference]: With dead ends: 157 [2018-09-30 23:06:08,055 INFO L226 Difference]: Without dead ends: 101 [2018-09-30 23:06:08,056 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 23:06:08,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-30 23:06:08,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-09-30 23:06:08,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-30 23:06:08,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 175 transitions. [2018-09-30 23:06:08,086 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 175 transitions. Word has length 14 [2018-09-30 23:06:08,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:08,086 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 175 transitions. [2018-09-30 23:06:08,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:06:08,087 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 175 transitions. [2018-09-30 23:06:08,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 23:06:08,088 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:08,088 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:08,088 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 23:06:08,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:08,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1068940041, now seen corresponding path program 1 times [2018-09-30 23:06:08,089 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:08,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:08,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:08,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:08,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:08,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:08,137 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:08,137 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:06:08,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:06:08,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:06:08,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:06:08,139 INFO L87 Difference]: Start difference. First operand 100 states and 175 transitions. Second operand 3 states. [2018-09-30 23:06:08,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:08,319 INFO L93 Difference]: Finished difference Result 205 states and 356 transitions. [2018-09-30 23:06:08,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:06:08,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-09-30 23:06:08,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:08,322 INFO L225 Difference]: With dead ends: 205 [2018-09-30 23:06:08,322 INFO L226 Difference]: Without dead ends: 104 [2018-09-30 23:06:08,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 23:06:08,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-30 23:06:08,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 89. [2018-09-30 23:06:08,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-30 23:06:08,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 152 transitions. [2018-09-30 23:06:08,335 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 152 transitions. Word has length 14 [2018-09-30 23:06:08,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:08,336 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 152 transitions. [2018-09-30 23:06:08,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:06:08,336 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 152 transitions. [2018-09-30 23:06:08,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-30 23:06:08,337 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:08,338 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:08,338 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 23:06:08,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:08,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1940946465, now seen corresponding path program 1 times [2018-09-30 23:06:08,339 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:08,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:08,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:08,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:08,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:08,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:08,535 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:08,536 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 23:06:08,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 23:06:08,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 23:06:08,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-30 23:06:08,537 INFO L87 Difference]: Start difference. First operand 89 states and 152 transitions. Second operand 5 states. [2018-09-30 23:06:08,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:08,680 INFO L93 Difference]: Finished difference Result 321 states and 545 transitions. [2018-09-30 23:06:08,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 23:06:08,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-09-30 23:06:08,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:08,685 INFO L225 Difference]: With dead ends: 321 [2018-09-30 23:06:08,686 INFO L226 Difference]: Without dead ends: 209 [2018-09-30 23:06:08,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-30 23:06:08,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-09-30 23:06:08,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2018-09-30 23:06:08,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-09-30 23:06:08,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 346 transitions. [2018-09-30 23:06:08,707 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 346 transitions. Word has length 19 [2018-09-30 23:06:08,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:08,707 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 346 transitions. [2018-09-30 23:06:08,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 23:06:08,708 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 346 transitions. [2018-09-30 23:06:08,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-30 23:06:08,710 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:08,710 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:08,710 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 23:06:08,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:08,711 INFO L82 PathProgramCache]: Analyzing trace with hash 2002343284, now seen corresponding path program 1 times [2018-09-30 23:06:08,711 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:08,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:08,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:08,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:08,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:08,781 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-30 23:06:08,782 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:08,782 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:06:08,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:06:08,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:06:08,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:06:08,783 INFO L87 Difference]: Start difference. First operand 207 states and 346 transitions. Second operand 3 states. [2018-09-30 23:06:08,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:08,894 INFO L93 Difference]: Finished difference Result 522 states and 865 transitions. [2018-09-30 23:06:08,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:06:08,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-09-30 23:06:08,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:08,900 INFO L225 Difference]: With dead ends: 522 [2018-09-30 23:06:08,900 INFO L226 Difference]: Without dead ends: 310 [2018-09-30 23:06:08,902 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 23:06:08,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-09-30 23:06:08,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 213. [2018-09-30 23:06:08,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-30 23:06:08,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 352 transitions. [2018-09-30 23:06:08,933 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 352 transitions. Word has length 41 [2018-09-30 23:06:08,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:08,934 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 352 transitions. [2018-09-30 23:06:08,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:06:08,934 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 352 transitions. [2018-09-30 23:06:08,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-30 23:06:08,935 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:08,936 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:08,937 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 23:06:08,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:08,937 INFO L82 PathProgramCache]: Analyzing trace with hash 2074119508, now seen corresponding path program 1 times [2018-09-30 23:06:08,937 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:08,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:08,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:08,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:08,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:09,000 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-09-30 23:06:09,001 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:09,001 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:06:09,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:06:09,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:06:09,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:06:09,002 INFO L87 Difference]: Start difference. First operand 213 states and 352 transitions. Second operand 3 states. [2018-09-30 23:06:09,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:09,175 INFO L93 Difference]: Finished difference Result 588 states and 972 transitions. [2018-09-30 23:06:09,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:06:09,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-09-30 23:06:09,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:09,183 INFO L225 Difference]: With dead ends: 588 [2018-09-30 23:06:09,184 INFO L226 Difference]: Without dead ends: 367 [2018-09-30 23:06:09,185 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 23:06:09,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-09-30 23:06:09,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 354. [2018-09-30 23:06:09,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-09-30 23:06:09,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 570 transitions. [2018-09-30 23:06:09,215 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 570 transitions. Word has length 42 [2018-09-30 23:06:09,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:09,215 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 570 transitions. [2018-09-30 23:06:09,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:06:09,216 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 570 transitions. [2018-09-30 23:06:09,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-30 23:06:09,217 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:09,218 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-09-30 23:06:09,218 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 23:06:09,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:09,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1430938278, now seen corresponding path program 1 times [2018-09-30 23:06:09,219 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:09,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:09,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:09,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:09,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:09,261 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-30 23:06:09,262 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:09,262 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:06:09,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:06:09,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:06:09,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:06:09,263 INFO L87 Difference]: Start difference. First operand 354 states and 570 transitions. Second operand 3 states. [2018-09-30 23:06:09,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:09,651 INFO L93 Difference]: Finished difference Result 880 states and 1399 transitions. [2018-09-30 23:06:09,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:06:09,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-09-30 23:06:09,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:09,656 INFO L225 Difference]: With dead ends: 880 [2018-09-30 23:06:09,656 INFO L226 Difference]: Without dead ends: 542 [2018-09-30 23:06:09,657 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 23:06:09,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-09-30 23:06:09,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 366. [2018-09-30 23:06:09,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-09-30 23:06:09,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 582 transitions. [2018-09-30 23:06:09,677 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 582 transitions. Word has length 44 [2018-09-30 23:06:09,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:09,678 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 582 transitions. [2018-09-30 23:06:09,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:06:09,678 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 582 transitions. [2018-09-30 23:06:09,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-30 23:06:09,680 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:09,680 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-09-30 23:06:09,680 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 23:06:09,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:09,681 INFO L82 PathProgramCache]: Analyzing trace with hash -138883553, now seen corresponding path program 1 times [2018-09-30 23:06:09,681 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:09,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:09,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:09,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:09,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:09,807 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 23:06:09,807 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:09,808 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 23:06:09,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 23:06:09,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 23:06:09,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-30 23:06:09,811 INFO L87 Difference]: Start difference. First operand 366 states and 582 transitions. Second operand 4 states. [2018-09-30 23:06:09,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:09,942 INFO L93 Difference]: Finished difference Result 1096 states and 1744 transitions. [2018-09-30 23:06:09,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:06:09,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-09-30 23:06:09,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:09,952 INFO L225 Difference]: With dead ends: 1096 [2018-09-30 23:06:09,952 INFO L226 Difference]: Without dead ends: 731 [2018-09-30 23:06:09,954 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-30 23:06:09,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-09-30 23:06:09,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 666. [2018-09-30 23:06:09,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2018-09-30 23:06:09,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1037 transitions. [2018-09-30 23:06:09,987 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1037 transitions. Word has length 46 [2018-09-30 23:06:09,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:09,988 INFO L480 AbstractCegarLoop]: Abstraction has 666 states and 1037 transitions. [2018-09-30 23:06:09,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 23:06:09,988 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1037 transitions. [2018-09-30 23:06:09,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-30 23:06:09,990 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:09,990 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-09-30 23:06:09,996 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 23:06:09,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:09,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1242691348, now seen corresponding path program 1 times [2018-09-30 23:06:09,997 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:09,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:09,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:09,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:09,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:10,351 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-09-30 23:06:10,585 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2018-09-30 23:06:10,750 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:10,750 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:06:10,750 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 23:06:10,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:10,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:06:11,141 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 23:06:11,171 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:06:11,172 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-09-30 23:06:11,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 23:06:11,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 23:06:11,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-09-30 23:06:11,173 INFO L87 Difference]: Start difference. First operand 666 states and 1037 transitions. Second operand 8 states. [2018-09-30 23:06:11,757 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-30 23:06:12,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:12,223 INFO L93 Difference]: Finished difference Result 1293 states and 2002 transitions. [2018-09-30 23:06:12,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 23:06:12,225 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-09-30 23:06:12,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:12,232 INFO L225 Difference]: With dead ends: 1293 [2018-09-30 23:06:12,232 INFO L226 Difference]: Without dead ends: 1292 [2018-09-30 23:06:12,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:06:12,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2018-09-30 23:06:12,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1176. [2018-09-30 23:06:12,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-09-30 23:06:12,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1825 transitions. [2018-09-30 23:06:12,283 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1825 transitions. Word has length 49 [2018-09-30 23:06:12,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:12,284 INFO L480 AbstractCegarLoop]: Abstraction has 1176 states and 1825 transitions. [2018-09-30 23:06:12,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 23:06:12,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1825 transitions. [2018-09-30 23:06:12,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-30 23:06:12,286 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:12,287 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:12,287 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 23:06:12,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:12,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1557173637, now seen corresponding path program 1 times [2018-09-30 23:06:12,288 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:12,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:12,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:12,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:12,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:12,493 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-09-30 23:06:12,494 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:12,494 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 23:06:12,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 23:06:12,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 23:06:12,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-30 23:06:12,495 INFO L87 Difference]: Start difference. First operand 1176 states and 1825 transitions. Second operand 4 states. [2018-09-30 23:06:12,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:12,775 INFO L93 Difference]: Finished difference Result 2655 states and 4085 transitions. [2018-09-30 23:06:12,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 23:06:12,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-09-30 23:06:12,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:12,784 INFO L225 Difference]: With dead ends: 2655 [2018-09-30 23:06:12,784 INFO L226 Difference]: Without dead ends: 1510 [2018-09-30 23:06:12,786 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 23:06:12,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-09-30 23:06:12,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1468. [2018-09-30 23:06:12,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1468 states. [2018-09-30 23:06:12,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 2236 transitions. [2018-09-30 23:06:12,843 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 2236 transitions. Word has length 67 [2018-09-30 23:06:12,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:12,843 INFO L480 AbstractCegarLoop]: Abstraction has 1468 states and 2236 transitions. [2018-09-30 23:06:12,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 23:06:12,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 2236 transitions. [2018-09-30 23:06:12,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-30 23:06:12,846 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:12,846 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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 23:06:12,847 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 23:06:12,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:12,847 INFO L82 PathProgramCache]: Analyzing trace with hash -423460397, now seen corresponding path program 1 times [2018-09-30 23:06:12,849 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:12,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:12,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:12,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:12,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:12,958 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-09-30 23:06:12,958 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:12,958 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 23:06:12,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 23:06:12,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 23:06:12,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-30 23:06:12,960 INFO L87 Difference]: Start difference. First operand 1468 states and 2236 transitions. Second operand 4 states. [2018-09-30 23:06:13,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:13,029 INFO L93 Difference]: Finished difference Result 2726 states and 4172 transitions. [2018-09-30 23:06:13,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:06:13,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-09-30 23:06:13,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:13,039 INFO L225 Difference]: With dead ends: 2726 [2018-09-30 23:06:13,039 INFO L226 Difference]: Without dead ends: 1469 [2018-09-30 23:06:13,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-30 23:06:13,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2018-09-30 23:06:13,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1466. [2018-09-30 23:06:13,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1466 states. [2018-09-30 23:06:13,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 2172 transitions. [2018-09-30 23:06:13,097 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 2172 transitions. Word has length 68 [2018-09-30 23:06:13,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:13,098 INFO L480 AbstractCegarLoop]: Abstraction has 1466 states and 2172 transitions. [2018-09-30 23:06:13,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 23:06:13,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 2172 transitions. [2018-09-30 23:06:13,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-09-30 23:06:13,101 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:13,101 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:13,101 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 23:06:13,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:13,102 INFO L82 PathProgramCache]: Analyzing trace with hash -734626103, now seen corresponding path program 2 times [2018-09-30 23:06:13,102 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:13,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:13,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:13,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:13,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:13,194 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-09-30 23:06:13,194 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:13,194 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:06:13,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:06:13,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:06:13,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:06:13,196 INFO L87 Difference]: Start difference. First operand 1466 states and 2172 transitions. Second operand 3 states. [2018-09-30 23:06:13,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:13,431 INFO L93 Difference]: Finished difference Result 2942 states and 4353 transitions. [2018-09-30 23:06:13,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:06:13,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-09-30 23:06:13,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:13,439 INFO L225 Difference]: With dead ends: 2942 [2018-09-30 23:06:13,440 INFO L226 Difference]: Without dead ends: 1457 [2018-09-30 23:06:13,442 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 23:06:13,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2018-09-30 23:06:13,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1397. [2018-09-30 23:06:13,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1397 states. [2018-09-30 23:06:13,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 2012 transitions. [2018-09-30 23:06:13,493 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 2012 transitions. Word has length 69 [2018-09-30 23:06:13,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:13,494 INFO L480 AbstractCegarLoop]: Abstraction has 1397 states and 2012 transitions. [2018-09-30 23:06:13,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:06:13,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 2012 transitions. [2018-09-30 23:06:13,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-30 23:06:13,498 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:13,499 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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 23:06:13,499 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 23:06:13,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:13,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1023158359, now seen corresponding path program 1 times [2018-09-30 23:06:13,500 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:13,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:13,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:13,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:06:13,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:13,612 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-09-30 23:06:13,612 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:13,613 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:06:13,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:06:13,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:06:13,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:06:13,614 INFO L87 Difference]: Start difference. First operand 1397 states and 2012 transitions. Second operand 3 states. [2018-09-30 23:06:13,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:13,694 INFO L93 Difference]: Finished difference Result 3297 states and 4763 transitions. [2018-09-30 23:06:13,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:06:13,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-09-30 23:06:13,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:13,704 INFO L225 Difference]: With dead ends: 3297 [2018-09-30 23:06:13,704 INFO L226 Difference]: Without dead ends: 1830 [2018-09-30 23:06:13,707 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 23:06:13,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2018-09-30 23:06:13,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1612. [2018-09-30 23:06:13,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1612 states. [2018-09-30 23:06:13,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2296 transitions. [2018-09-30 23:06:13,761 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2296 transitions. Word has length 84 [2018-09-30 23:06:13,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:13,762 INFO L480 AbstractCegarLoop]: Abstraction has 1612 states and 2296 transitions. [2018-09-30 23:06:13,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:06:13,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2296 transitions. [2018-09-30 23:06:13,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-30 23:06:13,765 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:13,766 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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 23:06:13,766 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 23:06:13,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:13,767 INFO L82 PathProgramCache]: Analyzing trace with hash -147951611, now seen corresponding path program 1 times [2018-09-30 23:06:13,767 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:13,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:13,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:13,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:13,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:14,305 WARN L178 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-09-30 23:06:14,639 WARN L178 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 14 [2018-09-30 23:06:14,872 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 16 proven. 116 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-30 23:06:14,872 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:06:14,872 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 23:06:14,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:14,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:06:15,353 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 31 proven. 100 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-30 23:06:15,374 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:06:15,374 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-09-30 23:06:15,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 23:06:15,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 23:06:15,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-09-30 23:06:15,376 INFO L87 Difference]: Start difference. First operand 1612 states and 2296 transitions. Second operand 13 states. [2018-09-30 23:06:15,681 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-09-30 23:06:16,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:16,632 INFO L93 Difference]: Finished difference Result 3128 states and 4425 transitions. [2018-09-30 23:06:16,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 23:06:16,633 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 85 [2018-09-30 23:06:16,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:16,648 INFO L225 Difference]: With dead ends: 3128 [2018-09-30 23:06:16,648 INFO L226 Difference]: Without dead ends: 3127 [2018-09-30 23:06:16,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-09-30 23:06:16,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3127 states. [2018-09-30 23:06:16,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3127 to 1270. [2018-09-30 23:06:16,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1270 states. [2018-09-30 23:06:16,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1805 transitions. [2018-09-30 23:06:16,703 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1805 transitions. Word has length 85 [2018-09-30 23:06:16,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:16,703 INFO L480 AbstractCegarLoop]: Abstraction has 1270 states and 1805 transitions. [2018-09-30 23:06:16,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 23:06:16,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1805 transitions. [2018-09-30 23:06:16,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-30 23:06:16,707 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:16,707 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:16,707 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 23:06:16,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:16,708 INFO L82 PathProgramCache]: Analyzing trace with hash -2004113356, now seen corresponding path program 1 times [2018-09-30 23:06:16,708 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:16,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:16,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:16,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:16,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:16,785 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-09-30 23:06:16,786 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:16,786 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:06:16,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:06:16,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:06:16,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:06:16,787 INFO L87 Difference]: Start difference. First operand 1270 states and 1805 transitions. Second operand 3 states. [2018-09-30 23:06:17,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:17,054 INFO L93 Difference]: Finished difference Result 2399 states and 3394 transitions. [2018-09-30 23:06:17,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:06:17,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-09-30 23:06:17,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:17,060 INFO L225 Difference]: With dead ends: 2399 [2018-09-30 23:06:17,060 INFO L226 Difference]: Without dead ends: 1130 [2018-09-30 23:06:17,062 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 23:06:17,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2018-09-30 23:06:17,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1129. [2018-09-30 23:06:17,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1129 states. [2018-09-30 23:06:17,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1537 transitions. [2018-09-30 23:06:17,098 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1537 transitions. Word has length 87 [2018-09-30 23:06:17,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:17,098 INFO L480 AbstractCegarLoop]: Abstraction has 1129 states and 1537 transitions. [2018-09-30 23:06:17,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:06:17,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1537 transitions. [2018-09-30 23:06:17,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-30 23:06:17,102 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:17,102 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:17,102 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 23:06:17,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:17,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1082348105, now seen corresponding path program 1 times [2018-09-30 23:06:17,103 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:17,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:17,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:17,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:17,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:17,185 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-09-30 23:06:17,185 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:17,185 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:06:17,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:06:17,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:06:17,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:06:17,186 INFO L87 Difference]: Start difference. First operand 1129 states and 1537 transitions. Second operand 3 states. [2018-09-30 23:06:17,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:17,350 INFO L93 Difference]: Finished difference Result 2013 states and 2713 transitions. [2018-09-30 23:06:17,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:06:17,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-09-30 23:06:17,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:17,355 INFO L225 Difference]: With dead ends: 2013 [2018-09-30 23:06:17,355 INFO L226 Difference]: Without dead ends: 850 [2018-09-30 23:06:17,357 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 23:06:17,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2018-09-30 23:06:17,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 700. [2018-09-30 23:06:17,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2018-09-30 23:06:17,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 909 transitions. [2018-09-30 23:06:17,383 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 909 transitions. Word has length 87 [2018-09-30 23:06:17,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:17,384 INFO L480 AbstractCegarLoop]: Abstraction has 700 states and 909 transitions. [2018-09-30 23:06:17,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:06:17,384 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 909 transitions. [2018-09-30 23:06:17,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-30 23:06:17,386 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:17,386 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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 23:06:17,386 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 23:06:17,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:17,387 INFO L82 PathProgramCache]: Analyzing trace with hash -951849668, now seen corresponding path program 1 times [2018-09-30 23:06:17,387 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:17,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:17,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:17,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:17,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:18,142 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 107 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-09-30 23:06:18,143 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:06:18,143 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 23:06:18,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:18,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:06:18,291 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 107 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-09-30 23:06:18,312 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:06:18,312 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2018-09-30 23:06:18,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 23:06:18,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 23:06:18,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-09-30 23:06:18,313 INFO L87 Difference]: Start difference. First operand 700 states and 909 transitions. Second operand 11 states. [2018-09-30 23:06:19,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:19,140 INFO L93 Difference]: Finished difference Result 1537 states and 1981 transitions. [2018-09-30 23:06:19,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 23:06:19,140 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2018-09-30 23:06:19,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:19,144 INFO L225 Difference]: With dead ends: 1537 [2018-09-30 23:06:19,144 INFO L226 Difference]: Without dead ends: 1017 [2018-09-30 23:06:19,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-09-30 23:06:19,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2018-09-30 23:06:19,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 761. [2018-09-30 23:06:19,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2018-09-30 23:06:19,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 978 transitions. [2018-09-30 23:06:19,172 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 978 transitions. Word has length 90 [2018-09-30 23:06:19,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:19,172 INFO L480 AbstractCegarLoop]: Abstraction has 761 states and 978 transitions. [2018-09-30 23:06:19,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 23:06:19,172 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 978 transitions. [2018-09-30 23:06:19,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-09-30 23:06:19,174 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:19,174 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:19,175 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 23:06:19,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:19,175 INFO L82 PathProgramCache]: Analyzing trace with hash 21511062, now seen corresponding path program 1 times [2018-09-30 23:06:19,175 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:19,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:19,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:19,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:19,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:19,397 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 160 proven. 13 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-30 23:06:19,397 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:06:19,397 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 23:06:19,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:19,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:06:19,498 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-09-30 23:06:19,531 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 23:06:19,531 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-09-30 23:06:19,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 23:06:19,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 23:06:19,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-30 23:06:19,532 INFO L87 Difference]: Start difference. First operand 761 states and 978 transitions. Second operand 5 states. [2018-09-30 23:06:19,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:19,669 INFO L93 Difference]: Finished difference Result 1396 states and 1798 transitions. [2018-09-30 23:06:19,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 23:06:19,669 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-09-30 23:06:19,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:19,671 INFO L225 Difference]: With dead ends: 1396 [2018-09-30 23:06:19,671 INFO L226 Difference]: Without dead ends: 661 [2018-09-30 23:06:19,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-30 23:06:19,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2018-09-30 23:06:19,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2018-09-30 23:06:19,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2018-09-30 23:06:19,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 792 transitions. [2018-09-30 23:06:19,693 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 792 transitions. Word has length 99 [2018-09-30 23:06:19,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:19,694 INFO L480 AbstractCegarLoop]: Abstraction has 661 states and 792 transitions. [2018-09-30 23:06:19,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 23:06:19,694 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 792 transitions. [2018-09-30 23:06:19,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-09-30 23:06:19,696 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:19,696 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:19,696 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 23:06:19,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:19,697 INFO L82 PathProgramCache]: Analyzing trace with hash -224853863, now seen corresponding path program 1 times [2018-09-30 23:06:19,697 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:19,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:19,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:19,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:19,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:19,779 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-09-30 23:06:19,779 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:19,779 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:06:19,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:06:19,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:06:19,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:06:19,780 INFO L87 Difference]: Start difference. First operand 661 states and 792 transitions. Second operand 3 states. [2018-09-30 23:06:19,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:19,837 INFO L93 Difference]: Finished difference Result 1306 states and 1552 transitions. [2018-09-30 23:06:19,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:06:19,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2018-09-30 23:06:19,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:19,840 INFO L225 Difference]: With dead ends: 1306 [2018-09-30 23:06:19,841 INFO L226 Difference]: Without dead ends: 667 [2018-09-30 23:06:19,842 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 23:06:19,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-09-30 23:06:19,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 607. [2018-09-30 23:06:19,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2018-09-30 23:06:19,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 700 transitions. [2018-09-30 23:06:19,862 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 700 transitions. Word has length 103 [2018-09-30 23:06:19,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:19,863 INFO L480 AbstractCegarLoop]: Abstraction has 607 states and 700 transitions. [2018-09-30 23:06:19,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:06:19,863 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 700 transitions. [2018-09-30 23:06:19,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-30 23:06:19,865 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:19,865 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 1] [2018-09-30 23:06:19,865 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 23:06:19,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:19,865 INFO L82 PathProgramCache]: Analyzing trace with hash 707364856, now seen corresponding path program 1 times [2018-09-30 23:06:19,866 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:19,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:19,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:19,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:19,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:20,171 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-09-30 23:06:20,171 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:20,171 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 23:06:20,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 23:06:20,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 23:06:20,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-30 23:06:20,172 INFO L87 Difference]: Start difference. First operand 607 states and 700 transitions. Second operand 5 states. [2018-09-30 23:06:20,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:20,542 INFO L93 Difference]: Finished difference Result 930 states and 1072 transitions. [2018-09-30 23:06:20,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 23:06:20,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2018-09-30 23:06:20,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:20,544 INFO L225 Difference]: With dead ends: 930 [2018-09-30 23:06:20,544 INFO L226 Difference]: Without dead ends: 336 [2018-09-30 23:06:20,545 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-30 23:06:20,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-09-30 23:06:20,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 335. [2018-09-30 23:06:20,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-09-30 23:06:20,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 382 transitions. [2018-09-30 23:06:20,558 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 382 transitions. Word has length 108 [2018-09-30 23:06:20,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:20,558 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 382 transitions. [2018-09-30 23:06:20,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 23:06:20,559 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 382 transitions. [2018-09-30 23:06:20,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-30 23:06:20,560 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:20,561 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:20,561 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 23:06:20,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:20,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1140799292, now seen corresponding path program 1 times [2018-09-30 23:06:20,562 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:20,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:20,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:20,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:20,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:20,641 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-09-30 23:06:20,642 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:20,642 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:06:20,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:06:20,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:06:20,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:06:20,643 INFO L87 Difference]: Start difference. First operand 335 states and 382 transitions. Second operand 3 states. [2018-09-30 23:06:20,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:20,698 INFO L93 Difference]: Finished difference Result 663 states and 757 transitions. [2018-09-30 23:06:20,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:06:20,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-09-30 23:06:20,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:20,700 INFO L225 Difference]: With dead ends: 663 [2018-09-30 23:06:20,700 INFO L226 Difference]: Without dead ends: 335 [2018-09-30 23:06:20,700 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 23:06:20,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-09-30 23:06:20,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 331. [2018-09-30 23:06:20,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-09-30 23:06:20,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 373 transitions. [2018-09-30 23:06:20,715 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 373 transitions. Word has length 116 [2018-09-30 23:06:20,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:20,715 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 373 transitions. [2018-09-30 23:06:20,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:06:20,715 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 373 transitions. [2018-09-30 23:06:20,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-30 23:06:20,717 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:20,717 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:20,718 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 23:06:20,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:20,718 INFO L82 PathProgramCache]: Analyzing trace with hash 166395550, now seen corresponding path program 2 times [2018-09-30 23:06:20,718 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:20,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:20,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:20,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:20,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:21,351 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 20 proven. 266 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-09-30 23:06:21,352 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:06:21,352 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:06:21,362 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 23:06:21,401 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 23:06:21,401 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 23:06:21,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:06:21,885 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 35 proven. 250 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-09-30 23:06:21,905 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:06:21,906 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-09-30 23:06:21,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 23:06:21,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 23:06:21,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-09-30 23:06:21,907 INFO L87 Difference]: Start difference. First operand 331 states and 373 transitions. Second operand 17 states. [2018-09-30 23:06:22,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:22,975 INFO L93 Difference]: Finished difference Result 1064 states and 1203 transitions. [2018-09-30 23:06:22,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 23:06:22,976 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 121 [2018-09-30 23:06:22,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:22,980 INFO L225 Difference]: With dead ends: 1064 [2018-09-30 23:06:22,980 INFO L226 Difference]: Without dead ends: 1063 [2018-09-30 23:06:22,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 113 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2018-09-30 23:06:22,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2018-09-30 23:06:22,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 419. [2018-09-30 23:06:22,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-09-30 23:06:22,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 471 transitions. [2018-09-30 23:06:22,999 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 471 transitions. Word has length 121 [2018-09-30 23:06:22,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:22,999 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 471 transitions. [2018-09-30 23:06:22,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 23:06:23,000 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 471 transitions. [2018-09-30 23:06:23,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-30 23:06:23,001 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:23,001 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 4, 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] [2018-09-30 23:06:23,002 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 23:06:23,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:23,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1620918566, now seen corresponding path program 1 times [2018-09-30 23:06:23,002 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:23,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:23,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:23,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:06:23,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:23,127 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-09-30 23:06:23,127 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:23,127 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 23:06:23,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 23:06:23,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 23:06:23,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-09-30 23:06:23,128 INFO L87 Difference]: Start difference. First operand 419 states and 471 transitions. Second operand 5 states. [2018-09-30 23:06:23,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:23,183 INFO L93 Difference]: Finished difference Result 673 states and 755 transitions. [2018-09-30 23:06:23,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 23:06:23,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2018-09-30 23:06:23,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:23,184 INFO L225 Difference]: With dead ends: 673 [2018-09-30 23:06:23,185 INFO L226 Difference]: Without dead ends: 468 [2018-09-30 23:06:23,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-09-30 23:06:23,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-09-30 23:06:23,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 412. [2018-09-30 23:06:23,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-09-30 23:06:23,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 463 transitions. [2018-09-30 23:06:23,201 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 463 transitions. Word has length 122 [2018-09-30 23:06:23,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:23,202 INFO L480 AbstractCegarLoop]: Abstraction has 412 states and 463 transitions. [2018-09-30 23:06:23,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 23:06:23,202 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 463 transitions. [2018-09-30 23:06:23,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-09-30 23:06:23,203 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:23,203 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:23,204 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 23:06:23,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:23,204 INFO L82 PathProgramCache]: Analyzing trace with hash -768532907, now seen corresponding path program 1 times [2018-09-30 23:06:23,204 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:23,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:23,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:23,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:23,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:23,488 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 202 proven. 50 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-09-30 23:06:23,488 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:06:23,488 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:06:23,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:23,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:06:23,733 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 139 proven. 131 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-09-30 23:06:23,754 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:06:23,754 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-09-30 23:06:23,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 23:06:23,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 23:06:23,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-09-30 23:06:23,755 INFO L87 Difference]: Start difference. First operand 412 states and 463 transitions. Second operand 9 states. [2018-09-30 23:06:24,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:24,105 INFO L93 Difference]: Finished difference Result 845 states and 948 transitions. [2018-09-30 23:06:24,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 23:06:24,106 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2018-09-30 23:06:24,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:24,109 INFO L225 Difference]: With dead ends: 845 [2018-09-30 23:06:24,109 INFO L226 Difference]: Without dead ends: 844 [2018-09-30 23:06:24,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2018-09-30 23:06:24,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2018-09-30 23:06:24,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 570. [2018-09-30 23:06:24,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-09-30 23:06:24,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 638 transitions. [2018-09-30 23:06:24,134 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 638 transitions. Word has length 123 [2018-09-30 23:06:24,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:24,135 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 638 transitions. [2018-09-30 23:06:24,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 23:06:24,135 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 638 transitions. [2018-09-30 23:06:24,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-09-30 23:06:24,137 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:24,137 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-30 23:06:24,138 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 23:06:24,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:24,138 INFO L82 PathProgramCache]: Analyzing trace with hash 242817106, now seen corresponding path program 3 times [2018-09-30 23:06:24,138 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:24,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:24,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:24,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:24,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:24,229 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2018-09-30 23:06:24,229 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 23:06:24,229 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 23:06:24,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 23:06:24,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 23:06:24,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 23:06:24,230 INFO L87 Difference]: Start difference. First operand 570 states and 638 transitions. Second operand 3 states. [2018-09-30 23:06:24,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:24,340 INFO L93 Difference]: Finished difference Result 1086 states and 1213 transitions. [2018-09-30 23:06:24,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 23:06:24,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2018-09-30 23:06:24,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:24,343 INFO L225 Difference]: With dead ends: 1086 [2018-09-30 23:06:24,343 INFO L226 Difference]: Without dead ends: 479 [2018-09-30 23:06:24,343 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 23:06:24,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-09-30 23:06:24,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 382. [2018-09-30 23:06:24,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-09-30 23:06:24,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 413 transitions. [2018-09-30 23:06:24,363 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 413 transitions. Word has length 159 [2018-09-30 23:06:24,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:24,363 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 413 transitions. [2018-09-30 23:06:24,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 23:06:24,363 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 413 transitions. [2018-09-30 23:06:24,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-09-30 23:06:24,365 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 23:06:24,365 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 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] [2018-09-30 23:06:24,366 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-30 23:06:24,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 23:06:24,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1109443822, now seen corresponding path program 1 times [2018-09-30 23:06:24,366 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 23:06:24,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 23:06:24,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:24,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 23:06:24,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 23:06:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:25,271 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 25 proven. 471 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-09-30 23:06:25,272 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 23:06:25,272 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 23:06:25,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 23:06:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 23:06:25,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 23:06:25,737 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 308 proven. 86 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-09-30 23:06:25,760 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 23:06:25,760 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 20 [2018-09-30 23:06:25,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-30 23:06:25,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-30 23:06:25,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2018-09-30 23:06:25,761 INFO L87 Difference]: Start difference. First operand 382 states and 413 transitions. Second operand 21 states. [2018-09-30 23:06:26,421 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 30 [2018-09-30 23:06:26,908 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 32 [2018-09-30 23:06:27,619 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2018-09-30 23:06:28,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 23:06:28,052 INFO L93 Difference]: Finished difference Result 970 states and 1050 transitions. [2018-09-30 23:06:28,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 23:06:28,052 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 159 [2018-09-30 23:06:28,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 23:06:28,053 INFO L225 Difference]: With dead ends: 970 [2018-09-30 23:06:28,053 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 23:06:28,055 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 170 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=367, Invalid=1193, Unknown=0, NotChecked=0, Total=1560 [2018-09-30 23:06:28,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 23:06:28,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 23:06:28,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 23:06:28,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 23:06:28,056 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 159 [2018-09-30 23:06:28,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 23:06:28,056 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 23:06:28,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-30 23:06:28,056 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 23:06:28,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 23:06:28,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 23:06:28,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:06:28,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:06:28,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:06:28,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:06:28,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:06:28,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:06:28,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:06:29,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:06:29,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:06:29,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 23:06:29,567 WARN L178 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 538 DAG size of output: 452 [2018-09-30 23:06:35,744 WARN L178 SmtUtils]: Spent 6.17 s on a formula simplification. DAG size of input: 431 DAG size of output: 153 [2018-09-30 23:06:35,748 INFO L426 ceAbstractionStarter]: For program point L143(lines 143 161) no Hoare annotation was computed. [2018-09-30 23:06:35,748 INFO L426 ceAbstractionStarter]: For program point L127(lines 127 138) no Hoare annotation was computed. [2018-09-30 23:06:35,748 INFO L426 ceAbstractionStarter]: For program point L70-1(lines 70 96) no Hoare annotation was computed. [2018-09-30 23:06:35,748 INFO L426 ceAbstractionStarter]: For program point L153(lines 153 161) no Hoare annotation was computed. [2018-09-30 23:06:35,748 INFO L426 ceAbstractionStarter]: For program point L87(lines 87 96) no Hoare annotation was computed. [2018-09-30 23:06:35,748 INFO L426 ceAbstractionStarter]: For program point L112(lines 112 120) no Hoare annotation was computed. [2018-09-30 23:06:35,748 INFO L426 ceAbstractionStarter]: For program point L79(lines 79 96) no Hoare annotation was computed. [2018-09-30 23:06:35,748 INFO L426 ceAbstractionStarter]: For program point L146(lines 146 161) no Hoare annotation was computed. [2018-09-30 23:06:35,748 INFO L426 ceAbstractionStarter]: For program point L47-1(lines 13 164) no Hoare annotation was computed. [2018-09-30 23:06:35,748 INFO L426 ceAbstractionStarter]: For program point L130(lines 130 138) no Hoare annotation was computed. [2018-09-30 23:06:35,749 INFO L426 ceAbstractionStarter]: For program point L89(lines 89 96) no Hoare annotation was computed. [2018-09-30 23:06:35,749 INFO L426 ceAbstractionStarter]: For program point ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT(lines 48 55) no Hoare annotation was computed. [2018-09-30 23:06:35,749 INFO L426 ceAbstractionStarter]: For program point L156(lines 156 161) no Hoare annotation was computed. [2018-09-30 23:06:35,750 INFO L422 ceAbstractionStarter]: At program point L156-2(lines 47 162) the Hoare annotation is: (let ((.cse41 (+ Elevator_dir 1))) (let ((.cse39 (+ Elevator_min 1)) (.cse34 (+ Elevator_dir Elevator_goal)) (.cse28 (= Elevator_qCSP 1)) (.cse22 (= Elevator_qCSP 3)) (.cse38 (+ Elevator_dir Elevator_current)) (.cse3 (not Elevator_stop)) (.cse4 (not (= Elevator_current Elevator_goal))) (.cse5 (<= Elevator_min Elevator_current)) (.cse6 (<= Elevator_current Elevator_max)) (.cse18 (= Elevator_qDC1 2)) (.cse7 (= Elevator_qDC2 2)) (.cse35 (= Elevator_dir 1)) (.cse29 (<= Elevator_current Elevator_goal)) (.cse40 (= .cse41 0))) (let ((.cse30 (or .cse29 .cse40)) (.cse21 (= Elevator_qDC2 3)) (.cse33 (not (= Elevator_min Elevator_goal))) (.cse12 (or (<= .cse41 0) (and (not (= Elevator_goal Elevator_current)) .cse29))) (.cse14 (or (<= Elevator_goal Elevator_current) .cse35)) (.cse15 (or .cse35 .cse40)) (.cse31 (and .cse3 (and .cse4 .cse5 .cse6 .cse18 .cse7))) (.cse27 (= Elevator_min Elevator_current)) (.cse36 (<= Elevator_min .cse38)) (.cse26 (<= Elevator_dir 1)) (.cse17 (not .cse22)) (.cse8 (<= Elevator_qDC1 1)) (.cse9 (not Elevator_passed)) (.cse19 (not .cse28)) (.cse20 (or (<= Elevator_current .cse34) .cse40)) (.cse23 (or (and .cse6 (<= .cse39 Elevator_current)) (and (<= (+ Elevator_current 1) Elevator_max) .cse5))) (.cse11 (or (<= (+ Elevator_min 2) .cse38) (<= (+ Elevator_current Elevator_min) (+ Elevator_dir (* 2 Elevator_goal) 2)))) (.cse16 (<= Elevator_c2 2)) (.cse0 (<= Elevator_c2 Elevator_c3)) (.cse32 (and .cse5 .cse6 .cse18 .cse28)) (.cse37 (= Elevator_qDC2 1)) (.cse2 (not Elevator_newgoal)) (.cse10 (<= Elevator_min Elevator_goal)) (.cse1 (<= Elevator_goal Elevator_max)) (.cse24 (not (= .cse34 Elevator_current))) (.cse25 (or (<= .cse34 Elevator_current) .cse35)) (.cse13 (not Elevator_start))) (or (and (and .cse0 .cse1 (and .cse2 (and .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) .cse10) .cse11 .cse12 .cse13 .cse14 .cse15) (and (and .cse16 .cse0 (and (and .cse3 (and .cse4 .cse17 .cse5 .cse6 .cse18 .cse7)) .cse19)) .cse1 .cse10 .cse13) (and .cse20 (or (and .cse16 (and (and (and .cse3 .cse21 .cse18) .cse9) .cse2 .cse22) .cse0) (and .cse3 (<= 0 Elevator_c3) .cse18 (<= Elevator_c2 0) .cse21 .cse2 .cse10 .cse22)) .cse23 .cse11 .cse1 .cse24 .cse25 .cse13) (and .cse26 (and (and .cse3 .cse0 .cse2 (and (and .cse4 .cse27 .cse8 .cse28) .cse7)) .cse1) .cse29 (<= Elevator_current (+ Elevator_dir Elevator_min)) .cse13) (and .cse30 (and (and (and .cse3 (and .cse5 .cse6 .cse7 (and .cse4 .cse8 .cse9))) .cse2 .cse22) .cse1 .cse10) .cse14) (and .cse3 .cse0 .cse18 (and .cse4 .cse5 .cse6) .cse21 .cse9) (and .cse30 (and (and .cse16 (and .cse31 .cse2 .cse22)) .cse1 .cse10) .cse14) (and .cse3 .cse32 .cse0 .cse21 .cse9) (and .cse33 .cse27 .cse2 .cse10 .cse8 .cse3 .cse0 (<= .cse34 (+ Elevator_max 1)) .cse35 .cse7 .cse22) (and .cse36 .cse26 (and (and .cse3 .cse0 (and (and (and .cse17 .cse27 .cse8) .cse33) .cse7) .cse19) .cse1) .cse29 .cse13) (and .cse11 .cse12 .cse13 .cse14 .cse15 (and .cse16 .cse0 (and .cse31 .cse2) .cse1 .cse10)) (and (and .cse0 .cse10 (and .cse37 (and .cse28 .cse8 .cse9) .cse2)) .cse20 .cse23 .cse11 .cse1 .cse24 .cse25 .cse13) (and (<= .cse38 Elevator_goal) (and .cse1 (and .cse37 (and .cse0 (and .cse27 (<= .cse39 Elevator_max) .cse8 .cse28)))) .cse36 .cse26) (and (and .cse5 .cse6 .cse0 (and (and .cse3 (and .cse4 .cse17 .cse7 .cse8 .cse9)) .cse19)) .cse1 .cse10 .cse13) (and .cse20 .cse23 .cse11 (and .cse16 .cse0 (and .cse32 .cse37 .cse2) .cse10) .cse1 .cse24 .cse25 .cse13))))) [2018-09-30 23:06:35,750 INFO L426 ceAbstractionStarter]: For program point L115(lines 115 120) no Hoare annotation was computed. [2018-09-30 23:06:35,750 INFO L426 ceAbstractionStarter]: For program point L82(lines 82 96) no Hoare annotation was computed. [2018-09-30 23:06:35,750 INFO L426 ceAbstractionStarter]: For program point L115-2(lines 99 138) no Hoare annotation was computed. [2018-09-30 23:06:35,750 INFO L426 ceAbstractionStarter]: For program point L107(lines 107 120) no Hoare annotation was computed. [2018-09-30 23:06:35,750 INFO L426 ceAbstractionStarter]: For program point ElevatorEXIT(lines 13 164) no Hoare annotation was computed. [2018-09-30 23:06:35,750 INFO L426 ceAbstractionStarter]: For program point L91(lines 91 96) no Hoare annotation was computed. [2018-09-30 23:06:35,750 INFO L426 ceAbstractionStarter]: For program point L91-2(lines 77 120) no Hoare annotation was computed. [2018-09-30 23:06:35,751 INFO L426 ceAbstractionStarter]: For program point L149(lines 149 161) no Hoare annotation was computed. [2018-09-30 23:06:35,751 INFO L426 ceAbstractionStarter]: For program point L133(lines 133 138) no Hoare annotation was computed. [2018-09-30 23:06:35,751 INFO L426 ceAbstractionStarter]: For program point L67(lines 67 69) no Hoare annotation was computed. [2018-09-30 23:06:35,751 INFO L426 ceAbstractionStarter]: For program point L133-2(lines 123 161) no Hoare annotation was computed. [2018-09-30 23:06:35,751 INFO L426 ceAbstractionStarter]: For program point L67-2(lines 67 72) no Hoare annotation was computed. [2018-09-30 23:06:35,751 INFO L426 ceAbstractionStarter]: For program point ElevatorENTRY(lines 13 164) no Hoare annotation was computed. [2018-09-30 23:06:35,751 INFO L426 ceAbstractionStarter]: For program point L84(lines 84 96) no Hoare annotation was computed. [2018-09-30 23:06:35,751 INFO L426 ceAbstractionStarter]: For program point L101(lines 101 120) no Hoare annotation was computed. [2018-09-30 23:06:35,838 INFO L202 PluginConnector]: Adding new model ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 11:06:35 BoogieIcfgContainer [2018-09-30 23:06:35,839 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 23:06:35,840 INFO L168 Benchmark]: Toolchain (without parser) took 29405.30 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 771.5 MB. Max. memory is 7.1 GB. [2018-09-30 23:06:35,841 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 23:06:35,841 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.70 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 23:06:35,842 INFO L168 Benchmark]: Boogie Preprocessor took 45.89 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 23:06:35,842 INFO L168 Benchmark]: RCFGBuilder took 673.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-30 23:06:35,843 INFO L168 Benchmark]: TraceAbstraction took 28631.04 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 739.8 MB. Max. memory is 7.1 GB. [2018-09-30 23:06:35,846 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.70 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 45.89 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 673.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28631.04 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 739.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: loop invariant is valid and assertion always holds For all program executions holds that loop invariant is valid and assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: (((((((((((((((((((((c2 <= c3 && goal <= max) && !newgoal && !stop && ((((!(current == goal) && min <= current) && current <= max) && qDC2 == 2) && qDC1 <= 1) && !passed) && min <= goal) && (min + 2 <= dir + current || current + min <= dir + 2 * goal + 2)) && (dir + 1 <= 0 || (!(goal == current) && current <= goal))) && !start) && (goal <= current || dir == 1)) && (dir == 1 || dir + 1 == 0)) || (((((c2 <= 2 && c2 <= c3) && (!stop && ((((!(current == goal) && !(qCSP == 3)) && min <= current) && current <= max) && qDC1 == 2) && qDC2 == 2) && !(qCSP == 1)) && goal <= max) && min <= goal) && !start)) || ((((((((current <= dir + goal || dir + 1 == 0) && (((c2 <= 2 && ((((!stop && qDC2 == 3) && qDC1 == 2) && !passed) && !newgoal) && qCSP == 3) && c2 <= c3) || (((((((!stop && 0 <= c3) && qDC1 == 2) && c2 <= 0) && qDC2 == 3) && !newgoal) && min <= goal) && qCSP == 3))) && ((current <= max && min + 1 <= current) || (current + 1 <= max && min <= current))) && (min + 2 <= dir + current || current + min <= dir + 2 * goal + 2)) && goal <= max) && !(dir + goal == current)) && (dir + goal <= current || dir == 1)) && !start)) || ((((dir <= 1 && (((!stop && c2 <= c3) && !newgoal) && (((!(current == goal) && min == current) && qDC1 <= 1) && qCSP == 1) && qDC2 == 2) && goal <= max) && current <= goal) && current <= dir + min) && !start)) || (((current <= goal || dir + 1 == 0) && ((((!stop && ((min <= current && current <= max) && qDC2 == 2) && (!(current == goal) && qDC1 <= 1) && !passed) && !newgoal) && qCSP == 3) && goal <= max) && min <= goal) && (goal <= current || dir == 1))) || (((((!stop && c2 <= c3) && qDC1 == 2) && (!(current == goal) && min <= current) && current <= max) && qDC2 == 3) && !passed)) || (((current <= goal || dir + 1 == 0) && ((c2 <= 2 && ((!stop && (((!(current == goal) && min <= current) && current <= max) && qDC1 == 2) && qDC2 == 2) && !newgoal) && qCSP == 3) && goal <= max) && min <= goal) && (goal <= current || dir == 1))) || ((((!stop && ((min <= current && current <= max) && qDC1 == 2) && qCSP == 1) && c2 <= c3) && qDC2 == 3) && !passed)) || ((((((((((!(min == goal) && min == current) && !newgoal) && min <= goal) && qDC1 <= 1) && !stop) && c2 <= c3) && dir + goal <= max + 1) && dir == 1) && qDC2 == 2) && qCSP == 3)) || ((((min <= dir + current && dir <= 1) && (((!stop && c2 <= c3) && (((!(qCSP == 3) && min == current) && qDC1 <= 1) && !(min == goal)) && qDC2 == 2) && !(qCSP == 1)) && goal <= max) && current <= goal) && !start)) || ((((((min + 2 <= dir + current || current + min <= dir + 2 * goal + 2) && (dir + 1 <= 0 || (!(goal == current) && current <= goal))) && !start) && (goal <= current || dir == 1)) && (dir == 1 || dir + 1 == 0)) && (((c2 <= 2 && c2 <= c3) && (!stop && (((!(current == goal) && min <= current) && current <= max) && qDC1 == 2) && qDC2 == 2) && !newgoal) && goal <= max) && min <= goal)) || (((((((((c2 <= c3 && min <= goal) && (qDC2 == 1 && (qCSP == 1 && qDC1 <= 1) && !passed) && !newgoal) && (current <= dir + goal || dir + 1 == 0)) && ((current <= max && min + 1 <= current) || (current + 1 <= max && min <= current))) && (min + 2 <= dir + current || current + min <= dir + 2 * goal + 2)) && goal <= max) && !(dir + goal == current)) && (dir + goal <= current || dir == 1)) && !start)) || (((dir + current <= goal && goal <= max && qDC2 == 1 && c2 <= c3 && ((min == current && min + 1 <= max) && qDC1 <= 1) && qCSP == 1) && min <= dir + current) && dir <= 1)) || ((((((min <= current && current <= max) && c2 <= c3) && (!stop && (((!(current == goal) && !(qCSP == 3)) && qDC2 == 2) && qDC1 <= 1) && !passed) && !(qCSP == 1)) && goal <= max) && min <= goal) && !start)) || ((((((((current <= dir + goal || dir + 1 == 0) && ((current <= max && min + 1 <= current) || (current + 1 <= max && min <= current))) && (min + 2 <= dir + current || current + min <= dir + 2 * goal + 2)) && ((c2 <= 2 && c2 <= c3) && ((((min <= current && current <= max) && qDC1 == 2) && qCSP == 1) && qDC2 == 1) && !newgoal) && min <= goal) && goal <= max) && !(dir + goal == current)) && (dir + goal <= current || dir == 1)) && !start) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. SAFE Result, 28.4s OverallTime, 26 OverallIterations, 9 TraceHistogramMax, 10.4s AutomataDifference, 0.0s DeadEndRemovalTime, 7.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 1795 SDtfs, 4287 SDslu, 4567 SDs, 0 SdLazy, 2480 SolverSat, 331 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 916 GetRequests, 760 SyntacticMatches, 14 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1612occurred in iteration=13, 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.7s AutomataMinimizationTime, 26 MinimizatonAttempts, 4209 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 55 NumberOfFragments, 896 HoareAnnotationTreeSize, 1 FomulaSimplifications, 325389 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 1 FomulaSimplificationsInter, 162317 FormulaSimplificationTreeSizeReductionInter, 6.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 2744 NumberOfCodeBlocks, 2744 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2711 ConstructedInterpolants, 0 QuantifiedInterpolants, 2091531 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1847 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 33 InterpolantComputations, 20 PerfectInterpolantSequences, 4169/5710 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/ElevatorWithAssignments.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_23-06-35-859.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/ElevatorWithAssignments.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_23-06-35-859.csv Received shutdown request...