java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/real-life/Elevator-Integer.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-bd42740 [2018-09-23 21:17:17,838 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-23 21:17:17,840 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-23 21:17:17,853 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-23 21:17:17,854 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-23 21:17:17,855 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-23 21:17:17,856 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-23 21:17:17,858 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-23 21:17:17,860 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-23 21:17:17,861 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-23 21:17:17,863 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-23 21:17:17,863 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-23 21:17:17,865 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-23 21:17:17,866 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-23 21:17:17,875 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-23 21:17:17,876 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-23 21:17:17,881 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-23 21:17:17,884 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-23 21:17:17,889 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-23 21:17:17,891 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-23 21:17:17,894 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-23 21:17:17,896 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-23 21:17:17,899 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-23 21:17:17,899 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-23 21:17:17,901 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-23 21:17:17,902 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-23 21:17:17,903 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-23 21:17:17,904 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-23 21:17:17,905 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-23 21:17:17,906 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-23 21:17:17,906 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-23 21:17:17,907 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-23 21:17:17,907 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-23 21:17:17,907 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-23 21:17:17,908 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-23 21:17:17,909 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-23 21:17:17,909 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-23 21:17:17,933 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-23 21:17:17,933 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-23 21:17:17,935 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-23 21:17:17,936 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-23 21:17:17,936 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-23 21:17:17,936 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-23 21:17:17,937 INFO L133 SettingsManager]: * Use SBE=true [2018-09-23 21:17:17,937 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-23 21:17:17,937 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-23 21:17:17,938 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-23 21:17:17,938 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-23 21:17:17,939 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-23 21:17:17,939 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-23 21:17:17,939 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-23 21:17:17,939 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-23 21:17:17,940 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-23 21:17:17,940 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-23 21:17:17,941 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-23 21:17:17,941 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-23 21:17:17,941 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-23 21:17:17,941 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-23 21:17:17,942 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-23 21:17:17,942 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 21:17:17,942 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-23 21:17:17,942 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-23 21:17:17,942 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-23 21:17:17,943 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-23 21:17:17,943 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-23 21:17:17,943 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-23 21:17:17,943 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-23 21:17:17,997 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-23 21:17:18,010 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-23 21:17:18,014 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-23 21:17:18,016 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-23 21:17:18,016 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-23 21:17:18,017 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator-Integer.bpl [2018-09-23 21:17:18,017 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/Elevator-Integer.bpl' [2018-09-23 21:17:18,079 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-23 21:17:18,083 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-23 21:17:18,084 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-23 21:17:18,084 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-23 21:17:18,084 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-23 21:17:18,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:17:18" (1/1) ... [2018-09-23 21:17:18,121 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:17:18" (1/1) ... [2018-09-23 21:17:18,126 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-23 21:17:18,127 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-23 21:17:18,127 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-23 21:17:18,129 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-23 21:17:18,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-23 21:17:18,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-23 21:17:18,130 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-23 21:17:18,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:17:18" (1/1) ... [2018-09-23 21:17:18,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:17:18" (1/1) ... [2018-09-23 21:17:18,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:17:18" (1/1) ... [2018-09-23 21:17:18,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:17:18" (1/1) ... [2018-09-23 21:17:18,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:17:18" (1/1) ... [2018-09-23 21:17:18,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:17:18" (1/1) ... [2018-09-23 21:17:18,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:17:18" (1/1) ... [2018-09-23 21:17:18,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-23 21:17:18,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-23 21:17:18,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-23 21:17:18,162 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-23 21:17:18,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:17:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 21:17:18,242 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Elevator given in one single declaration [2018-09-23 21:17:18,242 INFO L130 BoogieDeclarations]: Found specification of procedure Elevator [2018-09-23 21:17:18,243 INFO L138 BoogieDeclarations]: Found implementation of procedure Elevator [2018-09-23 21:17:18,925 INFO L351 CfgBuilder]: Using library mode [2018-09-23 21:17:18,925 INFO L202 PluginConnector]: Adding new model Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 09:17:18 BoogieIcfgContainer [2018-09-23 21:17:18,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-23 21:17:18,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-23 21:17:18,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-23 21:17:18,930 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-23 21:17:18,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:17:18" (1/2) ... [2018-09-23 21:17:18,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@469eea77 and model type Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.09 09:17:18, skipping insertion in model container [2018-09-23 21:17:18,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 09:17:18" (2/2) ... [2018-09-23 21:17:18,934 INFO L112 eAbstractionObserver]: Analyzing ICFG Elevator-Integer.bpl [2018-09-23 21:17:18,943 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-23 21:17:18,953 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-23 21:17:19,015 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-23 21:17:19,016 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-23 21:17:19,016 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-23 21:17:19,016 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-23 21:17:19,016 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-23 21:17:19,016 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-23 21:17:19,016 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-23 21:17:19,016 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-23 21:17:19,017 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-23 21:17:19,033 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-09-23 21:17:19,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 21:17:19,040 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:19,041 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:19,042 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:19,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:19,048 INFO L82 PathProgramCache]: Analyzing trace with hash 493797215, now seen corresponding path program 1 times [2018-09-23 21:17:19,049 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:19,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:19,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:19,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:19,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:19,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:17:19,197 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:19,197 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 21:17:19,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:17:19,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:17:19,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:17:19,218 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2018-09-23 21:17:19,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:19,331 INFO L93 Difference]: Finished difference Result 85 states and 157 transitions. [2018-09-23 21:17:19,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:17:19,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-09-23 21:17:19,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:19,347 INFO L225 Difference]: With dead ends: 85 [2018-09-23 21:17:19,348 INFO L226 Difference]: Without dead ends: 53 [2018-09-23 21:17:19,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:17:19,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-23 21:17:19,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-09-23 21:17:19,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-23 21:17:19,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 90 transitions. [2018-09-23 21:17:19,397 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 90 transitions. Word has length 9 [2018-09-23 21:17:19,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:19,397 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 90 transitions. [2018-09-23 21:17:19,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:17:19,397 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 90 transitions. [2018-09-23 21:17:19,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 21:17:19,398 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:19,398 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:19,399 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:19,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:19,399 INFO L82 PathProgramCache]: Analyzing trace with hash -2026162719, now seen corresponding path program 1 times [2018-09-23 21:17:19,399 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:19,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:19,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:19,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:19,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:19,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:17:19,448 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:19,448 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 21:17:19,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:17:19,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:17:19,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:17:19,451 INFO L87 Difference]: Start difference. First operand 52 states and 90 transitions. Second operand 3 states. [2018-09-23 21:17:19,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:19,620 INFO L93 Difference]: Finished difference Result 154 states and 268 transitions. [2018-09-23 21:17:19,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:17:19,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-09-23 21:17:19,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:19,623 INFO L225 Difference]: With dead ends: 154 [2018-09-23 21:17:19,623 INFO L226 Difference]: Without dead ends: 95 [2018-09-23 21:17:19,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:17:19,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-23 21:17:19,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-09-23 21:17:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-09-23 21:17:19,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 161 transitions. [2018-09-23 21:17:19,639 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 161 transitions. Word has length 9 [2018-09-23 21:17:19,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:19,640 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 161 transitions. [2018-09-23 21:17:19,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:17:19,640 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 161 transitions. [2018-09-23 21:17:19,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 21:17:19,641 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:19,641 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:19,641 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:19,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:19,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1968904417, now seen corresponding path program 1 times [2018-09-23 21:17:19,642 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:19,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:19,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:19,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:19,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:19,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:17:19,723 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:19,723 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:17:19,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:17:19,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:17:19,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:17:19,724 INFO L87 Difference]: Start difference. First operand 94 states and 161 transitions. Second operand 3 states. [2018-09-23 21:17:20,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:20,129 INFO L93 Difference]: Finished difference Result 233 states and 398 transitions. [2018-09-23 21:17:20,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:17:20,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-09-23 21:17:20,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:20,132 INFO L225 Difference]: With dead ends: 233 [2018-09-23 21:17:20,132 INFO L226 Difference]: Without dead ends: 136 [2018-09-23 21:17:20,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:17:20,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-09-23 21:17:20,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 114. [2018-09-23 21:17:20,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-09-23 21:17:20,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 193 transitions. [2018-09-23 21:17:20,149 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 193 transitions. Word has length 9 [2018-09-23 21:17:20,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:20,150 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 193 transitions. [2018-09-23 21:17:20,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:17:20,150 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 193 transitions. [2018-09-23 21:17:20,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-23 21:17:20,151 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:20,151 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:20,152 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:20,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:20,152 INFO L82 PathProgramCache]: Analyzing trace with hash -906451345, now seen corresponding path program 1 times [2018-09-23 21:17:20,153 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:20,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:20,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:20,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:20,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:20,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:17:20,243 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:20,243 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 21:17:20,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-23 21:17:20,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-23 21:17:20,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-23 21:17:20,245 INFO L87 Difference]: Start difference. First operand 114 states and 193 transitions. Second operand 4 states. [2018-09-23 21:17:20,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:20,461 INFO L93 Difference]: Finished difference Result 144 states and 242 transitions. [2018-09-23 21:17:20,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-23 21:17:20,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-09-23 21:17:20,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:20,465 INFO L225 Difference]: With dead ends: 144 [2018-09-23 21:17:20,465 INFO L226 Difference]: Without dead ends: 143 [2018-09-23 21:17:20,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-23 21:17:20,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-23 21:17:20,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2018-09-23 21:17:20,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-09-23 21:17:20,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 237 transitions. [2018-09-23 21:17:20,482 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 237 transitions. Word has length 10 [2018-09-23 21:17:20,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:20,483 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 237 transitions. [2018-09-23 21:17:20,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-23 21:17:20,483 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 237 transitions. [2018-09-23 21:17:20,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-23 21:17:20,484 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:20,485 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:20,485 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:20,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:20,485 INFO L82 PathProgramCache]: Analyzing trace with hash -464230043, now seen corresponding path program 1 times [2018-09-23 21:17:20,486 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:20,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:20,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:20,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:20,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:20,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:17:20,582 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:20,582 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-23 21:17:20,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-23 21:17:20,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-23 21:17:20,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-23 21:17:20,584 INFO L87 Difference]: Start difference. First operand 142 states and 237 transitions. Second operand 5 states. [2018-09-23 21:17:20,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:20,757 INFO L93 Difference]: Finished difference Result 459 states and 761 transitions. [2018-09-23 21:17:20,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-23 21:17:20,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-09-23 21:17:20,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:20,760 INFO L225 Difference]: With dead ends: 459 [2018-09-23 21:17:20,760 INFO L226 Difference]: Without dead ends: 286 [2018-09-23 21:17:20,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-23 21:17:20,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-09-23 21:17:20,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2018-09-23 21:17:20,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-09-23 21:17:20,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 461 transitions. [2018-09-23 21:17:20,787 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 461 transitions. Word has length 18 [2018-09-23 21:17:20,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:20,787 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 461 transitions. [2018-09-23 21:17:20,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-23 21:17:20,787 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 461 transitions. [2018-09-23 21:17:20,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-23 21:17:20,789 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:20,790 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:20,790 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:20,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:20,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1761001012, now seen corresponding path program 1 times [2018-09-23 21:17:20,791 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:20,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:20,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:20,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:20,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:20,841 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-23 21:17:20,841 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:20,841 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:17:20,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:17:20,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:17:20,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:17:20,843 INFO L87 Difference]: Start difference. First operand 286 states and 461 transitions. Second operand 3 states. [2018-09-23 21:17:21,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:21,026 INFO L93 Difference]: Finished difference Result 695 states and 1105 transitions. [2018-09-23 21:17:21,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:17:21,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-09-23 21:17:21,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:21,032 INFO L225 Difference]: With dead ends: 695 [2018-09-23 21:17:21,032 INFO L226 Difference]: Without dead ends: 402 [2018-09-23 21:17:21,037 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:17:21,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-09-23 21:17:21,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 294. [2018-09-23 21:17:21,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-09-23 21:17:21,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 469 transitions. [2018-09-23 21:17:21,074 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 469 transitions. Word has length 40 [2018-09-23 21:17:21,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:21,075 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 469 transitions. [2018-09-23 21:17:21,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:17:21,075 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 469 transitions. [2018-09-23 21:17:21,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-23 21:17:21,077 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:21,077 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:21,078 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:21,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:21,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1151060372, now seen corresponding path program 1 times [2018-09-23 21:17:21,078 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:21,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:21,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:21,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:21,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:21,157 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-23 21:17:21,157 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:21,158 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:17:21,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:17:21,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:17:21,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:17:21,159 INFO L87 Difference]: Start difference. First operand 294 states and 469 transitions. Second operand 3 states. [2018-09-23 21:17:21,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:21,265 INFO L93 Difference]: Finished difference Result 711 states and 1121 transitions. [2018-09-23 21:17:21,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:17:21,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-09-23 21:17:21,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:21,269 INFO L225 Difference]: With dead ends: 711 [2018-09-23 21:17:21,270 INFO L226 Difference]: Without dead ends: 414 [2018-09-23 21:17:21,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:17:21,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-09-23 21:17:21,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 306. [2018-09-23 21:17:21,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-09-23 21:17:21,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 481 transitions. [2018-09-23 21:17:21,288 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 481 transitions. Word has length 41 [2018-09-23 21:17:21,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:21,289 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 481 transitions. [2018-09-23 21:17:21,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:17:21,289 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 481 transitions. [2018-09-23 21:17:21,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-23 21:17:21,292 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:21,292 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:21,292 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:21,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:21,293 INFO L82 PathProgramCache]: Analyzing trace with hash 221883911, now seen corresponding path program 1 times [2018-09-23 21:17:21,293 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:21,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:21,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:21,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:21,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:21,508 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-23 21:17:21,509 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:17:21,510 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 21:17:21,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:21,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:17:21,709 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-23 21:17:21,746 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-23 21:17:21,746 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-09-23 21:17:21,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 21:17:21,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 21:17:21,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-23 21:17:21,748 INFO L87 Difference]: Start difference. First operand 306 states and 481 transitions. Second operand 7 states. [2018-09-23 21:17:22,128 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-23 21:17:22,752 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-23 21:17:22,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:22,862 INFO L93 Difference]: Finished difference Result 834 states and 1286 transitions. [2018-09-23 21:17:22,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-23 21:17:22,864 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-09-23 21:17:22,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:22,868 INFO L225 Difference]: With dead ends: 834 [2018-09-23 21:17:22,868 INFO L226 Difference]: Without dead ends: 523 [2018-09-23 21:17:22,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-09-23 21:17:22,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-09-23 21:17:22,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 432. [2018-09-23 21:17:22,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-09-23 21:17:22,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 649 transitions. [2018-09-23 21:17:22,890 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 649 transitions. Word has length 43 [2018-09-23 21:17:22,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:22,890 INFO L480 AbstractCegarLoop]: Abstraction has 432 states and 649 transitions. [2018-09-23 21:17:22,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 21:17:22,890 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 649 transitions. [2018-09-23 21:17:22,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-23 21:17:22,892 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:22,892 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:22,893 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:22,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:22,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1437736339, now seen corresponding path program 1 times [2018-09-23 21:17:22,894 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:22,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:22,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:22,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:22,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:22,964 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-23 21:17:22,964 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:22,965 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:17:22,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:17:22,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:17:22,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:17:22,966 INFO L87 Difference]: Start difference. First operand 432 states and 649 transitions. Second operand 3 states. [2018-09-23 21:17:23,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:23,288 INFO L93 Difference]: Finished difference Result 1110 states and 1680 transitions. [2018-09-23 21:17:23,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:17:23,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-09-23 21:17:23,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:23,292 INFO L225 Difference]: With dead ends: 1110 [2018-09-23 21:17:23,292 INFO L226 Difference]: Without dead ends: 657 [2018-09-23 21:17:23,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:17:23,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2018-09-23 21:17:23,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 654. [2018-09-23 21:17:23,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-09-23 21:17:23,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 980 transitions. [2018-09-23 21:17:23,319 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 980 transitions. Word has length 45 [2018-09-23 21:17:23,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:23,320 INFO L480 AbstractCegarLoop]: Abstraction has 654 states and 980 transitions. [2018-09-23 21:17:23,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:17:23,320 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 980 transitions. [2018-09-23 21:17:23,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-23 21:17:23,322 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:23,322 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:23,323 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:23,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:23,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1460368593, now seen corresponding path program 1 times [2018-09-23 21:17:23,323 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:23,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:23,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:23,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:23,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:23,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:23,432 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 21:17:23,433 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:23,433 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:17:23,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:17:23,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:17:23,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:17:23,434 INFO L87 Difference]: Start difference. First operand 654 states and 980 transitions. Second operand 3 states. [2018-09-23 21:17:23,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:23,636 INFO L93 Difference]: Finished difference Result 1308 states and 1959 transitions. [2018-09-23 21:17:23,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:17:23,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-09-23 21:17:23,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:23,642 INFO L225 Difference]: With dead ends: 1308 [2018-09-23 21:17:23,642 INFO L226 Difference]: Without dead ends: 655 [2018-09-23 21:17:23,643 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:17:23,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2018-09-23 21:17:23,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 654. [2018-09-23 21:17:23,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-09-23 21:17:23,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 924 transitions. [2018-09-23 21:17:23,670 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 924 transitions. Word has length 45 [2018-09-23 21:17:23,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:23,671 INFO L480 AbstractCegarLoop]: Abstraction has 654 states and 924 transitions. [2018-09-23 21:17:23,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:17:23,671 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 924 transitions. [2018-09-23 21:17:23,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-23 21:17:23,672 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:23,672 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:23,673 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:23,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:23,673 INFO L82 PathProgramCache]: Analyzing trace with hash -477421396, now seen corresponding path program 1 times [2018-09-23 21:17:23,673 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:23,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:23,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:23,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:23,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:24,549 WARN L178 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-09-23 21:17:24,955 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-23 21:17:24,972 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:17:24,973 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:17:24,973 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 21:17:24,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:25,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:17:25,573 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-09-23 21:17:26,211 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:17:26,233 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:17:26,233 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-09-23 21:17:26,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-23 21:17:26,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-23 21:17:26,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-09-23 21:17:26,235 INFO L87 Difference]: Start difference. First operand 654 states and 924 transitions. Second operand 16 states. [2018-09-23 21:17:27,511 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-09-23 21:17:27,687 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-09-23 21:17:28,169 WARN L178 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-09-23 21:17:28,349 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-09-23 21:17:28,553 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-09-23 21:17:29,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:29,581 INFO L93 Difference]: Finished difference Result 2731 states and 3833 transitions. [2018-09-23 21:17:29,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-23 21:17:29,581 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 48 [2018-09-23 21:17:29,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:29,591 INFO L225 Difference]: With dead ends: 2731 [2018-09-23 21:17:29,592 INFO L226 Difference]: Without dead ends: 2018 [2018-09-23 21:17:29,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=322, Invalid=868, Unknown=0, NotChecked=0, Total=1190 [2018-09-23 21:17:29,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2018-09-23 21:17:29,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 916. [2018-09-23 21:17:29,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-09-23 21:17:29,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1353 transitions. [2018-09-23 21:17:29,652 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1353 transitions. Word has length 48 [2018-09-23 21:17:29,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:29,653 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 1353 transitions. [2018-09-23 21:17:29,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-23 21:17:29,653 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1353 transitions. [2018-09-23 21:17:29,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-23 21:17:29,657 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:29,657 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:29,658 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:29,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:29,658 INFO L82 PathProgramCache]: Analyzing trace with hash -253604652, now seen corresponding path program 1 times [2018-09-23 21:17:29,658 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:29,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:29,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:29,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:29,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:29,802 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-09-23 21:17:29,803 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:29,803 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-23 21:17:29,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-23 21:17:29,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-23 21:17:29,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-23 21:17:29,804 INFO L87 Difference]: Start difference. First operand 916 states and 1353 transitions. Second operand 4 states. [2018-09-23 21:17:30,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:30,013 INFO L93 Difference]: Finished difference Result 1832 states and 2705 transitions. [2018-09-23 21:17:30,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:17:30,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-09-23 21:17:30,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:30,019 INFO L225 Difference]: With dead ends: 1832 [2018-09-23 21:17:30,020 INFO L226 Difference]: Without dead ends: 917 [2018-09-23 21:17:30,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-23 21:17:30,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-09-23 21:17:30,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 914. [2018-09-23 21:17:30,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2018-09-23 21:17:30,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1297 transitions. [2018-09-23 21:17:30,068 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1297 transitions. Word has length 67 [2018-09-23 21:17:30,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:30,069 INFO L480 AbstractCegarLoop]: Abstraction has 914 states and 1297 transitions. [2018-09-23 21:17:30,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-23 21:17:30,069 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1297 transitions. [2018-09-23 21:17:30,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-23 21:17:30,070 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:30,071 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:30,071 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:30,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:30,071 INFO L82 PathProgramCache]: Analyzing trace with hash 597366310, now seen corresponding path program 2 times [2018-09-23 21:17:30,072 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:30,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:30,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:30,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:30,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:30,158 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-09-23 21:17:30,158 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:30,158 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:17:30,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:17:30,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:17:30,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:17:30,159 INFO L87 Difference]: Start difference. First operand 914 states and 1297 transitions. Second operand 3 states. [2018-09-23 21:17:30,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:30,364 INFO L93 Difference]: Finished difference Result 1833 states and 2596 transitions. [2018-09-23 21:17:30,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:17:30,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-09-23 21:17:30,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:30,369 INFO L225 Difference]: With dead ends: 1833 [2018-09-23 21:17:30,369 INFO L226 Difference]: Without dead ends: 852 [2018-09-23 21:17:30,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:17:30,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2018-09-23 21:17:30,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 827. [2018-09-23 21:17:30,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2018-09-23 21:17:30,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1131 transitions. [2018-09-23 21:17:30,409 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1131 transitions. Word has length 68 [2018-09-23 21:17:30,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:30,409 INFO L480 AbstractCegarLoop]: Abstraction has 827 states and 1131 transitions. [2018-09-23 21:17:30,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:17:30,410 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1131 transitions. [2018-09-23 21:17:30,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-23 21:17:30,412 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:30,413 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:30,413 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:30,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:30,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1297357211, now seen corresponding path program 1 times [2018-09-23 21:17:30,413 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:30,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:30,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:30,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:17:30,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:31,455 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 27 proven. 101 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-23 21:17:31,455 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:17:31,455 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 21:17:31,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:31,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:31,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:17:32,315 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 108 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-23 21:17:32,337 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:17:32,337 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 26 [2018-09-23 21:17:32,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-23 21:17:32,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-23 21:17:32,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2018-09-23 21:17:32,338 INFO L87 Difference]: Start difference. First operand 827 states and 1131 transitions. Second operand 27 states. [2018-09-23 21:17:33,678 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2018-09-23 21:17:34,446 WARN L178 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2018-09-23 21:17:34,752 WARN L178 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2018-09-23 21:17:35,104 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2018-09-23 21:17:35,280 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2018-09-23 21:17:36,164 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2018-09-23 21:17:36,347 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2018-09-23 21:17:36,622 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2018-09-23 21:17:37,002 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2018-09-23 21:17:37,376 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2018-09-23 21:17:37,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:37,926 INFO L93 Difference]: Finished difference Result 2306 states and 2951 transitions. [2018-09-23 21:17:37,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-23 21:17:37,927 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 84 [2018-09-23 21:17:37,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:37,936 INFO L225 Difference]: With dead ends: 2306 [2018-09-23 21:17:37,936 INFO L226 Difference]: Without dead ends: 2305 [2018-09-23 21:17:37,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=838, Invalid=3194, Unknown=0, NotChecked=0, Total=4032 [2018-09-23 21:17:37,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2018-09-23 21:17:38,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 951. [2018-09-23 21:17:38,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2018-09-23 21:17:38,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1304 transitions. [2018-09-23 21:17:38,004 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1304 transitions. Word has length 84 [2018-09-23 21:17:38,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:38,004 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 1304 transitions. [2018-09-23 21:17:38,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-23 21:17:38,004 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1304 transitions. [2018-09-23 21:17:38,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-23 21:17:38,006 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:38,006 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:38,007 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:38,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:38,007 INFO L82 PathProgramCache]: Analyzing trace with hash -604514526, now seen corresponding path program 1 times [2018-09-23 21:17:38,007 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:38,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:38,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:38,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:38,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:38,102 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-09-23 21:17:38,102 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:38,103 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:17:38,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:17:38,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:17:38,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:17:38,104 INFO L87 Difference]: Start difference. First operand 951 states and 1304 transitions. Second operand 3 states. [2018-09-23 21:17:38,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:38,358 INFO L93 Difference]: Finished difference Result 1902 states and 2607 transitions. [2018-09-23 21:17:38,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:17:38,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-09-23 21:17:38,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:38,361 INFO L225 Difference]: With dead ends: 1902 [2018-09-23 21:17:38,361 INFO L226 Difference]: Without dead ends: 952 [2018-09-23 21:17:38,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:17:38,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2018-09-23 21:17:38,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 896. [2018-09-23 21:17:38,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-09-23 21:17:38,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1202 transitions. [2018-09-23 21:17:38,419 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1202 transitions. Word has length 85 [2018-09-23 21:17:38,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:38,419 INFO L480 AbstractCegarLoop]: Abstraction has 896 states and 1202 transitions. [2018-09-23 21:17:38,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:17:38,420 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1202 transitions. [2018-09-23 21:17:38,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-23 21:17:38,424 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:38,424 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:38,424 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:38,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:38,425 INFO L82 PathProgramCache]: Analyzing trace with hash 722130188, now seen corresponding path program 1 times [2018-09-23 21:17:38,425 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:38,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:38,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:38,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:38,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:38,505 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-09-23 21:17:38,505 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:38,505 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:17:38,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:17:38,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:17:38,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:17:38,506 INFO L87 Difference]: Start difference. First operand 896 states and 1202 transitions. Second operand 3 states. [2018-09-23 21:17:38,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:38,582 INFO L93 Difference]: Finished difference Result 1560 states and 2084 transitions. [2018-09-23 21:17:38,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:17:38,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-09-23 21:17:38,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:38,584 INFO L225 Difference]: With dead ends: 1560 [2018-09-23 21:17:38,584 INFO L226 Difference]: Without dead ends: 640 [2018-09-23 21:17:38,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:17:38,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-09-23 21:17:38,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 554. [2018-09-23 21:17:38,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-09-23 21:17:38,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 719 transitions. [2018-09-23 21:17:38,627 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 719 transitions. Word has length 87 [2018-09-23 21:17:38,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:38,627 INFO L480 AbstractCegarLoop]: Abstraction has 554 states and 719 transitions. [2018-09-23 21:17:38,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:17:38,628 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 719 transitions. [2018-09-23 21:17:38,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-23 21:17:38,630 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:38,630 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:38,630 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:38,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:38,631 INFO L82 PathProgramCache]: Analyzing trace with hash 818701568, now seen corresponding path program 1 times [2018-09-23 21:17:38,631 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:38,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:38,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:38,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:38,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:38,809 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 104 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-09-23 21:17:38,810 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:17:38,810 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 21:17:38,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:38,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:17:39,002 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 104 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-09-23 21:17:39,023 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:17:39,023 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-09-23 21:17:39,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 21:17:39,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 21:17:39,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-09-23 21:17:39,024 INFO L87 Difference]: Start difference. First operand 554 states and 719 transitions. Second operand 7 states. [2018-09-23 21:17:39,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:39,293 INFO L93 Difference]: Finished difference Result 1394 states and 1802 transitions. [2018-09-23 21:17:39,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-23 21:17:39,294 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-09-23 21:17:39,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:39,297 INFO L225 Difference]: With dead ends: 1394 [2018-09-23 21:17:39,297 INFO L226 Difference]: Without dead ends: 724 [2018-09-23 21:17:39,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-09-23 21:17:39,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2018-09-23 21:17:39,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 323. [2018-09-23 21:17:39,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-09-23 21:17:39,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 408 transitions. [2018-09-23 21:17:39,328 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 408 transitions. Word has length 89 [2018-09-23 21:17:39,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:39,329 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 408 transitions. [2018-09-23 21:17:39,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 21:17:39,329 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 408 transitions. [2018-09-23 21:17:39,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-23 21:17:39,330 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:39,331 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:39,331 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ElevatorErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:39,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:39,331 INFO L82 PathProgramCache]: Analyzing trace with hash -199349933, now seen corresponding path program 2 times [2018-09-23 21:17:39,332 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:39,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:39,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:39,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:39,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:39,432 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-09-23 21:17:39,432 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:39,432 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-23 21:17:39,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:17:39,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:17:39,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:17:39,435 INFO L87 Difference]: Start difference. First operand 323 states and 408 transitions. Second operand 3 states. [2018-09-23 21:17:39,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:39,758 INFO L93 Difference]: Finished difference Result 566 states and 704 transitions. [2018-09-23 21:17:39,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:17:39,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2018-09-23 21:17:39,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:39,760 INFO L225 Difference]: With dead ends: 566 [2018-09-23 21:17:39,760 INFO L226 Difference]: Without dead ends: 0 [2018-09-23 21:17:39,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:17:39,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-23 21:17:39,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-23 21:17:39,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-23 21:17:39,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-23 21:17:39,762 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2018-09-23 21:17:39,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:39,762 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-23 21:17:39,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:17:39,762 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-23 21:17:39,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-23 21:17:39,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-23 21:17:39,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:17:39,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:17:40,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:17:40,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:17:40,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:17:40,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:17:41,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-23 21:17:41,457 WARN L178 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 509 DAG size of output: 449 [2018-09-23 21:17:48,385 WARN L178 SmtUtils]: Spent 6.92 s on a formula simplification. DAG size of input: 436 DAG size of output: 113 [2018-09-23 21:17:48,389 INFO L426 ceAbstractionStarter]: For program point L168(lines 168 183) no Hoare annotation was computed. [2018-09-23 21:17:48,390 INFO L426 ceAbstractionStarter]: For program point L135(lines 135 142) no Hoare annotation was computed. [2018-09-23 21:17:48,390 INFO L426 ceAbstractionStarter]: For program point L135-2(lines 111 160) no Hoare annotation was computed. [2018-09-23 21:17:48,390 INFO L426 ceAbstractionStarter]: For program point L94(lines 94 108) no Hoare annotation was computed. [2018-09-23 21:17:48,390 INFO L426 ceAbstractionStarter]: For program point L152(lines 152 160) no Hoare annotation was computed. [2018-09-23 21:17:48,390 INFO L426 ceAbstractionStarter]: For program point L103(lines 103 108) no Hoare annotation was computed. [2018-09-23 21:17:48,390 INFO L426 ceAbstractionStarter]: For program point L103-2(lines 89 142) no Hoare annotation was computed. [2018-09-23 21:17:48,390 INFO L426 ceAbstractionStarter]: For program point ElevatorErr0ASSERT_VIOLATIONASSERT(line 185) no Hoare annotation was computed. [2018-09-23 21:17:48,390 INFO L426 ceAbstractionStarter]: For program point L178(lines 178 183) no Hoare annotation was computed. [2018-09-23 21:17:48,390 INFO L426 ceAbstractionStarter]: For program point L178-2(lines 163 183) no Hoare annotation was computed. [2018-09-23 21:17:48,390 INFO L426 ceAbstractionStarter]: For program point L129(lines 129 142) no Hoare annotation was computed. [2018-09-23 21:17:48,390 INFO L426 ceAbstractionStarter]: For program point L96(lines 96 108) no Hoare annotation was computed. [2018-09-23 21:17:48,390 INFO L426 ceAbstractionStarter]: For program point L80(lines 80 82) no Hoare annotation was computed. [2018-09-23 21:17:48,391 INFO L426 ceAbstractionStarter]: For program point L80-2(lines 80 85) no Hoare annotation was computed. [2018-09-23 21:17:48,391 INFO L426 ceAbstractionStarter]: For program point L171(lines 171 183) no Hoare annotation was computed. [2018-09-23 21:17:48,391 INFO L426 ceAbstractionStarter]: For program point L155(lines 155 160) no Hoare annotation was computed. [2018-09-23 21:17:48,391 INFO L426 ceAbstractionStarter]: For program point L155-2(lines 145 183) no Hoare annotation was computed. [2018-09-23 21:17:48,392 INFO L422 ceAbstractionStarter]: At program point L48-1(lines 13 188) the Hoare annotation is: (let ((.cse2 (<= Elevator_min Elevator_current)) (.cse6 (<= Elevator_current Elevator_max)) (.cse28 (<= |Elevator_goal'| |Elevator_current'|)) (.cse31 (<= |Elevator_current'| |Elevator_goal'|)) (.cse0 (<= Elevator_c2 Elevator_c3)) (.cse1 (<= |Elevator_current'| Elevator_max)) (.cse4 (<= Elevator_min |Elevator_current'|)) (.cse29 (+ |Elevator_goal'| 1))) (let ((.cse3 (<= Elevator_qDC2 1)) (.cse14 (or (< |Elevator_current'| |Elevator_goal'|) (<= .cse29 |Elevator_current'|))) (.cse21 (<= Elevator_qDC1 1)) (.cse22 (not Elevator_passed)) (.cse25 (not (= Elevator_qCSP 3))) (.cse26 (or (and .cse1 (<= (+ Elevator_min 1) |Elevator_current'|)) (and (<= (+ |Elevator_current'| 1) Elevator_max) .cse4))) (.cse16 (= Elevator_qDC2 3)) (.cse5 (= Elevator_qCSP 1)) (.cse13 (not Elevator_stop)) (.cse24 (or (<= Elevator_c2 2) .cse0)) (.cse17 (or (= (+ |Elevator_dir'| 1) 0) .cse31)) (.cse7 (= Elevator_qDC1 2)) (.cse18 (or (= |Elevator_dir'| 1) .cse28)) (.cse19 (<= Elevator_qDC2 2)) (.cse20 (<= 2 Elevator_qDC2)) (.cse8 (<= |Elevator_goal'| Elevator_max)) (.cse10 (<= Elevator_goal Elevator_max)) (.cse11 (<= Elevator_min Elevator_goal)) (.cse15 (and .cse1 .cse2 .cse6 .cse4)) (.cse9 (<= Elevator_min |Elevator_goal'|)) (.cse23 (not (= |Elevator_current'| |Elevator_goal'|))) (.cse12 (not Elevator_newgoal))) (or (and .cse0 (and (and .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12) (and .cse13 .cse0 (and (and .cse14 .cse8 .cse15) .cse7 .cse9 .cse10 .cse11) .cse16) (and (and .cse13 (and .cse17 .cse18 (and .cse19 .cse20 (and .cse1 .cse2 .cse6 .cse4 .cse8 .cse9 .cse10 .cse11 .cse21 .cse22)) .cse23)) .cse12) (and .cse13 .cse24 (and (and .cse25 .cse19 .cse2 .cse6 .cse14 .cse20 .cse8 .cse10 .cse26 .cse11) .cse7 .cse9)) (and (let ((.cse27 (let ((.cse30 (let ((.cse32 (and .cse5 (and .cse1 .cse3 .cse4 .cse21)))) (or (and .cse31 .cse32 .cse28) (and .cse8 .cse9 .cse10 .cse11 .cse32))))) (or (and .cse17 .cse18 .cse26 .cse30) (and .cse2 .cse6 .cse10 .cse11 .cse30))))) (or (and .cse6 .cse27) (and (or (and (<= (+ |Elevator_current'| |Elevator_dir'| 2) Elevator_max) .cse28) (= |Elevator_goal'| |Elevator_current'|) (and (< |Elevator_current'| .cse29) (<= (+ Elevator_min 2) (+ |Elevator_current'| |Elevator_dir'|)))) .cse27))) .cse0) (and (and .cse13 .cse0 (and .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse15)) .cse16) .cse12) (and .cse13 (and .cse9 (and .cse2 .cse19 .cse14 .cse20 .cse8 .cse10 .cse21 .cse22 .cse25 .cse6 .cse26) .cse11)) (and .cse0 (and .cse1 .cse2 .cse4 .cse8 .cse16 .cse10 .cse11 .cse5 .cse13 .cse6 .cse7 .cse9)) (and (and .cse13 .cse24 (and .cse17 .cse7 .cse18 (and .cse19 .cse20 .cse8 .cse10 .cse11 .cse15) .cse9 .cse23)) .cse12)))) [2018-09-23 21:17:48,392 INFO L426 ceAbstractionStarter]: For program point L123(lines 123 142) no Hoare annotation was computed. [2018-09-23 21:17:48,392 INFO L426 ceAbstractionStarter]: For program point L165(lines 165 183) no Hoare annotation was computed. [2018-09-23 21:17:48,392 INFO L426 ceAbstractionStarter]: For program point L99(lines 99 108) no Hoare annotation was computed. [2018-09-23 21:17:48,392 INFO L426 ceAbstractionStarter]: For program point ElevatorEXIT(lines 13 188) no Hoare annotation was computed. [2018-09-23 21:17:48,392 INFO L426 ceAbstractionStarter]: For program point L91(lines 91 108) no Hoare annotation was computed. [2018-09-23 21:17:48,392 INFO L426 ceAbstractionStarter]: For program point L149(lines 149 160) no Hoare annotation was computed. [2018-09-23 21:17:48,393 INFO L426 ceAbstractionStarter]: For program point L116(lines 116 142) no Hoare annotation was computed. [2018-09-23 21:17:48,393 INFO L426 ceAbstractionStarter]: For program point L83-1(lines 83 108) no Hoare annotation was computed. [2018-09-23 21:17:48,393 INFO L426 ceAbstractionStarter]: For program point ElevatorENTRY(lines 13 188) no Hoare annotation was computed. [2018-09-23 21:17:48,393 INFO L426 ceAbstractionStarter]: For program point L175(lines 175 183) no Hoare annotation was computed. [2018-09-23 21:17:48,393 INFO L426 ceAbstractionStarter]: For program point L101(lines 101 108) no Hoare annotation was computed. [2018-09-23 21:17:48,416 INFO L202 PluginConnector]: Adding new model Elevator-Integer.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.09 09:17:48 BoogieIcfgContainer [2018-09-23 21:17:48,416 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-23 21:17:48,417 INFO L168 Benchmark]: Toolchain (without parser) took 30337.45 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 358.6 MB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -264.9 MB). Peak memory consumption was 806.9 MB. Max. memory is 7.1 GB. [2018-09-23 21:17:48,418 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 21:17:48,419 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 21:17:48,419 INFO L168 Benchmark]: Boogie Preprocessor took 31.59 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 21:17:48,420 INFO L168 Benchmark]: RCFGBuilder took 763.80 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-23 21:17:48,420 INFO L168 Benchmark]: TraceAbstraction took 29489.86 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 358.6 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -296.6 MB). Peak memory consumption was 775.2 MB. Max. memory is 7.1 GB. [2018-09-23 21:17:48,424 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.59 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 763.80 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29489.86 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 358.6 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -296.6 MB). Peak memory consumption was 775.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 185]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: (((((((((c2 <= c3 && (((((((((current' <= max && min <= current) && qDC2 <= 1) && min <= current') && qCSP == 1) && current <= max) && qDC1 == 2) && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && !newgoal) || (((!stop && c2 <= c3) && ((((((current' < goal' || goal' + 1 <= current') && goal' <= max) && ((current' <= max && min <= current) && current <= max) && min <= current') && qDC1 == 2) && min <= goal') && goal <= max) && min <= goal) && qDC2 == 3)) || ((!stop && (((dir' + 1 == 0 || current' <= goal') && (dir' == 1 || goal' <= current')) && (qDC2 <= 2 && 2 <= qDC2) && ((((((((current' <= max && min <= current) && current <= max) && min <= current') && goal' <= max) && min <= goal') && goal <= max) && min <= goal) && qDC1 <= 1) && !passed) && !(current' == goal')) && !newgoal)) || ((!stop && (c2 <= 2 || c2 <= c3)) && ((((((((((!(qCSP == 3) && qDC2 <= 2) && min <= current) && current <= max) && (current' < goal' || goal' + 1 <= current')) && 2 <= qDC2) && goal' <= max) && goal <= max) && ((current' <= max && min + 1 <= current') || (current' + 1 <= max && min <= current'))) && min <= goal) && qDC1 == 2) && min <= goal')) || (((current <= max && (((((dir' + 1 == 0 || current' <= goal') && (dir' == 1 || goal' <= current')) && ((current' <= max && min + 1 <= current') || (current' + 1 <= max && min <= current'))) && (((current' <= goal' && qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1) && goal' <= current') || ((((goal' <= max && min <= goal') && goal <= max) && min <= goal) && qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1))) || ((((min <= current && current <= max) && goal <= max) && min <= goal) && (((current' <= goal' && qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1) && goal' <= current') || ((((goal' <= max && min <= goal') && goal <= max) && min <= goal) && qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1))))) || ((((current' + dir' + 2 <= max && goal' <= current') || goal' == current') || (current' < goal' + 1 && min + 2 <= current' + dir')) && (((((dir' + 1 == 0 || current' <= goal') && (dir' == 1 || goal' <= current')) && ((current' <= max && min + 1 <= current') || (current' + 1 <= max && min <= current'))) && (((current' <= goal' && qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1) && goal' <= current') || ((((goal' <= max && min <= goal') && goal <= max) && min <= goal) && qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1))) || ((((min <= current && current <= max) && goal <= max) && min <= goal) && (((current' <= goal' && qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1) && goal' <= current') || ((((goal' <= max && min <= goal') && goal <= max) && min <= goal) && qCSP == 1 && ((current' <= max && qDC2 <= 1) && min <= current') && qDC1 <= 1)))))) && c2 <= c3)) || ((((!stop && c2 <= c3) && qDC1 == 2 && (((goal' <= max && min <= goal') && goal <= max) && min <= goal) && ((current' <= max && min <= current) && current <= max) && min <= current') && qDC2 == 3) && !newgoal)) || (!stop && (min <= goal' && (((((((((min <= current && qDC2 <= 2) && (current' < goal' || goal' + 1 <= current')) && 2 <= qDC2) && goal' <= max) && goal <= max) && qDC1 <= 1) && !passed) && !(qCSP == 3)) && current <= max) && ((current' <= max && min + 1 <= current') || (current' + 1 <= max && min <= current'))) && min <= goal)) || (c2 <= c3 && ((((((((((current' <= max && min <= current) && min <= current') && goal' <= max) && qDC2 == 3) && goal <= max) && min <= goal) && qCSP == 1) && !stop) && current <= max) && qDC1 == 2) && min <= goal')) || (((!stop && (c2 <= 2 || c2 <= c3)) && (((((dir' + 1 == 0 || current' <= goal') && qDC1 == 2) && (dir' == 1 || goal' <= current')) && ((((qDC2 <= 2 && 2 <= qDC2) && goal' <= max) && goal <= max) && min <= goal) && ((current' <= max && min <= current) && current <= max) && min <= current') && min <= goal') && !(current' == goal')) && !newgoal) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. SAFE Result, 29.3s OverallTime, 18 OverallIterations, 6 TraceHistogramMax, 13.4s AutomataDifference, 0.0s DeadEndRemovalTime, 8.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 1068 SDtfs, 1946 SDslu, 2970 SDs, 0 SdLazy, 2059 SolverSat, 235 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 417 GetRequests, 280 SyntacticMatches, 5 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 11.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=951occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 3363 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 18 NumberOfFragments, 799 HoareAnnotationTreeSize, 1 FomulaSimplifications, 494164 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 1 FomulaSimplificationsInter, 246468 FormulaSimplificationTreeSizeReductionInter, 6.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 1161 NumberOfCodeBlocks, 1161 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1139 ConstructedInterpolants, 0 QuantifiedInterpolants, 554405 SizeOfPredicates, 23 NumberOfNonLiveVariables, 862 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 22 InterpolantComputations, 15 PerfectInterpolantSequences, 1300/1473 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Elevator-Integer.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-23_21-17-48-437.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Elevator-Integer.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-23_21-17-48-437.csv Received shutdown request...