java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/real-life/ElevatorWithAssignments.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:41:51,876 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:41:51,879 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:41:51,894 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:41:51,894 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:41:51,895 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:41:51,897 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:41:51,900 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:41:51,901 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:41:51,904 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:41:51,906 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:41:51,906 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:41:51,907 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:41:51,908 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:41:51,910 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:41:51,910 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:41:51,911 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:41:51,913 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:41:51,915 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:41:51,917 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:41:51,918 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:41:51,919 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:41:51,922 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:41:51,922 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:41:51,922 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:41:51,924 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:41:51,925 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:41:51,926 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:41:51,926 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:41:51,928 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:41:51,928 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:41:51,929 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:41:51,929 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:41:51,929 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:41:51,930 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:41:51,931 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:41:51,931 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 12:41:51,947 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:41:51,947 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:41:51,948 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:41:51,948 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:41:51,949 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:41:51,949 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:41:51,949 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:41:51,950 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:41:51,950 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:41:51,950 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:41:51,950 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:41:51,950 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:41:51,951 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:41:51,951 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:41:51,951 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:41:51,951 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:41:51,951 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:41:51,951 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:41:51,952 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:41:51,952 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:41:51,952 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:41:51,952 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:41:51,952 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:41:51,953 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:41:51,955 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:41:51,955 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:41:51,955 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:41:51,955 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:41:51,956 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:41:51,956 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:41:51,956 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:41:52,031 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:41:52,048 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:41:52,055 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:41:52,057 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:41:52,057 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:41:52,058 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:41:52,059 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/ElevatorWithAssignments.bpl' [2018-10-04 12:41:52,135 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:41:52,136 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:41:52,137 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:41:52,137 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:41:52,138 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:41:52,158 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:41:52" (1/1) ... [2018-10-04 12:41:52,172 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:41:52" (1/1) ... [2018-10-04 12:41:52,177 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 12:41:52,177 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 12:41:52,177 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 12:41:52,180 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:41:52,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:41:52,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:41:52,181 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:41:52,191 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:41:52" (1/1) ... [2018-10-04 12:41:52,191 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:41:52" (1/1) ... [2018-10-04 12:41:52,193 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:41:52" (1/1) ... [2018-10-04 12:41:52,194 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:41:52" (1/1) ... [2018-10-04 12:41:52,198 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:41:52" (1/1) ... [2018-10-04 12:41:52,205 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:41:52" (1/1) ... [2018-10-04 12:41:52,207 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:41:52" (1/1) ... [2018-10-04 12:41:52,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:41:52,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:41:52,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:41:52,210 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:41:52,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:52" (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:41:52,271 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Elevator given in one single declaration [2018-10-04 12:41:52,271 INFO L130 BoogieDeclarations]: Found specification of procedure Elevator [2018-10-04 12:41:52,271 INFO L138 BoogieDeclarations]: Found implementation of procedure Elevator [2018-10-04 12:41:53,055 INFO L338 CfgBuilder]: Using library mode [2018-10-04 12:41:53,055 INFO L202 PluginConnector]: Adding new model ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:41:53 BoogieIcfgContainer [2018-10-04 12:41:53,055 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:41:53,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:41:53,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:41:53,060 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:41:53,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:52" (1/2) ... [2018-10-04 12:41:53,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41924f32 and model type ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:41:53, skipping insertion in model container [2018-10-04 12:41:53,062 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:41:53" (2/2) ... [2018-10-04 12:41:53,064 INFO L112 eAbstractionObserver]: Analyzing ICFG ElevatorWithAssignments.bpl [2018-10-04 12:41:53,075 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:41:53,084 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:41:53,137 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:41:53,138 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:41:53,138 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:41:53,138 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:41:53,138 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:41:53,139 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:41:53,139 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:41:53,139 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:41:53,139 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:41:53,156 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-10-04 12:41:53,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-10-04 12:41:53,162 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:53,163 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-10-04 12:41:53,164 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:41:53,171 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:53,171 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-10-04 12:41:53,173 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:53,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:53,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:53,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:41:53,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:53,387 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:41:53,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:41:53,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-04 12:41:53,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:41:53,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:41:53,410 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:53,412 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2018-10-04 12:41:53,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:41:53,608 INFO L93 Difference]: Finished difference Result 84 states and 157 transitions. [2018-10-04 12:41:53,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:41:53,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-10-04 12:41:53,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:41:53,624 INFO L225 Difference]: With dead ends: 84 [2018-10-04 12:41:53,624 INFO L226 Difference]: Without dead ends: 54 [2018-10-04 12:41:53,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:41:53,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-04 12:41:53,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-10-04 12:41:53,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-04 12:41:53,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 93 transitions. [2018-10-04 12:41:53,672 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 93 transitions. Word has length 2 [2018-10-04 12:41:53,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:41:53,673 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 93 transitions. [2018-10-04 12:41:53,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:41:53,673 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 93 transitions. [2018-10-04 12:41:53,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:41:53,674 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:53,675 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:41:53,675 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:41:53,675 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:53,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1770004619, now seen corresponding path program 1 times [2018-10-04 12:41:53,676 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:53,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:53,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:53,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:41:53,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:53,729 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:41:53,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:41:53,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:41:53,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:41:53,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:41:53,732 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:53,733 INFO L87 Difference]: Start difference. First operand 53 states and 93 transitions. Second operand 3 states. [2018-10-04 12:41:53,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:41:53,825 INFO L93 Difference]: Finished difference Result 157 states and 277 transitions. [2018-10-04 12:41:53,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:41:53,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-04 12:41:53,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:41:53,832 INFO L225 Difference]: With dead ends: 157 [2018-10-04 12:41:53,832 INFO L226 Difference]: Without dead ends: 101 [2018-10-04 12:41:53,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:41:53,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-04 12:41:53,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-10-04 12:41:53,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-04 12:41:53,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 175 transitions. [2018-10-04 12:41:53,862 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 175 transitions. Word has length 14 [2018-10-04 12:41:53,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:41:53,862 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 175 transitions. [2018-10-04 12:41:53,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:41:53,862 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 175 transitions. [2018-10-04 12:41:53,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:41:53,864 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:53,864 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:41:53,864 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:41:53,864 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:53,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1068940041, now seen corresponding path program 1 times [2018-10-04 12:41:53,865 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:53,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:53,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:53,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:41:53,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:53,901 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:41:53,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:41:53,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:41:53,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:41:53,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:41:53,906 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:53,906 INFO L87 Difference]: Start difference. First operand 100 states and 175 transitions. Second operand 3 states. [2018-10-04 12:41:54,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:41:54,198 INFO L93 Difference]: Finished difference Result 205 states and 356 transitions. [2018-10-04 12:41:54,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:41:54,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-04 12:41:54,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:41:54,201 INFO L225 Difference]: With dead ends: 205 [2018-10-04 12:41:54,201 INFO L226 Difference]: Without dead ends: 104 [2018-10-04 12:41:54,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:41:54,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-04 12:41:54,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 89. [2018-10-04 12:41:54,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-04 12:41:54,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 152 transitions. [2018-10-04 12:41:54,215 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 152 transitions. Word has length 14 [2018-10-04 12:41:54,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:41:54,215 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 152 transitions. [2018-10-04 12:41:54,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:41:54,216 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 152 transitions. [2018-10-04 12:41:54,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:41:54,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:54,217 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:41:54,220 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:41:54,220 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:54,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1940946465, now seen corresponding path program 1 times [2018-10-04 12:41:54,220 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:54,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:54,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:54,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:41:54,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:54,328 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:41:54,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:41:54,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:41:54,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:41:54,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:41:54,329 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:54,330 INFO L87 Difference]: Start difference. First operand 89 states and 152 transitions. Second operand 5 states. [2018-10-04 12:41:54,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:41:54,575 INFO L93 Difference]: Finished difference Result 321 states and 545 transitions. [2018-10-04 12:41:54,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:41:54,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-10-04 12:41:54,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:41:54,579 INFO L225 Difference]: With dead ends: 321 [2018-10-04 12:41:54,580 INFO L226 Difference]: Without dead ends: 209 [2018-10-04 12:41:54,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 3 [2018-10-04 12:41:54,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-04 12:41:54,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2018-10-04 12:41:54,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-04 12:41:54,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 346 transitions. [2018-10-04 12:41:54,603 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 346 transitions. Word has length 19 [2018-10-04 12:41:54,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:41:54,604 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 346 transitions. [2018-10-04 12:41:54,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:41:54,604 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 346 transitions. [2018-10-04 12:41:54,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-04 12:41:54,606 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:54,606 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:41:54,606 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:41:54,606 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:54,607 INFO L82 PathProgramCache]: Analyzing trace with hash 2002343284, now seen corresponding path program 1 times [2018-10-04 12:41:54,607 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:54,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:54,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:54,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:41:54,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:54,664 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:41:54,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:41:54,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:41:54,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:41:54,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:41:54,665 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:54,666 INFO L87 Difference]: Start difference. First operand 207 states and 346 transitions. Second operand 3 states. [2018-10-04 12:41:54,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:41:54,858 INFO L93 Difference]: Finished difference Result 522 states and 865 transitions. [2018-10-04 12:41:54,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:41:54,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-04 12:41:54,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:41:54,868 INFO L225 Difference]: With dead ends: 522 [2018-10-04 12:41:54,868 INFO L226 Difference]: Without dead ends: 310 [2018-10-04 12:41:54,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:41:54,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-10-04 12:41:54,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 213. [2018-10-04 12:41:54,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-04 12:41:54,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 352 transitions. [2018-10-04 12:41:54,895 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 352 transitions. Word has length 41 [2018-10-04 12:41:54,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:41:54,895 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 352 transitions. [2018-10-04 12:41:54,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:41:54,896 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 352 transitions. [2018-10-04 12:41:54,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-04 12:41:54,897 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:54,898 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:41:54,898 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:41:54,898 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:54,898 INFO L82 PathProgramCache]: Analyzing trace with hash 2074119508, now seen corresponding path program 1 times [2018-10-04 12:41:54,899 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:54,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:54,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:54,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:41:54,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:54,957 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:41:54,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:41:54,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:41:54,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:41:54,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:41:54,959 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:54,960 INFO L87 Difference]: Start difference. First operand 213 states and 352 transitions. Second operand 3 states. [2018-10-04 12:41:55,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:41:55,031 INFO L93 Difference]: Finished difference Result 588 states and 972 transitions. [2018-10-04 12:41:55,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:41:55,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-10-04 12:41:55,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:41:55,039 INFO L225 Difference]: With dead ends: 588 [2018-10-04 12:41:55,039 INFO L226 Difference]: Without dead ends: 367 [2018-10-04 12:41:55,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:41:55,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-10-04 12:41:55,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 354. [2018-10-04 12:41:55,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-10-04 12:41:55,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 570 transitions. [2018-10-04 12:41:55,062 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 570 transitions. Word has length 42 [2018-10-04 12:41:55,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:41:55,062 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 570 transitions. [2018-10-04 12:41:55,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:41:55,062 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 570 transitions. [2018-10-04 12:41:55,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 12:41:55,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:55,066 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:41:55,068 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:41:55,068 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:55,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1430938278, now seen corresponding path program 1 times [2018-10-04 12:41:55,069 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:55,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:55,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:55,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:41:55,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:55,174 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:41:55,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:41:55,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:41:55,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:41:55,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:41:55,177 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:55,177 INFO L87 Difference]: Start difference. First operand 354 states and 570 transitions. Second operand 3 states. [2018-10-04 12:41:55,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:41:55,613 INFO L93 Difference]: Finished difference Result 880 states and 1399 transitions. [2018-10-04 12:41:55,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:41:55,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-04 12:41:55,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:41:55,620 INFO L225 Difference]: With dead ends: 880 [2018-10-04 12:41:55,620 INFO L226 Difference]: Without dead ends: 542 [2018-10-04 12:41:55,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:41:55,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-10-04 12:41:55,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 366. [2018-10-04 12:41:55,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-10-04 12:41:55,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 582 transitions. [2018-10-04 12:41:55,644 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 582 transitions. Word has length 44 [2018-10-04 12:41:55,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:41:55,645 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 582 transitions. [2018-10-04 12:41:55,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:41:55,645 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 582 transitions. [2018-10-04 12:41:55,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-04 12:41:55,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:55,650 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:41:55,653 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:41:55,653 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:55,654 INFO L82 PathProgramCache]: Analyzing trace with hash -138883553, now seen corresponding path program 1 times [2018-10-04 12:41:55,654 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:55,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:55,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:55,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:41:55,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:55,775 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:41:55,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:41:55,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:41:55,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:41:55,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:41:55,776 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:55,777 INFO L87 Difference]: Start difference. First operand 366 states and 582 transitions. Second operand 4 states. [2018-10-04 12:41:56,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:41:56,003 INFO L93 Difference]: Finished difference Result 1096 states and 1744 transitions. [2018-10-04 12:41:56,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:41:56,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-10-04 12:41:56,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:41:56,015 INFO L225 Difference]: With dead ends: 1096 [2018-10-04 12:41:56,015 INFO L226 Difference]: Without dead ends: 731 [2018-10-04 12:41:56,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 2 [2018-10-04 12:41:56,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-10-04 12:41:56,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 666. [2018-10-04 12:41:56,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2018-10-04 12:41:56,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1037 transitions. [2018-10-04 12:41:56,048 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1037 transitions. Word has length 46 [2018-10-04 12:41:56,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:41:56,048 INFO L480 AbstractCegarLoop]: Abstraction has 666 states and 1037 transitions. [2018-10-04 12:41:56,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:41:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1037 transitions. [2018-10-04 12:41:56,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-04 12:41:56,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:56,053 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:41:56,054 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:41:56,054 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:56,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1242691348, now seen corresponding path program 1 times [2018-10-04 12:41:56,054 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:56,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:56,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:56,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:41:56,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:56,456 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:41:56,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:41:56,457 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:41:56,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:41:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:56,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:41:57,321 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:41:57,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:41:57,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-10-04 12:41:57,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:41:57,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:41:57,356 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:57,356 INFO L87 Difference]: Start difference. First operand 666 states and 1037 transitions. Second operand 8 states. [2018-10-04 12:41:58,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:41:58,114 INFO L93 Difference]: Finished difference Result 1293 states and 2002 transitions. [2018-10-04 12:41:58,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:41:58,115 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-10-04 12:41:58,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:41:58,122 INFO L225 Difference]: With dead ends: 1293 [2018-10-04 12:41:58,122 INFO L226 Difference]: Without dead ends: 1292 [2018-10-04 12:41:58,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.2s impTime 6 [2018-10-04 12:41:58,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2018-10-04 12:41:58,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1176. [2018-10-04 12:41:58,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-10-04 12:41:58,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1825 transitions. [2018-10-04 12:41:58,172 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1825 transitions. Word has length 49 [2018-10-04 12:41:58,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:41:58,172 INFO L480 AbstractCegarLoop]: Abstraction has 1176 states and 1825 transitions. [2018-10-04 12:41:58,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:41:58,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1825 transitions. [2018-10-04 12:41:58,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-04 12:41:58,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:58,176 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:41:58,176 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:41:58,177 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:58,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1557173637, now seen corresponding path program 1 times [2018-10-04 12:41:58,177 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:58,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:58,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:58,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:41:58,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:58,354 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:41:58,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:41:58,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:41:58,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:41:58,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:41:58,356 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:58,356 INFO L87 Difference]: Start difference. First operand 1176 states and 1825 transitions. Second operand 4 states. [2018-10-04 12:41:58,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:41:58,664 INFO L93 Difference]: Finished difference Result 2655 states and 4085 transitions. [2018-10-04 12:41:58,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:41:58,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-10-04 12:41:58,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:41:58,675 INFO L225 Difference]: With dead ends: 2655 [2018-10-04 12:41:58,675 INFO L226 Difference]: Without dead ends: 1510 [2018-10-04 12:41:58,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 2 [2018-10-04 12:41:58,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-10-04 12:41:58,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1468. [2018-10-04 12:41:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1468 states. [2018-10-04 12:41:58,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 2236 transitions. [2018-10-04 12:41:58,740 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 2236 transitions. Word has length 67 [2018-10-04 12:41:58,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:41:58,740 INFO L480 AbstractCegarLoop]: Abstraction has 1468 states and 2236 transitions. [2018-10-04 12:41:58,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:41:58,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 2236 transitions. [2018-10-04 12:41:58,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-04 12:41:58,743 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:58,744 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:41:58,744 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:41:58,744 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:58,744 INFO L82 PathProgramCache]: Analyzing trace with hash -423460397, now seen corresponding path program 1 times [2018-10-04 12:41:58,744 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:58,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:58,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:58,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:41:58,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:58,953 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:41:58,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:41:58,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:41:58,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:41:58,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:41:58,958 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:58,958 INFO L87 Difference]: Start difference. First operand 1468 states and 2236 transitions. Second operand 4 states. [2018-10-04 12:41:59,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:41:59,139 INFO L93 Difference]: Finished difference Result 2726 states and 4172 transitions. [2018-10-04 12:41:59,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:41:59,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-10-04 12:41:59,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:41:59,155 INFO L225 Difference]: With dead ends: 2726 [2018-10-04 12:41:59,156 INFO L226 Difference]: Without dead ends: 1469 [2018-10-04 12:41:59,158 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 2 [2018-10-04 12:41:59,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2018-10-04 12:41:59,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1466. [2018-10-04 12:41:59,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1466 states. [2018-10-04 12:41:59,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 2172 transitions. [2018-10-04 12:41:59,213 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 2172 transitions. Word has length 68 [2018-10-04 12:41:59,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:41:59,213 INFO L480 AbstractCegarLoop]: Abstraction has 1466 states and 2172 transitions. [2018-10-04 12:41:59,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:41:59,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 2172 transitions. [2018-10-04 12:41:59,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-04 12:41:59,216 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:59,217 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:41:59,217 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:41:59,217 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:59,218 INFO L82 PathProgramCache]: Analyzing trace with hash -734626103, now seen corresponding path program 2 times [2018-10-04 12:41:59,218 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:59,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:59,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:59,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:41:59,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:59,299 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:41:59,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:41:59,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:41:59,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:41:59,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:41:59,301 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:59,301 INFO L87 Difference]: Start difference. First operand 1466 states and 2172 transitions. Second operand 3 states. [2018-10-04 12:41:59,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:41:59,716 INFO L93 Difference]: Finished difference Result 2942 states and 4353 transitions. [2018-10-04 12:41:59,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:41:59,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-10-04 12:41:59,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:41:59,724 INFO L225 Difference]: With dead ends: 2942 [2018-10-04 12:41:59,724 INFO L226 Difference]: Without dead ends: 1457 [2018-10-04 12:41:59,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:41:59,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2018-10-04 12:41:59,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1397. [2018-10-04 12:41:59,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1397 states. [2018-10-04 12:41:59,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 2012 transitions. [2018-10-04 12:41:59,780 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 2012 transitions. Word has length 69 [2018-10-04 12:41:59,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:41:59,781 INFO L480 AbstractCegarLoop]: Abstraction has 1397 states and 2012 transitions. [2018-10-04 12:41:59,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:41:59,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 2012 transitions. [2018-10-04 12:41:59,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-04 12:41:59,784 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:41:59,784 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:41:59,784 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:41:59,785 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:41:59,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1023158359, now seen corresponding path program 1 times [2018-10-04 12:41:59,785 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:41:59,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:41:59,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:59,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:41:59,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:41:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:41:59,886 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:41:59,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:41:59,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:41:59,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:41:59,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:41:59,887 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:41:59,887 INFO L87 Difference]: Start difference. First operand 1397 states and 2012 transitions. Second operand 3 states. [2018-10-04 12:42:00,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:00,017 INFO L93 Difference]: Finished difference Result 3297 states and 4763 transitions. [2018-10-04 12:42:00,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:42:00,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-10-04 12:42:00,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:00,026 INFO L225 Difference]: With dead ends: 3297 [2018-10-04 12:42:00,027 INFO L226 Difference]: Without dead ends: 1830 [2018-10-04 12:42:00,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:42:00,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2018-10-04 12:42:00,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1612. [2018-10-04 12:42:00,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1612 states. [2018-10-04 12:42:00,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2296 transitions. [2018-10-04 12:42:00,083 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2296 transitions. Word has length 84 [2018-10-04 12:42:00,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:00,083 INFO L480 AbstractCegarLoop]: Abstraction has 1612 states and 2296 transitions. [2018-10-04 12:42:00,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:42:00,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2296 transitions. [2018-10-04 12:42:00,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-04 12:42:00,087 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:00,087 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:42:00,087 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:42:00,088 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:00,088 INFO L82 PathProgramCache]: Analyzing trace with hash -147951611, now seen corresponding path program 1 times [2018-10-04 12:42:00,088 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:00,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:00,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:00,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:00,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:00,987 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:42:00,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:00,988 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:42:01,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:01,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:03,303 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:42:03,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:03,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2018-10-04 12:42:03,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:42:03,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:42:03,326 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:03,326 INFO L87 Difference]: Start difference. First operand 1612 states and 2296 transitions. Second operand 14 states. [2018-10-04 12:42:04,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:04,758 INFO L93 Difference]: Finished difference Result 3128 states and 4425 transitions. [2018-10-04 12:42:04,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:42:04,759 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 85 [2018-10-04 12:42:04,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:04,772 INFO L225 Difference]: With dead ends: 3128 [2018-10-04 12:42:04,773 INFO L226 Difference]: Without dead ends: 3127 [2018-10-04 12:42:04,774 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s Time 0.9s impTime 12 [2018-10-04 12:42:04,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3127 states. [2018-10-04 12:42:04,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3127 to 1270. [2018-10-04 12:42:04,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1270 states. [2018-10-04 12:42:04,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1805 transitions. [2018-10-04 12:42:04,835 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1805 transitions. Word has length 85 [2018-10-04 12:42:04,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:04,836 INFO L480 AbstractCegarLoop]: Abstraction has 1270 states and 1805 transitions. [2018-10-04 12:42:04,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:42:04,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1805 transitions. [2018-10-04 12:42:04,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-04 12:42:04,839 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:04,839 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:42:04,840 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:42:04,840 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:04,840 INFO L82 PathProgramCache]: Analyzing trace with hash -2004113356, now seen corresponding path program 1 times [2018-10-04 12:42:04,840 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:04,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:04,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:04,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:04,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:04,917 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:42:04,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:04,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:42:04,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:42:04,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:42:04,918 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:04,919 INFO L87 Difference]: Start difference. First operand 1270 states and 1805 transitions. Second operand 3 states. [2018-10-04 12:42:04,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:04,993 INFO L93 Difference]: Finished difference Result 2399 states and 3394 transitions. [2018-10-04 12:42:04,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:42:04,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-10-04 12:42:04,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:05,001 INFO L225 Difference]: With dead ends: 2399 [2018-10-04 12:42:05,001 INFO L226 Difference]: Without dead ends: 1130 [2018-10-04 12:42:05,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:42:05,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2018-10-04 12:42:05,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1129. [2018-10-04 12:42:05,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1129 states. [2018-10-04 12:42:05,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1537 transitions. [2018-10-04 12:42:05,044 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1537 transitions. Word has length 87 [2018-10-04 12:42:05,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:05,044 INFO L480 AbstractCegarLoop]: Abstraction has 1129 states and 1537 transitions. [2018-10-04 12:42:05,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:42:05,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1537 transitions. [2018-10-04 12:42:05,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-04 12:42:05,047 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:05,047 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:42:05,048 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:42:05,048 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:05,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1082348105, now seen corresponding path program 1 times [2018-10-04 12:42:05,048 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:05,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:05,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:05,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:05,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:05,129 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:42:05,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:05,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:42:05,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:42:05,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:42:05,130 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:05,130 INFO L87 Difference]: Start difference. First operand 1129 states and 1537 transitions. Second operand 3 states. [2018-10-04 12:42:05,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:05,304 INFO L93 Difference]: Finished difference Result 2013 states and 2713 transitions. [2018-10-04 12:42:05,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:42:05,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-10-04 12:42:05,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:05,308 INFO L225 Difference]: With dead ends: 2013 [2018-10-04 12:42:05,309 INFO L226 Difference]: Without dead ends: 850 [2018-10-04 12:42:05,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:42:05,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2018-10-04 12:42:05,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 700. [2018-10-04 12:42:05,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2018-10-04 12:42:05,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 909 transitions. [2018-10-04 12:42:05,342 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 909 transitions. Word has length 87 [2018-10-04 12:42:05,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:05,343 INFO L480 AbstractCegarLoop]: Abstraction has 700 states and 909 transitions. [2018-10-04 12:42:05,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:42:05,343 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 909 transitions. [2018-10-04 12:42:05,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-04 12:42:05,345 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:05,345 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:42:05,345 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:42:05,345 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:05,346 INFO L82 PathProgramCache]: Analyzing trace with hash -951849668, now seen corresponding path program 1 times [2018-10-04 12:42:05,346 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:05,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:05,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:05,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:05,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:05,526 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:42:05,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:05,527 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:42:05,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:05,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:05,875 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:42:05,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:05,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2018-10-04 12:42:05,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:42:05,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:42:05,897 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:05,897 INFO L87 Difference]: Start difference. First operand 700 states and 909 transitions. Second operand 11 states. [2018-10-04 12:42:06,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:06,651 INFO L93 Difference]: Finished difference Result 1537 states and 1981 transitions. [2018-10-04 12:42:06,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:42:06,652 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2018-10-04 12:42:06,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:06,655 INFO L225 Difference]: With dead ends: 1537 [2018-10-04 12:42:06,655 INFO L226 Difference]: Without dead ends: 1017 [2018-10-04 12:42:06,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 11 [2018-10-04 12:42:06,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2018-10-04 12:42:06,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 761. [2018-10-04 12:42:06,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2018-10-04 12:42:06,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 978 transitions. [2018-10-04 12:42:06,687 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 978 transitions. Word has length 90 [2018-10-04 12:42:06,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:06,687 INFO L480 AbstractCegarLoop]: Abstraction has 761 states and 978 transitions. [2018-10-04 12:42:06,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:42:06,687 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 978 transitions. [2018-10-04 12:42:06,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-04 12:42:06,689 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:06,690 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:42:06,690 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:42:06,690 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:06,690 INFO L82 PathProgramCache]: Analyzing trace with hash 21511062, now seen corresponding path program 1 times [2018-10-04 12:42:06,690 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:06,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:06,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:06,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:06,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:06,886 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:42:06,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:06,886 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:42:06,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:06,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:07,169 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:42:07,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:42:07,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-04 12:42:07,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:42:07,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:42:07,202 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:07,202 INFO L87 Difference]: Start difference. First operand 761 states and 978 transitions. Second operand 5 states. [2018-10-04 12:42:07,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:07,387 INFO L93 Difference]: Finished difference Result 1396 states and 1798 transitions. [2018-10-04 12:42:07,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:42:07,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-10-04 12:42:07,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:07,390 INFO L225 Difference]: With dead ends: 1396 [2018-10-04 12:42:07,390 INFO L226 Difference]: Without dead ends: 661 [2018-10-04 12:42:07,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 3 [2018-10-04 12:42:07,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2018-10-04 12:42:07,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2018-10-04 12:42:07,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2018-10-04 12:42:07,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 792 transitions. [2018-10-04 12:42:07,421 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 792 transitions. Word has length 99 [2018-10-04 12:42:07,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:07,421 INFO L480 AbstractCegarLoop]: Abstraction has 661 states and 792 transitions. [2018-10-04 12:42:07,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:42:07,422 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 792 transitions. [2018-10-04 12:42:07,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-04 12:42:07,424 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:07,425 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:42:07,425 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:42:07,426 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:07,426 INFO L82 PathProgramCache]: Analyzing trace with hash -224853863, now seen corresponding path program 1 times [2018-10-04 12:42:07,426 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:07,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:07,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:07,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:07,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:07,528 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:42:07,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:07,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:42:07,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:42:07,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:42:07,529 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:07,530 INFO L87 Difference]: Start difference. First operand 661 states and 792 transitions. Second operand 3 states. [2018-10-04 12:42:07,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:07,865 INFO L93 Difference]: Finished difference Result 1306 states and 1552 transitions. [2018-10-04 12:42:07,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:42:07,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2018-10-04 12:42:07,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:07,869 INFO L225 Difference]: With dead ends: 1306 [2018-10-04 12:42:07,869 INFO L226 Difference]: Without dead ends: 667 [2018-10-04 12:42:07,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:42:07,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-10-04 12:42:07,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 607. [2018-10-04 12:42:07,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2018-10-04 12:42:07,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 700 transitions. [2018-10-04 12:42:07,903 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 700 transitions. Word has length 103 [2018-10-04 12:42:07,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:07,904 INFO L480 AbstractCegarLoop]: Abstraction has 607 states and 700 transitions. [2018-10-04 12:42:07,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:42:07,904 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 700 transitions. [2018-10-04 12:42:07,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-04 12:42:07,906 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:07,907 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:42:07,907 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:42:07,907 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:07,907 INFO L82 PathProgramCache]: Analyzing trace with hash 707364856, now seen corresponding path program 1 times [2018-10-04 12:42:07,907 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:07,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:07,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:07,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:07,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:08,189 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:42:08,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:08,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:42:08,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:42:08,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:42:08,191 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:08,191 INFO L87 Difference]: Start difference. First operand 607 states and 700 transitions. Second operand 5 states. [2018-10-04 12:42:08,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:08,366 INFO L93 Difference]: Finished difference Result 930 states and 1072 transitions. [2018-10-04 12:42:08,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:42:08,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2018-10-04 12:42:08,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:08,368 INFO L225 Difference]: With dead ends: 930 [2018-10-04 12:42:08,368 INFO L226 Difference]: Without dead ends: 336 [2018-10-04 12:42:08,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 3 [2018-10-04 12:42:08,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-10-04 12:42:08,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 335. [2018-10-04 12:42:08,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-10-04 12:42:08,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 382 transitions. [2018-10-04 12:42:08,385 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 382 transitions. Word has length 108 [2018-10-04 12:42:08,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:08,385 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 382 transitions. [2018-10-04 12:42:08,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:42:08,385 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 382 transitions. [2018-10-04 12:42:08,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-04 12:42:08,387 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:08,387 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:42:08,387 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:42:08,387 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:08,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1140799292, now seen corresponding path program 1 times [2018-10-04 12:42:08,390 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:08,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:08,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:08,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:08,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:08,487 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:42:08,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:08,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:42:08,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:42:08,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:42:08,488 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:08,488 INFO L87 Difference]: Start difference. First operand 335 states and 382 transitions. Second operand 3 states. [2018-10-04 12:42:08,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:08,556 INFO L93 Difference]: Finished difference Result 663 states and 757 transitions. [2018-10-04 12:42:08,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:42:08,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-10-04 12:42:08,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:08,558 INFO L225 Difference]: With dead ends: 663 [2018-10-04 12:42:08,558 INFO L226 Difference]: Without dead ends: 335 [2018-10-04 12:42:08,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:42:08,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-10-04 12:42:08,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 331. [2018-10-04 12:42:08,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-10-04 12:42:08,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 373 transitions. [2018-10-04 12:42:08,573 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 373 transitions. Word has length 116 [2018-10-04 12:42:08,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:08,573 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 373 transitions. [2018-10-04 12:42:08,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:42:08,574 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 373 transitions. [2018-10-04 12:42:08,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-04 12:42:08,575 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:08,575 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:42:08,576 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:42:08,576 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:08,576 INFO L82 PathProgramCache]: Analyzing trace with hash 166395550, now seen corresponding path program 2 times [2018-10-04 12:42:08,576 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:08,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:08,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:08,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:08,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:09,565 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:42:09,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:09,566 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:42:09,573 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:42:09,611 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:42:09,611 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:42:09,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:10,549 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:42:10,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:10,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-10-04 12:42:10,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 12:42:10,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 12:42:10,570 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:10,570 INFO L87 Difference]: Start difference. First operand 331 states and 373 transitions. Second operand 18 states. [2018-10-04 12:42:11,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:11,918 INFO L93 Difference]: Finished difference Result 1064 states and 1203 transitions. [2018-10-04 12:42:11,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:42:11,921 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 121 [2018-10-04 12:42:11,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:11,925 INFO L225 Difference]: With dead ends: 1064 [2018-10-04 12:42:11,925 INFO L226 Difference]: Without dead ends: 1063 [2018-10-04 12:42:11,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 112 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 0.7s impTime 18 [2018-10-04 12:42:11,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2018-10-04 12:42:11,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 419. [2018-10-04 12:42:11,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-10-04 12:42:11,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 471 transitions. [2018-10-04 12:42:11,949 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 471 transitions. Word has length 121 [2018-10-04 12:42:11,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:11,949 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 471 transitions. [2018-10-04 12:42:11,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 12:42:11,949 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 471 transitions. [2018-10-04 12:42:11,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-04 12:42:11,950 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:11,950 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:42:11,951 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:42:11,951 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:11,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1620918566, now seen corresponding path program 1 times [2018-10-04 12:42:11,951 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:11,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:11,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:11,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:11,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:12,313 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:42:12,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:12,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:42:12,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:42:12,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:42:12,316 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:12,316 INFO L87 Difference]: Start difference. First operand 419 states and 471 transitions. Second operand 5 states. [2018-10-04 12:42:12,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:12,484 INFO L93 Difference]: Finished difference Result 673 states and 755 transitions. [2018-10-04 12:42:12,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:42:12,485 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2018-10-04 12:42:12,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:12,487 INFO L225 Difference]: With dead ends: 673 [2018-10-04 12:42:12,487 INFO L226 Difference]: Without dead ends: 468 [2018-10-04 12:42:12,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 4 [2018-10-04 12:42:12,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-10-04 12:42:12,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 412. [2018-10-04 12:42:12,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-10-04 12:42:12,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 463 transitions. [2018-10-04 12:42:12,503 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 463 transitions. Word has length 122 [2018-10-04 12:42:12,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:12,504 INFO L480 AbstractCegarLoop]: Abstraction has 412 states and 463 transitions. [2018-10-04 12:42:12,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:42:12,504 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 463 transitions. [2018-10-04 12:42:12,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-04 12:42:12,505 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:12,505 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:42:12,506 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:42:12,506 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:12,506 INFO L82 PathProgramCache]: Analyzing trace with hash -768532907, now seen corresponding path program 1 times [2018-10-04 12:42:12,506 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:12,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:12,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:12,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:12,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:12,696 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:42:12,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:12,696 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:42:12,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:12,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:13,201 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:42:13,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:13,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-10-04 12:42:13,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:42:13,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:42:13,223 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:13,223 INFO L87 Difference]: Start difference. First operand 412 states and 463 transitions. Second operand 10 states. [2018-10-04 12:42:13,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:13,508 INFO L93 Difference]: Finished difference Result 845 states and 948 transitions. [2018-10-04 12:42:13,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:42:13,508 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2018-10-04 12:42:13,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:13,511 INFO L225 Difference]: With dead ends: 845 [2018-10-04 12:42:13,511 INFO L226 Difference]: Without dead ends: 844 [2018-10-04 12:42:13,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.1s impTime 9 [2018-10-04 12:42:13,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2018-10-04 12:42:13,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 570. [2018-10-04 12:42:13,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-10-04 12:42:13,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 638 transitions. [2018-10-04 12:42:13,543 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 638 transitions. Word has length 123 [2018-10-04 12:42:13,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:13,544 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 638 transitions. [2018-10-04 12:42:13,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:42:13,544 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 638 transitions. [2018-10-04 12:42:13,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-04 12:42:13,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:13,546 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:42:13,546 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:42:13,546 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:13,547 INFO L82 PathProgramCache]: Analyzing trace with hash 242817106, now seen corresponding path program 3 times [2018-10-04 12:42:13,547 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:13,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:13,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:13,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:13,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:13,642 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:42:13,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:13,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:42:13,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:42:13,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:42:13,643 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:13,643 INFO L87 Difference]: Start difference. First operand 570 states and 638 transitions. Second operand 3 states. [2018-10-04 12:42:13,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:13,730 INFO L93 Difference]: Finished difference Result 1086 states and 1213 transitions. [2018-10-04 12:42:13,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:42:13,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2018-10-04 12:42:13,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:13,732 INFO L225 Difference]: With dead ends: 1086 [2018-10-04 12:42:13,732 INFO L226 Difference]: Without dead ends: 479 [2018-10-04 12:42:13,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:42:13,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-10-04 12:42:13,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 382. [2018-10-04 12:42:13,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-04 12:42:13,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 413 transitions. [2018-10-04 12:42:13,759 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 413 transitions. Word has length 159 [2018-10-04 12:42:13,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:13,759 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 413 transitions. [2018-10-04 12:42:13,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:42:13,760 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 413 transitions. [2018-10-04 12:42:13,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-04 12:42:13,761 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:13,761 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:42:13,761 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-04 12:42:13,761 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:13,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1109443822, now seen corresponding path program 1 times [2018-10-04 12:42:13,762 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:13,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:13,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:13,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:42:13,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:14,386 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:42:14,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:14,386 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:42:14,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:14,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:15,251 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:42:15,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:15,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 20 [2018-10-04 12:42:15,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 12:42:15,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 12:42:15,272 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:15,272 INFO L87 Difference]: Start difference. First operand 382 states and 413 transitions. Second operand 21 states. [2018-10-04 12:42:16,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:16,927 INFO L93 Difference]: Finished difference Result 970 states and 1050 transitions. [2018-10-04 12:42:16,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 12:42:16,928 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 159 [2018-10-04 12:42:16,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:16,928 INFO L225 Difference]: With dead ends: 970 [2018-10-04 12:42:16,928 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:42:16,929 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 165 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 0.9s impTime 19 [2018-10-04 12:42:16,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:42:16,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:42:16,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:42:16,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:42:16,930 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 159 [2018-10-04 12:42:16,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:16,930 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:42:16,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 12:42:16,930 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:42:16,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:42:16,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:42:17,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:17,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:17,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:42:19,413 WARN L178 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 666 DAG size of output: 594 [2018-10-04 12:42:27,235 WARN L178 SmtUtils]: Spent 7.81 s on a formula simplification. DAG size of input: 571 DAG size of output: 162 [2018-10-04 12:42:27,240 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 161) no Hoare annotation was computed. [2018-10-04 12:42:27,240 INFO L425 ceAbstractionStarter]: For program point L127(lines 127 138) no Hoare annotation was computed. [2018-10-04 12:42:27,240 INFO L425 ceAbstractionStarter]: For program point L70-1(lines 70 96) no Hoare annotation was computed. [2018-10-04 12:42:27,241 INFO L425 ceAbstractionStarter]: For program point L153(lines 153 161) no Hoare annotation was computed. [2018-10-04 12:42:27,241 INFO L425 ceAbstractionStarter]: For program point L87(lines 87 96) no Hoare annotation was computed. [2018-10-04 12:42:27,241 INFO L425 ceAbstractionStarter]: For program point L112(lines 112 120) no Hoare annotation was computed. [2018-10-04 12:42:27,241 INFO L425 ceAbstractionStarter]: For program point L79(lines 79 96) no Hoare annotation was computed. [2018-10-04 12:42:27,241 INFO L425 ceAbstractionStarter]: For program point ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT(lines 48 55) no Hoare annotation was computed. [2018-10-04 12:42:27,241 INFO L425 ceAbstractionStarter]: For program point L146(lines 146 161) no Hoare annotation was computed. [2018-10-04 12:42:27,241 INFO L425 ceAbstractionStarter]: For program point L47-1(lines 13 164) no Hoare annotation was computed. [2018-10-04 12:42:27,241 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 138) no Hoare annotation was computed. [2018-10-04 12:42:27,241 INFO L425 ceAbstractionStarter]: For program point L89(lines 89 96) no Hoare annotation was computed. [2018-10-04 12:42:27,241 INFO L425 ceAbstractionStarter]: For program point L156(lines 156 161) no Hoare annotation was computed. [2018-10-04 12:42:27,242 INFO L421 ceAbstractionStarter]: At program point L156-2(lines 47 162) the Hoare annotation is: (let ((.cse44 (+ Elevator_dir Elevator_goal))) (let ((.cse34 (<= Elevator_min Elevator_current)) (.cse35 (<= Elevator_current Elevator_max)) (.cse27 (<= .cse44 (+ Elevator_max 1))) (.cse32 (+ Elevator_dir Elevator_current)) (.cse47 (+ Elevator_dir 1)) (.cse48 (= Elevator_current Elevator_goal))) (let ((.cse45 (= Elevator_dir 1)) (.cse4 (not Elevator_stop)) (.cse21 (not .cse48)) (.cse6 (= Elevator_qDC2 2)) (.cse17 (<= Elevator_qDC1 1)) (.cse22 (not Elevator_passed)) (.cse46 (= .cse47 0)) (.cse40 (<= (+ Elevator_min 2) .cse32)) (.cse42 (<= (+ Elevator_current Elevator_min) (+ Elevator_dir (* 2 Elevator_goal) 2))) (.cse9 (not (= Elevator_goal Elevator_current))) (.cse43 (<= Elevator_current (+ Elevator_dir Elevator_min))) (.cse33 (and (<= .cse32 Elevator_goal) .cse27)) (.cse5 (= Elevator_qDC1 2)) (.cse7 (and .cse34 .cse35)) (.cse41 (<= Elevator_goal Elevator_current)) (.cse29 (= Elevator_qCSP 1)) (.cse37 (= Elevator_qCSP 3))) (let ((.cse30 (= Elevator_qDC2 1)) (.cse15 (not .cse37)) (.cse18 (not .cse29)) (.cse19 (or .cse41 (<= Elevator_dir 1))) (.cse16 (= Elevator_min Elevator_current)) (.cse31 (and .cse5 .cse7 .cse29)) (.cse14 (not (= Elevator_min Elevator_goal))) (.cse20 (or (<= .cse47 0) .cse48 .cse33)) (.cse12 (or .cse40 (and .cse41 (and .cse42 .cse9)) .cse43)) (.cse0 (or (<= Elevator_current Elevator_goal) .cse46)) (.cse38 (and .cse4 (and .cse21 .cse6 .cse7 .cse17 .cse22))) (.cse11 (or .cse41 .cse45)) (.cse23 (or (<= Elevator_current .cse44) .cse46)) (.cse24 (or (and (<= (+ Elevator_current 1) Elevator_max) .cse34) (and .cse35 (<= (+ Elevator_min 1) Elevator_current)))) (.cse25 (not (= .cse44 Elevator_current))) (.cse26 (or (<= .cse44 Elevator_current) .cse45)) (.cse3 (<= Elevator_c2 2)) (.cse8 (not Elevator_newgoal)) (.cse10 (<= Elevator_c2 Elevator_c3)) (.cse36 (= Elevator_qDC2 3)) (.cse1 (<= Elevator_goal Elevator_max)) (.cse2 (<= Elevator_min Elevator_goal)) (.cse28 (or .cse40 (and .cse41 (or .cse42 (< Elevator_current (+ Elevator_goal 1)))) .cse43)) (.cse13 (not Elevator_start))) (or (and .cse0 .cse1 .cse2 (and .cse3 (and (and .cse4 (and .cse5 .cse6 .cse7)) .cse8) .cse9 .cse10) .cse11 .cse12 .cse13) (and (and .cse4 .cse10 (and .cse6 (and .cse14 (and .cse15 .cse16 .cse17)) .cse1) .cse18) .cse19 .cse20 .cse12 .cse13) (and (and .cse10 (and (and .cse4 (and .cse21 .cse15 .cse6 .cse7 .cse17 .cse22)) .cse18)) .cse1 .cse2 .cse13) (and .cse23 .cse24 .cse25 .cse2 .cse26 .cse27 .cse28 (and .cse10 (and (and .cse29 .cse17 .cse22) .cse30 .cse8)) .cse13) (and .cse23 .cse24 .cse25 .cse26 (and .cse3 .cse10 .cse1 .cse2 (and .cse31 .cse30 .cse8)) .cse28 .cse13) (and (and (and .cse30 (and .cse10 (and .cse16 .cse17 .cse29))) .cse1) .cse19 (<= Elevator_min .cse32) (or .cse9 (<= (+ Elevator_dir Elevator_current 1) Elevator_max)) .cse33) (and .cse3 .cse34 .cse35 .cse10 (and .cse4 .cse21 .cse5 .cse15 .cse6 .cse18) .cse1 .cse2 .cse13) (and .cse19 (and (and .cse4 .cse10 (and .cse6 (and .cse14 .cse16 .cse17 .cse29)) .cse8) .cse1 .cse2) .cse12 .cse13) (and .cse10 (and .cse4 .cse31 .cse36) .cse22) (and .cse0 (and (and .cse3 (and (and .cse4 (and .cse21 .cse5 .cse6 .cse7)) .cse8 .cse37)) .cse1 .cse2) .cse11) (and .cse4 .cse10 .cse5 (and .cse21 .cse7) .cse36 .cse22) (and (and .cse14 .cse8 .cse17 .cse4 .cse10 (= Elevator_current Elevator_min) .cse6 .cse37) .cse11 .cse20 .cse12) (and .cse0 (and .cse10 (and .cse38 .cse8) .cse1 .cse2) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 (and .cse38 .cse8 .cse37) .cse11) (and .cse23 .cse24 .cse25 .cse26 (and (and .cse3 (and .cse8 (let ((.cse39 (and .cse4 (and .cse5 .cse7) .cse36))) (or (and (<= 0 Elevator_c3) .cse39 (<= Elevator_c2 0)) (and .cse10 .cse39 .cse22))) .cse37)) .cse1 .cse2) .cse28 .cse13)))))) [2018-10-04 12:42:27,242 INFO L425 ceAbstractionStarter]: For program point L115(lines 115 120) no Hoare annotation was computed. [2018-10-04 12:42:27,243 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 96) no Hoare annotation was computed. [2018-10-04 12:42:27,243 INFO L425 ceAbstractionStarter]: For program point L115-2(lines 99 138) no Hoare annotation was computed. [2018-10-04 12:42:27,243 INFO L425 ceAbstractionStarter]: For program point L107(lines 107 120) no Hoare annotation was computed. [2018-10-04 12:42:27,243 INFO L425 ceAbstractionStarter]: For program point ElevatorEXIT(lines 13 164) no Hoare annotation was computed. [2018-10-04 12:42:27,243 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 96) no Hoare annotation was computed. [2018-10-04 12:42:27,243 INFO L425 ceAbstractionStarter]: For program point L91-2(lines 77 120) no Hoare annotation was computed. [2018-10-04 12:42:27,243 INFO L425 ceAbstractionStarter]: For program point L149(lines 149 161) no Hoare annotation was computed. [2018-10-04 12:42:27,243 INFO L425 ceAbstractionStarter]: For program point L133(lines 133 138) no Hoare annotation was computed. [2018-10-04 12:42:27,243 INFO L425 ceAbstractionStarter]: For program point L67(lines 67 69) no Hoare annotation was computed. [2018-10-04 12:42:27,243 INFO L425 ceAbstractionStarter]: For program point L133-2(lines 123 161) no Hoare annotation was computed. [2018-10-04 12:42:27,243 INFO L425 ceAbstractionStarter]: For program point L67-2(lines 67 72) no Hoare annotation was computed. [2018-10-04 12:42:27,244 INFO L425 ceAbstractionStarter]: For program point ElevatorENTRY(lines 13 164) no Hoare annotation was computed. [2018-10-04 12:42:27,244 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 96) no Hoare annotation was computed. [2018-10-04 12:42:27,244 INFO L425 ceAbstractionStarter]: For program point L101(lines 101 120) no Hoare annotation was computed. [2018-10-04 12:42:27,268 INFO L202 PluginConnector]: Adding new model ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:42:27 BoogieIcfgContainer [2018-10-04 12:42:27,268 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:42:27,269 INFO L168 Benchmark]: Toolchain (without parser) took 35133.59 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 399.0 MB). Free memory was 1.4 GB in the beginning and 981.9 MB in the end (delta: 461.7 MB). Peak memory consumption was 861.6 MB. Max. memory is 7.1 GB. [2018-10-04 12:42:27,270 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 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:42:27,271 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.23 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:42:27,272 INFO L168 Benchmark]: Boogie Preprocessor took 28.64 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:42:27,272 INFO L168 Benchmark]: RCFGBuilder took 845.76 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:42:27,273 INFO L168 Benchmark]: TraceAbstraction took 34211.75 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 399.0 MB). Free memory was 1.4 GB in the beginning and 981.9 MB in the end (delta: 430.0 MB). Peak memory consumption was 829.9 MB. Max. memory is 7.1 GB. [2018-10-04 12:42:27,278 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.23 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 28.64 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 845.76 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 34211.75 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 399.0 MB). Free memory was 1.4 GB in the beginning and 981.9 MB in the end (delta: 430.0 MB). Peak memory consumption was 829.9 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: ((((((((((((((((((((current <= goal || dir + 1 == 0) && goal <= max) && min <= goal) && ((c2 <= 2 && (!stop && (qDC1 == 2 && qDC2 == 2) && min <= current && current <= max) && !newgoal) && !(goal == current)) && c2 <= c3) && (goal <= current || dir == 1)) && ((min + 2 <= dir + current || (goal <= current && current + min <= dir + 2 * goal + 2 && !(goal == current))) || current <= dir + min)) && !start) || (((((((!stop && c2 <= c3) && (qDC2 == 2 && !(min == goal) && (!(qCSP == 3) && min == current) && qDC1 <= 1) && goal <= max) && !(qCSP == 1)) && (goal <= current || dir <= 1)) && ((dir + 1 <= 0 || current == goal) || (dir + current <= goal && dir + goal <= max + 1))) && ((min + 2 <= dir + current || (goal <= current && current + min <= dir + 2 * goal + 2 && !(goal == current))) || current <= dir + min)) && !start)) || ((((c2 <= c3 && (!stop && ((((!(current == goal) && !(qCSP == 3)) && qDC2 == 2) && min <= current && current <= max) && qDC1 <= 1) && !passed) && !(qCSP == 1)) && goal <= max) && min <= goal) && !start)) || (((((((((current <= dir + goal || dir + 1 == 0) && ((current + 1 <= max && min <= current) || (current <= max && min + 1 <= current))) && !(dir + goal == current)) && min <= goal) && (dir + goal <= current || dir == 1)) && dir + goal <= max + 1) && ((min + 2 <= dir + current || (goal <= current && (current + min <= dir + 2 * goal + 2 || current < goal + 1))) || current <= dir + min)) && c2 <= c3 && (((qCSP == 1 && qDC1 <= 1) && !passed) && qDC2 == 1) && !newgoal) && !start)) || (((((((current <= dir + goal || dir + 1 == 0) && ((current + 1 <= max && min <= current) || (current <= max && min + 1 <= current))) && !(dir + goal == current)) && (dir + goal <= current || dir == 1)) && (((c2 <= 2 && c2 <= c3) && goal <= max) && min <= goal) && (((qDC1 == 2 && min <= current && current <= max) && qCSP == 1) && qDC2 == 1) && !newgoal) && ((min + 2 <= dir + current || (goal <= current && (current + min <= dir + 2 * goal + 2 || current < goal + 1))) || current <= dir + min)) && !start)) || ((((((qDC2 == 1 && c2 <= c3 && (min == current && qDC1 <= 1) && qCSP == 1) && goal <= max) && (goal <= current || dir <= 1)) && min <= dir + current) && (!(goal == current) || dir + current + 1 <= max)) && dir + current <= goal && dir + goal <= max + 1)) || (((((((c2 <= 2 && min <= current) && current <= max) && c2 <= c3) && ((((!stop && !(current == goal)) && qDC1 == 2) && !(qCSP == 3)) && qDC2 == 2) && !(qCSP == 1)) && goal <= max) && min <= goal) && !start)) || ((((goal <= current || dir <= 1) && ((((!stop && c2 <= c3) && qDC2 == 2 && ((!(min == goal) && min == current) && qDC1 <= 1) && qCSP == 1) && !newgoal) && goal <= max) && min <= goal) && ((min + 2 <= dir + current || (goal <= current && current + min <= dir + 2 * goal + 2 && !(goal == current))) || current <= dir + min)) && !start)) || ((c2 <= c3 && (!stop && (qDC1 == 2 && min <= current && current <= max) && qCSP == 1) && qDC2 == 3) && !passed)) || (((current <= goal || dir + 1 == 0) && ((c2 <= 2 && ((!stop && ((!(current == goal) && qDC1 == 2) && qDC2 == 2) && min <= current && current <= max) && !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)) || ((((((((((!(min == goal) && !newgoal) && qDC1 <= 1) && !stop) && c2 <= c3) && current == min) && qDC2 == 2) && qCSP == 3) && (goal <= current || dir == 1)) && ((dir + 1 <= 0 || current == goal) || (dir + current <= goal && dir + goal <= max + 1))) && ((min + 2 <= dir + current || (goal <= current && current + min <= dir + 2 * goal + 2 && !(goal == current))) || current <= dir + min))) || (((((current <= goal || dir + 1 == 0) && ((c2 <= c3 && (!stop && (((!(current == goal) && qDC2 == 2) && min <= current && current <= max) && qDC1 <= 1) && !passed) && !newgoal) && goal <= max) && min <= goal) && (goal <= current || dir == 1)) && ((min + 2 <= dir + current || (goal <= current && current + min <= dir + 2 * goal + 2 && !(goal == current))) || current <= dir + min)) && !start)) || (((((current <= goal || dir + 1 == 0) && goal <= max) && min <= goal) && ((!stop && (((!(current == goal) && qDC2 == 2) && min <= current && current <= max) && qDC1 <= 1) && !passed) && !newgoal) && qCSP == 3) && (goal <= current || dir == 1))) || (((((((current <= dir + goal || dir + 1 == 0) && ((current + 1 <= max && min <= current) || (current <= max && min + 1 <= current))) && !(dir + goal == current)) && (dir + goal <= current || dir == 1)) && ((c2 <= 2 && (!newgoal && (((0 <= c3 && (!stop && qDC1 == 2 && min <= current && current <= max) && qDC2 == 3) && c2 <= 0) || ((c2 <= c3 && (!stop && qDC1 == 2 && min <= current && current <= max) && qDC2 == 3) && !passed))) && qCSP == 3) && goal <= max) && min <= goal) && ((min + 2 <= dir + current || (goal <= current && (current + min <= dir + 2 * goal + 2 || current < goal + 1))) || current <= dir + min)) && !start) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. SAFE Result, 34.1s OverallTime, 26 OverallIterations, 9 TraceHistogramMax, 10.5s AutomataDifference, 0.0s DeadEndRemovalTime, 10.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1795 SDtfs, 4320 SDslu, 4596 SDs, 0 SdLazy, 2474 SolverSat, 345 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 904 GetRequests, 745 SyntacticMatches, 14 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.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.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 4209 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 55 NumberOfFragments, 1109 HoareAnnotationTreeSize, 1 FomulaSimplifications, 363350 FormulaSimplificationTreeSizeReduction, 2.4s HoareSimplificationTime, 1 FomulaSimplificationsInter, 342019 FormulaSimplificationTreeSizeReductionInter, 7.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 2744 NumberOfCodeBlocks, 2744 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2711 ConstructedInterpolants, 0 QuantifiedInterpolants, 4736705 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_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-42-27-296.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/ElevatorWithAssignments.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-42-27-296.csv Received shutdown request...