java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 19:17:09,972 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 19:17:09,975 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 19:17:09,987 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 19:17:09,987 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 19:17:09,988 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 19:17:09,990 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 19:17:09,992 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 19:17:09,993 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 19:17:09,994 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 19:17:09,995 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 19:17:09,995 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 19:17:09,996 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 19:17:09,997 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 19:17:09,999 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 19:17:09,999 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 19:17:10,000 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 19:17:10,002 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 19:17:10,004 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 19:17:10,006 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 19:17:10,007 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 19:17:10,008 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 19:17:10,011 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 19:17:10,011 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 19:17:10,012 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 19:17:10,015 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 19:17:10,016 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 19:17:10,019 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 19:17:10,020 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 19:17:10,023 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 19:17:10,023 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 19:17:10,026 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 19:17:10,026 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 19:17:10,026 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 19:17:10,027 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 19:17:10,028 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 19:17:10,028 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-03 19:17:10,052 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 19:17:10,052 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 19:17:10,053 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 19:17:10,053 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 19:17:10,053 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 19:17:10,054 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 19:17:10,054 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 19:17:10,055 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 19:17:10,055 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 19:17:10,055 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-03 19:17:10,055 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 19:17:10,055 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 19:17:10,056 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 19:17:10,056 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 19:17:10,056 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 19:17:10,058 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 19:17:10,058 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 19:17:10,058 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 19:17:10,058 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 19:17:10,058 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 19:17:10,059 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 19:17:10,059 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 19:17:10,059 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 19:17:10,059 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 19:17:10,059 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 19:17:10,060 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 19:17:10,061 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 19:17:10,062 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 19:17:10,062 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 19:17:10,062 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 19:17:10,062 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 19:17:10,062 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 19:17:10,063 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 19:17:10,063 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 19:17:10,063 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 19:17:10,063 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 19:17:10,063 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 19:17:10,063 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 19:17:10,064 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 19:17:10,064 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 19:17:10,109 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 19:17:10,125 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 19:17:10,129 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 19:17:10,130 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 19:17:10,131 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 19:17:10,132 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl [2018-12-03 19:17:10,132 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl' [2018-12-03 19:17:10,193 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 19:17:10,195 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 19:17:10,195 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 19:17:10,196 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 19:17:10,196 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 19:17:10,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:17:10" (1/1) ... [2018-12-03 19:17:10,229 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:17:10" (1/1) ... [2018-12-03 19:17:10,243 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 19:17:10,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 19:17:10,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 19:17:10,244 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 19:17:10,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:17:10" (1/1) ... [2018-12-03 19:17:10,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:17:10" (1/1) ... [2018-12-03 19:17:10,270 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:17:10" (1/1) ... [2018-12-03 19:17:10,270 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:17:10" (1/1) ... [2018-12-03 19:17:10,288 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:17:10" (1/1) ... [2018-12-03 19:17:10,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:17:10" (1/1) ... [2018-12-03 19:17:10,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:17:10" (1/1) ... [2018-12-03 19:17:10,307 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 19:17:10,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 19:17:10,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 19:17:10,311 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 19:17:10,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:17:10" (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-12-03 19:17:10,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 19:17:10,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 19:17:11,009 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 19:17:11,009 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 19:17:11,010 INFO L202 PluginConnector]: Adding new model pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:17:11 BoogieIcfgContainer [2018-12-03 19:17:11,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 19:17:11,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 19:17:11,011 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 19:17:11,015 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 19:17:11,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:17:10" (1/2) ... [2018-12-03 19:17:11,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bfc57f7 and model type pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:17:11, skipping insertion in model container [2018-12-03 19:17:11,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:17:11" (2/2) ... [2018-12-03 19:17:11,018 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl [2018-12-03 19:17:11,029 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 19:17:11,039 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 19:17:11,058 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 19:17:11,101 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 19:17:11,102 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 19:17:11,102 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 19:17:11,102 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 19:17:11,102 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 19:17:11,102 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 19:17:11,102 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 19:17:11,103 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 19:17:11,121 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-12-03 19:17:11,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 19:17:11,131 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:17:11,132 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:17:11,137 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:17:11,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:17:11,144 INFO L82 PathProgramCache]: Analyzing trace with hash 679324735, now seen corresponding path program 1 times [2018-12-03 19:17:11,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:17:11,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:17:11,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:17:11,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:17:11,218 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:17:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:17:11,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:17:11,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:17:11,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:17:11,394 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:17:11,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:17:11,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:17:11,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:17:11,418 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-12-03 19:17:11,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:17:11,489 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2018-12-03 19:17:11,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:17:11,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 19:17:11,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:17:11,502 INFO L225 Difference]: With dead ends: 48 [2018-12-03 19:17:11,502 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 19:17:11,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:17:11,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 19:17:11,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-12-03 19:17:11,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 19:17:11,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-12-03 19:17:11,547 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 15 [2018-12-03 19:17:11,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:17:11,548 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2018-12-03 19:17:11,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:17:11,548 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2018-12-03 19:17:11,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 19:17:11,549 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:17:11,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:17:11,550 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:17:11,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:17:11,550 INFO L82 PathProgramCache]: Analyzing trace with hash 92518721, now seen corresponding path program 1 times [2018-12-03 19:17:11,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:17:11,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:17:11,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:17:11,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:17:11,554 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:17:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:17:11,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:17:11,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:17:11,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:17:11,642 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:17:11,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:17:11,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:17:11,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:17:11,645 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 3 states. [2018-12-03 19:17:11,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:17:11,703 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2018-12-03 19:17:11,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:17:11,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 19:17:11,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:17:11,706 INFO L225 Difference]: With dead ends: 85 [2018-12-03 19:17:11,706 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 19:17:11,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:17:11,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 19:17:11,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-12-03 19:17:11,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 19:17:11,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2018-12-03 19:17:11,724 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 15 [2018-12-03 19:17:11,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:17:11,725 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2018-12-03 19:17:11,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:17:11,725 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2018-12-03 19:17:11,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 19:17:11,726 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:17:11,726 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:17:11,726 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:17:11,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:17:11,727 INFO L82 PathProgramCache]: Analyzing trace with hash 772577091, now seen corresponding path program 1 times [2018-12-03 19:17:11,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:17:11,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:17:11,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:17:11,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:17:11,729 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:17:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:17:11,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:17:11,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:17:11,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:17:11,856 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:17:11,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:17:11,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:17:11,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:17:11,858 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand 3 states. [2018-12-03 19:17:11,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:17:11,926 INFO L93 Difference]: Finished difference Result 163 states and 232 transitions. [2018-12-03 19:17:11,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:17:11,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 19:17:11,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:17:11,931 INFO L225 Difference]: With dead ends: 163 [2018-12-03 19:17:11,931 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 19:17:11,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:17:11,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 19:17:11,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-12-03 19:17:11,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 19:17:11,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 150 transitions. [2018-12-03 19:17:11,961 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 150 transitions. Word has length 15 [2018-12-03 19:17:11,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:17:11,961 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 150 transitions. [2018-12-03 19:17:11,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:17:11,962 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 150 transitions. [2018-12-03 19:17:11,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 19:17:11,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:17:11,964 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:17:11,964 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:17:11,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:17:11,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1002430271, now seen corresponding path program 1 times [2018-12-03 19:17:11,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:17:11,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:17:11,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:17:11,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:17:11,969 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:17:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:17:12,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:17:12,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:17:12,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:17:12,132 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:17:12,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:17:12,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:17:12,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:17:12,134 INFO L87 Difference]: Start difference. First operand 107 states and 150 transitions. Second operand 3 states. [2018-12-03 19:17:12,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:17:12,251 INFO L93 Difference]: Finished difference Result 269 states and 378 transitions. [2018-12-03 19:17:12,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:17:12,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 19:17:12,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:17:12,254 INFO L225 Difference]: With dead ends: 269 [2018-12-03 19:17:12,254 INFO L226 Difference]: Without dead ends: 163 [2018-12-03 19:17:12,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:17:12,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-03 19:17:12,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2018-12-03 19:17:12,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-03 19:17:12,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 220 transitions. [2018-12-03 19:17:12,290 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 220 transitions. Word has length 15 [2018-12-03 19:17:12,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:17:12,290 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 220 transitions. [2018-12-03 19:17:12,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:17:12,291 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 220 transitions. [2018-12-03 19:17:12,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 19:17:12,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:17:12,291 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:17:12,292 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:17:12,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:17:12,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1000583229, now seen corresponding path program 1 times [2018-12-03 19:17:12,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:17:12,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:17:12,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:17:12,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:17:12,295 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:17:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:17:12,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:17:12,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:17:12,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 19:17:12,493 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:17:12,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 19:17:12,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 19:17:12,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 19:17:12,495 INFO L87 Difference]: Start difference. First operand 161 states and 220 transitions. Second operand 4 states. [2018-12-03 19:17:12,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:17:12,755 INFO L93 Difference]: Finished difference Result 293 states and 396 transitions. [2018-12-03 19:17:12,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 19:17:12,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-12-03 19:17:12,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:17:12,759 INFO L225 Difference]: With dead ends: 293 [2018-12-03 19:17:12,759 INFO L226 Difference]: Without dead ends: 291 [2018-12-03 19:17:12,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 19:17:12,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-12-03 19:17:12,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 177. [2018-12-03 19:17:12,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-03 19:17:12,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2018-12-03 19:17:12,813 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 15 [2018-12-03 19:17:12,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:17:12,815 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2018-12-03 19:17:12,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 19:17:12,815 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2018-12-03 19:17:12,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 19:17:12,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:17:12,817 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:17:12,817 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:17:12,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:17:12,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1080825333, now seen corresponding path program 1 times [2018-12-03 19:17:12,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:17:12,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:17:12,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:17:12,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:17:12,821 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:17:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:17:13,031 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:17:13,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:17:13,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:17:13,032 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:17:13,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:17:13,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:17:13,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:17:13,033 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand 3 states. [2018-12-03 19:17:13,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:17:13,157 INFO L93 Difference]: Finished difference Result 525 states and 690 transitions. [2018-12-03 19:17:13,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:17:13,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-03 19:17:13,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:17:13,160 INFO L225 Difference]: With dead ends: 525 [2018-12-03 19:17:13,161 INFO L226 Difference]: Without dead ends: 351 [2018-12-03 19:17:13,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:17:13,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-12-03 19:17:13,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2018-12-03 19:17:13,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-12-03 19:17:13,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 448 transitions. [2018-12-03 19:17:13,250 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 448 transitions. Word has length 28 [2018-12-03 19:17:13,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:17:13,250 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 448 transitions. [2018-12-03 19:17:13,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:17:13,253 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 448 transitions. [2018-12-03 19:17:13,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 19:17:13,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:17:13,257 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:17:13,257 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:17:13,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:17:13,258 INFO L82 PathProgramCache]: Analyzing trace with hash 379760755, now seen corresponding path program 1 times [2018-12-03 19:17:13,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:17:13,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:17:13,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:17:13,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:17:13,260 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:17:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:17:13,656 WARN L180 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 19:17:13,817 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 3 [2018-12-03 19:17:13,822 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 19:17:13,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:17:13,823 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:17:13,824 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-12-03 19:17:13,826 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [44], [46], [48], [52], [54], [56] [2018-12-03 19:17:13,908 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 19:17:13,909 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 19:17:14,769 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 19:18:14,250 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 19:18:14,251 INFO L272 AbstractInterpreter]: Visited 22 different actions 733 times. Merged at 21 different actions 512 times. Widened at 20 different actions 353 times. Found 172 fixpoints after 16 different actions. Largest state had 0 variables. [2018-12-03 19:18:14,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:14,275 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 19:18:14,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:18:14,275 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-12-03 19:18:14,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:14,293 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:18:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:14,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:18:14,522 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 19:18:14,523 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:18:14,700 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 19:18:14,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:18:14,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 3] total 7 [2018-12-03 19:18:14,733 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:18:14,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 19:18:14,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 19:18:14,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-12-03 19:18:14,736 INFO L87 Difference]: Start difference. First operand 349 states and 448 transitions. Second operand 6 states. [2018-12-03 19:18:15,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:15,088 INFO L93 Difference]: Finished difference Result 811 states and 1054 transitions. [2018-12-03 19:18:15,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 19:18:15,089 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-03 19:18:15,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:15,092 INFO L225 Difference]: With dead ends: 811 [2018-12-03 19:18:15,092 INFO L226 Difference]: Without dead ends: 569 [2018-12-03 19:18:15,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-12-03 19:18:15,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-12-03 19:18:15,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 557. [2018-12-03 19:18:15,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-12-03 19:18:15,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 688 transitions. [2018-12-03 19:18:15,160 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 688 transitions. Word has length 28 [2018-12-03 19:18:15,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:15,160 INFO L480 AbstractCegarLoop]: Abstraction has 557 states and 688 transitions. [2018-12-03 19:18:15,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 19:18:15,160 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 688 transitions. [2018-12-03 19:18:15,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 19:18:15,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:15,164 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 19:18:15,165 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:15,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:15,165 INFO L82 PathProgramCache]: Analyzing trace with hash 415408239, now seen corresponding path program 2 times [2018-12-03 19:18:15,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:15,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:15,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:15,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:15,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:15,560 WARN L180 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-12-03 19:18:15,800 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-12-03 19:18:15,818 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 43 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-03 19:18:15,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:18:15,818 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:18:15,818 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:18:15,819 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:18:15,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:18:15,819 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-12-03 19:18:15,838 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:18:15,838 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:18:15,926 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 19:18:15,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:18:15,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:18:16,129 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-12-03 19:18:16,515 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-12-03 19:18:16,800 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 15 proven. 38 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 19:18:16,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:18:17,163 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 15 proven. 38 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 19:18:17,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:18:17,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2018-12-03 19:18:17,190 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:18:17,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 19:18:17,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 19:18:17,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 19:18:17,191 INFO L87 Difference]: Start difference. First operand 557 states and 688 transitions. Second operand 8 states. [2018-12-03 19:18:18,227 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-12-03 19:18:19,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:19,073 INFO L93 Difference]: Finished difference Result 883 states and 1094 transitions. [2018-12-03 19:18:19,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 19:18:19,074 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-12-03 19:18:19,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:19,075 INFO L225 Difference]: With dead ends: 883 [2018-12-03 19:18:19,075 INFO L226 Difference]: Without dead ends: 220 [2018-12-03 19:18:19,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2018-12-03 19:18:19,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-12-03 19:18:19,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 149. [2018-12-03 19:18:19,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-03 19:18:19,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2018-12-03 19:18:19,111 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 54 [2018-12-03 19:18:19,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:19,111 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2018-12-03 19:18:19,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 19:18:19,111 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2018-12-03 19:18:19,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 19:18:19,113 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:19,113 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 19:18:19,113 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:19,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:19,114 INFO L82 PathProgramCache]: Analyzing trace with hash -129171151, now seen corresponding path program 3 times [2018-12-03 19:18:19,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:19,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:19,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:18:19,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:19,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:19,191 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-03 19:18:19,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:19,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:18:19,191 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:19,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:18:19,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:18:19,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:19,193 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand 3 states. [2018-12-03 19:18:19,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:19,198 INFO L93 Difference]: Finished difference Result 149 states and 172 transitions. [2018-12-03 19:18:19,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:18:19,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-03 19:18:19,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:19,199 INFO L225 Difference]: With dead ends: 149 [2018-12-03 19:18:19,199 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 19:18:19,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:19,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 19:18:19,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 19:18:19,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 19:18:19,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 19:18:19,201 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-12-03 19:18:19,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:19,201 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 19:18:19,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:18:19,201 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 19:18:19,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 19:18:19,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 19:18:19,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:19,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:19,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:19,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:19,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:19,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:18:21,124 WARN L180 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2018-12-03 19:18:21,361 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2018-12-03 19:18:21,790 WARN L180 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2018-12-03 19:18:21,984 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2018-12-03 19:18:22,237 WARN L180 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2018-12-03 19:18:22,491 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2018-12-03 19:18:22,759 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2018-12-03 19:18:23,324 WARN L180 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2018-12-03 19:18:23,543 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2018-12-03 19:18:23,829 WARN L180 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2018-12-03 19:18:24,250 WARN L180 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2018-12-03 19:18:24,255 INFO L444 ceAbstractionStarter]: At program point L300(lines 300 311) the Hoare annotation is: (let ((.cse10 (exists ((v_prenex_1 Int)) (let ((.cse12 (mod v_prenex_1 256))) (and (<= .cse12 127) (<= v_prenex_1 127) (= ~p3_new .cse12) (<= 0 v_prenex_1))))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode2)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse4 (<= ~r1 1)) (.cse5 (< 0 (+ (div ~send1 256) 1))) (.cse6 (<= ~send1 127)) (.cse7 (<= (div ~mode2 256) 0)) (.cse8 (= 0 (+ ~nomsg 1))) (.cse9 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= ~r1 0) .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (= ~mode4 (* 256 (div ~mode4 256))) .cse9 .cse10) (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse11 (mod v_prenex_1 256))) (and (<= .cse11 127) (<= v_prenex_1 127) (= .cse11 ~p3_old) (<= 0 v_prenex_1)))) (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2018-12-03 19:18:24,255 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 375) no Hoare annotation was computed. [2018-12-03 19:18:24,255 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 66 376) no Hoare annotation was computed. [2018-12-03 19:18:24,255 INFO L444 ceAbstractionStarter]: At program point L317(lines 310 318) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse4 (<= ~r1 1)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode2)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse5 (< 0 (+ (div ~send1 256) 1))) (.cse6 (<= ~send1 127)) (.cse7 (<= (div ~mode2 256) 0)) (.cse8 (= 0 (+ ~nomsg 1))) (.cse9 (<= 0 ~send3)) (.cse10 (exists ((v_prenex_1 Int)) (let ((.cse12 (mod v_prenex_1 256))) (and (<= .cse12 127) (<= v_prenex_1 127) (= ~p3_new .cse12) (<= 0 v_prenex_1)))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse11 (mod v_prenex_1 256))) (and (<= .cse11 127) (<= v_prenex_1 127) (= .cse11 ~p3_old) (<= 0 v_prenex_1)))) (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (= ~r1 0) .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2018-12-03 19:18:24,255 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 66 376) no Hoare annotation was computed. [2018-12-03 19:18:24,256 INFO L444 ceAbstractionStarter]: At program point L251(lines 243 252) the Hoare annotation is: (let ((.cse13 (div ~mode2 256))) (let ((.cse4 (<= ~r1 1)) (.cse2 (exists ((v_prenex_1 Int)) (let ((.cse14 (mod v_prenex_1 256))) (and (<= .cse14 127) (<= v_prenex_1 127) (= .cse14 ~p3_old) (<= 0 v_prenex_1))))) (.cse10 (= ~mode1 (* 256 (div ~mode1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse11 (<= 1 ~mode2)) (.cse12 (<= .cse13 0)) (.cse1 (<= ~send3 127)) (.cse9 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse3 (not (= ~p1_new ~nomsg))) (.cse5 (< 0 (+ (div ~send1 256) 1))) (.cse6 (<= ~send1 127)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse10 .cse11 .cse5 .cse6 .cse12 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse5 .cse6 .cse12 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse5 .cse6 .cse12 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse11 .cse3 .cse5 .cse6 .cse12 .cse7 .cse8) (and (= ~r1 0) .cse1 .cse9 .cse3 .cse5 (= ~mode2 (* 256 .cse13)) .cse6 .cse7 (= ~mode4 (* 256 (div ~mode4 256))) .cse8)))) [2018-12-03 19:18:24,256 INFO L444 ceAbstractionStarter]: At program point L367(lines 367 374) the Hoare annotation is: false [2018-12-03 19:18:24,256 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 66 376) no Hoare annotation was computed. [2018-12-03 19:18:24,256 INFO L444 ceAbstractionStarter]: At program point L256(lines 256 266) the Hoare annotation is: (let ((.cse13 (div ~mode2 256))) (let ((.cse4 (<= ~r1 1)) (.cse2 (exists ((v_prenex_1 Int)) (let ((.cse14 (mod v_prenex_1 256))) (and (<= .cse14 127) (<= v_prenex_1 127) (= .cse14 ~p3_old) (<= 0 v_prenex_1))))) (.cse10 (= ~mode1 (* 256 (div ~mode1 256)))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse11 (<= 1 ~mode2)) (.cse12 (<= .cse13 0)) (.cse1 (<= ~send3 127)) (.cse9 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse3 (not (= ~p1_new ~nomsg))) (.cse5 (< 0 (+ (div ~send1 256) 1))) (.cse6 (<= ~send1 127)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse10 .cse11 .cse5 .cse6 .cse12 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse5 .cse6 .cse12 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse5 .cse6 .cse12 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse11 .cse3 .cse5 .cse6 .cse12 .cse7 .cse8) (and (= ~r1 0) .cse1 .cse9 .cse3 .cse5 (= ~mode2 (* 256 .cse13)) .cse6 .cse7 (= ~mode4 (* 256 (div ~mode4 256))) .cse8)))) [2018-12-03 19:18:24,256 INFO L444 ceAbstractionStarter]: At program point L351(lines 346 352) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode2)) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= 1 ULTIMATE.start_check_~tmp~83)) (.cse8 (<= 0 ~send3))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (<= .cse9 127) (<= v_prenex_1 127) (= .cse9 ~p3_old) (<= 0 v_prenex_1)))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2018-12-03 19:18:24,257 INFO L444 ceAbstractionStarter]: At program point L273(lines 265 274) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse5 (<= ~r1 1)) (.cse11 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= ~send3 127)) (.cse3 (<= 1 ~mode2)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse6 (< 0 (+ (div ~send1 256) 1))) (.cse7 (<= ~send1 127)) (.cse8 (<= (div ~mode2 256) 0)) (.cse9 (= 0 (+ ~nomsg 1))) (.cse10 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse2 (mod v_prenex_1 256))) (and (<= .cse2 127) (<= v_prenex_1 127) (= .cse2 ~p3_old) (<= 0 v_prenex_1)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= ~r1 0) .cse11 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 (= ~mode4 (* 256 (div ~mode4 256))) .cse10))) [2018-12-03 19:18:24,257 INFO L444 ceAbstractionStarter]: At program point L331(lines 331 337) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= ~send3 127)) (.cse3 (<= 1 ~mode2)) (.cse4 (<= ~r1 1)) (.cse5 (< 0 (+ (div ~send1 256) 1))) (.cse6 (<= ~send1 127)) (.cse7 (<= (div ~mode2 256) 0)) (.cse8 (= 0 (+ ~nomsg 1))) (.cse9 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse2 (mod v_prenex_1 256))) (and (<= .cse2 127) (<= v_prenex_1 127) (= .cse2 ~p3_old) (<= 0 v_prenex_1)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2018-12-03 19:18:24,257 INFO L444 ceAbstractionStarter]: At program point L278(lines 278 288) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse5 (<= ~r1 1)) (.cse11 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse1 (<= ~send3 127)) (.cse3 (<= 1 ~mode2)) (.cse4 (not (= ~p1_new ~nomsg))) (.cse6 (< 0 (+ (div ~send1 256) 1))) (.cse7 (<= ~send1 127)) (.cse8 (<= (div ~mode2 256) 0)) (.cse9 (= 0 (+ ~nomsg 1))) (.cse10 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse2 (mod v_prenex_1 256))) (and (<= .cse2 127) (<= v_prenex_1 127) (= .cse2 ~p3_old) (<= 0 v_prenex_1)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= ~r1 0) .cse11 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 (= ~mode4 (* 256 (div ~mode4 256))) .cse10))) [2018-12-03 19:18:24,257 INFO L444 ceAbstractionStarter]: At program point L373(lines 226 373) the Hoare annotation is: (let ((.cse10 (div ~mode2 256))) (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse3 (<= 1 ~mode2)) (.cse6 (<= .cse10 0)) (.cse1 (<= ~send3 127)) (.cse9 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse4 (< 0 (+ (div ~send1 256) 1))) (.cse5 (<= ~send1 127)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse2 (mod v_prenex_1 256))) (and (<= .cse2 127) (<= v_prenex_1 127) (= .cse2 ~p3_old) (<= 0 v_prenex_1)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= ~r1 0) .cse1 .cse9 (= ~mode1 (* 256 (div ~mode1 256))) .cse4 (= ~mode2 (* 256 .cse10)) .cse5 .cse7 (= ~mode4 (* 256 (div ~mode4 256))) .cse8)))) [2018-12-03 19:18:24,258 INFO L444 ceAbstractionStarter]: At program point L340(lines 336 347) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= ~send3 127)) (.cse3 (<= 1 ~mode2)) (.cse4 (<= ~r1 1)) (.cse5 (< 0 (+ (div ~send1 256) 1))) (.cse6 (<= ~send1 127)) (.cse7 (<= (div ~mode2 256) 0)) (.cse8 (= 0 (+ ~nomsg 1))) (.cse9 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse2 (mod v_prenex_1 256))) (and (<= .cse2 127) (<= v_prenex_1 127) (= .cse2 ~p3_old) (<= 0 v_prenex_1)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2018-12-03 19:18:24,258 INFO L444 ceAbstractionStarter]: At program point L233(lines 233 244) the Hoare annotation is: (let ((.cse10 (div ~mode2 256))) (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse3 (<= 1 ~mode2)) (.cse6 (<= .cse10 0)) (.cse1 (<= ~send3 127)) (.cse9 (= ~mode3 (* 256 (div ~mode3 256)))) (.cse4 (< 0 (+ (div ~send1 256) 1))) (.cse5 (<= ~send1 127)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (<= 0 ~send3))) (or (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse2 (mod v_prenex_1 256))) (and (<= .cse2 127) (<= v_prenex_1 127) (= .cse2 ~p3_old) (<= 0 v_prenex_1)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= ~r1 0) .cse1 .cse9 (= ~mode1 (* 256 (div ~mode1 256))) .cse4 (= ~mode2 (* 256 .cse10)) .cse5 .cse7 (= ~mode4 (* 256 (div ~mode4 256))) .cse8)))) [2018-12-03 19:18:24,258 INFO L444 ceAbstractionStarter]: At program point L361(lines 361 368) the Hoare annotation is: (let ((.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode2)) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (<= (div ULTIMATE.start_assert_~arg 256) 0)) (.cse7 (= 0 (+ ~nomsg 1))) (.cse8 (<= 1 ULTIMATE.start_assert_~arg)) (.cse9 (<= 1 ULTIMATE.start_check_~tmp~83)) (.cse10 (<= 0 ~send3))) (or (and .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse11 (mod v_prenex_1 256))) (and (<= .cse11 127) (<= v_prenex_1 127) (= .cse11 ~p3_old) (<= 0 v_prenex_1)))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2018-12-03 19:18:24,258 INFO L444 ceAbstractionStarter]: At program point L295(lines 287 296) the Hoare annotation is: (let ((.cse10 (exists ((v_prenex_1 Int)) (let ((.cse12 (mod v_prenex_1 256))) (and (<= .cse12 127) (<= v_prenex_1 127) (= ~p3_new .cse12) (<= 0 v_prenex_1))))) (.cse0 (not (= ~p1_old ~nomsg))) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode2)) (.cse3 (not (= ~p1_new ~nomsg))) (.cse4 (<= ~r1 1)) (.cse5 (< 0 (+ (div ~send1 256) 1))) (.cse6 (<= ~send1 127)) (.cse7 (<= (div ~mode2 256) 0)) (.cse8 (= 0 (+ ~nomsg 1))) (.cse9 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= ~r1 0) .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (= ~mode4 (* 256 (div ~mode4 256))) .cse9 .cse10) (and .cse0 .cse1 (exists ((v_prenex_1 Int)) (let ((.cse11 (mod v_prenex_1 256))) (and (<= .cse11 127) (<= v_prenex_1 127) (= .cse11 ~p3_old) (<= 0 v_prenex_1)))) (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2018-12-03 19:18:24,289 INFO L202 PluginConnector]: Adding new model pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 07:18:24 BoogieIcfgContainer [2018-12-03 19:18:24,290 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 19:18:24,291 INFO L168 Benchmark]: Toolchain (without parser) took 74097.24 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-12-03 19:18:24,292 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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-12-03 19:18:24,293 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.81 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-12-03 19:18:24,293 INFO L168 Benchmark]: Boogie Preprocessor took 63.58 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-12-03 19:18:24,294 INFO L168 Benchmark]: RCFGBuilder took 699.73 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-12-03 19:18:24,294 INFO L168 Benchmark]: TraceAbstraction took 73278.62 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-12-03 19:18:24,298 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.19 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 47.81 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 63.58 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 699.73 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 73278.62 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 375]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: (((((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && 0 <= ~send3) || ((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((~r1 == 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: (((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) || ((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || ((((((((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 287]: Loop Invariant Derived loop invariant: (((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p3_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) || ((((((((((~r1 == 0 && ~send3 <= 127) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p3_new == v_prenex_1 % 256) && 0 <= v_prenex_1))) || (((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 1 <= ~mode2) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) || (((((((((!(~p1_old == ~nomsg) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 1 <= ~mode2) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) || ((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((~r1 == 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 233]: Loop Invariant Derived loop invariant: (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) || ((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((~r1 == 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: (((((((((!(~p1_old == ~nomsg) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && 0 <= ~send3) || (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= check_~tmp~83) && 0 <= ~send3) - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 1 <= ~mode2) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) || (((((((((!(~p1_old == ~nomsg) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 1 <= ~mode2) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: (((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && 1 <= check_~tmp~83) && 0 <= ~send3) || (((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && 1 <= check_~tmp~83) && 0 <= ~send3) - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: (((((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && 0 <= ~send3) || ((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((~r1 == 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: (((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) || ((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || ((((((((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: (((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p3_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) || (((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((((((~r1 == 0 && ~send3 <= 127) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p3_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) - InvariantResult [Line: 300]: Loop Invariant Derived loop invariant: (((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p3_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) || ((((((((((~r1 == 0 && ~send3 <= 127) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p3_new == v_prenex_1 % 256) && 0 <= v_prenex_1))) || (((((((((((!(~p1_old == ~nomsg) && ~send3 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && ~r1 <= 1) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && 0 <= ~send3) - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. SAFE Result, 73.1s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 5.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 240 SDtfs, 213 SDslu, 235 SDs, 0 SdLazy, 186 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 162 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=557occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 60.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 207 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 127 NumberOfFragments, 2286 HoareAnnotationTreeSize, 14 FomulaSimplifications, 5225 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 14 FomulaSimplificationsInter, 951 FormulaSimplificationTreeSizeReductionInter, 4.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 321 NumberOfCodeBlocks, 295 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 390 ConstructedInterpolants, 15 QuantifiedInterpolants, 121117 SizeOfPredicates, 12 NumberOfNonLiveVariables, 512 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 260/364 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...