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-1cc990c [2018-10-01 00:24:34,678 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:24:34,681 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:24:34,692 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:24:34,693 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:24:34,694 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:24:34,695 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:24:34,697 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:24:34,699 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:24:34,700 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:24:34,701 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:24:34,701 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:24:34,702 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:24:34,703 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:24:34,704 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:24:34,705 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:24:34,706 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:24:34,708 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:24:34,710 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:24:34,711 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:24:34,713 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:24:34,714 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:24:34,716 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:24:34,717 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:24:34,717 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:24:34,718 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:24:34,719 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:24:34,720 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:24:34,721 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:24:34,722 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:24:34,722 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:24:34,723 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:24:34,723 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:24:34,723 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:24:34,724 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:24:34,725 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:24:34,725 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-01 00:24:34,741 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:24:34,741 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:24:34,742 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:24:34,742 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:24:34,743 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:24:34,743 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:24:34,743 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:24:34,743 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:24:34,744 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:24:34,744 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:24:34,744 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:24:34,747 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:24:34,748 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:24:34,748 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:24:34,748 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:24:34,748 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:24:34,748 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:24:34,749 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:24:34,750 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:24:34,750 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:24:34,751 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:24:34,751 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:24:34,751 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:24:34,751 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:24:34,751 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:24:34,752 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:24:34,752 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:24:34,752 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:24:34,752 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:24:34,752 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:24:34,752 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:24:34,807 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:24:34,822 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:24:34,831 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:24:34,833 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:24:34,833 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:24:34,834 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-01 00:24:34,835 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/ElevatorWithAssignments.bpl' [2018-10-01 00:24:34,911 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:24:34,916 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:24:34,917 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:24:34,917 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:24:34,917 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:24:34,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:34" (1/1) ... [2018-10-01 00:24:34,959 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:34" (1/1) ... [2018-10-01 00:24:34,976 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-01 00:24:34,976 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-01 00:24:34,977 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-01 00:24:34,979 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:24:34,980 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:24:34,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:24:34,981 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:24:34,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:34" (1/1) ... [2018-10-01 00:24:34,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:34" (1/1) ... [2018-10-01 00:24:34,997 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:34" (1/1) ... [2018-10-01 00:24:34,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:34" (1/1) ... [2018-10-01 00:24:35,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:34" (1/1) ... [2018-10-01 00:24:35,021 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:34" (1/1) ... [2018-10-01 00:24:35,023 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:34" (1/1) ... [2018-10-01 00:24:35,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:24:35,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:24:35,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:24:35,035 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:24:35,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:34" (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-01 00:24:35,116 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Elevator given in one single declaration [2018-10-01 00:24:35,116 INFO L130 BoogieDeclarations]: Found specification of procedure Elevator [2018-10-01 00:24:35,116 INFO L138 BoogieDeclarations]: Found implementation of procedure Elevator [2018-10-01 00:24:35,758 INFO L345 CfgBuilder]: Using library mode [2018-10-01 00:24:35,759 INFO L202 PluginConnector]: Adding new model ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:24:35 BoogieIcfgContainer [2018-10-01 00:24:35,760 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:24:35,761 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:24:35,761 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:24:35,764 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:24:35,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:34" (1/2) ... [2018-10-01 00:24:35,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae72126 and model type ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:24:35, skipping insertion in model container [2018-10-01 00:24:35,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:24:35" (2/2) ... [2018-10-01 00:24:35,768 INFO L112 eAbstractionObserver]: Analyzing ICFG ElevatorWithAssignments.bpl [2018-10-01 00:24:35,778 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:24:35,786 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 00:24:35,833 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:24:35,834 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:24:35,834 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:24:35,834 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:24:35,834 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:24:35,835 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:24:35,835 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:24:35,835 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:24:35,835 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:24:35,851 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-10-01 00:24:35,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-10-01 00:24:35,857 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:35,858 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-10-01 00:24:35,859 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-01 00:24:35,865 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:35,866 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-10-01 00:24:35,868 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:35,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:35,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:35,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:35,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:35,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:36,095 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-01 00:24:36,098 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:36,098 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-01 00:24:36,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:24:36,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:24:36,120 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:36,122 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2018-10-01 00:24:36,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:36,686 INFO L93 Difference]: Finished difference Result 84 states and 157 transitions. [2018-10-01 00:24:36,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:24:36,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-10-01 00:24:36,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:36,710 INFO L225 Difference]: With dead ends: 84 [2018-10-01 00:24:36,710 INFO L226 Difference]: Without dead ends: 54 [2018-10-01 00:24:36,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:24:36,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-01 00:24:36,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-10-01 00:24:36,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-01 00:24:36,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 93 transitions. [2018-10-01 00:24:36,756 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 93 transitions. Word has length 2 [2018-10-01 00:24:36,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:36,757 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 93 transitions. [2018-10-01 00:24:36,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:24:36,757 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 93 transitions. [2018-10-01 00:24:36,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-01 00:24:36,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:36,759 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:24:36,759 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-01 00:24:36,760 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:36,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1770004619, now seen corresponding path program 1 times [2018-10-01 00:24:36,760 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:36,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:36,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:36,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:36,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:36,807 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-01 00:24:36,808 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:36,808 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:24:36,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:24:36,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:24:36,810 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:36,811 INFO L87 Difference]: Start difference. First operand 53 states and 93 transitions. Second operand 3 states. [2018-10-01 00:24:37,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:37,065 INFO L93 Difference]: Finished difference Result 157 states and 277 transitions. [2018-10-01 00:24:37,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:24:37,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-01 00:24:37,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:37,071 INFO L225 Difference]: With dead ends: 157 [2018-10-01 00:24:37,071 INFO L226 Difference]: Without dead ends: 101 [2018-10-01 00:24:37,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:24:37,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-01 00:24:37,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-10-01 00:24:37,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-01 00:24:37,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 175 transitions. [2018-10-01 00:24:37,088 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 175 transitions. Word has length 14 [2018-10-01 00:24:37,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:37,089 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 175 transitions. [2018-10-01 00:24:37,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:24:37,089 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 175 transitions. [2018-10-01 00:24:37,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-01 00:24:37,090 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:37,091 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:24:37,091 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-01 00:24:37,091 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:37,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1068940041, now seen corresponding path program 1 times [2018-10-01 00:24:37,092 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:37,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:37,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:37,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:37,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:37,156 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-01 00:24:37,157 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:37,157 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:24:37,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:24:37,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:24:37,158 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:37,158 INFO L87 Difference]: Start difference. First operand 100 states and 175 transitions. Second operand 3 states. [2018-10-01 00:24:37,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:37,798 INFO L93 Difference]: Finished difference Result 205 states and 356 transitions. [2018-10-01 00:24:37,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:24:37,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-01 00:24:37,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:37,802 INFO L225 Difference]: With dead ends: 205 [2018-10-01 00:24:37,803 INFO L226 Difference]: Without dead ends: 104 [2018-10-01 00:24:37,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:24:37,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-01 00:24:37,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 89. [2018-10-01 00:24:37,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-01 00:24:37,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 152 transitions. [2018-10-01 00:24:37,830 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 152 transitions. Word has length 14 [2018-10-01 00:24:37,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:37,831 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 152 transitions. [2018-10-01 00:24:37,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:24:37,831 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 152 transitions. [2018-10-01 00:24:37,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-01 00:24:37,832 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:37,832 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-01 00:24:37,835 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-01 00:24:37,836 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:37,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1940946465, now seen corresponding path program 1 times [2018-10-01 00:24:37,836 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:37,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:37,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:37,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:37,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:37,943 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-01 00:24:37,944 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:37,944 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:24:37,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:24:37,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:24:37,945 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:37,945 INFO L87 Difference]: Start difference. First operand 89 states and 152 transitions. Second operand 5 states. [2018-10-01 00:24:38,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:38,449 INFO L93 Difference]: Finished difference Result 321 states and 545 transitions. [2018-10-01 00:24:38,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:24:38,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-10-01 00:24:38,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:38,456 INFO L225 Difference]: With dead ends: 321 [2018-10-01 00:24:38,456 INFO L226 Difference]: Without dead ends: 209 [2018-10-01 00:24:38,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:24:38,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-01 00:24:38,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2018-10-01 00:24:38,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-01 00:24:38,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 346 transitions. [2018-10-01 00:24:38,486 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 346 transitions. Word has length 19 [2018-10-01 00:24:38,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:38,486 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 346 transitions. [2018-10-01 00:24:38,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:24:38,487 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 346 transitions. [2018-10-01 00:24:38,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-01 00:24:38,488 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:38,489 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-01 00:24:38,489 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-01 00:24:38,489 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:38,490 INFO L82 PathProgramCache]: Analyzing trace with hash 2002343284, now seen corresponding path program 1 times [2018-10-01 00:24:38,490 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:38,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:38,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:38,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:38,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:38,566 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-01 00:24:38,566 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:38,567 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:24:38,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:24:38,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:24:38,568 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:38,568 INFO L87 Difference]: Start difference. First operand 207 states and 346 transitions. Second operand 3 states. [2018-10-01 00:24:38,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:38,771 INFO L93 Difference]: Finished difference Result 522 states and 865 transitions. [2018-10-01 00:24:38,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:24:38,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-01 00:24:38,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:38,775 INFO L225 Difference]: With dead ends: 522 [2018-10-01 00:24:38,775 INFO L226 Difference]: Without dead ends: 310 [2018-10-01 00:24:38,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:24:38,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-10-01 00:24:38,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 213. [2018-10-01 00:24:38,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-01 00:24:38,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 352 transitions. [2018-10-01 00:24:38,796 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 352 transitions. Word has length 41 [2018-10-01 00:24:38,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:38,796 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 352 transitions. [2018-10-01 00:24:38,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:24:38,797 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 352 transitions. [2018-10-01 00:24:38,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-01 00:24:38,798 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:38,799 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-01 00:24:38,799 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-01 00:24:38,799 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:38,799 INFO L82 PathProgramCache]: Analyzing trace with hash 2074119508, now seen corresponding path program 1 times [2018-10-01 00:24:38,800 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:38,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:38,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:38,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:38,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:38,845 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-01 00:24:38,845 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:38,845 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:24:38,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:24:38,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:24:38,847 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:38,847 INFO L87 Difference]: Start difference. First operand 213 states and 352 transitions. Second operand 3 states. [2018-10-01 00:24:39,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:39,443 INFO L93 Difference]: Finished difference Result 588 states and 972 transitions. [2018-10-01 00:24:39,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:24:39,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-10-01 00:24:39,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:39,448 INFO L225 Difference]: With dead ends: 588 [2018-10-01 00:24:39,448 INFO L226 Difference]: Without dead ends: 367 [2018-10-01 00:24:39,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:24:39,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-10-01 00:24:39,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 354. [2018-10-01 00:24:39,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-10-01 00:24:39,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 570 transitions. [2018-10-01 00:24:39,476 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 570 transitions. Word has length 42 [2018-10-01 00:24:39,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:39,476 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 570 transitions. [2018-10-01 00:24:39,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:24:39,476 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 570 transitions. [2018-10-01 00:24:39,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-01 00:24:39,478 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:39,478 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-01 00:24:39,479 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-01 00:24:39,479 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:39,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1430938278, now seen corresponding path program 1 times [2018-10-01 00:24:39,479 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:39,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:39,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:39,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:39,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:39,521 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-01 00:24:39,522 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:39,522 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:24:39,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:24:39,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:24:39,523 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:39,523 INFO L87 Difference]: Start difference. First operand 354 states and 570 transitions. Second operand 3 states. [2018-10-01 00:24:39,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:39,694 INFO L93 Difference]: Finished difference Result 880 states and 1399 transitions. [2018-10-01 00:24:39,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:24:39,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-01 00:24:39,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:39,706 INFO L225 Difference]: With dead ends: 880 [2018-10-01 00:24:39,706 INFO L226 Difference]: Without dead ends: 542 [2018-10-01 00:24:39,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:24:39,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-10-01 00:24:39,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 366. [2018-10-01 00:24:39,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-10-01 00:24:39,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 582 transitions. [2018-10-01 00:24:39,725 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 582 transitions. Word has length 44 [2018-10-01 00:24:39,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:39,725 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 582 transitions. [2018-10-01 00:24:39,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:24:39,725 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 582 transitions. [2018-10-01 00:24:39,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-01 00:24:39,727 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:39,727 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-01 00:24:39,728 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-01 00:24:39,728 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:39,728 INFO L82 PathProgramCache]: Analyzing trace with hash -138883553, now seen corresponding path program 1 times [2018-10-01 00:24:39,728 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:39,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:39,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:39,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:39,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:39,803 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-01 00:24:39,803 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:39,804 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:24:39,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:24:39,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:24:39,804 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:39,805 INFO L87 Difference]: Start difference. First operand 366 states and 582 transitions. Second operand 4 states. [2018-10-01 00:24:39,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:39,987 INFO L93 Difference]: Finished difference Result 1096 states and 1744 transitions. [2018-10-01 00:24:39,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:24:39,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-10-01 00:24:39,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:39,993 INFO L225 Difference]: With dead ends: 1096 [2018-10-01 00:24:39,993 INFO L226 Difference]: Without dead ends: 731 [2018-10-01 00:24:39,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:24:39,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-10-01 00:24:40,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 666. [2018-10-01 00:24:40,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2018-10-01 00:24:40,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1037 transitions. [2018-10-01 00:24:40,023 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1037 transitions. Word has length 46 [2018-10-01 00:24:40,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:40,023 INFO L480 AbstractCegarLoop]: Abstraction has 666 states and 1037 transitions. [2018-10-01 00:24:40,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:24:40,024 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1037 transitions. [2018-10-01 00:24:40,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-01 00:24:40,026 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:40,026 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-01 00:24:40,026 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-01 00:24:40,027 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:40,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1242691348, now seen corresponding path program 1 times [2018-10-01 00:24:40,027 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:40,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:40,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:40,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:40,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:40,597 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-01 00:24:40,597 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:24:40,597 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-01 00:24:40,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:40,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:24:41,579 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-01 00:24:41,626 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:24:41,626 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-10-01 00:24:41,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:24:41,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:24:41,627 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:41,628 INFO L87 Difference]: Start difference. First operand 666 states and 1037 transitions. Second operand 8 states. [2018-10-01 00:24:43,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:43,070 INFO L93 Difference]: Finished difference Result 1293 states and 2002 transitions. [2018-10-01 00:24:43,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-01 00:24:43,071 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-10-01 00:24:43,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:43,078 INFO L225 Difference]: With dead ends: 1293 [2018-10-01 00:24:43,078 INFO L226 Difference]: Without dead ends: 1292 [2018-10-01 00:24:43,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:24:43,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2018-10-01 00:24:43,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1176. [2018-10-01 00:24:43,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-10-01 00:24:43,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1825 transitions. [2018-10-01 00:24:43,136 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1825 transitions. Word has length 49 [2018-10-01 00:24:43,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:43,137 INFO L480 AbstractCegarLoop]: Abstraction has 1176 states and 1825 transitions. [2018-10-01 00:24:43,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:24:43,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1825 transitions. [2018-10-01 00:24:43,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-01 00:24:43,143 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:43,143 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-01 00:24:43,143 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-01 00:24:43,144 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:43,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1557173637, now seen corresponding path program 1 times [2018-10-01 00:24:43,144 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:43,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:43,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:43,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:43,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:43,355 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-01 00:24:43,356 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:43,356 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:24:43,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:24:43,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:24:43,357 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:43,357 INFO L87 Difference]: Start difference. First operand 1176 states and 1825 transitions. Second operand 4 states. [2018-10-01 00:24:43,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:43,882 INFO L93 Difference]: Finished difference Result 2655 states and 4085 transitions. [2018-10-01 00:24:43,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:24:43,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-10-01 00:24:43,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:43,891 INFO L225 Difference]: With dead ends: 2655 [2018-10-01 00:24:43,891 INFO L226 Difference]: Without dead ends: 1510 [2018-10-01 00:24:43,893 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:24:43,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-10-01 00:24:43,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1468. [2018-10-01 00:24:43,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1468 states. [2018-10-01 00:24:43,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 2236 transitions. [2018-10-01 00:24:43,949 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 2236 transitions. Word has length 67 [2018-10-01 00:24:43,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:43,949 INFO L480 AbstractCegarLoop]: Abstraction has 1468 states and 2236 transitions. [2018-10-01 00:24:43,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:24:43,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 2236 transitions. [2018-10-01 00:24:43,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-01 00:24:43,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:43,952 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-01 00:24:43,953 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-01 00:24:43,953 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:43,953 INFO L82 PathProgramCache]: Analyzing trace with hash -423460397, now seen corresponding path program 1 times [2018-10-01 00:24:43,955 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:43,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:43,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:43,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:43,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:44,081 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-01 00:24:44,083 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:44,084 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:24:44,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:24:44,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:24:44,084 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:44,085 INFO L87 Difference]: Start difference. First operand 1468 states and 2236 transitions. Second operand 4 states. [2018-10-01 00:24:44,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:44,266 INFO L93 Difference]: Finished difference Result 2726 states and 4172 transitions. [2018-10-01 00:24:44,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:24:44,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-10-01 00:24:44,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:44,281 INFO L225 Difference]: With dead ends: 2726 [2018-10-01 00:24:44,281 INFO L226 Difference]: Without dead ends: 1469 [2018-10-01 00:24:44,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:24:44,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2018-10-01 00:24:44,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1466. [2018-10-01 00:24:44,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1466 states. [2018-10-01 00:24:44,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 2172 transitions. [2018-10-01 00:24:44,332 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 2172 transitions. Word has length 68 [2018-10-01 00:24:44,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:44,333 INFO L480 AbstractCegarLoop]: Abstraction has 1466 states and 2172 transitions. [2018-10-01 00:24:44,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:24:44,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 2172 transitions. [2018-10-01 00:24:44,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-01 00:24:44,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:44,335 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-01 00:24:44,335 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-01 00:24:44,336 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:44,336 INFO L82 PathProgramCache]: Analyzing trace with hash -734626103, now seen corresponding path program 2 times [2018-10-01 00:24:44,336 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:44,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:44,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:44,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:44,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:44,451 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-01 00:24:44,451 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:44,451 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:24:44,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:24:44,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:24:44,452 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:44,452 INFO L87 Difference]: Start difference. First operand 1466 states and 2172 transitions. Second operand 3 states. [2018-10-01 00:24:45,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:45,073 INFO L93 Difference]: Finished difference Result 2942 states and 4353 transitions. [2018-10-01 00:24:45,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:24:45,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-10-01 00:24:45,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:45,084 INFO L225 Difference]: With dead ends: 2942 [2018-10-01 00:24:45,084 INFO L226 Difference]: Without dead ends: 1457 [2018-10-01 00:24:45,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:24:45,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2018-10-01 00:24:45,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1397. [2018-10-01 00:24:45,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1397 states. [2018-10-01 00:24:45,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 2012 transitions. [2018-10-01 00:24:45,128 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 2012 transitions. Word has length 69 [2018-10-01 00:24:45,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:45,128 INFO L480 AbstractCegarLoop]: Abstraction has 1397 states and 2012 transitions. [2018-10-01 00:24:45,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:24:45,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 2012 transitions. [2018-10-01 00:24:45,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-01 00:24:45,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:45,131 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-01 00:24:45,131 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-01 00:24:45,131 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:45,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1023158359, now seen corresponding path program 1 times [2018-10-01 00:24:45,132 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:45,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:45,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:45,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:24:45,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:45,216 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-01 00:24:45,216 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:45,217 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:24:45,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:24:45,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:24:45,217 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:45,217 INFO L87 Difference]: Start difference. First operand 1397 states and 2012 transitions. Second operand 3 states. [2018-10-01 00:24:45,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:45,325 INFO L93 Difference]: Finished difference Result 3297 states and 4763 transitions. [2018-10-01 00:24:45,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:24:45,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-10-01 00:24:45,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:45,335 INFO L225 Difference]: With dead ends: 3297 [2018-10-01 00:24:45,336 INFO L226 Difference]: Without dead ends: 1830 [2018-10-01 00:24:45,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:24:45,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2018-10-01 00:24:45,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1612. [2018-10-01 00:24:45,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1612 states. [2018-10-01 00:24:45,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2296 transitions. [2018-10-01 00:24:45,387 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2296 transitions. Word has length 84 [2018-10-01 00:24:45,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:45,387 INFO L480 AbstractCegarLoop]: Abstraction has 1612 states and 2296 transitions. [2018-10-01 00:24:45,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:24:45,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2296 transitions. [2018-10-01 00:24:45,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-01 00:24:45,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:45,390 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-01 00:24:45,391 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-10-01 00:24:45,391 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:45,391 INFO L82 PathProgramCache]: Analyzing trace with hash -147951611, now seen corresponding path program 1 times [2018-10-01 00:24:45,391 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:45,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:45,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:45,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:45,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:46,339 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-01 00:24:46,340 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:24:46,340 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-01 00:24:46,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:46,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:24:48,984 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-01 00:24:49,005 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:24:49,005 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2018-10-01 00:24:49,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:24:49,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:24:49,006 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:49,007 INFO L87 Difference]: Start difference. First operand 1612 states and 2296 transitions. Second operand 14 states. [2018-10-01 00:24:52,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:52,140 INFO L93 Difference]: Finished difference Result 3111 states and 4394 transitions. [2018-10-01 00:24:52,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-01 00:24:52,141 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 85 [2018-10-01 00:24:52,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:52,142 INFO L225 Difference]: With dead ends: 3111 [2018-10-01 00:24:52,142 INFO L226 Difference]: Without dead ends: 0 [2018-10-01 00:24:52,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s Time [2018-10-01 00:24:52,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-01 00:24:52,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-01 00:24:52,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-01 00:24:52,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-01 00:24:52,147 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2018-10-01 00:24:52,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:52,147 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-01 00:24:52,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:24:52,148 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-01 00:24:52,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-01 00:24:52,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-01 00:24:52,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:24:52,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:24:52,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:24:53,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:24:53,213 WARN L178 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 324 DAG size of output: 259 [2018-10-01 00:24:56,189 WARN L178 SmtUtils]: Spent 2.97 s on a formula simplification. DAG size of input: 251 DAG size of output: 35 [2018-10-01 00:24:56,193 INFO L426 ceAbstractionStarter]: For program point L143(lines 143 161) no Hoare annotation was computed. [2018-10-01 00:24:56,193 INFO L426 ceAbstractionStarter]: For program point L127(lines 127 138) no Hoare annotation was computed. [2018-10-01 00:24:56,193 INFO L426 ceAbstractionStarter]: For program point L70-1(lines 70 96) no Hoare annotation was computed. [2018-10-01 00:24:56,193 INFO L426 ceAbstractionStarter]: For program point ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT(lines 48 55) no Hoare annotation was computed. [2018-10-01 00:24:56,194 INFO L426 ceAbstractionStarter]: For program point L153(lines 153 161) no Hoare annotation was computed. [2018-10-01 00:24:56,194 INFO L426 ceAbstractionStarter]: For program point L87(lines 87 96) no Hoare annotation was computed. [2018-10-01 00:24:56,194 INFO L426 ceAbstractionStarter]: For program point L112(lines 112 120) no Hoare annotation was computed. [2018-10-01 00:24:56,194 INFO L426 ceAbstractionStarter]: For program point L79(lines 79 96) no Hoare annotation was computed. [2018-10-01 00:24:56,194 INFO L426 ceAbstractionStarter]: For program point L146(lines 146 161) no Hoare annotation was computed. [2018-10-01 00:24:56,194 INFO L426 ceAbstractionStarter]: For program point L47-1(lines 13 164) no Hoare annotation was computed. [2018-10-01 00:24:56,194 INFO L426 ceAbstractionStarter]: For program point L130(lines 130 138) no Hoare annotation was computed. [2018-10-01 00:24:56,194 INFO L426 ceAbstractionStarter]: For program point L89(lines 89 96) no Hoare annotation was computed. [2018-10-01 00:24:56,194 INFO L426 ceAbstractionStarter]: For program point L156(lines 156 161) no Hoare annotation was computed. [2018-10-01 00:24:56,194 INFO L422 ceAbstractionStarter]: At program point L156-2(lines 47 162) the Hoare annotation is: (let ((.cse5 (and (<= Elevator_min Elevator_current) (<= Elevator_current Elevator_max))) (.cse0 (not (= Elevator_min Elevator_goal))) (.cse1 (<= Elevator_min Elevator_goal)) (.cse2 (= Elevator_min Elevator_current)) (.cse3 (<= (+ Elevator_min 1) Elevator_max)) (.cse4 (<= Elevator_qDC1 1))) (or (and .cse0 .cse1 .cse2 (= Elevator_dir 1) .cse3 .cse4) (and (and .cse4 (not Elevator_passed)) .cse5) (and (= Elevator_qDC1 2) .cse5) (and (and (not (= Elevator_qCSP 3)) .cse2 .cse3 .cse4) .cse0 .cse1) (and .cse2 .cse3 .cse4 (= Elevator_qCSP 1)))) [2018-10-01 00:24:56,194 INFO L426 ceAbstractionStarter]: For program point L115(lines 115 120) no Hoare annotation was computed. [2018-10-01 00:24:56,195 INFO L426 ceAbstractionStarter]: For program point L82(lines 82 96) no Hoare annotation was computed. [2018-10-01 00:24:56,195 INFO L426 ceAbstractionStarter]: For program point L115-2(lines 99 138) no Hoare annotation was computed. [2018-10-01 00:24:56,195 INFO L426 ceAbstractionStarter]: For program point L107(lines 107 120) no Hoare annotation was computed. [2018-10-01 00:24:56,195 INFO L426 ceAbstractionStarter]: For program point ElevatorEXIT(lines 13 164) no Hoare annotation was computed. [2018-10-01 00:24:56,195 INFO L426 ceAbstractionStarter]: For program point L91(lines 91 96) no Hoare annotation was computed. [2018-10-01 00:24:56,195 INFO L426 ceAbstractionStarter]: For program point L91-2(lines 77 120) no Hoare annotation was computed. [2018-10-01 00:24:56,195 INFO L426 ceAbstractionStarter]: For program point L149(lines 149 161) no Hoare annotation was computed. [2018-10-01 00:24:56,195 INFO L426 ceAbstractionStarter]: For program point L133(lines 133 138) no Hoare annotation was computed. [2018-10-01 00:24:56,195 INFO L426 ceAbstractionStarter]: For program point L67(lines 67 69) no Hoare annotation was computed. [2018-10-01 00:24:56,195 INFO L426 ceAbstractionStarter]: For program point L133-2(lines 123 161) no Hoare annotation was computed. [2018-10-01 00:24:56,195 INFO L426 ceAbstractionStarter]: For program point L67-2(lines 67 72) no Hoare annotation was computed. [2018-10-01 00:24:56,195 INFO L426 ceAbstractionStarter]: For program point ElevatorENTRY(lines 13 164) no Hoare annotation was computed. [2018-10-01 00:24:56,195 INFO L426 ceAbstractionStarter]: For program point L84(lines 84 96) no Hoare annotation was computed. [2018-10-01 00:24:56,195 INFO L426 ceAbstractionStarter]: For program point L101(lines 101 120) no Hoare annotation was computed. [2018-10-01 00:24:56,207 INFO L202 PluginConnector]: Adding new model ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 12:24:56 BoogieIcfgContainer [2018-10-01 00:24:56,207 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 00:24:56,208 INFO L168 Benchmark]: Toolchain (without parser) took 21296.15 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 141.6 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 313.8 MB). Peak memory consumption was 606.7 MB. Max. memory is 7.1 GB. [2018-10-01 00:24:56,210 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.33 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-01 00:24:56,211 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.02 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-01 00:24:56,212 INFO L168 Benchmark]: Boogie Preprocessor took 45.82 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-01 00:24:56,212 INFO L168 Benchmark]: RCFGBuilder took 724.89 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-01 00:24:56,213 INFO L168 Benchmark]: TraceAbstraction took 20446.79 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 141.6 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 282.1 MB). Peak memory consumption was 575.0 MB. Max. memory is 7.1 GB. [2018-10-01 00:24:56,218 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.33 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 63.02 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 45.82 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 724.89 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 20446.79 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 141.6 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 282.1 MB). Peak memory consumption was 575.0 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: ((((((((!(min == goal) && min <= goal) && min == current) && dir == 1) && min + 1 <= max) && qDC1 <= 1) || ((qDC1 <= 1 && !passed) && min <= current && current <= max)) || (qDC1 == 2 && min <= current && current <= max)) || (((((!(qCSP == 3) && min == current) && min + 1 <= max) && qDC1 <= 1) && !(min == goal)) && min <= goal)) || (((min == current && min + 1 <= max) && qDC1 <= 1) && qCSP == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. SAFE Result, 20.3s OverallTime, 14 OverallIterations, 5 TraceHistogramMax, 9.2s AutomataDifference, 0.0s DeadEndRemovalTime, 4.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 896 SDtfs, 1112 SDslu, 1459 SDs, 0 SdLazy, 840 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 142 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s 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.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 809 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 135 NumberOfFragments, 87 HoareAnnotationTreeSize, 1 FomulaSimplifications, 8391 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 9442 FormulaSimplificationTreeSizeReductionInter, 2.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 778 NumberOfCodeBlocks, 778 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 762 ConstructedInterpolants, 0 QuantifiedInterpolants, 676593 SizeOfPredicates, 4 NumberOfNonLiveVariables, 351 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 16 InterpolantComputations, 12 PerfectInterpolantSequences, 625/891 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-01_00-24-56-231.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-01_00-24-56-231.csv Received shutdown request...