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_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:42:16,999 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:42:17,001 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:42:17,014 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:42:17,014 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:42:17,015 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:42:17,017 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:42:17,019 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:42:17,020 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:42:17,021 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:42:17,022 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:42:17,022 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:42:17,023 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:42:17,024 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:42:17,026 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:42:17,026 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:42:17,027 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:42:17,029 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:42:17,031 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:42:17,033 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:42:17,034 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:42:17,035 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:42:17,038 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:42:17,038 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:42:17,038 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:42:17,039 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:42:17,040 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:42:17,041 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:42:17,042 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:42:17,043 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:42:17,043 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:42:17,044 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:42:17,044 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:42:17,045 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:42:17,046 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:42:17,046 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:42:17,047 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:42:17,060 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:42:17,060 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:42:17,061 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:42:17,061 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:42:17,061 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:42:17,062 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:42:17,062 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:42:17,062 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:42:17,062 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:42:17,062 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:42:17,063 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:42:17,063 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:42:17,063 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:42:17,063 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:42:17,063 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:42:17,064 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:42:17,064 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:42:17,064 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:42:17,065 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:42:17,065 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:42:17,065 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:42:17,065 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:42:17,066 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:42:17,066 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:42:17,066 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:42:17,066 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:42:17,066 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:42:17,067 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:42:17,067 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:42:17,067 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:42:17,067 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:42:17,067 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:42:17,068 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:42:17,068 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:42:17,068 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:42:17,068 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:42:17,068 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:42:17,069 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:42:17,069 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:42:17,069 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:42:17,069 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:42:17,120 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:42:17,137 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:42:17,141 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:42:17,143 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:42:17,144 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:42:17,144 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl [2018-12-03 16:42:17,145 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl' [2018-12-03 16:42:17,236 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:42:17,238 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:42:17,239 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:42:17,239 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:42:17,239 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:42:17,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:17" (1/1) ... [2018-12-03 16:42:17,271 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:17" (1/1) ... [2018-12-03 16:42:17,281 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:42:17,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:42:17,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:42:17,282 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:42:17,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:17" (1/1) ... [2018-12-03 16:42:17,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:17" (1/1) ... [2018-12-03 16:42:17,299 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:17" (1/1) ... [2018-12-03 16:42:17,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:17" (1/1) ... [2018-12-03 16:42:17,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:17" (1/1) ... [2018-12-03 16:42:17,313 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:17" (1/1) ... [2018-12-03 16:42:17,318 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:17" (1/1) ... [2018-12-03 16:42:17,324 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:42:17,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:42:17,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:42:17,325 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:42:17,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:17" (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 16:42:17,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:42:17,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:42:18,046 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:42:18,046 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:42:18,047 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:42:18 BoogieIcfgContainer [2018-12-03 16:42:18,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:42:18,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:42:18,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:42:18,052 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:42:18,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:17" (1/2) ... [2018-12-03 16:42:18,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd8a4b7 and model type pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:42:18, skipping insertion in model container [2018-12-03 16:42:18,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:42:18" (2/2) ... [2018-12-03 16:42:18,055 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl [2018-12-03 16:42:18,066 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:42:18,074 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:42:18,093 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:42:18,129 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:42:18,129 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:42:18,130 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:42:18,130 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:42:18,130 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:42:18,130 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:42:18,130 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:42:18,131 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:42:18,147 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-12-03 16:42:18,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:42:18,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:18,156 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:18,158 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:18,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:18,164 INFO L82 PathProgramCache]: Analyzing trace with hash -417618601, now seen corresponding path program 1 times [2018-12-03 16:42:18,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:18,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:18,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:18,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:18,227 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:18,431 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 16:42:18,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:18,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:18,435 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:18,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:18,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:18,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:18,457 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-12-03 16:42:18,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:18,515 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2018-12-03 16:42:18,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:18,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 16:42:18,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:18,530 INFO L225 Difference]: With dead ends: 51 [2018-12-03 16:42:18,530 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:42:18,535 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 16:42:18,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:42:18,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-12-03 16:42:18,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 16:42:18,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-12-03 16:42:18,583 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 16 [2018-12-03 16:42:18,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:18,583 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-12-03 16:42:18,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:18,584 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-12-03 16:42:18,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:42:18,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:18,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:18,585 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:18,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:18,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1428735851, now seen corresponding path program 1 times [2018-12-03 16:42:18,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:18,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:18,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:18,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:18,592 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:18,752 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 16:42:18,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:18,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:18,753 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:18,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:18,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:18,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:18,755 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 3 states. [2018-12-03 16:42:18,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:18,820 INFO L93 Difference]: Finished difference Result 91 states and 127 transitions. [2018-12-03 16:42:18,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:18,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 16:42:18,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:18,822 INFO L225 Difference]: With dead ends: 91 [2018-12-03 16:42:18,822 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 16:42:18,824 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 16:42:18,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 16:42:18,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-12-03 16:42:18,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 16:42:18,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2018-12-03 16:42:18,841 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 16 [2018-12-03 16:42:18,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:18,842 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2018-12-03 16:42:18,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:18,842 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-12-03 16:42:18,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:42:18,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:18,843 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:18,843 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:18,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:18,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1821762861, now seen corresponding path program 1 times [2018-12-03 16:42:18,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:18,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:18,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:18,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:18,847 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:18,973 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 16:42:18,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:18,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:18,974 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:18,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:18,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:18,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:18,975 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 3 states. [2018-12-03 16:42:19,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:19,045 INFO L93 Difference]: Finished difference Result 175 states and 244 transitions. [2018-12-03 16:42:19,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:19,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 16:42:19,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:19,050 INFO L225 Difference]: With dead ends: 175 [2018-12-03 16:42:19,050 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 16:42:19,051 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 16:42:19,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 16:42:19,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-12-03 16:42:19,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 16:42:19,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2018-12-03 16:42:19,096 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 158 transitions. Word has length 16 [2018-12-03 16:42:19,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:19,097 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 158 transitions. [2018-12-03 16:42:19,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:19,097 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 158 transitions. [2018-12-03 16:42:19,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:42:19,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:19,098 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:19,100 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:19,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:19,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1012416235, now seen corresponding path program 1 times [2018-12-03 16:42:19,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:19,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:19,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:19,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:19,103 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:19,196 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 16:42:19,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:19,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:19,197 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:19,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:19,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:19,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:19,199 INFO L87 Difference]: Start difference. First operand 115 states and 158 transitions. Second operand 3 states. [2018-12-03 16:42:19,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:19,279 INFO L93 Difference]: Finished difference Result 343 states and 472 transitions. [2018-12-03 16:42:19,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:19,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 16:42:19,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:19,290 INFO L225 Difference]: With dead ends: 343 [2018-12-03 16:42:19,290 INFO L226 Difference]: Without dead ends: 229 [2018-12-03 16:42:19,292 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 16:42:19,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-12-03 16:42:19,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2018-12-03 16:42:19,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-12-03 16:42:19,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 306 transitions. [2018-12-03 16:42:19,370 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 306 transitions. Word has length 16 [2018-12-03 16:42:19,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:19,370 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 306 transitions. [2018-12-03 16:42:19,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:19,371 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 306 transitions. [2018-12-03 16:42:19,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:42:19,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:19,371 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:19,372 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:19,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:19,372 INFO L82 PathProgramCache]: Analyzing trace with hash -955157933, now seen corresponding path program 1 times [2018-12-03 16:42:19,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:19,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:19,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:19,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:19,375 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:19,495 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 16:42:19,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:19,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:19,496 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:19,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:19,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:19,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:19,497 INFO L87 Difference]: Start difference. First operand 227 states and 306 transitions. Second operand 3 states. [2018-12-03 16:42:19,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:19,598 INFO L93 Difference]: Finished difference Result 569 states and 770 transitions. [2018-12-03 16:42:19,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:19,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 16:42:19,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:19,601 INFO L225 Difference]: With dead ends: 569 [2018-12-03 16:42:19,601 INFO L226 Difference]: Without dead ends: 343 [2018-12-03 16:42:19,603 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 16:42:19,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-12-03 16:42:19,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2018-12-03 16:42:19,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-12-03 16:42:19,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 456 transitions. [2018-12-03 16:42:19,682 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 456 transitions. Word has length 16 [2018-12-03 16:42:19,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:19,682 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 456 transitions. [2018-12-03 16:42:19,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:19,683 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 456 transitions. [2018-12-03 16:42:19,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:42:19,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:19,684 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:19,684 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:19,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:19,684 INFO L82 PathProgramCache]: Analyzing trace with hash -955217515, now seen corresponding path program 1 times [2018-12-03 16:42:19,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:19,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:19,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:19,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:19,687 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:19,996 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 16:42:19,997 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 16:42:19,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:19,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:42:19,998 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:19,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:42:19,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:42:19,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:42:19,999 INFO L87 Difference]: Start difference. First operand 341 states and 456 transitions. Second operand 4 states. [2018-12-03 16:42:20,164 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-12-03 16:42:20,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:20,339 INFO L93 Difference]: Finished difference Result 610 states and 805 transitions. [2018-12-03 16:42:20,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:42:20,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-03 16:42:20,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:20,344 INFO L225 Difference]: With dead ends: 610 [2018-12-03 16:42:20,344 INFO L226 Difference]: Without dead ends: 608 [2018-12-03 16:42:20,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:42:20,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-12-03 16:42:20,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 373. [2018-12-03 16:42:20,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-12-03 16:42:20,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 480 transitions. [2018-12-03 16:42:20,415 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 480 transitions. Word has length 16 [2018-12-03 16:42:20,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:20,415 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 480 transitions. [2018-12-03 16:42:20,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:42:20,416 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 480 transitions. [2018-12-03 16:42:20,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 16:42:20,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:20,419 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:20,420 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:20,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:20,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1530501555, now seen corresponding path program 1 times [2018-12-03 16:42:20,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:20,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:20,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:20,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:20,424 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:20,802 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 16:42:20,811 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:20,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:20,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:42:20,812 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:20,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:20,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:20,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:20,816 INFO L87 Difference]: Start difference. First operand 373 states and 480 transitions. Second operand 3 states. [2018-12-03 16:42:21,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:21,007 INFO L93 Difference]: Finished difference Result 1113 states and 1434 transitions. [2018-12-03 16:42:21,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:21,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-03 16:42:21,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:21,016 INFO L225 Difference]: With dead ends: 1113 [2018-12-03 16:42:21,016 INFO L226 Difference]: Without dead ends: 743 [2018-12-03 16:42:21,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:21,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-12-03 16:42:21,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2018-12-03 16:42:21,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-12-03 16:42:21,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 932 transitions. [2018-12-03 16:42:21,145 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 932 transitions. Word has length 30 [2018-12-03 16:42:21,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:21,145 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 932 transitions. [2018-12-03 16:42:21,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:21,145 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 932 transitions. [2018-12-03 16:42:21,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 16:42:21,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:21,153 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, 1, 1] [2018-12-03 16:42:21,154 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:21,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:21,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1272336117, now seen corresponding path program 1 times [2018-12-03 16:42:21,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:21,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:21,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:21,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:21,156 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:21,460 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-12-03 16:42:21,601 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:21,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:21,601 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:42:21,603 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-12-03 16:42:21,605 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42], [46], [48], [50], [54], [56], [58] [2018-12-03 16:42:21,651 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:42:21,651 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:42:23,268 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:42:23,270 INFO L272 AbstractInterpreter]: Visited 23 different actions 164 times. Merged at 22 different actions 106 times. Widened at 12 different actions 12 times. Found 35 fixpoints after 12 different actions. Largest state had 0 variables. [2018-12-03 16:42:23,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:23,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:42:23,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:23,317 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 16:42:23,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:23,335 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:42:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:23,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:42:23,672 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 16:42:23,672 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:42:24,178 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-03 16:42:24,187 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 16:42:24,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:42:24,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2018-12-03 16:42:24,221 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:42:24,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:42:24,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:42:24,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:42:24,222 INFO L87 Difference]: Start difference. First operand 741 states and 932 transitions. Second operand 8 states. [2018-12-03 16:42:24,888 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 16:42:25,263 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-03 16:42:26,281 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 16:42:26,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:26,823 INFO L93 Difference]: Finished difference Result 1749 states and 2207 transitions. [2018-12-03 16:42:26,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:42:26,823 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-12-03 16:42:26,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:26,829 INFO L225 Difference]: With dead ends: 1749 [2018-12-03 16:42:26,830 INFO L226 Difference]: Without dead ends: 1011 [2018-12-03 16:42:26,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:42:26,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2018-12-03 16:42:26,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 647. [2018-12-03 16:42:26,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2018-12-03 16:42:26,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 783 transitions. [2018-12-03 16:42:26,982 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 783 transitions. Word has length 30 [2018-12-03 16:42:26,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:26,982 INFO L480 AbstractCegarLoop]: Abstraction has 647 states and 783 transitions. [2018-12-03 16:42:26,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:42:26,983 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 783 transitions. [2018-12-03 16:42:26,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 16:42:26,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:26,986 INFO L402 BasicCegarLoop]: trace histogram [4, 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 16:42:26,986 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:26,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:26,987 INFO L82 PathProgramCache]: Analyzing trace with hash 661288113, now seen corresponding path program 2 times [2018-12-03 16:42:26,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:26,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:26,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:26,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:26,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:27,325 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 16:42:27,333 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 16:42:27,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:27,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:42:27,334 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:27,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:27,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:27,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:27,336 INFO L87 Difference]: Start difference. First operand 647 states and 783 transitions. Second operand 3 states. [2018-12-03 16:42:27,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:27,395 INFO L93 Difference]: Finished difference Result 727 states and 879 transitions. [2018-12-03 16:42:27,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:27,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-12-03 16:42:27,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:27,396 INFO L225 Difference]: With dead ends: 727 [2018-12-03 16:42:27,396 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 16:42:27,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:27,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 16:42:27,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 16:42:27,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 16:42:27,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 16:42:27,399 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-12-03 16:42:27,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:27,399 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 16:42:27,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:27,399 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 16:42:27,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 16:42:27,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 16:42:27,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:27,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:29,098 WARN L180 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-12-03 16:42:29,424 WARN L180 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2018-12-03 16:42:29,595 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-12-03 16:42:29,744 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-12-03 16:42:30,023 WARN L180 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2018-12-03 16:42:30,172 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-12-03 16:42:30,308 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2018-12-03 16:42:30,660 WARN L180 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2018-12-03 16:42:30,807 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-12-03 16:42:31,024 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2018-12-03 16:42:31,181 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2018-12-03 16:42:31,332 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-12-03 16:42:31,623 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2018-12-03 16:42:31,627 INFO L444 ceAbstractionStarter]: At program point L316(lines 316 327) the Hoare annotation is: (let ((.cse1 (= ~r1 0)) (.cse2 (<= ~send4 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (< 0 (+ (div ~send4 256) 1))) (.cse0 (div ~mode5 256))) (or (and (= ~mode5 (* 256 .cse0)) .cse1 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse1 (<= 1 ULTIMATE.start_check_~tmp~127) (<= 1 ~mode5) .cse2 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse3 (<= 1 ULTIMATE.start_assert_~arg) (not (= ~p4_old ~nomsg)) .cse4 (<= .cse0 0)))) [2018-12-03 16:42:31,627 INFO L444 ceAbstractionStarter]: At program point L399(lines 399 409) the Hoare annotation is: (let ((.cse11 (div ~mode5 256))) (let ((.cse8 (= ~mode4 (* 256 (div ~mode4 256)))) (.cse13 (= ~mode1 (* 256 (div ~mode1 256)))) (.cse14 (<= ~r1 1)) (.cse2 (<= 1 ~mode5)) (.cse10 (<= .cse11 0)) (.cse0 (= ~r1 0)) (.cse1 (<= 1 ULTIMATE.start_check_~tmp~127)) (.cse12 (not (= ~p4_new ~nomsg))) (.cse3 (<= ~send4 127)) (.cse4 (<= (div ULTIMATE.start_assert_~arg 256) 0)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 1 ULTIMATE.start_assert_~arg)) (.cse7 (not (= ~p4_old ~nomsg))) (.cse9 (< 0 (+ (div ~send4 256) 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= ~mode5 (* 256 .cse11)) .cse0 .cse12 .cse3 .cse5 .cse9) (and .cse13 .cse14 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse13 .cse12 .cse14 .cse2 .cse3 .cse5 .cse7 .cse9 .cse10) (and .cse0 .cse1 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9)))) [2018-12-03 16:42:31,628 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 91 466) no Hoare annotation was computed. [2018-12-03 16:42:31,628 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 91 466) no Hoare annotation was computed. [2018-12-03 16:42:31,628 INFO L444 ceAbstractionStarter]: At program point L441(lines 436 442) the Hoare annotation is: (and (= ~r1 0) (<= 1 ULTIMATE.start_check_~tmp~127) (<= 1 ~mode5) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (not (= ~p4_old ~nomsg)) (< 0 (+ (div ~send4 256) 1)) (<= (div ~mode5 256) 0)) [2018-12-03 16:42:31,628 INFO L444 ceAbstractionStarter]: At program point L371(lines 365 372) the Hoare annotation is: (let ((.cse6 (div ~mode5 256))) (let ((.cse7 (= ~r1 0)) (.cse0 (<= 1 ~mode5)) (.cse1 (<= ~send4 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (not (= ~p4_old ~nomsg))) (.cse4 (< 0 (+ (div ~send4 256) 1))) (.cse5 (<= .cse6 0))) (or (and (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= ~mode5 (* 256 .cse6)) .cse7 .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse7 (<= 1 ULTIMATE.start_check_~tmp~127) .cse0 .cse1 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse2 (<= 1 ULTIMATE.start_assert_~arg) .cse3 .cse4 .cse5)))) [2018-12-03 16:42:31,628 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 465) no Hoare annotation was computed. [2018-12-03 16:42:31,628 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 91 466) no Hoare annotation was computed. [2018-12-03 16:42:31,629 INFO L444 ceAbstractionStarter]: At program point L351(lines 345 352) the Hoare annotation is: (let ((.cse6 (div ~mode5 256))) (let ((.cse7 (= ~r1 0)) (.cse0 (<= 1 ~mode5)) (.cse1 (<= ~send4 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (not (= ~p4_old ~nomsg))) (.cse4 (< 0 (+ (div ~send4 256) 1))) (.cse5 (<= .cse6 0))) (or (and (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= ~mode5 (* 256 .cse6)) .cse7 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse7 (<= 1 ULTIMATE.start_check_~tmp~127) .cse0 .cse1 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse2 (<= 1 ULTIMATE.start_assert_~arg) .cse3 .cse4 .cse5)))) [2018-12-03 16:42:31,629 INFO L444 ceAbstractionStarter]: At program point L376(lines 376 388) the Hoare annotation is: (let ((.cse6 (div ~mode5 256))) (let ((.cse7 (= ~r1 0)) (.cse0 (<= 1 ~mode5)) (.cse1 (<= ~send4 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (not (= ~p4_old ~nomsg))) (.cse4 (< 0 (+ (div ~send4 256) 1))) (.cse5 (<= .cse6 0))) (or (and (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= ~mode5 (* 256 .cse6)) .cse7 .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse7 (<= 1 ULTIMATE.start_check_~tmp~127) .cse0 .cse1 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse2 (<= 1 ULTIMATE.start_assert_~arg) .cse3 .cse4 .cse5)))) [2018-12-03 16:42:31,629 INFO L444 ceAbstractionStarter]: At program point L463(lines 463 464) the Hoare annotation is: false [2018-12-03 16:42:31,629 INFO L444 ceAbstractionStarter]: At program point L430(lines 430 437) the Hoare annotation is: (and (= ~r1 0) (<= 1 ~mode5) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (not (= ~p4_old ~nomsg)) (< 0 (+ (div ~send4 256) 1)) (<= (div ~mode5 256) 0)) [2018-12-03 16:42:31,629 INFO L444 ceAbstractionStarter]: At program point L331(lines 326 332) the Hoare annotation is: (let ((.cse6 (div ~mode5 256))) (let ((.cse7 (= ~r1 0)) (.cse0 (<= 1 ~mode5)) (.cse1 (<= ~send4 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (not (= ~p4_old ~nomsg))) (.cse4 (< 0 (+ (div ~send4 256) 1))) (.cse5 (<= .cse6 0))) (or (and (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= ~mode5 (* 256 .cse6)) .cse7 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse7 (<= 1 ULTIMATE.start_check_~tmp~127) .cse0 .cse1 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse2 (<= 1 ULTIMATE.start_assert_~arg) .cse3 .cse4 .cse5)))) [2018-12-03 16:42:31,630 INFO L444 ceAbstractionStarter]: At program point L459(lines 309 459) the Hoare annotation is: (let ((.cse1 (= ~r1 0)) (.cse2 (<= ~send4 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (< 0 (+ (div ~send4 256) 1))) (.cse0 (div ~mode5 256))) (or (and (= ~mode5 (* 256 .cse0)) .cse1 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse1 (<= 1 ULTIMATE.start_check_~tmp~127) (<= 1 ~mode5) .cse2 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse3 (<= 1 ULTIMATE.start_assert_~arg) (not (= ~p4_old ~nomsg)) .cse4 (<= .cse0 0)))) [2018-12-03 16:42:31,630 INFO L444 ceAbstractionStarter]: At program point L356(lines 356 366) the Hoare annotation is: (let ((.cse6 (div ~mode5 256))) (let ((.cse7 (= ~r1 0)) (.cse0 (<= 1 ~mode5)) (.cse1 (<= ~send4 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (not (= ~p4_old ~nomsg))) (.cse4 (< 0 (+ (div ~send4 256) 1))) (.cse5 (<= .cse6 0))) (or (and (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= ~mode5 (* 256 .cse6)) .cse7 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse7 (<= 1 ULTIMATE.start_check_~tmp~127) .cse0 .cse1 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse2 (<= 1 ULTIMATE.start_assert_~arg) .cse3 .cse4 .cse5)))) [2018-12-03 16:42:31,630 INFO L444 ceAbstractionStarter]: At program point L451(lines 451 460) the Hoare annotation is: (and (= ~r1 0) (<= 1 ULTIMATE.start_check_~tmp~127) (<= 1 ~mode5) (<= ~send4 127) (<= (div ULTIMATE.start_assert_~arg 256) 0) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg) (not (= ~p4_old ~nomsg)) (< 0 (+ (div ~send4 256) 1)) (<= (div ~mode5 256) 0)) [2018-12-03 16:42:31,630 INFO L444 ceAbstractionStarter]: At program point L414(lines 408 415) the Hoare annotation is: (and (= ~r1 0) (not (= ~p4_new ~nomsg)) (<= 1 ~mode5) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (< 0 (+ (div ~send4 256) 1)) (<= (div ~mode5 256) 0)) [2018-12-03 16:42:31,630 INFO L444 ceAbstractionStarter]: At program point L336(lines 336 346) the Hoare annotation is: (let ((.cse6 (div ~mode5 256))) (let ((.cse7 (= ~r1 0)) (.cse0 (<= 1 ~mode5)) (.cse1 (<= ~send4 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (not (= ~p4_old ~nomsg))) (.cse4 (< 0 (+ (div ~send4 256) 1))) (.cse5 (<= .cse6 0))) (or (and (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= ~mode5 (* 256 .cse6)) .cse7 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse7 (<= 1 ULTIMATE.start_check_~tmp~127) .cse0 .cse1 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse2 (<= 1 ULTIMATE.start_assert_~arg) .cse3 .cse4 .cse5)))) [2018-12-03 16:42:31,631 INFO L444 ceAbstractionStarter]: At program point L394(lines 387 395) the Hoare annotation is: (let ((.cse11 (div ~mode5 256))) (let ((.cse8 (= ~mode4 (* 256 (div ~mode4 256)))) (.cse13 (= ~mode1 (* 256 (div ~mode1 256)))) (.cse14 (<= ~r1 1)) (.cse2 (<= 1 ~mode5)) (.cse10 (<= .cse11 0)) (.cse0 (= ~r1 0)) (.cse1 (<= 1 ULTIMATE.start_check_~tmp~127)) (.cse12 (not (= ~p4_new ~nomsg))) (.cse3 (<= ~send4 127)) (.cse4 (<= (div ULTIMATE.start_assert_~arg 256) 0)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 1 ULTIMATE.start_assert_~arg)) (.cse7 (not (= ~p4_old ~nomsg))) (.cse9 (< 0 (+ (div ~send4 256) 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= ~mode5 (* 256 .cse11)) .cse0 .cse12 .cse3 .cse5 .cse9) (and .cse13 .cse14 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse13 .cse12 .cse14 .cse2 .cse3 .cse5 .cse7 .cse9 .cse10) (and .cse0 .cse1 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9)))) [2018-12-03 16:42:31,652 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:42:31 BoogieIcfgContainer [2018-12-03 16:42:31,652 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:42:31,653 INFO L168 Benchmark]: Toolchain (without parser) took 14416.44 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 836.8 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -654.7 MB). Peak memory consumption was 601.8 MB. Max. memory is 7.1 GB. [2018-12-03 16:42:31,655 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 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 16:42:31,655 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.76 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 16:42:31,656 INFO L168 Benchmark]: Boogie Preprocessor took 42.32 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 16:42:31,656 INFO L168 Benchmark]: RCFGBuilder took 722.41 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-12-03 16:42:31,657 INFO L168 Benchmark]: TraceAbstraction took 13604.10 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 836.8 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -697.0 MB). Peak memory consumption was 559.5 MB. Max. memory is 7.1 GB. [2018-12-03 16:42:31,661 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.23 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 42.76 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 42.32 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 722.41 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13604.10 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 836.8 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -697.0 MB). Peak memory consumption was 559.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 465]: 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: 356]: Loop Invariant Derived loop invariant: ((((((((~mode1 == 256 * (~mode1 / 256) && 1 <= ~mode5) && ~r1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) || ((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1)) || (((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) - InvariantResult [Line: 436]: Loop Invariant Derived loop invariant: ((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0 - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: (((((~r1 == 0 && 1 <= ~mode5) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0 - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: ((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0 - InvariantResult [Line: 376]: Loop Invariant Derived loop invariant: ((((((((~mode1 == 256 * (~mode1 / 256) && 1 <= ~mode5) && ~r1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) || (((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1)) || (((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1) || (((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: ((((((((~mode1 == 256 * (~mode1 / 256) && 1 <= ~mode5) && ~r1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) || ((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1)) || (((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((((((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) || (((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && !(~p4_new == ~nomsg)) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 < ~send4 / 256 + 1)) || ((((((((~mode1 == 256 * (~mode1 / 256) && ~r1 <= 1) && 1 <= ~mode5) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0)) || ((((((((~mode1 == 256 * (~mode1 / 256) && !(~p4_new == ~nomsg)) && ~r1 <= 1) && 1 <= ~mode5) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0)) || ((((((((~r1 == 0 && 1 <= check_~tmp~127) && !(~p4_new == ~nomsg)) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: ((((((((~mode1 == 256 * (~mode1 / 256) && 1 <= ~mode5) && ~r1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) || ((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1)) || (((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: (((((~r1 == 0 && !(~p4_new == ~nomsg)) && 1 <= ~mode5) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0 - InvariantResult [Line: 365]: Loop Invariant Derived loop invariant: ((((((((~mode1 == 256 * (~mode1 / 256) && 1 <= ~mode5) && ~r1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) || (((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1)) || (((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) - InvariantResult [Line: 316]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1) || (((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: ((((((((~mode1 == 256 * (~mode1 / 256) && 1 <= ~mode5) && ~r1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) || ((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1)) || (((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: (((((((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) || (((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && !(~p4_new == ~nomsg)) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 < ~send4 / 256 + 1)) || ((((((((~mode1 == 256 * (~mode1 / 256) && ~r1 <= 1) && 1 <= ~mode5) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0)) || ((((((((~mode1 == 256 * (~mode1 / 256) && !(~p4_new == ~nomsg)) && ~r1 <= 1) && 1 <= ~mode5) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0)) || ((((((((~r1 == 0 && 1 <= check_~tmp~127) && !(~p4_new == ~nomsg)) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) - InvariantResult [Line: 463]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. SAFE Result, 13.5s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 4.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 284 SDtfs, 230 SDslu, 231 SDs, 0 SdLazy, 167 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=741occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.7s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 611 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 107 NumberOfFragments, 1441 HoareAnnotationTreeSize, 15 FomulaSimplifications, 10115 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 15 FomulaSimplificationsInter, 78 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 244 NumberOfCodeBlocks, 244 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 263 ConstructedInterpolants, 0 QuantifiedInterpolants, 34017 SizeOfPredicates, 8 NumberOfNonLiveVariables, 299 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 110/140 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...