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-9f4048f [2018-10-04 12:13:44,114 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:13:44,116 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:13:44,129 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:13:44,129 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:13:44,130 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:13:44,131 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:13:44,133 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:13:44,135 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:13:44,142 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:13:44,143 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:13:44,145 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:13:44,146 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:13:44,149 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:13:44,152 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:13:44,153 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:13:44,153 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:13:44,157 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:13:44,162 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:13:44,163 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:13:44,167 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:13:44,169 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:13:44,172 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:13:44,172 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:13:44,173 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:13:44,174 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:13:44,175 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:13:44,175 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:13:44,176 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:13:44,179 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:13:44,181 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:13:44,182 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:13:44,182 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:13:44,182 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:13:44,185 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:13:44,186 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:13:44,186 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-10-04 12:13:44,217 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:13:44,217 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:13:44,219 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:13:44,219 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:13:44,220 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:13:44,223 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:13:44,223 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:13:44,223 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:13:44,224 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:13:44,224 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:13:44,224 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:13:44,225 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:13:44,225 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:13:44,225 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:13:44,225 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:13:44,226 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:13:44,226 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:13:44,226 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:13:44,226 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:13:44,227 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:13:44,227 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:13:44,227 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:13:44,227 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:13:44,227 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:13:44,229 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:13:44,229 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:13:44,229 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:13:44,230 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:13:44,230 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:13:44,230 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:13:44,285 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:13:44,298 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:13:44,302 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:13:44,304 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:13:44,304 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:13:44,305 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/ElevatorWithAssignments.bpl [2018-10-04 12:13:44,306 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/ElevatorWithAssignments.bpl' [2018-10-04 12:13:44,408 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:13:44,410 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:13:44,411 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:13:44,411 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:13:44,411 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:13:44,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:44" (1/1) ... [2018-10-04 12:13:44,448 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:44" (1/1) ... [2018-10-04 12:13:44,452 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 12:13:44,453 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 12:13:44,453 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 12:13:44,455 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:13:44,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:13:44,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:13:44,456 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:13:44,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:44" (1/1) ... [2018-10-04 12:13:44,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:44" (1/1) ... [2018-10-04 12:13:44,469 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:44" (1/1) ... [2018-10-04 12:13:44,470 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:44" (1/1) ... [2018-10-04 12:13:44,474 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:44" (1/1) ... [2018-10-04 12:13:44,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:44" (1/1) ... [2018-10-04 12:13:44,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:44" (1/1) ... [2018-10-04 12:13:44,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:13:44,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:13:44,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:13:44,486 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:13:44,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:13:44,563 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Elevator given in one single declaration [2018-10-04 12:13:44,563 INFO L130 BoogieDeclarations]: Found specification of procedure Elevator [2018-10-04 12:13:44,563 INFO L138 BoogieDeclarations]: Found implementation of procedure Elevator [2018-10-04 12:13:45,227 INFO L338 CfgBuilder]: Using library mode [2018-10-04 12:13:45,228 INFO L202 PluginConnector]: Adding new model ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:13:45 BoogieIcfgContainer [2018-10-04 12:13:45,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:13:45,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:13:45,230 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:13:45,233 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:13:45,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:44" (1/2) ... [2018-10-04 12:13:45,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c824a96 and model type ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:13:45, skipping insertion in model container [2018-10-04 12:13:45,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:13:45" (2/2) ... [2018-10-04 12:13:45,236 INFO L112 eAbstractionObserver]: Analyzing ICFG ElevatorWithAssignments.bpl [2018-10-04 12:13:45,246 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:13:45,255 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:13:45,300 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:13:45,300 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:13:45,301 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:13:45,301 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:13:45,301 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:13:45,301 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:13:45,301 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:13:45,301 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:13:45,302 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:13:45,316 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-10-04 12:13:45,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-10-04 12:13:45,322 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:45,323 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-10-04 12:13:45,325 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:13:45,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:45,330 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-10-04 12:13:45,332 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:45,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:45,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:45,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:45,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:45,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:45,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:45,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:45,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-04 12:13:45,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:13:45,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:13:45,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:13:45,494 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2018-10-04 12:13:45,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:45,650 INFO L93 Difference]: Finished difference Result 84 states and 157 transitions. [2018-10-04 12:13:45,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:13:45,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-10-04 12:13:45,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:45,677 INFO L225 Difference]: With dead ends: 84 [2018-10-04 12:13:45,677 INFO L226 Difference]: Without dead ends: 54 [2018-10-04 12:13:45,684 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-10-04 12:13:45,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-04 12:13:45,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-10-04 12:13:45,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-04 12:13:45,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 93 transitions. [2018-10-04 12:13:45,728 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 93 transitions. Word has length 2 [2018-10-04 12:13:45,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:45,728 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 93 transitions. [2018-10-04 12:13:45,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:13:45,729 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 93 transitions. [2018-10-04 12:13:45,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:13:45,729 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:45,730 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:13:45,730 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:13:45,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:45,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1770004619, now seen corresponding path program 1 times [2018-10-04 12:13:45,731 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:45,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:45,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:45,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:45,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:45,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:45,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:45,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:13:45,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:13:45,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:13:45,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:13:45,769 INFO L87 Difference]: Start difference. First operand 53 states and 93 transitions. Second operand 3 states. [2018-10-04 12:13:45,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:45,878 INFO L93 Difference]: Finished difference Result 157 states and 277 transitions. [2018-10-04 12:13:45,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:13:45,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-04 12:13:45,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:45,881 INFO L225 Difference]: With dead ends: 157 [2018-10-04 12:13:45,882 INFO L226 Difference]: Without dead ends: 101 [2018-10-04 12:13:45,883 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-10-04 12:13:45,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-04 12:13:45,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-10-04 12:13:45,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-04 12:13:45,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 175 transitions. [2018-10-04 12:13:45,899 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 175 transitions. Word has length 14 [2018-10-04 12:13:45,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:45,899 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 175 transitions. [2018-10-04 12:13:45,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:13:45,899 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 175 transitions. [2018-10-04 12:13:45,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:13:45,900 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:45,900 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:13:45,901 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:13:45,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:45,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1068940041, now seen corresponding path program 1 times [2018-10-04 12:13:45,901 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:45,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:45,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:45,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:45,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:45,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:45,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:45,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:13:45,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:13:45,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:13:45,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:13:45,955 INFO L87 Difference]: Start difference. First operand 100 states and 175 transitions. Second operand 3 states. [2018-10-04 12:13:46,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:46,269 INFO L93 Difference]: Finished difference Result 205 states and 356 transitions. [2018-10-04 12:13:46,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:13:46,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-04 12:13:46,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:46,271 INFO L225 Difference]: With dead ends: 205 [2018-10-04 12:13:46,272 INFO L226 Difference]: Without dead ends: 104 [2018-10-04 12:13:46,273 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-10-04 12:13:46,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-04 12:13:46,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 89. [2018-10-04 12:13:46,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-04 12:13:46,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 152 transitions. [2018-10-04 12:13:46,286 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 152 transitions. Word has length 14 [2018-10-04 12:13:46,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:46,287 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 152 transitions. [2018-10-04 12:13:46,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:13:46,287 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 152 transitions. [2018-10-04 12:13:46,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:13:46,288 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:46,288 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-10-04 12:13:46,289 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:13:46,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:46,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1940946465, now seen corresponding path program 1 times [2018-10-04 12:13:46,290 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:46,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:46,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:46,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:46,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:46,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:46,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:46,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:13:46,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:13:46,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:13:46,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:13:46,494 INFO L87 Difference]: Start difference. First operand 89 states and 152 transitions. Second operand 5 states. [2018-10-04 12:13:46,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:46,672 INFO L93 Difference]: Finished difference Result 321 states and 545 transitions. [2018-10-04 12:13:46,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:13:46,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-10-04 12:13:46,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:46,676 INFO L225 Difference]: With dead ends: 321 [2018-10-04 12:13:46,676 INFO L226 Difference]: Without dead ends: 209 [2018-10-04 12:13:46,677 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-10-04 12:13:46,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-04 12:13:46,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2018-10-04 12:13:46,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-04 12:13:46,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 346 transitions. [2018-10-04 12:13:46,699 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 346 transitions. Word has length 19 [2018-10-04 12:13:46,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:46,699 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 346 transitions. [2018-10-04 12:13:46,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:13:46,699 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 346 transitions. [2018-10-04 12:13:46,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-04 12:13:46,701 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:46,701 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-10-04 12:13:46,702 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:13:46,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:46,702 INFO L82 PathProgramCache]: Analyzing trace with hash 2002343284, now seen corresponding path program 1 times [2018-10-04 12:13:46,702 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:46,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:46,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:46,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:46,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:46,758 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-04 12:13:46,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:46,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:13:46,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:13:46,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:13:46,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:13:46,761 INFO L87 Difference]: Start difference. First operand 207 states and 346 transitions. Second operand 3 states. [2018-10-04 12:13:46,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:46,869 INFO L93 Difference]: Finished difference Result 522 states and 865 transitions. [2018-10-04 12:13:46,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:13:46,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-04 12:13:46,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:46,872 INFO L225 Difference]: With dead ends: 522 [2018-10-04 12:13:46,872 INFO L226 Difference]: Without dead ends: 310 [2018-10-04 12:13:46,874 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-10-04 12:13:46,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-10-04 12:13:46,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 213. [2018-10-04 12:13:46,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-04 12:13:46,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 352 transitions. [2018-10-04 12:13:46,901 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 352 transitions. Word has length 41 [2018-10-04 12:13:46,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:46,902 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 352 transitions. [2018-10-04 12:13:46,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:13:46,902 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 352 transitions. [2018-10-04 12:13:46,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-04 12:13:46,904 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:46,904 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-10-04 12:13:46,904 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:13:46,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:46,905 INFO L82 PathProgramCache]: Analyzing trace with hash 2074119508, now seen corresponding path program 1 times [2018-10-04 12:13:46,905 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:46,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:46,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:46,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:46,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:46,955 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-04 12:13:46,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:46,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:13:46,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:13:46,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:13:46,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:13:46,957 INFO L87 Difference]: Start difference. First operand 213 states and 352 transitions. Second operand 3 states. [2018-10-04 12:13:47,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:47,053 INFO L93 Difference]: Finished difference Result 588 states and 972 transitions. [2018-10-04 12:13:47,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:13:47,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-10-04 12:13:47,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:47,059 INFO L225 Difference]: With dead ends: 588 [2018-10-04 12:13:47,059 INFO L226 Difference]: Without dead ends: 367 [2018-10-04 12:13:47,060 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-10-04 12:13:47,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-10-04 12:13:47,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 354. [2018-10-04 12:13:47,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-10-04 12:13:47,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 570 transitions. [2018-10-04 12:13:47,081 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 570 transitions. Word has length 42 [2018-10-04 12:13:47,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:47,082 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 570 transitions. [2018-10-04 12:13:47,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:13:47,082 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 570 transitions. [2018-10-04 12:13:47,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 12:13:47,084 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:47,084 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-10-04 12:13:47,084 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:13:47,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:47,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1430938278, now seen corresponding path program 1 times [2018-10-04 12:13:47,085 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:47,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:47,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:47,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:47,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:47,136 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-04 12:13:47,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:47,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:13:47,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:13:47,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:13:47,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:13:47,138 INFO L87 Difference]: Start difference. First operand 354 states and 570 transitions. Second operand 3 states. [2018-10-04 12:13:47,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:47,532 INFO L93 Difference]: Finished difference Result 880 states and 1399 transitions. [2018-10-04 12:13:47,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:13:47,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-04 12:13:47,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:47,539 INFO L225 Difference]: With dead ends: 880 [2018-10-04 12:13:47,539 INFO L226 Difference]: Without dead ends: 542 [2018-10-04 12:13:47,540 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-10-04 12:13:47,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-10-04 12:13:47,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 366. [2018-10-04 12:13:47,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-10-04 12:13:47,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 582 transitions. [2018-10-04 12:13:47,561 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 582 transitions. Word has length 44 [2018-10-04 12:13:47,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:47,562 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 582 transitions. [2018-10-04 12:13:47,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:13:47,562 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 582 transitions. [2018-10-04 12:13:47,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-04 12:13:47,564 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:47,564 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-10-04 12:13:47,564 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:13:47,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:47,565 INFO L82 PathProgramCache]: Analyzing trace with hash -138883553, now seen corresponding path program 1 times [2018-10-04 12:13:47,565 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:47,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:47,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:47,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:47,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:47,694 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:13:47,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:47,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:13:47,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:13:47,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:13:47,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:13:47,696 INFO L87 Difference]: Start difference. First operand 366 states and 582 transitions. Second operand 4 states. [2018-10-04 12:13:47,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:47,806 INFO L93 Difference]: Finished difference Result 1096 states and 1744 transitions. [2018-10-04 12:13:47,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:13:47,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-10-04 12:13:47,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:47,814 INFO L225 Difference]: With dead ends: 1096 [2018-10-04 12:13:47,814 INFO L226 Difference]: Without dead ends: 731 [2018-10-04 12:13:47,815 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-10-04 12:13:47,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-10-04 12:13:47,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 666. [2018-10-04 12:13:47,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2018-10-04 12:13:47,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1037 transitions. [2018-10-04 12:13:47,844 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1037 transitions. Word has length 46 [2018-10-04 12:13:47,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:47,844 INFO L480 AbstractCegarLoop]: Abstraction has 666 states and 1037 transitions. [2018-10-04 12:13:47,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:13:47,844 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1037 transitions. [2018-10-04 12:13:47,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-04 12:13:47,847 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:47,847 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-10-04 12:13:47,847 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:13:47,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:47,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1242691348, now seen corresponding path program 1 times [2018-10-04 12:13:47,848 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:47,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:47,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:47,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:47,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:48,210 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-10-04 12:13:48,419 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:48,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:13:48,419 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:13:48,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:48,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:13:48,667 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:13:48,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:13:48,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-10-04 12:13:48,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:13:48,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:13:48,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:13:48,700 INFO L87 Difference]: Start difference. First operand 666 states and 1037 transitions. Second operand 8 states. [2018-10-04 12:13:49,330 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-04 12:13:50,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:50,006 INFO L93 Difference]: Finished difference Result 1293 states and 2002 transitions. [2018-10-04 12:13:50,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:13:50,007 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-10-04 12:13:50,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:50,016 INFO L225 Difference]: With dead ends: 1293 [2018-10-04 12:13:50,017 INFO L226 Difference]: Without dead ends: 1292 [2018-10-04 12:13:50,018 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:13:50,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2018-10-04 12:13:50,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1176. [2018-10-04 12:13:50,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-10-04 12:13:50,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1825 transitions. [2018-10-04 12:13:50,077 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1825 transitions. Word has length 49 [2018-10-04 12:13:50,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:50,078 INFO L480 AbstractCegarLoop]: Abstraction has 1176 states and 1825 transitions. [2018-10-04 12:13:50,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:13:50,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1825 transitions. [2018-10-04 12:13:50,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-04 12:13:50,086 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:50,086 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-10-04 12:13:50,087 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:13:50,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:50,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1557173637, now seen corresponding path program 1 times [2018-10-04 12:13:50,090 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:50,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:50,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:50,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:50,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:50,323 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-04 12:13:50,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:50,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:13:50,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:13:50,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:13:50,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:13:50,325 INFO L87 Difference]: Start difference. First operand 1176 states and 1825 transitions. Second operand 4 states. [2018-10-04 12:13:50,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:50,565 INFO L93 Difference]: Finished difference Result 2655 states and 4085 transitions. [2018-10-04 12:13:50,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:13:50,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-10-04 12:13:50,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:50,574 INFO L225 Difference]: With dead ends: 2655 [2018-10-04 12:13:50,574 INFO L226 Difference]: Without dead ends: 1510 [2018-10-04 12:13:50,577 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-10-04 12:13:50,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-10-04 12:13:50,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1468. [2018-10-04 12:13:50,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1468 states. [2018-10-04 12:13:50,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 2236 transitions. [2018-10-04 12:13:50,635 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 2236 transitions. Word has length 67 [2018-10-04 12:13:50,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:50,635 INFO L480 AbstractCegarLoop]: Abstraction has 1468 states and 2236 transitions. [2018-10-04 12:13:50,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:13:50,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 2236 transitions. [2018-10-04 12:13:50,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-04 12:13:50,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:50,638 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-10-04 12:13:50,639 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:13:50,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:50,639 INFO L82 PathProgramCache]: Analyzing trace with hash -423460397, now seen corresponding path program 1 times [2018-10-04 12:13:50,640 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:50,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:50,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:50,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:50,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:50,711 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-04 12:13:50,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:50,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:13:50,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:13:50,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:13:50,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:13:50,712 INFO L87 Difference]: Start difference. First operand 1468 states and 2236 transitions. Second operand 4 states. [2018-10-04 12:13:50,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:50,843 INFO L93 Difference]: Finished difference Result 2726 states and 4172 transitions. [2018-10-04 12:13:50,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:13:50,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-10-04 12:13:50,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:50,858 INFO L225 Difference]: With dead ends: 2726 [2018-10-04 12:13:50,858 INFO L226 Difference]: Without dead ends: 1469 [2018-10-04 12:13:50,861 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-10-04 12:13:50,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2018-10-04 12:13:50,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1466. [2018-10-04 12:13:50,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1466 states. [2018-10-04 12:13:50,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 2172 transitions. [2018-10-04 12:13:50,916 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 2172 transitions. Word has length 68 [2018-10-04 12:13:50,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:50,917 INFO L480 AbstractCegarLoop]: Abstraction has 1466 states and 2172 transitions. [2018-10-04 12:13:50,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:13:50,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 2172 transitions. [2018-10-04 12:13:50,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-04 12:13:50,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:50,920 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-10-04 12:13:50,920 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:13:50,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:50,921 INFO L82 PathProgramCache]: Analyzing trace with hash -734626103, now seen corresponding path program 2 times [2018-10-04 12:13:50,921 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:50,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:50,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:50,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:50,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:51,005 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-04 12:13:51,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:51,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:13:51,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:13:51,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:13:51,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:13:51,007 INFO L87 Difference]: Start difference. First operand 1466 states and 2172 transitions. Second operand 3 states. [2018-10-04 12:13:51,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:51,235 INFO L93 Difference]: Finished difference Result 2942 states and 4353 transitions. [2018-10-04 12:13:51,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:13:51,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-10-04 12:13:51,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:51,243 INFO L225 Difference]: With dead ends: 2942 [2018-10-04 12:13:51,243 INFO L226 Difference]: Without dead ends: 1457 [2018-10-04 12:13:51,245 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-10-04 12:13:51,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2018-10-04 12:13:51,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1397. [2018-10-04 12:13:51,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1397 states. [2018-10-04 12:13:51,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 2012 transitions. [2018-10-04 12:13:51,296 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 2012 transitions. Word has length 69 [2018-10-04 12:13:51,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:51,297 INFO L480 AbstractCegarLoop]: Abstraction has 1397 states and 2012 transitions. [2018-10-04 12:13:51,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:13:51,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 2012 transitions. [2018-10-04 12:13:51,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-04 12:13:51,299 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:51,300 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-10-04 12:13:51,300 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:13:51,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:51,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1023158359, now seen corresponding path program 1 times [2018-10-04 12:13:51,300 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:51,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:51,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:51,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:13:51,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:51,389 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-04 12:13:51,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:51,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:13:51,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:13:51,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:13:51,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:13:51,391 INFO L87 Difference]: Start difference. First operand 1397 states and 2012 transitions. Second operand 3 states. [2018-10-04 12:13:51,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:51,476 INFO L93 Difference]: Finished difference Result 3297 states and 4763 transitions. [2018-10-04 12:13:51,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:13:51,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-10-04 12:13:51,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:51,489 INFO L225 Difference]: With dead ends: 3297 [2018-10-04 12:13:51,489 INFO L226 Difference]: Without dead ends: 1830 [2018-10-04 12:13:51,492 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-10-04 12:13:51,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2018-10-04 12:13:51,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1612. [2018-10-04 12:13:51,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1612 states. [2018-10-04 12:13:51,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2296 transitions. [2018-10-04 12:13:51,546 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2296 transitions. Word has length 84 [2018-10-04 12:13:51,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:51,546 INFO L480 AbstractCegarLoop]: Abstraction has 1612 states and 2296 transitions. [2018-10-04 12:13:51,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:13:51,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2296 transitions. [2018-10-04 12:13:51,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-04 12:13:51,549 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:51,549 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-10-04 12:13:51,549 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:13:51,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:51,550 INFO L82 PathProgramCache]: Analyzing trace with hash -147951611, now seen corresponding path program 1 times [2018-10-04 12:13:51,550 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:51,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:51,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:51,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:51,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:52,205 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 16 proven. 116 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-04 12:13:52,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:13:52,205 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:13:52,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:52,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:13:52,784 WARN L178 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-10-04 12:13:53,104 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 11 [2018-10-04 12:13:53,278 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 31 proven. 100 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-04 12:13:53,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:13:53,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-10-04 12:13:53,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:13:53,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:13:53,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:13:53,300 INFO L87 Difference]: Start difference. First operand 1612 states and 2296 transitions. Second operand 13 states. [2018-10-04 12:13:54,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:54,773 INFO L93 Difference]: Finished difference Result 3128 states and 4425 transitions. [2018-10-04 12:13:54,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:13:54,773 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 85 [2018-10-04 12:13:54,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:54,787 INFO L225 Difference]: With dead ends: 3128 [2018-10-04 12:13:54,787 INFO L226 Difference]: Without dead ends: 3127 [2018-10-04 12:13:54,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-10-04 12:13:54,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3127 states. [2018-10-04 12:13:54,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3127 to 1270. [2018-10-04 12:13:54,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1270 states. [2018-10-04 12:13:54,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1805 transitions. [2018-10-04 12:13:54,842 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1805 transitions. Word has length 85 [2018-10-04 12:13:54,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:54,842 INFO L480 AbstractCegarLoop]: Abstraction has 1270 states and 1805 transitions. [2018-10-04 12:13:54,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:13:54,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1805 transitions. [2018-10-04 12:13:54,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-04 12:13:54,845 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:54,846 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-10-04 12:13:54,846 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:13:54,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:54,846 INFO L82 PathProgramCache]: Analyzing trace with hash -2004113356, now seen corresponding path program 1 times [2018-10-04 12:13:54,846 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:54,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:54,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:54,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:54,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:54,927 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-04 12:13:54,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:54,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:13:54,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:13:54,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:13:54,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:13:54,929 INFO L87 Difference]: Start difference. First operand 1270 states and 1805 transitions. Second operand 3 states. [2018-10-04 12:13:55,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:55,197 INFO L93 Difference]: Finished difference Result 2399 states and 3394 transitions. [2018-10-04 12:13:55,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:13:55,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-10-04 12:13:55,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:55,203 INFO L225 Difference]: With dead ends: 2399 [2018-10-04 12:13:55,203 INFO L226 Difference]: Without dead ends: 1130 [2018-10-04 12:13:55,205 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-10-04 12:13:55,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2018-10-04 12:13:55,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1129. [2018-10-04 12:13:55,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1129 states. [2018-10-04 12:13:55,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1537 transitions. [2018-10-04 12:13:55,243 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1537 transitions. Word has length 87 [2018-10-04 12:13:55,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:55,244 INFO L480 AbstractCegarLoop]: Abstraction has 1129 states and 1537 transitions. [2018-10-04 12:13:55,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:13:55,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1537 transitions. [2018-10-04 12:13:55,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-04 12:13:55,247 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:55,247 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-10-04 12:13:55,247 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:13:55,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:55,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1082348105, now seen corresponding path program 1 times [2018-10-04 12:13:55,248 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:55,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:55,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:55,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:55,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:55,329 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-04 12:13:55,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:55,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:13:55,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:13:55,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:13:55,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:13:55,331 INFO L87 Difference]: Start difference. First operand 1129 states and 1537 transitions. Second operand 3 states. [2018-10-04 12:13:55,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:55,701 INFO L93 Difference]: Finished difference Result 2013 states and 2713 transitions. [2018-10-04 12:13:55,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:13:55,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-10-04 12:13:55,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:55,706 INFO L225 Difference]: With dead ends: 2013 [2018-10-04 12:13:55,706 INFO L226 Difference]: Without dead ends: 850 [2018-10-04 12:13:55,708 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-10-04 12:13:55,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2018-10-04 12:13:55,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 700. [2018-10-04 12:13:55,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2018-10-04 12:13:55,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 909 transitions. [2018-10-04 12:13:55,733 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 909 transitions. Word has length 87 [2018-10-04 12:13:55,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:55,733 INFO L480 AbstractCegarLoop]: Abstraction has 700 states and 909 transitions. [2018-10-04 12:13:55,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:13:55,734 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 909 transitions. [2018-10-04 12:13:55,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-04 12:13:55,735 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:55,735 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-10-04 12:13:55,736 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:13:55,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:55,736 INFO L82 PathProgramCache]: Analyzing trace with hash -951849668, now seen corresponding path program 1 times [2018-10-04 12:13:55,736 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:55,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:55,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:55,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:55,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:56,181 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 107 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-04 12:13:56,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:13:56,181 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:13:56,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:56,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:13:56,470 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 107 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-04 12:13:56,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:13:56,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2018-10-04 12:13:56,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:13:56,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:13:56,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:13:56,492 INFO L87 Difference]: Start difference. First operand 700 states and 909 transitions. Second operand 11 states. [2018-10-04 12:13:57,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:57,303 INFO L93 Difference]: Finished difference Result 1537 states and 1981 transitions. [2018-10-04 12:13:57,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:13:57,304 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2018-10-04 12:13:57,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:57,308 INFO L225 Difference]: With dead ends: 1537 [2018-10-04 12:13:57,309 INFO L226 Difference]: Without dead ends: 1017 [2018-10-04 12:13:57,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-10-04 12:13:57,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2018-10-04 12:13:57,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 761. [2018-10-04 12:13:57,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2018-10-04 12:13:57,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 978 transitions. [2018-10-04 12:13:57,336 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 978 transitions. Word has length 90 [2018-10-04 12:13:57,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:57,336 INFO L480 AbstractCegarLoop]: Abstraction has 761 states and 978 transitions. [2018-10-04 12:13:57,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:13:57,336 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 978 transitions. [2018-10-04 12:13:57,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-04 12:13:57,338 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:57,338 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-10-04 12:13:57,339 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:13:57,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:57,339 INFO L82 PathProgramCache]: Analyzing trace with hash 21511062, now seen corresponding path program 1 times [2018-10-04 12:13:57,339 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:57,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:57,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:57,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:57,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:57,552 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 160 proven. 13 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-04 12:13:57,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:13:57,553 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:13:57,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:57,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:13:57,734 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-10-04 12:13:57,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:13:57,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-04 12:13:57,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:13:57,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:13:57,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:13:57,773 INFO L87 Difference]: Start difference. First operand 761 states and 978 transitions. Second operand 5 states. [2018-10-04 12:13:58,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:58,158 INFO L93 Difference]: Finished difference Result 1396 states and 1798 transitions. [2018-10-04 12:13:58,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:13:58,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-10-04 12:13:58,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:58,161 INFO L225 Difference]: With dead ends: 1396 [2018-10-04 12:13:58,161 INFO L226 Difference]: Without dead ends: 661 [2018-10-04 12:13:58,162 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-10-04 12:13:58,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2018-10-04 12:13:58,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2018-10-04 12:13:58,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2018-10-04 12:13:58,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 792 transitions. [2018-10-04 12:13:58,183 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 792 transitions. Word has length 99 [2018-10-04 12:13:58,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:58,183 INFO L480 AbstractCegarLoop]: Abstraction has 661 states and 792 transitions. [2018-10-04 12:13:58,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:13:58,183 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 792 transitions. [2018-10-04 12:13:58,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-04 12:13:58,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:58,185 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-10-04 12:13:58,185 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:13:58,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:58,187 INFO L82 PathProgramCache]: Analyzing trace with hash -224853863, now seen corresponding path program 1 times [2018-10-04 12:13:58,187 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:58,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:58,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:58,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:58,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:58,270 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-10-04 12:13:58,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:58,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:13:58,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:13:58,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:13:58,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:13:58,272 INFO L87 Difference]: Start difference. First operand 661 states and 792 transitions. Second operand 3 states. [2018-10-04 12:13:58,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:58,485 INFO L93 Difference]: Finished difference Result 1306 states and 1552 transitions. [2018-10-04 12:13:58,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:13:58,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2018-10-04 12:13:58,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:58,489 INFO L225 Difference]: With dead ends: 1306 [2018-10-04 12:13:58,489 INFO L226 Difference]: Without dead ends: 667 [2018-10-04 12:13:58,490 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-10-04 12:13:58,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-10-04 12:13:58,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 607. [2018-10-04 12:13:58,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2018-10-04 12:13:58,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 700 transitions. [2018-10-04 12:13:58,511 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 700 transitions. Word has length 103 [2018-10-04 12:13:58,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:58,511 INFO L480 AbstractCegarLoop]: Abstraction has 607 states and 700 transitions. [2018-10-04 12:13:58,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:13:58,511 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 700 transitions. [2018-10-04 12:13:58,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-04 12:13:58,513 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:58,513 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-10-04 12:13:58,513 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:13:58,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:58,514 INFO L82 PathProgramCache]: Analyzing trace with hash 707364856, now seen corresponding path program 1 times [2018-10-04 12:13:58,514 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:58,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:58,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:58,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:58,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:58,590 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-10-04 12:13:58,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:58,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:13:58,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:13:58,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:13:58,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:13:58,592 INFO L87 Difference]: Start difference. First operand 607 states and 700 transitions. Second operand 5 states. [2018-10-04 12:13:58,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:58,684 INFO L93 Difference]: Finished difference Result 930 states and 1072 transitions. [2018-10-04 12:13:58,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:13:58,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2018-10-04 12:13:58,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:58,687 INFO L225 Difference]: With dead ends: 930 [2018-10-04 12:13:58,687 INFO L226 Difference]: Without dead ends: 336 [2018-10-04 12:13:58,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:13:58,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-10-04 12:13:58,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 335. [2018-10-04 12:13:58,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-10-04 12:13:58,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 382 transitions. [2018-10-04 12:13:58,701 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 382 transitions. Word has length 108 [2018-10-04 12:13:58,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:58,702 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 382 transitions. [2018-10-04 12:13:58,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:13:58,702 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 382 transitions. [2018-10-04 12:13:58,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-04 12:13:58,704 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:58,704 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-10-04 12:13:58,704 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:13:58,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:58,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1140799292, now seen corresponding path program 1 times [2018-10-04 12:13:58,705 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:58,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:58,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:58,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:58,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:58,791 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-10-04 12:13:58,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:13:58,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:13:58,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:13:58,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:13:58,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:13:58,793 INFO L87 Difference]: Start difference. First operand 335 states and 382 transitions. Second operand 3 states. [2018-10-04 12:13:58,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:13:58,940 INFO L93 Difference]: Finished difference Result 663 states and 757 transitions. [2018-10-04 12:13:58,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:13:58,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-10-04 12:13:58,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:13:58,942 INFO L225 Difference]: With dead ends: 663 [2018-10-04 12:13:58,942 INFO L226 Difference]: Without dead ends: 335 [2018-10-04 12:13:58,943 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-10-04 12:13:58,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-10-04 12:13:58,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 331. [2018-10-04 12:13:58,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-10-04 12:13:58,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 373 transitions. [2018-10-04 12:13:58,956 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 373 transitions. Word has length 116 [2018-10-04 12:13:58,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:13:58,957 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 373 transitions. [2018-10-04 12:13:58,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:13:58,957 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 373 transitions. [2018-10-04 12:13:58,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-04 12:13:58,958 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:13:58,959 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-10-04 12:13:58,959 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:13:58,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:13:58,959 INFO L82 PathProgramCache]: Analyzing trace with hash 166395550, now seen corresponding path program 2 times [2018-10-04 12:13:58,960 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:13:58,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:13:58,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:58,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:13:58,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:13:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:13:59,364 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 17 [2018-10-04 12:13:59,766 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 20 proven. 266 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-04 12:13:59,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:13:59,767 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-10-04 12:13:59,775 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:13:59,823 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:13:59,823 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:13:59,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:00,416 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 35 proven. 250 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-04 12:14:00,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:00,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-10-04 12:14:00,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:14:00,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:14:00,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-10-04 12:14:00,437 INFO L87 Difference]: Start difference. First operand 331 states and 373 transitions. Second operand 17 states. [2018-10-04 12:14:01,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:01,355 INFO L93 Difference]: Finished difference Result 1064 states and 1203 transitions. [2018-10-04 12:14:01,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:14:01,358 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 121 [2018-10-04 12:14:01,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:01,364 INFO L225 Difference]: With dead ends: 1064 [2018-10-04 12:14:01,365 INFO L226 Difference]: Without dead ends: 1063 [2018-10-04 12:14:01,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 113 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2018-10-04 12:14:01,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2018-10-04 12:14:01,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 419. [2018-10-04 12:14:01,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-10-04 12:14:01,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 471 transitions. [2018-10-04 12:14:01,384 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 471 transitions. Word has length 121 [2018-10-04 12:14:01,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:01,384 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 471 transitions. [2018-10-04 12:14:01,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:14:01,384 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 471 transitions. [2018-10-04 12:14:01,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-04 12:14:01,386 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:01,386 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-10-04 12:14:01,386 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:14:01,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:01,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1620918566, now seen corresponding path program 1 times [2018-10-04 12:14:01,387 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:01,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:01,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:01,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:14:01,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:01,512 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-10-04 12:14:01,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:01,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:14:01,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:14:01,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:14:01,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:14:01,513 INFO L87 Difference]: Start difference. First operand 419 states and 471 transitions. Second operand 5 states. [2018-10-04 12:14:01,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:01,571 INFO L93 Difference]: Finished difference Result 673 states and 755 transitions. [2018-10-04 12:14:01,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:14:01,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2018-10-04 12:14:01,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:01,573 INFO L225 Difference]: With dead ends: 673 [2018-10-04 12:14:01,573 INFO L226 Difference]: Without dead ends: 468 [2018-10-04 12:14:01,574 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-10-04 12:14:01,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-10-04 12:14:01,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 412. [2018-10-04 12:14:01,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-10-04 12:14:01,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 463 transitions. [2018-10-04 12:14:01,588 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 463 transitions. Word has length 122 [2018-10-04 12:14:01,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:01,588 INFO L480 AbstractCegarLoop]: Abstraction has 412 states and 463 transitions. [2018-10-04 12:14:01,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:14:01,588 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 463 transitions. [2018-10-04 12:14:01,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-04 12:14:01,590 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:01,590 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-10-04 12:14:01,590 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:14:01,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:01,591 INFO L82 PathProgramCache]: Analyzing trace with hash -768532907, now seen corresponding path program 1 times [2018-10-04 12:14:01,591 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:01,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:01,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:01,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:01,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:01,931 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 202 proven. 50 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-10-04 12:14:01,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:01,931 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-10-04 12:14:01,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:01,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:02,235 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 139 proven. 131 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-04 12:14:02,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:02,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-10-04 12:14:02,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:14:02,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:14:02,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:14:02,257 INFO L87 Difference]: Start difference. First operand 412 states and 463 transitions. Second operand 9 states. [2018-10-04 12:14:02,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:02,613 INFO L93 Difference]: Finished difference Result 845 states and 948 transitions. [2018-10-04 12:14:02,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:14:02,613 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2018-10-04 12:14:02,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:02,616 INFO L225 Difference]: With dead ends: 845 [2018-10-04 12:14:02,616 INFO L226 Difference]: Without dead ends: 844 [2018-10-04 12:14:02,617 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:14:02,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2018-10-04 12:14:02,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 570. [2018-10-04 12:14:02,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-10-04 12:14:02,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 638 transitions. [2018-10-04 12:14:02,642 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 638 transitions. Word has length 123 [2018-10-04 12:14:02,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:02,642 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 638 transitions. [2018-10-04 12:14:02,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:14:02,643 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 638 transitions. [2018-10-04 12:14:02,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-04 12:14:02,645 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:02,645 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-10-04 12:14:02,645 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:14:02,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:02,646 INFO L82 PathProgramCache]: Analyzing trace with hash 242817106, now seen corresponding path program 3 times [2018-10-04 12:14:02,646 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:02,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:02,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:02,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:02,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:02,739 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2018-10-04 12:14:02,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:02,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:14:02,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:14:02,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:14:02,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:14:02,741 INFO L87 Difference]: Start difference. First operand 570 states and 638 transitions. Second operand 3 states. [2018-10-04 12:14:02,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:02,838 INFO L93 Difference]: Finished difference Result 1086 states and 1213 transitions. [2018-10-04 12:14:02,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:14:02,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2018-10-04 12:14:02,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:02,840 INFO L225 Difference]: With dead ends: 1086 [2018-10-04 12:14:02,840 INFO L226 Difference]: Without dead ends: 479 [2018-10-04 12:14:02,841 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-10-04 12:14:02,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-10-04 12:14:02,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 382. [2018-10-04 12:14:02,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-04 12:14:02,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 413 transitions. [2018-10-04 12:14:02,860 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 413 transitions. Word has length 159 [2018-10-04 12:14:02,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:02,860 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 413 transitions. [2018-10-04 12:14:02,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:14:02,860 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 413 transitions. [2018-10-04 12:14:02,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-04 12:14:02,862 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:02,862 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-10-04 12:14:02,862 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:14:02,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:02,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1109443822, now seen corresponding path program 1 times [2018-10-04 12:14:02,863 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:02,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:02,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:02,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:14:02,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:03,691 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 25 proven. 471 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-04 12:14:03,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:03,691 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-10-04 12:14:03,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:03,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:04,166 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 308 proven. 86 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-10-04 12:14:04,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:04,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 20 [2018-10-04 12:14:04,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 12:14:04,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 12:14:04,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2018-10-04 12:14:04,188 INFO L87 Difference]: Start difference. First operand 382 states and 413 transitions. Second operand 21 states. [2018-10-04 12:14:04,860 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 30 [2018-10-04 12:14:05,064 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 35 [2018-10-04 12:14:05,337 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 32 [2018-10-04 12:14:05,859 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2018-10-04 12:14:06,109 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2018-10-04 12:14:06,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:06,552 INFO L93 Difference]: Finished difference Result 970 states and 1050 transitions. [2018-10-04 12:14:06,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 12:14:06,552 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 159 [2018-10-04 12:14:06,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:06,553 INFO L225 Difference]: With dead ends: 970 [2018-10-04 12:14:06,553 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:14:06,555 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 170 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=367, Invalid=1193, Unknown=0, NotChecked=0, Total=1560 [2018-10-04 12:14:06,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:14:06,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:14:06,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:14:06,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:14:06,556 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 159 [2018-10-04 12:14:06,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:06,556 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:14:06,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 12:14:06,557 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:14:06,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:14:06,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:14:06,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:06,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:06,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:06,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:06,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:06,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:07,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:07,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:07,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:07,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:14:08,085 WARN L178 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 538 DAG size of output: 452 [2018-10-04 12:14:14,133 WARN L178 SmtUtils]: Spent 6.04 s on a formula simplification. DAG size of input: 431 DAG size of output: 153 [2018-10-04 12:14:14,138 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 161) no Hoare annotation was computed. [2018-10-04 12:14:14,138 INFO L425 ceAbstractionStarter]: For program point L127(lines 127 138) no Hoare annotation was computed. [2018-10-04 12:14:14,138 INFO L425 ceAbstractionStarter]: For program point L70-1(lines 70 96) no Hoare annotation was computed. [2018-10-04 12:14:14,138 INFO L425 ceAbstractionStarter]: For program point L153(lines 153 161) no Hoare annotation was computed. [2018-10-04 12:14:14,138 INFO L425 ceAbstractionStarter]: For program point L87(lines 87 96) no Hoare annotation was computed. [2018-10-04 12:14:14,138 INFO L425 ceAbstractionStarter]: For program point L112(lines 112 120) no Hoare annotation was computed. [2018-10-04 12:14:14,138 INFO L425 ceAbstractionStarter]: For program point L79(lines 79 96) no Hoare annotation was computed. [2018-10-04 12:14:14,138 INFO L425 ceAbstractionStarter]: For program point L146(lines 146 161) no Hoare annotation was computed. [2018-10-04 12:14:14,139 INFO L425 ceAbstractionStarter]: For program point L47-1(lines 13 164) no Hoare annotation was computed. [2018-10-04 12:14:14,139 INFO L425 ceAbstractionStarter]: For program point ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT(lines 48 55) no Hoare annotation was computed. [2018-10-04 12:14:14,139 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 138) no Hoare annotation was computed. [2018-10-04 12:14:14,139 INFO L425 ceAbstractionStarter]: For program point L89(lines 89 96) no Hoare annotation was computed. [2018-10-04 12:14:14,139 INFO L425 ceAbstractionStarter]: For program point L156(lines 156 161) no Hoare annotation was computed. [2018-10-04 12:14:14,140 INFO L421 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-10-04 12:14:14,140 INFO L425 ceAbstractionStarter]: For program point L115(lines 115 120) no Hoare annotation was computed. [2018-10-04 12:14:14,140 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 96) no Hoare annotation was computed. [2018-10-04 12:14:14,140 INFO L425 ceAbstractionStarter]: For program point L115-2(lines 99 138) no Hoare annotation was computed. [2018-10-04 12:14:14,140 INFO L425 ceAbstractionStarter]: For program point L107(lines 107 120) no Hoare annotation was computed. [2018-10-04 12:14:14,140 INFO L425 ceAbstractionStarter]: For program point ElevatorEXIT(lines 13 164) no Hoare annotation was computed. [2018-10-04 12:14:14,141 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 96) no Hoare annotation was computed. [2018-10-04 12:14:14,141 INFO L425 ceAbstractionStarter]: For program point L91-2(lines 77 120) no Hoare annotation was computed. [2018-10-04 12:14:14,141 INFO L425 ceAbstractionStarter]: For program point L149(lines 149 161) no Hoare annotation was computed. [2018-10-04 12:14:14,141 INFO L425 ceAbstractionStarter]: For program point L133(lines 133 138) no Hoare annotation was computed. [2018-10-04 12:14:14,141 INFO L425 ceAbstractionStarter]: For program point L67(lines 67 69) no Hoare annotation was computed. [2018-10-04 12:14:14,141 INFO L425 ceAbstractionStarter]: For program point L133-2(lines 123 161) no Hoare annotation was computed. [2018-10-04 12:14:14,141 INFO L425 ceAbstractionStarter]: For program point L67-2(lines 67 72) no Hoare annotation was computed. [2018-10-04 12:14:14,141 INFO L425 ceAbstractionStarter]: For program point ElevatorENTRY(lines 13 164) no Hoare annotation was computed. [2018-10-04 12:14:14,141 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 96) no Hoare annotation was computed. [2018-10-04 12:14:14,141 INFO L425 ceAbstractionStarter]: For program point L101(lines 101 120) no Hoare annotation was computed. [2018-10-04 12:14:14,160 INFO L202 PluginConnector]: Adding new model ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:14:14 BoogieIcfgContainer [2018-10-04 12:14:14,161 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:14:14,161 INFO L168 Benchmark]: Toolchain (without parser) took 29753.00 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 362.8 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 260.0 MB). Peak memory consumption was 844.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:14:14,163 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:14:14,163 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.94 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:14:14,163 INFO L168 Benchmark]: Boogie Preprocessor took 29.41 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:14:14,164 INFO L168 Benchmark]: RCFGBuilder took 742.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-04 12:14:14,164 INFO L168 Benchmark]: TraceAbstraction took 28931.23 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 362.8 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 228.3 MB). Peak memory consumption was 812.4 MB. Max. memory is 7.1 GB. [2018-10-04 12:14:14,168 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.94 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.41 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 742.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 28931.23 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 362.8 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 228.3 MB). Peak memory consumption was 812.4 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.8s OverallTime, 26 OverallIterations, 9 TraceHistogramMax, 11.2s AutomataDifference, 0.0s DeadEndRemovalTime, 7.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 1795 SDtfs, 4287 SDslu, 4567 SDs, 0 SdLazy, 2480 SolverSat, 331 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 916 GetRequests, 760 SyntacticMatches, 14 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 8.8s 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.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.7s 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-10-04_12-14-14-182.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-10-04_12-14-14-182.csv Received shutdown request...