java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/real-life/ElevatorWithAssignments.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d19836b [2018-09-26 21:40:11,996 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:40:11,998 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:40:12,011 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:40:12,011 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:40:12,012 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:40:12,014 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:40:12,016 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:40:12,018 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:40:12,019 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:40:12,020 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:40:12,021 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:40:12,022 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:40:12,023 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:40:12,024 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:40:12,025 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:40:12,026 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:40:12,028 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:40:12,030 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:40:12,032 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:40:12,033 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:40:12,035 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:40:12,038 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:40:12,038 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:40:12,038 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:40:12,040 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:40:12,041 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:40:12,042 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:40:12,043 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:40:12,044 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:40:12,047 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:40:12,049 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:40:12,049 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:40:12,049 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:40:12,054 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:40:12,055 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:40:12,055 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-09-26 21:40:12,089 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:40:12,090 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:40:12,091 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:40:12,091 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:40:12,095 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:40:12,095 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:40:12,096 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:40:12,096 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:40:12,096 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:40:12,096 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:40:12,096 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:40:12,097 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:40:12,097 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:40:12,097 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:40:12,097 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:40:12,097 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:40:12,098 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:40:12,098 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:40:12,098 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:40:12,099 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:40:12,099 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:40:12,099 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:40:12,099 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:40:12,100 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:40:12,100 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:40:12,100 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:40:12,100 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:40:12,100 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:40:12,101 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:40:12,101 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:40:12,101 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-26 21:40:12,155 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:40:12,173 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:40:12,181 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:40:12,183 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:40:12,184 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:40:12,185 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/ElevatorWithAssignments.bpl [2018-09-26 21:40:12,185 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/ElevatorWithAssignments.bpl' [2018-09-26 21:40:12,269 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:40:12,273 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:40:12,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:40:12,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:40:12,274 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:40:12,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:12" (1/1) ... [2018-09-26 21:40:12,318 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:12" (1/1) ... [2018-09-26 21:40:12,324 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 21:40:12,325 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 21:40:12,325 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 21:40:12,327 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:40:12,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:40:12,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:40:12,329 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:40:12,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:12" (1/1) ... [2018-09-26 21:40:12,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:12" (1/1) ... [2018-09-26 21:40:12,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:12" (1/1) ... [2018-09-26 21:40:12,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:12" (1/1) ... [2018-09-26 21:40:12,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:12" (1/1) ... [2018-09-26 21:40:12,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:12" (1/1) ... [2018-09-26 21:40:12,377 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:12" (1/1) ... [2018-09-26 21:40:12,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:40:12,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:40:12,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:40:12,390 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:40:12,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:12" (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-26 21:40:12,488 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Elevator given in one single declaration [2018-09-26 21:40:12,488 INFO L130 BoogieDeclarations]: Found specification of procedure Elevator [2018-09-26 21:40:12,489 INFO L138 BoogieDeclarations]: Found implementation of procedure Elevator [2018-09-26 21:40:13,055 INFO L343 CfgBuilder]: Using library mode [2018-09-26 21:40:13,056 INFO L202 PluginConnector]: Adding new model ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:40:13 BoogieIcfgContainer [2018-09-26 21:40:13,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:40:13,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:40:13,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:40:13,060 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:40:13,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:12" (1/2) ... [2018-09-26 21:40:13,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6a4321 and model type ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:40:13, skipping insertion in model container [2018-09-26 21:40:13,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:40:13" (2/2) ... [2018-09-26 21:40:13,064 INFO L112 eAbstractionObserver]: Analyzing ICFG ElevatorWithAssignments.bpl [2018-09-26 21:40:13,074 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:40:13,084 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 21:40:13,136 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:40:13,137 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:40:13,137 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:40:13,137 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:40:13,137 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:40:13,138 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:40:13,138 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:40:13,138 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:40:13,138 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:40:13,156 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-09-26 21:40:13,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-09-26 21:40:13,162 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:13,163 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-09-26 21:40:13,164 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-26 21:40:13,170 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:13,170 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-09-26 21:40:13,172 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:13,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:13,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:13,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:13,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:13,311 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-26 21:40:13,313 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:13,313 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-09-26 21:40:13,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:40:13,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:40:13,332 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:13,334 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2018-09-26 21:40:13,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:13,902 INFO L93 Difference]: Finished difference Result 84 states and 157 transitions. [2018-09-26 21:40:13,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:40:13,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-09-26 21:40:13,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:13,919 INFO L225 Difference]: With dead ends: 84 [2018-09-26 21:40:13,919 INFO L226 Difference]: Without dead ends: 54 [2018-09-26 21:40:13,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:13,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-26 21:40:13,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-09-26 21:40:13,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 21:40:13,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 93 transitions. [2018-09-26 21:40:13,963 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 93 transitions. Word has length 2 [2018-09-26 21:40:13,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:13,964 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 93 transitions. [2018-09-26 21:40:13,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:40:13,964 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 93 transitions. [2018-09-26 21:40:13,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 21:40:13,965 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:13,965 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:13,966 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-26 21:40:13,966 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:13,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1770004619, now seen corresponding path program 1 times [2018-09-26 21:40:13,966 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:13,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:13,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:13,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:13,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:14,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:14,009 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:14,009 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:40:14,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:40:14,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:40:14,012 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:14,012 INFO L87 Difference]: Start difference. First operand 53 states and 93 transitions. Second operand 3 states. [2018-09-26 21:40:14,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:14,255 INFO L93 Difference]: Finished difference Result 157 states and 277 transitions. [2018-09-26 21:40:14,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:40:14,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-09-26 21:40:14,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:14,261 INFO L225 Difference]: With dead ends: 157 [2018-09-26 21:40:14,262 INFO L226 Difference]: Without dead ends: 101 [2018-09-26 21:40:14,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:14,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-26 21:40:14,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-09-26 21:40:14,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-26 21:40:14,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 175 transitions. [2018-09-26 21:40:14,279 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 175 transitions. Word has length 14 [2018-09-26 21:40:14,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:14,279 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 175 transitions. [2018-09-26 21:40:14,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:40:14,280 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 175 transitions. [2018-09-26 21:40:14,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 21:40:14,281 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:14,281 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:14,282 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-26 21:40:14,282 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:14,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1068940041, now seen corresponding path program 1 times [2018-09-26 21:40:14,282 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:14,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:14,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:14,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:14,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:14,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:14,326 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:14,326 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:40:14,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:40:14,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:40:14,327 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:14,328 INFO L87 Difference]: Start difference. First operand 100 states and 175 transitions. Second operand 3 states. [2018-09-26 21:40:14,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:14,989 INFO L93 Difference]: Finished difference Result 205 states and 356 transitions. [2018-09-26 21:40:14,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:40:14,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-09-26 21:40:14,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:14,991 INFO L225 Difference]: With dead ends: 205 [2018-09-26 21:40:14,991 INFO L226 Difference]: Without dead ends: 104 [2018-09-26 21:40:14,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:14,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-26 21:40:15,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 89. [2018-09-26 21:40:15,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-26 21:40:15,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 152 transitions. [2018-09-26 21:40:15,005 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 152 transitions. Word has length 14 [2018-09-26 21:40:15,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:15,009 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 152 transitions. [2018-09-26 21:40:15,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:40:15,009 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 152 transitions. [2018-09-26 21:40:15,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 21:40:15,010 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:15,011 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:15,011 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-26 21:40:15,012 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:15,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1940946465, now seen corresponding path program 1 times [2018-09-26 21:40:15,012 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:15,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:15,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:15,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:15,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:15,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:15,178 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:15,178 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:40:15,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 21:40:15,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 21:40:15,179 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:15,179 INFO L87 Difference]: Start difference. First operand 89 states and 152 transitions. Second operand 5 states. [2018-09-26 21:40:15,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:15,674 INFO L93 Difference]: Finished difference Result 321 states and 545 transitions. [2018-09-26 21:40:15,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 21:40:15,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-09-26 21:40:15,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:15,680 INFO L225 Difference]: With dead ends: 321 [2018-09-26 21:40:15,683 INFO L226 Difference]: Without dead ends: 209 [2018-09-26 21:40:15,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:15,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-09-26 21:40:15,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2018-09-26 21:40:15,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-09-26 21:40:15,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 346 transitions. [2018-09-26 21:40:15,716 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 346 transitions. Word has length 19 [2018-09-26 21:40:15,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:15,716 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 346 transitions. [2018-09-26 21:40:15,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 21:40:15,716 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 346 transitions. [2018-09-26 21:40:15,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-26 21:40:15,718 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:15,718 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:15,719 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-26 21:40:15,719 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:15,719 INFO L82 PathProgramCache]: Analyzing trace with hash 2002343284, now seen corresponding path program 1 times [2018-09-26 21:40:15,719 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:15,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:15,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:15,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:15,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:15,762 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-26 21:40:15,762 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:15,763 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:40:15,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:40:15,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:40:15,764 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:15,764 INFO L87 Difference]: Start difference. First operand 207 states and 346 transitions. Second operand 3 states. [2018-09-26 21:40:15,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:15,982 INFO L93 Difference]: Finished difference Result 522 states and 865 transitions. [2018-09-26 21:40:15,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:40:15,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-09-26 21:40:15,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:15,987 INFO L225 Difference]: With dead ends: 522 [2018-09-26 21:40:15,987 INFO L226 Difference]: Without dead ends: 310 [2018-09-26 21:40:15,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:15,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-09-26 21:40:16,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 213. [2018-09-26 21:40:16,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-26 21:40:16,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 352 transitions. [2018-09-26 21:40:16,010 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 352 transitions. Word has length 41 [2018-09-26 21:40:16,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:16,010 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 352 transitions. [2018-09-26 21:40:16,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:40:16,010 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 352 transitions. [2018-09-26 21:40:16,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 21:40:16,012 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:16,012 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:16,012 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-26 21:40:16,013 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:16,013 INFO L82 PathProgramCache]: Analyzing trace with hash 2074119508, now seen corresponding path program 1 times [2018-09-26 21:40:16,013 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:16,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:16,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:16,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:16,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:16,048 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-09-26 21:40:16,049 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:16,049 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:40:16,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:40:16,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:40:16,050 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:16,050 INFO L87 Difference]: Start difference. First operand 213 states and 352 transitions. Second operand 3 states. [2018-09-26 21:40:16,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:16,660 INFO L93 Difference]: Finished difference Result 588 states and 972 transitions. [2018-09-26 21:40:16,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:40:16,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-09-26 21:40:16,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:16,664 INFO L225 Difference]: With dead ends: 588 [2018-09-26 21:40:16,664 INFO L226 Difference]: Without dead ends: 367 [2018-09-26 21:40:16,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:16,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-09-26 21:40:16,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 354. [2018-09-26 21:40:16,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-09-26 21:40:16,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 570 transitions. [2018-09-26 21:40:16,687 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 570 transitions. Word has length 42 [2018-09-26 21:40:16,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:16,687 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 570 transitions. [2018-09-26 21:40:16,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:40:16,688 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 570 transitions. [2018-09-26 21:40:16,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 21:40:16,689 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:16,690 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:16,690 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-26 21:40:16,690 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:16,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1430938278, now seen corresponding path program 1 times [2018-09-26 21:40:16,690 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:16,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:16,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:16,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:16,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:16,740 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-26 21:40:16,740 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:16,740 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:40:16,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:40:16,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:40:16,741 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:16,741 INFO L87 Difference]: Start difference. First operand 354 states and 570 transitions. Second operand 3 states. [2018-09-26 21:40:16,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:16,945 INFO L93 Difference]: Finished difference Result 880 states and 1399 transitions. [2018-09-26 21:40:16,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:40:16,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-09-26 21:40:16,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:16,952 INFO L225 Difference]: With dead ends: 880 [2018-09-26 21:40:16,953 INFO L226 Difference]: Without dead ends: 542 [2018-09-26 21:40:16,953 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:16,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-09-26 21:40:16,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 366. [2018-09-26 21:40:16,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-09-26 21:40:16,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 582 transitions. [2018-09-26 21:40:16,976 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 582 transitions. Word has length 44 [2018-09-26 21:40:16,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:16,976 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 582 transitions. [2018-09-26 21:40:16,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:40:16,979 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 582 transitions. [2018-09-26 21:40:16,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 21:40:16,984 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:16,985 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:16,985 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-26 21:40:16,985 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:16,985 INFO L82 PathProgramCache]: Analyzing trace with hash -138883553, now seen corresponding path program 1 times [2018-09-26 21:40:16,988 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:16,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:16,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:16,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:16,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:17,090 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 21:40:17,090 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:17,090 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:40:17,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:40:17,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:40:17,091 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:17,092 INFO L87 Difference]: Start difference. First operand 366 states and 582 transitions. Second operand 4 states. [2018-09-26 21:40:17,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:17,306 INFO L93 Difference]: Finished difference Result 1096 states and 1744 transitions. [2018-09-26 21:40:17,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:40:17,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-09-26 21:40:17,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:17,313 INFO L225 Difference]: With dead ends: 1096 [2018-09-26 21:40:17,314 INFO L226 Difference]: Without dead ends: 731 [2018-09-26 21:40:17,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:17,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-09-26 21:40:17,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 666. [2018-09-26 21:40:17,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2018-09-26 21:40:17,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1037 transitions. [2018-09-26 21:40:17,344 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1037 transitions. Word has length 46 [2018-09-26 21:40:17,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:17,345 INFO L480 AbstractCegarLoop]: Abstraction has 666 states and 1037 transitions. [2018-09-26 21:40:17,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:40:17,345 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1037 transitions. [2018-09-26 21:40:17,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-26 21:40:17,347 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:17,347 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:17,348 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-26 21:40:17,348 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:17,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1242691348, now seen corresponding path program 1 times [2018-09-26 21:40:17,348 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:17,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:17,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:17,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:17,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:18,004 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:18,004 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:40:18,004 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-26 21:40:18,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:18,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:40:19,131 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:19,155 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:40:19,155 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-09-26 21:40:19,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:40:19,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:40:19,156 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:19,156 INFO L87 Difference]: Start difference. First operand 666 states and 1037 transitions. Second operand 8 states. [2018-09-26 21:40:20,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:20,714 INFO L93 Difference]: Finished difference Result 1293 states and 2002 transitions. [2018-09-26 21:40:20,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 21:40:20,715 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-09-26 21:40:20,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:20,722 INFO L225 Difference]: With dead ends: 1293 [2018-09-26 21:40:20,722 INFO L226 Difference]: Without dead ends: 1292 [2018-09-26 21:40:20,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:20,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2018-09-26 21:40:20,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1176. [2018-09-26 21:40:20,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-09-26 21:40:20,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1825 transitions. [2018-09-26 21:40:20,770 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1825 transitions. Word has length 49 [2018-09-26 21:40:20,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:20,771 INFO L480 AbstractCegarLoop]: Abstraction has 1176 states and 1825 transitions. [2018-09-26 21:40:20,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:40:20,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1825 transitions. [2018-09-26 21:40:20,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-26 21:40:20,773 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:20,774 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:20,774 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-26 21:40:20,774 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:20,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1557173637, now seen corresponding path program 1 times [2018-09-26 21:40:20,775 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:20,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:20,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:20,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:20,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:20,985 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-09-26 21:40:20,986 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:20,986 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:40:20,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:40:20,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:40:20,987 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:20,987 INFO L87 Difference]: Start difference. First operand 1176 states and 1825 transitions. Second operand 4 states. [2018-09-26 21:40:21,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:21,507 INFO L93 Difference]: Finished difference Result 2655 states and 4085 transitions. [2018-09-26 21:40:21,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 21:40:21,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-09-26 21:40:21,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:21,517 INFO L225 Difference]: With dead ends: 2655 [2018-09-26 21:40:21,518 INFO L226 Difference]: Without dead ends: 1510 [2018-09-26 21:40:21,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:21,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-09-26 21:40:21,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1468. [2018-09-26 21:40:21,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1468 states. [2018-09-26 21:40:21,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 2236 transitions. [2018-09-26 21:40:21,575 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 2236 transitions. Word has length 67 [2018-09-26 21:40:21,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:21,575 INFO L480 AbstractCegarLoop]: Abstraction has 1468 states and 2236 transitions. [2018-09-26 21:40:21,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:40:21,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 2236 transitions. [2018-09-26 21:40:21,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-26 21:40:21,578 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:21,578 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:21,578 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-26 21:40:21,579 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:21,580 INFO L82 PathProgramCache]: Analyzing trace with hash -423460397, now seen corresponding path program 1 times [2018-09-26 21:40:21,580 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:21,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:21,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:21,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:21,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:21,783 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-09-26 21:40:21,783 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:21,783 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:40:21,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:40:21,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:40:21,784 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:21,784 INFO L87 Difference]: Start difference. First operand 1468 states and 2236 transitions. Second operand 4 states. [2018-09-26 21:40:21,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:21,954 INFO L93 Difference]: Finished difference Result 2726 states and 4172 transitions. [2018-09-26 21:40:21,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:40:21,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-09-26 21:40:21,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:21,962 INFO L225 Difference]: With dead ends: 2726 [2018-09-26 21:40:21,962 INFO L226 Difference]: Without dead ends: 1469 [2018-09-26 21:40:21,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:21,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2018-09-26 21:40:22,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1466. [2018-09-26 21:40:22,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1466 states. [2018-09-26 21:40:22,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 2172 transitions. [2018-09-26 21:40:22,013 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 2172 transitions. Word has length 68 [2018-09-26 21:40:22,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:22,014 INFO L480 AbstractCegarLoop]: Abstraction has 1466 states and 2172 transitions. [2018-09-26 21:40:22,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:40:22,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 2172 transitions. [2018-09-26 21:40:22,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-09-26 21:40:22,016 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:22,016 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:22,017 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-26 21:40:22,017 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:22,017 INFO L82 PathProgramCache]: Analyzing trace with hash -734626103, now seen corresponding path program 2 times [2018-09-26 21:40:22,017 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:22,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:22,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:22,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:22,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:22,115 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-09-26 21:40:22,115 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:22,115 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:40:22,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:40:22,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:40:22,116 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:22,116 INFO L87 Difference]: Start difference. First operand 1466 states and 2172 transitions. Second operand 3 states. [2018-09-26 21:40:22,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:22,597 INFO L93 Difference]: Finished difference Result 2942 states and 4353 transitions. [2018-09-26 21:40:22,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:40:22,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-09-26 21:40:22,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:22,607 INFO L225 Difference]: With dead ends: 2942 [2018-09-26 21:40:22,608 INFO L226 Difference]: Without dead ends: 1457 [2018-09-26 21:40:22,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:22,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2018-09-26 21:40:22,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1397. [2018-09-26 21:40:22,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1397 states. [2018-09-26 21:40:22,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 2012 transitions. [2018-09-26 21:40:22,654 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 2012 transitions. Word has length 69 [2018-09-26 21:40:22,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:22,654 INFO L480 AbstractCegarLoop]: Abstraction has 1397 states and 2012 transitions. [2018-09-26 21:40:22,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:40:22,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 2012 transitions. [2018-09-26 21:40:22,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-26 21:40:22,657 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:22,657 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:22,657 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-26 21:40:22,657 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:22,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1023158359, now seen corresponding path program 1 times [2018-09-26 21:40:22,658 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:22,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:22,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:22,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:40:22,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:22,715 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-09-26 21:40:22,715 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:22,715 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:40:22,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:40:22,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:40:22,716 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:22,716 INFO L87 Difference]: Start difference. First operand 1397 states and 2012 transitions. Second operand 3 states. [2018-09-26 21:40:22,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:22,833 INFO L93 Difference]: Finished difference Result 3297 states and 4763 transitions. [2018-09-26 21:40:22,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:40:22,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-09-26 21:40:22,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:22,847 INFO L225 Difference]: With dead ends: 3297 [2018-09-26 21:40:22,847 INFO L226 Difference]: Without dead ends: 1830 [2018-09-26 21:40:22,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:22,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2018-09-26 21:40:22,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1612. [2018-09-26 21:40:22,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1612 states. [2018-09-26 21:40:22,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2296 transitions. [2018-09-26 21:40:22,897 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2296 transitions. Word has length 84 [2018-09-26 21:40:22,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:22,897 INFO L480 AbstractCegarLoop]: Abstraction has 1612 states and 2296 transitions. [2018-09-26 21:40:22,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:40:22,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2296 transitions. [2018-09-26 21:40:22,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-26 21:40:22,900 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:22,900 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:22,901 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-26 21:40:22,901 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:22,901 INFO L82 PathProgramCache]: Analyzing trace with hash -147951611, now seen corresponding path program 1 times [2018-09-26 21:40:22,901 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:22,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:22,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:22,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:22,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:23,758 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 16 proven. 116 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-26 21:40:23,758 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:40:23,758 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-26 21:40:23,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:23,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:40:25,836 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 31 proven. 100 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-26 21:40:25,857 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:40:25,857 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2018-09-26 21:40:25,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 21:40:25,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 21:40:25,858 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:25,858 INFO L87 Difference]: Start difference. First operand 1612 states and 2296 transitions. Second operand 14 states. [2018-09-26 21:40:29,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:29,505 INFO L93 Difference]: Finished difference Result 3128 states and 4425 transitions. [2018-09-26 21:40:29,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 21:40:29,506 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 85 [2018-09-26 21:40:29,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:29,520 INFO L225 Difference]: With dead ends: 3128 [2018-09-26 21:40:29,521 INFO L226 Difference]: Without dead ends: 3127 [2018-09-26 21:40:29,522 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:29,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3127 states. [2018-09-26 21:40:29,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3127 to 1270. [2018-09-26 21:40:29,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1270 states. [2018-09-26 21:40:29,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1805 transitions. [2018-09-26 21:40:29,577 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1805 transitions. Word has length 85 [2018-09-26 21:40:29,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:29,577 INFO L480 AbstractCegarLoop]: Abstraction has 1270 states and 1805 transitions. [2018-09-26 21:40:29,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 21:40:29,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1805 transitions. [2018-09-26 21:40:29,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-26 21:40:29,581 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:29,581 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:29,581 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-26 21:40:29,582 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:29,582 INFO L82 PathProgramCache]: Analyzing trace with hash -2004113356, now seen corresponding path program 1 times [2018-09-26 21:40:29,582 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:29,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:29,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:29,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:29,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:29,657 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-09-26 21:40:29,657 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:29,657 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:40:29,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:40:29,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:40:29,658 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:29,658 INFO L87 Difference]: Start difference. First operand 1270 states and 1805 transitions. Second operand 3 states. [2018-09-26 21:40:29,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:29,818 INFO L93 Difference]: Finished difference Result 2399 states and 3394 transitions. [2018-09-26 21:40:29,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:40:29,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-09-26 21:40:29,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:29,827 INFO L225 Difference]: With dead ends: 2399 [2018-09-26 21:40:29,827 INFO L226 Difference]: Without dead ends: 1130 [2018-09-26 21:40:29,829 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:29,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2018-09-26 21:40:29,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1129. [2018-09-26 21:40:29,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1129 states. [2018-09-26 21:40:29,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1537 transitions. [2018-09-26 21:40:29,873 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1537 transitions. Word has length 87 [2018-09-26 21:40:29,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:29,874 INFO L480 AbstractCegarLoop]: Abstraction has 1129 states and 1537 transitions. [2018-09-26 21:40:29,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:40:29,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1537 transitions. [2018-09-26 21:40:29,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-26 21:40:29,877 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:29,878 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:29,878 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-26 21:40:29,878 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:29,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1082348105, now seen corresponding path program 1 times [2018-09-26 21:40:29,878 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:29,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:29,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:29,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:29,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:29,965 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-09-26 21:40:29,966 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:29,966 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:40:29,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:40:29,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:40:29,967 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:29,967 INFO L87 Difference]: Start difference. First operand 1129 states and 1537 transitions. Second operand 3 states. [2018-09-26 21:40:30,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:30,436 INFO L93 Difference]: Finished difference Result 2013 states and 2713 transitions. [2018-09-26 21:40:30,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:40:30,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-09-26 21:40:30,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:30,439 INFO L225 Difference]: With dead ends: 2013 [2018-09-26 21:40:30,439 INFO L226 Difference]: Without dead ends: 850 [2018-09-26 21:40:30,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:30,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2018-09-26 21:40:30,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 700. [2018-09-26 21:40:30,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2018-09-26 21:40:30,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 909 transitions. [2018-09-26 21:40:30,467 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 909 transitions. Word has length 87 [2018-09-26 21:40:30,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:30,467 INFO L480 AbstractCegarLoop]: Abstraction has 700 states and 909 transitions. [2018-09-26 21:40:30,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:40:30,468 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 909 transitions. [2018-09-26 21:40:30,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-26 21:40:30,469 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:30,470 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:30,470 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-26 21:40:30,470 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:30,470 INFO L82 PathProgramCache]: Analyzing trace with hash -951849668, now seen corresponding path program 1 times [2018-09-26 21:40:30,470 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:30,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:30,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:30,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:30,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:31,161 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 107 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-09-26 21:40:31,161 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:40:31,162 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-26 21:40:31,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:31,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:40:31,382 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 107 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-09-26 21:40:31,406 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:40:31,406 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2018-09-26 21:40:31,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 21:40:31,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 21:40:31,407 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:31,407 INFO L87 Difference]: Start difference. First operand 700 states and 909 transitions. Second operand 11 states. [2018-09-26 21:40:33,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:33,489 INFO L93 Difference]: Finished difference Result 1537 states and 1981 transitions. [2018-09-26 21:40:33,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 21:40:33,489 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2018-09-26 21:40:33,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:33,494 INFO L225 Difference]: With dead ends: 1537 [2018-09-26 21:40:33,494 INFO L226 Difference]: Without dead ends: 1017 [2018-09-26 21:40:33,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:33,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2018-09-26 21:40:33,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 761. [2018-09-26 21:40:33,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2018-09-26 21:40:33,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 978 transitions. [2018-09-26 21:40:33,532 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 978 transitions. Word has length 90 [2018-09-26 21:40:33,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:33,532 INFO L480 AbstractCegarLoop]: Abstraction has 761 states and 978 transitions. [2018-09-26 21:40:33,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 21:40:33,533 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 978 transitions. [2018-09-26 21:40:33,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-09-26 21:40:33,535 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:33,535 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:33,536 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-26 21:40:33,536 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:33,536 INFO L82 PathProgramCache]: Analyzing trace with hash 21511062, now seen corresponding path program 1 times [2018-09-26 21:40:33,536 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:33,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:33,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:33,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:33,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:33,639 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 160 proven. 13 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-26 21:40:33,639 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:40:33,639 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-26 21:40:33,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:33,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:40:33,785 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-09-26 21:40:33,816 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-26 21:40:33,816 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-09-26 21:40:33,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 21:40:33,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 21:40:33,817 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:33,818 INFO L87 Difference]: Start difference. First operand 761 states and 978 transitions. Second operand 5 states. [2018-09-26 21:40:33,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:33,991 INFO L93 Difference]: Finished difference Result 1396 states and 1798 transitions. [2018-09-26 21:40:33,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 21:40:33,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-09-26 21:40:33,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:33,994 INFO L225 Difference]: With dead ends: 1396 [2018-09-26 21:40:33,994 INFO L226 Difference]: Without dead ends: 661 [2018-09-26 21:40:33,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:33,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2018-09-26 21:40:34,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2018-09-26 21:40:34,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2018-09-26 21:40:34,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 792 transitions. [2018-09-26 21:40:34,019 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 792 transitions. Word has length 99 [2018-09-26 21:40:34,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:34,019 INFO L480 AbstractCegarLoop]: Abstraction has 661 states and 792 transitions. [2018-09-26 21:40:34,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 21:40:34,019 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 792 transitions. [2018-09-26 21:40:34,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-09-26 21:40:34,021 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:34,021 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:34,021 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-26 21:40:34,022 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:34,022 INFO L82 PathProgramCache]: Analyzing trace with hash -224853863, now seen corresponding path program 1 times [2018-09-26 21:40:34,022 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:34,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:34,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:34,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:34,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:34,088 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-09-26 21:40:34,088 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:34,088 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:40:34,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:40:34,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:40:34,089 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:34,089 INFO L87 Difference]: Start difference. First operand 661 states and 792 transitions. Second operand 3 states. [2018-09-26 21:40:34,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:34,179 INFO L93 Difference]: Finished difference Result 1306 states and 1552 transitions. [2018-09-26 21:40:34,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:40:34,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2018-09-26 21:40:34,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:34,181 INFO L225 Difference]: With dead ends: 1306 [2018-09-26 21:40:34,181 INFO L226 Difference]: Without dead ends: 667 [2018-09-26 21:40:34,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:34,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-09-26 21:40:34,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 607. [2018-09-26 21:40:34,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2018-09-26 21:40:34,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 700 transitions. [2018-09-26 21:40:34,206 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 700 transitions. Word has length 103 [2018-09-26 21:40:34,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:34,206 INFO L480 AbstractCegarLoop]: Abstraction has 607 states and 700 transitions. [2018-09-26 21:40:34,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:40:34,206 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 700 transitions. [2018-09-26 21:40:34,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-26 21:40:34,208 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:34,208 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:34,208 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-26 21:40:34,208 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:34,209 INFO L82 PathProgramCache]: Analyzing trace with hash 707364856, now seen corresponding path program 1 times [2018-09-26 21:40:34,209 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:34,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:34,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:34,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:34,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:34,276 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-09-26 21:40:34,277 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:34,277 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:40:34,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 21:40:34,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 21:40:34,277 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:34,278 INFO L87 Difference]: Start difference. First operand 607 states and 700 transitions. Second operand 5 states. [2018-09-26 21:40:34,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:34,387 INFO L93 Difference]: Finished difference Result 930 states and 1072 transitions. [2018-09-26 21:40:34,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 21:40:34,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2018-09-26 21:40:34,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:34,388 INFO L225 Difference]: With dead ends: 930 [2018-09-26 21:40:34,388 INFO L226 Difference]: Without dead ends: 336 [2018-09-26 21:40:34,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:34,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-09-26 21:40:34,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 335. [2018-09-26 21:40:34,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-09-26 21:40:34,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 382 transitions. [2018-09-26 21:40:34,401 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 382 transitions. Word has length 108 [2018-09-26 21:40:34,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:34,401 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 382 transitions. [2018-09-26 21:40:34,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 21:40:34,401 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 382 transitions. [2018-09-26 21:40:34,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-26 21:40:34,403 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:34,403 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:34,403 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-26 21:40:34,404 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:34,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1140799292, now seen corresponding path program 1 times [2018-09-26 21:40:34,404 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:34,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:34,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:34,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:34,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:34,494 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-09-26 21:40:34,495 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:34,495 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:40:34,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:40:34,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:40:34,495 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:34,496 INFO L87 Difference]: Start difference. First operand 335 states and 382 transitions. Second operand 3 states. [2018-09-26 21:40:34,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:34,638 INFO L93 Difference]: Finished difference Result 663 states and 757 transitions. [2018-09-26 21:40:34,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:40:34,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-09-26 21:40:34,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:34,640 INFO L225 Difference]: With dead ends: 663 [2018-09-26 21:40:34,640 INFO L226 Difference]: Without dead ends: 335 [2018-09-26 21:40:34,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:34,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-09-26 21:40:34,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 331. [2018-09-26 21:40:34,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-09-26 21:40:34,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 373 transitions. [2018-09-26 21:40:34,652 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 373 transitions. Word has length 116 [2018-09-26 21:40:34,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:34,652 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 373 transitions. [2018-09-26 21:40:34,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:40:34,653 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 373 transitions. [2018-09-26 21:40:34,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-26 21:40:34,654 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:34,654 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:34,654 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-26 21:40:34,655 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:34,655 INFO L82 PathProgramCache]: Analyzing trace with hash 166395550, now seen corresponding path program 2 times [2018-09-26 21:40:34,655 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:34,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:34,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:34,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:34,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:35,066 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 20 proven. 266 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-09-26 21:40:35,066 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:40:35,066 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:40:35,075 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:40:35,116 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:40:35,116 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:40:35,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:40:36,087 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 35 proven. 250 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-09-26 21:40:36,107 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:40:36,107 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-09-26 21:40:36,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 21:40:36,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 21:40:36,108 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:36,108 INFO L87 Difference]: Start difference. First operand 331 states and 373 transitions. Second operand 18 states. [2018-09-26 21:40:40,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:40,692 INFO L93 Difference]: Finished difference Result 1064 states and 1203 transitions. [2018-09-26 21:40:40,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 21:40:40,696 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 121 [2018-09-26 21:40:40,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:40,701 INFO L225 Difference]: With dead ends: 1064 [2018-09-26 21:40:40,701 INFO L226 Difference]: Without dead ends: 1063 [2018-09-26 21:40:40,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 112 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:40,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2018-09-26 21:40:40,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 419. [2018-09-26 21:40:40,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-09-26 21:40:40,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 471 transitions. [2018-09-26 21:40:40,720 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 471 transitions. Word has length 121 [2018-09-26 21:40:40,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:40,720 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 471 transitions. [2018-09-26 21:40:40,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 21:40:40,720 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 471 transitions. [2018-09-26 21:40:40,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-26 21:40:40,721 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:40,721 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:40,721 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-26 21:40:40,722 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:40,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1620918566, now seen corresponding path program 1 times [2018-09-26 21:40:40,722 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:40,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:40,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:40,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:40:40,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:41,063 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-09-26 21:40:41,063 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:41,063 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 21:40:41,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 21:40:41,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 21:40:41,064 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:41,064 INFO L87 Difference]: Start difference. First operand 419 states and 471 transitions. Second operand 5 states. [2018-09-26 21:40:41,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:41,237 INFO L93 Difference]: Finished difference Result 673 states and 755 transitions. [2018-09-26 21:40:41,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 21:40:41,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2018-09-26 21:40:41,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:41,239 INFO L225 Difference]: With dead ends: 673 [2018-09-26 21:40:41,239 INFO L226 Difference]: Without dead ends: 468 [2018-09-26 21:40:41,240 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:41,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-09-26 21:40:41,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 412. [2018-09-26 21:40:41,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-09-26 21:40:41,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 463 transitions. [2018-09-26 21:40:41,255 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 463 transitions. Word has length 122 [2018-09-26 21:40:41,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:41,255 INFO L480 AbstractCegarLoop]: Abstraction has 412 states and 463 transitions. [2018-09-26 21:40:41,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 21:40:41,256 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 463 transitions. [2018-09-26 21:40:41,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-09-26 21:40:41,256 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:41,257 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:41,257 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-26 21:40:41,257 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:41,257 INFO L82 PathProgramCache]: Analyzing trace with hash -768532907, now seen corresponding path program 1 times [2018-09-26 21:40:41,257 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:41,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:41,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:41,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:41,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:41,395 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 202 proven. 50 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-09-26 21:40:41,395 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:40:41,395 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:40:41,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:41,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:40:41,792 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 139 proven. 131 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-09-26 21:40:41,813 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:40:41,813 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-09-26 21:40:41,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 21:40:41,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 21:40:41,814 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:41,814 INFO L87 Difference]: Start difference. First operand 412 states and 463 transitions. Second operand 10 states. [2018-09-26 21:40:42,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:42,545 INFO L93 Difference]: Finished difference Result 845 states and 948 transitions. [2018-09-26 21:40:42,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 21:40:42,546 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2018-09-26 21:40:42,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:42,550 INFO L225 Difference]: With dead ends: 845 [2018-09-26 21:40:42,551 INFO L226 Difference]: Without dead ends: 844 [2018-09-26 21:40:42,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:42,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2018-09-26 21:40:42,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 570. [2018-09-26 21:40:42,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-09-26 21:40:42,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 638 transitions. [2018-09-26 21:40:42,577 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 638 transitions. Word has length 123 [2018-09-26 21:40:42,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:42,577 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 638 transitions. [2018-09-26 21:40:42,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 21:40:42,578 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 638 transitions. [2018-09-26 21:40:42,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-09-26 21:40:42,579 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:42,579 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:42,579 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-26 21:40:42,580 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:42,580 INFO L82 PathProgramCache]: Analyzing trace with hash 242817106, now seen corresponding path program 3 times [2018-09-26 21:40:42,580 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:42,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:42,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:42,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:42,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2018-09-26 21:40:42,682 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:42,682 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:40:42,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:40:42,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:40:42,683 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:42,683 INFO L87 Difference]: Start difference. First operand 570 states and 638 transitions. Second operand 3 states. [2018-09-26 21:40:42,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:42,774 INFO L93 Difference]: Finished difference Result 1086 states and 1213 transitions. [2018-09-26 21:40:42,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:40:42,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2018-09-26 21:40:42,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:42,776 INFO L225 Difference]: With dead ends: 1086 [2018-09-26 21:40:42,776 INFO L226 Difference]: Without dead ends: 479 [2018-09-26 21:40:42,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:42,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-09-26 21:40:42,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 382. [2018-09-26 21:40:42,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-09-26 21:40:42,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 413 transitions. [2018-09-26 21:40:42,801 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 413 transitions. Word has length 159 [2018-09-26 21:40:42,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:42,802 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 413 transitions. [2018-09-26 21:40:42,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:40:42,802 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 413 transitions. [2018-09-26 21:40:42,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-09-26 21:40:42,803 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:42,803 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:42,803 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2018-09-26 21:40:42,803 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:42,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1109443822, now seen corresponding path program 1 times [2018-09-26 21:40:42,804 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:42,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:42,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:42,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:40:42,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:43,565 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 25 proven. 471 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-09-26 21:40:43,565 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:40:43,566 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:40:43,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:43,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:40:44,757 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 308 proven. 86 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-09-26 21:40:44,778 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:40:44,778 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 20 [2018-09-26 21:40:44,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 21:40:44,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 21:40:44,779 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:44,779 INFO L87 Difference]: Start difference. First operand 382 states and 413 transitions. Second operand 21 states. [2018-09-26 21:40:50,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:50,648 INFO L93 Difference]: Finished difference Result 970 states and 1050 transitions. [2018-09-26 21:40:50,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 21:40:50,649 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 159 [2018-09-26 21:40:50,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:50,649 INFO L225 Difference]: With dead ends: 970 [2018-09-26 21:40:50,650 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 21:40:50,651 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 165 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:50,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 21:40:50,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 21:40:50,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 21:40:50,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 21:40:50,652 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 159 [2018-09-26 21:40:50,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:50,652 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 21:40:50,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 21:40:50,652 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 21:40:50,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 21:40:50,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 21:40:51,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:40:51,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:40:53,140 WARN L178 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 666 DAG size of output: 595 [2018-09-26 21:41:00,916 WARN L178 SmtUtils]: Spent 7.76 s on a formula simplification. DAG size of input: 573 DAG size of output: 165 [2018-09-26 21:41:00,921 INFO L426 ceAbstractionStarter]: For program point L143(lines 143 161) no Hoare annotation was computed. [2018-09-26 21:41:00,921 INFO L426 ceAbstractionStarter]: For program point L127(lines 127 138) no Hoare annotation was computed. [2018-09-26 21:41:00,921 INFO L426 ceAbstractionStarter]: For program point L70-1(lines 70 96) no Hoare annotation was computed. [2018-09-26 21:41:00,921 INFO L426 ceAbstractionStarter]: For program point L153(lines 153 161) no Hoare annotation was computed. [2018-09-26 21:41:00,922 INFO L426 ceAbstractionStarter]: For program point L87(lines 87 96) no Hoare annotation was computed. [2018-09-26 21:41:00,922 INFO L426 ceAbstractionStarter]: For program point L112(lines 112 120) no Hoare annotation was computed. [2018-09-26 21:41:00,922 INFO L426 ceAbstractionStarter]: For program point L79(lines 79 96) no Hoare annotation was computed. [2018-09-26 21:41:00,922 INFO L426 ceAbstractionStarter]: For program point L146(lines 146 161) no Hoare annotation was computed. [2018-09-26 21:41:00,922 INFO L426 ceAbstractionStarter]: For program point ElevatorErr0ASSERT_VIOLATIONINVARIANTandASSERT(lines 48 55) no Hoare annotation was computed. [2018-09-26 21:41:00,922 INFO L426 ceAbstractionStarter]: For program point L47-1(lines 13 164) no Hoare annotation was computed. [2018-09-26 21:41:00,922 INFO L426 ceAbstractionStarter]: For program point L130(lines 130 138) no Hoare annotation was computed. [2018-09-26 21:41:00,922 INFO L426 ceAbstractionStarter]: For program point L89(lines 89 96) no Hoare annotation was computed. [2018-09-26 21:41:00,922 INFO L426 ceAbstractionStarter]: For program point L156(lines 156 161) no Hoare annotation was computed. [2018-09-26 21:41:00,923 INFO L422 ceAbstractionStarter]: At program point L156-2(lines 47 162) the Hoare annotation is: (let ((.cse46 (+ Elevator_dir Elevator_goal))) (let ((.cse16 (<= Elevator_min Elevator_current)) (.cse17 (<= Elevator_current Elevator_max)) (.cse50 (= Elevator_current Elevator_goal)) (.cse30 (<= .cse46 (+ Elevator_max 1))) (.cse49 (+ Elevator_dir 1)) (.cse36 (+ Elevator_dir Elevator_current))) (let ((.cse42 (<= (+ Elevator_min 2) .cse36)) (.cse44 (<= (+ Elevator_current Elevator_min) (+ Elevator_dir (* 2 Elevator_goal) 2))) (.cse25 (not (= Elevator_goal Elevator_current))) (.cse45 (<= Elevator_current (+ Elevator_dir Elevator_min))) (.cse47 (= Elevator_dir 1)) (.cse48 (= .cse49 0)) (.cse37 (and (<= .cse36 Elevator_goal) .cse30)) (.cse43 (<= Elevator_goal Elevator_current)) (.cse3 (not Elevator_stop)) (.cse12 (not .cse50)) (.cse6 (= Elevator_qDC2 2)) (.cse2 (<= Elevator_qDC1 1)) (.cse24 (not Elevator_passed)) (.cse13 (= Elevator_qDC1 2)) (.cse23 (and .cse16 .cse17)) (.cse32 (= Elevator_qCSP 1)) (.cse7 (= Elevator_qCSP 3))) (let ((.cse14 (not .cse7)) (.cse15 (not .cse32)) (.cse5 (= Elevator_current Elevator_min)) (.cse33 (= Elevator_qDC2 1)) (.cse38 (and .cse13 .cse23 .cse32)) (.cse39 (and .cse3 (and .cse12 .cse6 .cse23 .cse2 .cse24))) (.cse35 (= Elevator_min Elevator_current)) (.cse0 (not (= Elevator_min Elevator_goal))) (.cse34 (or .cse43 (<= Elevator_dir 1))) (.cse9 (or (<= .cse49 0) .cse50 .cse37)) (.cse21 (or (<= Elevator_current Elevator_goal) .cse48)) (.cse22 (and .cse3 (and .cse12 .cse13 .cse6 .cse23))) (.cse8 (or .cse43 .cse47)) (.cse10 (or .cse42 (and .cse43 (and .cse44 .cse25)) .cse45)) (.cse26 (or (<= Elevator_current .cse46) .cse48)) (.cse27 (or (and (<= (+ Elevator_current 1) Elevator_max) .cse16) (and .cse17 (<= (+ Elevator_min 1) Elevator_current)))) (.cse28 (not (= .cse46 Elevator_current))) (.cse29 (or (<= .cse46 Elevator_current) .cse47)) (.cse11 (<= Elevator_c2 2)) (.cse1 (not Elevator_newgoal)) (.cse4 (<= Elevator_c2 Elevator_c3)) (.cse40 (= Elevator_qDC2 3)) (.cse18 (<= Elevator_goal Elevator_max)) (.cse19 (<= Elevator_min Elevator_goal)) (.cse31 (or .cse42 (and .cse43 (or .cse44 (< Elevator_current (+ Elevator_goal 1)))) .cse45)) (.cse20 (not Elevator_start))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10) (and (and .cse11 .cse12 (and .cse3 .cse13 .cse14 .cse6 .cse15) .cse16 .cse17 .cse4 .cse18 .cse19) .cse20) (and .cse21 (and (and .cse11 (and .cse22 .cse1 .cse7)) .cse18 .cse19) .cse8) (and (and .cse4 (and (and .cse3 (and .cse14 .cse6 .cse23 .cse2 .cse24)) .cse15) .cse18 .cse19) .cse25 .cse20) (and .cse26 .cse27 .cse28 .cse19 .cse29 .cse30 .cse31 (and .cse4 (and (and .cse32 .cse2 .cse24) .cse33 .cse1)) .cse20) (and .cse34 (and .cse4 (and .cse35 (and .cse3 (and (and .cse0 (and .cse14 .cse2)) .cse6) .cse15)) .cse18 .cse19) .cse10 .cse20) (and .cse34 (and (and .cse33 (and .cse4 (and (and .cse2 .cse32) .cse5))) .cse18) (<= Elevator_min .cse36) (or .cse25 (<= (+ Elevator_dir Elevator_current 1) Elevator_max)) .cse37) (and .cse26 .cse27 .cse28 .cse29 (and .cse11 .cse4 .cse18 .cse19 (and .cse38 .cse33 .cse1)) .cse31 .cse20) (and .cse21 (and .cse18 .cse19 (and .cse39 .cse1 .cse7)) .cse8) (and .cse4 (and .cse3 .cse38 .cse40) .cse24) (and .cse3 .cse4 .cse13 (and .cse12 .cse23) .cse40 .cse24) (and .cse21 .cse8 .cse10 .cse20 (and .cse4 (and .cse39 .cse1) .cse18 .cse19)) (and (and (and .cse3 .cse4 .cse35 (and (and .cse0 .cse2 .cse32) .cse6) .cse1) .cse18) .cse34 .cse9 .cse10 .cse20) (and .cse21 (and .cse11 .cse4 (and .cse22 .cse1)) .cse18 .cse19 .cse8 .cse10 .cse20) (and .cse26 .cse27 .cse28 .cse29 (and (and .cse11 (and .cse1 (let ((.cse41 (and .cse3 (and .cse13 .cse23) .cse40))) (or (and (<= 0 Elevator_c3) .cse41 (<= Elevator_c2 0)) (and .cse4 .cse41 .cse24))) .cse7)) .cse18 .cse19) .cse31 .cse20)))))) [2018-09-26 21:41:00,923 INFO L426 ceAbstractionStarter]: For program point L115(lines 115 120) no Hoare annotation was computed. [2018-09-26 21:41:00,923 INFO L426 ceAbstractionStarter]: For program point L82(lines 82 96) no Hoare annotation was computed. [2018-09-26 21:41:00,924 INFO L426 ceAbstractionStarter]: For program point L115-2(lines 99 138) no Hoare annotation was computed. [2018-09-26 21:41:00,924 INFO L426 ceAbstractionStarter]: For program point L107(lines 107 120) no Hoare annotation was computed. [2018-09-26 21:41:00,924 INFO L426 ceAbstractionStarter]: For program point ElevatorEXIT(lines 13 164) no Hoare annotation was computed. [2018-09-26 21:41:00,924 INFO L426 ceAbstractionStarter]: For program point L91(lines 91 96) no Hoare annotation was computed. [2018-09-26 21:41:00,924 INFO L426 ceAbstractionStarter]: For program point L91-2(lines 77 120) no Hoare annotation was computed. [2018-09-26 21:41:00,924 INFO L426 ceAbstractionStarter]: For program point L149(lines 149 161) no Hoare annotation was computed. [2018-09-26 21:41:00,924 INFO L426 ceAbstractionStarter]: For program point L133(lines 133 138) no Hoare annotation was computed. [2018-09-26 21:41:00,924 INFO L426 ceAbstractionStarter]: For program point L67(lines 67 69) no Hoare annotation was computed. [2018-09-26 21:41:00,924 INFO L426 ceAbstractionStarter]: For program point L133-2(lines 123 161) no Hoare annotation was computed. [2018-09-26 21:41:00,925 INFO L426 ceAbstractionStarter]: For program point L67-2(lines 67 72) no Hoare annotation was computed. [2018-09-26 21:41:00,925 INFO L426 ceAbstractionStarter]: For program point ElevatorENTRY(lines 13 164) no Hoare annotation was computed. [2018-09-26 21:41:00,925 INFO L426 ceAbstractionStarter]: For program point L84(lines 84 96) no Hoare annotation was computed. [2018-09-26 21:41:00,925 INFO L426 ceAbstractionStarter]: For program point L101(lines 101 120) no Hoare annotation was computed. [2018-09-26 21:41:00,948 INFO L202 PluginConnector]: Adding new model ElevatorWithAssignments.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 09:41:00 BoogieIcfgContainer [2018-09-26 21:41:00,948 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:41:00,949 INFO L168 Benchmark]: Toolchain (without parser) took 48679.89 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 581.4 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -62.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-09-26 21:41:00,951 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.30 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-26 21:41:00,951 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.87 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-26 21:41:00,952 INFO L168 Benchmark]: Boogie Preprocessor took 59.85 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-26 21:41:00,952 INFO L168 Benchmark]: RCFGBuilder took 667.67 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-26 21:41:00,953 INFO L168 Benchmark]: TraceAbstraction took 47891.50 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 581.4 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -93.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-09-26 21:41:00,958 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.30 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 53.87 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 59.85 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 667.67 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 47891.50 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 581.4 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -93.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: loop invariant is valid and assertion always holds For all program executions holds that loop invariant is valid and assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(min == goal) && !newgoal) && qDC1 <= 1) && !stop) && c2 <= c3) && current == min) && qDC2 == 2) && qCSP == 3) && (goal <= current || dir == 1)) && ((dir + 1 <= 0 || current == goal) || (dir + current <= goal && dir + goal <= max + 1))) && ((min + 2 <= dir + current || (goal <= current && current + min <= dir + 2 * goal + 2 && !(goal == current))) || current <= dir + min)) || ((((((((c2 <= 2 && !(current == goal)) && (((!stop && qDC1 == 2) && !(qCSP == 3)) && qDC2 == 2) && !(qCSP == 1)) && min <= current) && current <= max) && c2 <= c3) && goal <= max) && min <= goal) && !start)) || (((current <= goal || dir + 1 == 0) && ((c2 <= 2 && ((!stop && ((!(current == goal) && qDC1 == 2) && qDC2 == 2) && min <= current && current <= max) && !newgoal) && qCSP == 3) && goal <= max) && min <= goal) && (goal <= current || dir == 1))) || (((((c2 <= c3 && (!stop && (((!(qCSP == 3) && qDC2 == 2) && min <= current && current <= max) && qDC1 <= 1) && !passed) && !(qCSP == 1)) && goal <= max) && min <= goal) && !(goal == current)) && !start)) || (((((((((current <= dir + goal || dir + 1 == 0) && ((current + 1 <= max && min <= current) || (current <= max && min + 1 <= current))) && !(dir + goal == current)) && min <= goal) && (dir + goal <= current || dir == 1)) && dir + goal <= max + 1) && ((min + 2 <= dir + current || (goal <= current && (current + min <= dir + 2 * goal + 2 || current < goal + 1))) || current <= dir + min)) && c2 <= c3 && (((qCSP == 1 && qDC1 <= 1) && !passed) && qDC2 == 1) && !newgoal) && !start)) || ((((goal <= current || dir <= 1) && ((c2 <= c3 && min == current && (!stop && (!(min == goal) && !(qCSP == 3) && qDC1 <= 1) && qDC2 == 2) && !(qCSP == 1)) && goal <= max) && min <= goal) && ((min + 2 <= dir + current || (goal <= current && current + min <= dir + 2 * goal + 2 && !(goal == current))) || current <= dir + min)) && !start)) || (((((goal <= current || dir <= 1) && (qDC2 == 1 && c2 <= c3 && (qDC1 <= 1 && qCSP == 1) && current == min) && goal <= max) && min <= dir + current) && (!(goal == current) || dir + current + 1 <= max)) && dir + current <= goal && dir + goal <= max + 1)) || (((((((current <= dir + goal || dir + 1 == 0) && ((current + 1 <= max && min <= current) || (current <= max && min + 1 <= current))) && !(dir + goal == current)) && (dir + goal <= current || dir == 1)) && (((c2 <= 2 && c2 <= c3) && goal <= max) && min <= goal) && (((qDC1 == 2 && min <= current && current <= max) && qCSP == 1) && qDC2 == 1) && !newgoal) && ((min + 2 <= dir + current || (goal <= current && (current + min <= dir + 2 * goal + 2 || current < goal + 1))) || current <= dir + min)) && !start)) || (((current <= goal || dir + 1 == 0) && (goal <= max && min <= goal) && ((!stop && (((!(current == goal) && qDC2 == 2) && min <= current && current <= max) && qDC1 <= 1) && !passed) && !newgoal) && qCSP == 3) && (goal <= current || dir == 1))) || ((c2 <= c3 && (!stop && (qDC1 == 2 && min <= current && current <= max) && qCSP == 1) && qDC2 == 3) && !passed)) || (((((!stop && c2 <= c3) && qDC1 == 2) && !(current == goal) && min <= current && current <= max) && qDC2 == 3) && !passed)) || (((((current <= goal || dir + 1 == 0) && (goal <= current || dir == 1)) && ((min + 2 <= dir + current || (goal <= current && current + min <= dir + 2 * goal + 2 && !(goal == current))) || current <= dir + min)) && !start) && ((c2 <= c3 && (!stop && (((!(current == goal) && qDC2 == 2) && min <= current && current <= max) && qDC1 <= 1) && !passed) && !newgoal) && goal <= max) && min <= goal)) || (((((((((!stop && c2 <= c3) && min == current) && ((!(min == goal) && qDC1 <= 1) && qCSP == 1) && qDC2 == 2) && !newgoal) && goal <= max) && (goal <= current || dir <= 1)) && ((dir + 1 <= 0 || current == goal) || (dir + current <= goal && dir + goal <= max + 1))) && ((min + 2 <= dir + current || (goal <= current && current + min <= dir + 2 * goal + 2 && !(goal == current))) || current <= dir + min)) && !start)) || (((((((current <= goal || dir + 1 == 0) && (c2 <= 2 && c2 <= c3) && (!stop && ((!(current == goal) && qDC1 == 2) && qDC2 == 2) && min <= current && current <= max) && !newgoal) && goal <= max) && min <= goal) && (goal <= current || dir == 1)) && ((min + 2 <= dir + current || (goal <= current && current + min <= dir + 2 * goal + 2 && !(goal == current))) || current <= dir + min)) && !start)) || (((((((current <= dir + goal || dir + 1 == 0) && ((current + 1 <= max && min <= current) || (current <= max && min + 1 <= current))) && !(dir + goal == current)) && (dir + goal <= current || dir == 1)) && ((c2 <= 2 && (!newgoal && (((0 <= c3 && (!stop && qDC1 == 2 && min <= current && current <= max) && qDC2 == 3) && c2 <= 0) || ((c2 <= c3 && (!stop && qDC1 == 2 && min <= current && current <= max) && qDC2 == 3) && !passed))) && qCSP == 3) && goal <= max) && min <= goal) && ((min + 2 <= dir + current || (goal <= current && (current + min <= dir + 2 * goal + 2 || current < goal + 1))) || current <= dir + min)) && !start) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. SAFE Result, 47.7s OverallTime, 26 OverallIterations, 9 TraceHistogramMax, 24.6s AutomataDifference, 0.0s DeadEndRemovalTime, 10.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1795 SDtfs, 4356 SDslu, 4562 SDs, 0 SdLazy, 2457 SolverSat, 350 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 904 GetRequests, 745 SyntacticMatches, 14 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1612occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 26 MinimizatonAttempts, 4209 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 55 NumberOfFragments, 1114 HoareAnnotationTreeSize, 1 FomulaSimplifications, 368978 FormulaSimplificationTreeSizeReduction, 2.4s HoareSimplificationTime, 1 FomulaSimplificationsInter, 337510 FormulaSimplificationTreeSizeReductionInter, 7.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 2744 NumberOfCodeBlocks, 2744 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2711 ConstructedInterpolants, 0 QuantifiedInterpolants, 4736705 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1847 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 33 InterpolantComputations, 20 PerfectInterpolantSequences, 4169/5710 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/ElevatorWithAssignments.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_21-41-00-974.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/ElevatorWithAssignments.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_21-41-00-974.csv Received shutdown request...