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.4.2.ufo.UNBOUNDED.pals.c_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:42:02,113 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:42:02,115 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:42:02,128 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:42:02,128 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:42:02,129 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:42:02,130 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:42:02,132 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:42:02,134 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:42:02,135 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:42:02,136 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:42:02,137 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:42:02,138 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:42:02,138 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:42:02,140 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:42:02,140 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:42:02,141 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:42:02,143 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:42:02,145 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:42:02,147 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:42:02,148 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:42:02,149 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:42:02,152 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:42:02,152 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:42:02,152 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:42:02,153 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:42:02,155 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:42:02,155 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:42:02,156 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:42:02,158 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:42:02,158 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:42:02,159 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:42:02,159 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:42:02,159 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:42:02,160 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:42:02,161 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:42:02,161 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:02,175 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:42:02,175 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:42:02,176 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:42:02,176 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:42:02,176 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:42:02,177 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:42:02,177 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:42:02,177 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:42:02,177 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:42:02,177 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:42:02,178 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:42:02,178 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:42:02,178 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:42:02,178 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:42:02,178 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:42:02,179 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:42:02,179 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:42:02,180 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:42:02,180 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:42:02,180 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:42:02,180 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:42:02,180 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:42:02,181 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:42:02,181 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:42:02,181 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:42:02,181 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:42:02,182 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:42:02,182 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:42:02,182 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:42:02,182 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:42:02,182 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:42:02,183 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:42:02,183 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:42:02,183 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:42:02,183 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:42:02,183 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:42:02,184 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:42:02,184 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:42:02,184 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:42:02,184 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:42:02,184 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:42:02,215 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:42:02,231 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:42:02,237 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:42:02,239 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:42:02,239 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:42:02,240 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.4.2.ufo.UNBOUNDED.pals.c_11.bpl [2018-12-03 16:42:02,241 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl' [2018-12-03 16:42:02,336 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:42:02,338 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:42:02,339 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:42:02,339 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:42:02,339 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:42:02,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:02" (1/1) ... [2018-12-03 16:42:02,370 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:02" (1/1) ... [2018-12-03 16:42:02,380 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:42:02,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:42:02,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:42:02,382 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:42:02,394 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:02" (1/1) ... [2018-12-03 16:42:02,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:02" (1/1) ... [2018-12-03 16:42:02,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:02" (1/1) ... [2018-12-03 16:42:02,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:02" (1/1) ... [2018-12-03 16:42:02,406 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:02" (1/1) ... [2018-12-03 16:42:02,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:02" (1/1) ... [2018-12-03 16:42:02,412 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:02" (1/1) ... [2018-12-03 16:42:02,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:42:02,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:42:02,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:42:02,425 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:42:02,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:02" (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:02,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:42:02,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:42:03,081 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:42:03,082 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:42:03,082 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:42:03 BoogieIcfgContainer [2018-12-03 16:42:03,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:42:03,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:42:03,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:42:03,087 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:42:03,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:02" (1/2) ... [2018-12-03 16:42:03,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7309cc5b and model type pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:42:03, skipping insertion in model container [2018-12-03 16:42:03,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:42:03" (2/2) ... [2018-12-03 16:42:03,090 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl [2018-12-03 16:42:03,100 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:42:03,109 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:42:03,127 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:42:03,169 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:42:03,170 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:42:03,170 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:42:03,170 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:42:03,170 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:42:03,170 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:42:03,170 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:42:03,171 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:42:03,189 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-12-03 16:42:03,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:42:03,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:03,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:03,207 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:03,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:03,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1823027031, now seen corresponding path program 1 times [2018-12-03 16:42:03,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:03,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:03,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:03,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:03,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:03,485 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:03,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:03,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:03,488 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:03,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:03,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:03,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:03,512 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-12-03 16:42:03,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:03,562 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2018-12-03 16:42:03,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:03,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 16:42:03,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:03,581 INFO L225 Difference]: With dead ends: 45 [2018-12-03 16:42:03,582 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:42:03,585 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:03,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:42:03,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-12-03 16:42:03,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 16:42:03,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-03 16:42:03,628 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2018-12-03 16:42:03,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:03,629 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-03 16:42:03,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:03,629 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-03 16:42:03,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:42:03,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:03,630 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:03,630 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:03,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:03,631 INFO L82 PathProgramCache]: Analyzing trace with hash 2081192469, now seen corresponding path program 1 times [2018-12-03 16:42:03,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:03,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:03,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:03,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:03,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:03,758 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:03,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:03,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:03,759 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:03,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:03,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:03,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:03,762 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 3 states. [2018-12-03 16:42:03,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:03,821 INFO L93 Difference]: Finished difference Result 79 states and 109 transitions. [2018-12-03 16:42:03,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:03,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 16:42:03,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:03,826 INFO L225 Difference]: With dead ends: 79 [2018-12-03 16:42:03,827 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 16:42:03,828 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:03,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 16:42:03,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-12-03 16:42:03,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 16:42:03,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2018-12-03 16:42:03,854 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 14 [2018-12-03 16:42:03,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:03,854 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2018-12-03 16:42:03,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:03,856 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2018-12-03 16:42:03,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:42:03,856 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:03,856 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:03,857 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:03,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:03,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1271845843, now seen corresponding path program 1 times [2018-12-03 16:42:03,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:03,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:03,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:03,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:03,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:04,058 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:04,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:04,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:42:04,062 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:04,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:42:04,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:42:04,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:42:04,064 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand 4 states. [2018-12-03 16:42:04,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:04,273 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2018-12-03 16:42:04,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:42:04,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-03 16:42:04,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:04,283 INFO L225 Difference]: With dead ends: 109 [2018-12-03 16:42:04,283 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 16:42:04,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:42:04,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 16:42:04,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 59. [2018-12-03 16:42:04,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 16:42:04,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2018-12-03 16:42:04,322 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 14 [2018-12-03 16:42:04,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:04,322 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2018-12-03 16:42:04,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:42:04,323 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2018-12-03 16:42:04,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:42:04,323 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:04,324 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:04,324 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:04,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:04,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1271905425, now seen corresponding path program 1 times [2018-12-03 16:42:04,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:04,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:04,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:04,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:04,328 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:04,436 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:04,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:04,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:04,437 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:04,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:04,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:04,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:04,438 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand 3 states. [2018-12-03 16:42:04,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:04,513 INFO L93 Difference]: Finished difference Result 143 states and 190 transitions. [2018-12-03 16:42:04,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:04,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 16:42:04,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:04,516 INFO L225 Difference]: With dead ends: 143 [2018-12-03 16:42:04,516 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 16:42:04,517 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:04,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 16:42:04,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 16:42:04,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 16:42:04,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2018-12-03 16:42:04,538 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 14 [2018-12-03 16:42:04,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:04,539 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2018-12-03 16:42:04,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:04,539 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2018-12-03 16:42:04,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 16:42:04,541 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:04,541 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:04,542 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:04,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:04,542 INFO L82 PathProgramCache]: Analyzing trace with hash -602166477, now seen corresponding path program 1 times [2018-12-03 16:42:04,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:04,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:04,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:04,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:04,545 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:04,688 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:04,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:04,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:42:04,688 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:04,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:04,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:04,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:04,690 INFO L87 Difference]: Start difference. First operand 85 states and 111 transitions. Second operand 3 states. [2018-12-03 16:42:04,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:04,785 INFO L93 Difference]: Finished difference Result 249 states and 327 transitions. [2018-12-03 16:42:04,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:04,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-03 16:42:04,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:04,789 INFO L225 Difference]: With dead ends: 249 [2018-12-03 16:42:04,790 INFO L226 Difference]: Without dead ends: 167 [2018-12-03 16:42:04,795 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 16:42:04,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-03 16:42:04,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-12-03 16:42:04,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-03 16:42:04,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 212 transitions. [2018-12-03 16:42:04,855 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 212 transitions. Word has length 26 [2018-12-03 16:42:04,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:04,855 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 212 transitions. [2018-12-03 16:42:04,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:04,856 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 212 transitions. [2018-12-03 16:42:04,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 16:42:04,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:04,857 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:04,858 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:04,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:04,859 INFO L82 PathProgramCache]: Analyzing trace with hash -209139467, now seen corresponding path program 1 times [2018-12-03 16:42:04,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:04,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:04,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:04,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:04,863 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:05,245 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 16:42:05,248 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:05,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:05,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:42:05,250 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:05,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:05,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:05,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:05,251 INFO L87 Difference]: Start difference. First operand 165 states and 212 transitions. Second operand 3 states. [2018-12-03 16:42:05,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:05,374 INFO L93 Difference]: Finished difference Result 489 states and 630 transitions. [2018-12-03 16:42:05,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:05,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-03 16:42:05,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:05,378 INFO L225 Difference]: With dead ends: 489 [2018-12-03 16:42:05,378 INFO L226 Difference]: Without dead ends: 327 [2018-12-03 16:42:05,379 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:05,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-12-03 16:42:05,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2018-12-03 16:42:05,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-12-03 16:42:05,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 408 transitions. [2018-12-03 16:42:05,465 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 408 transitions. Word has length 26 [2018-12-03 16:42:05,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:05,470 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 408 transitions. [2018-12-03 16:42:05,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:05,471 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 408 transitions. [2018-12-03 16:42:05,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 16:42:05,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:05,473 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] [2018-12-03 16:42:05,474 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:05,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:05,474 INFO L82 PathProgramCache]: Analyzing trace with hash -266397769, now seen corresponding path program 1 times [2018-12-03 16:42:05,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:05,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:05,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:05,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:05,476 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:05,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:05,934 WARN L180 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-12-03 16:42:05,964 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:05,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:05,964 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:42:05,965 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-03 16:42:05,967 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42], [46], [48], [50] [2018-12-03 16:42:06,013 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:42:06,013 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:42:07,594 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:42:07,596 INFO L272 AbstractInterpreter]: Visited 20 different actions 172 times. Merged at 19 different actions 110 times. Widened at 13 different actions 17 times. Found 39 fixpoints after 13 different actions. Largest state had 0 variables. [2018-12-03 16:42:07,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:07,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:42:07,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:07,646 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:07,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:07,667 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:42:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:07,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:42:08,029 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 16:42:08,029 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:42:08,413 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 16:42:08,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:42:08,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2018-12-03 16:42:08,450 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:42:08,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:42:08,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:42:08,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:42:08,452 INFO L87 Difference]: Start difference. First operand 325 states and 408 transitions. Second operand 7 states. [2018-12-03 16:42:08,679 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 16:42:08,980 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 16:42:09,563 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-03 16:42:09,786 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-03 16:42:11,075 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 16:42:11,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:11,386 INFO L93 Difference]: Finished difference Result 911 states and 1139 transitions. [2018-12-03 16:42:11,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:42:11,391 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-03 16:42:11,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:11,395 INFO L225 Difference]: With dead ends: 911 [2018-12-03 16:42:11,395 INFO L226 Difference]: Without dead ends: 589 [2018-12-03 16:42:11,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:42:11,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-12-03 16:42:11,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 409. [2018-12-03 16:42:11,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-12-03 16:42:11,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 505 transitions. [2018-12-03 16:42:11,503 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 505 transitions. Word has length 26 [2018-12-03 16:42:11,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:11,504 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 505 transitions. [2018-12-03 16:42:11,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:42:11,504 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 505 transitions. [2018-12-03 16:42:11,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 16:42:11,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:11,507 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 16:42:11,507 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:11,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:11,508 INFO L82 PathProgramCache]: Analyzing trace with hash 819979193, now seen corresponding path program 2 times [2018-12-03 16:42:11,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:11,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:11,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:11,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:11,510 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:11,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:11,703 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 16:42:11,710 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-03 16:42:11,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:11,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:42:11,711 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:11,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:11,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:11,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:11,712 INFO L87 Difference]: Start difference. First operand 409 states and 505 transitions. Second operand 3 states. [2018-12-03 16:42:11,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:11,899 INFO L93 Difference]: Finished difference Result 945 states and 1155 transitions. [2018-12-03 16:42:11,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:11,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-03 16:42:11,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:11,902 INFO L225 Difference]: With dead ends: 945 [2018-12-03 16:42:11,902 INFO L226 Difference]: Without dead ends: 423 [2018-12-03 16:42:11,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:11,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-12-03 16:42:11,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 349. [2018-12-03 16:42:11,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-12-03 16:42:11,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 416 transitions. [2018-12-03 16:42:11,989 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 416 transitions. Word has length 50 [2018-12-03 16:42:11,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:11,989 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 416 transitions. [2018-12-03 16:42:11,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:11,989 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 416 transitions. [2018-12-03 16:42:11,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 16:42:11,991 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:11,991 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 16:42:11,992 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:11,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:11,992 INFO L82 PathProgramCache]: Analyzing trace with hash 47747323, now seen corresponding path program 3 times [2018-12-03 16:42:11,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:11,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:11,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:42:11,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:11,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:12,066 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-12-03 16:42:12,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:12,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:12,067 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:12,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:12,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:12,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:12,068 INFO L87 Difference]: Start difference. First operand 349 states and 416 transitions. Second operand 3 states. [2018-12-03 16:42:12,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:12,079 INFO L93 Difference]: Finished difference Result 351 states and 418 transitions. [2018-12-03 16:42:12,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:12,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-03 16:42:12,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:12,080 INFO L225 Difference]: With dead ends: 351 [2018-12-03 16:42:12,080 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 16:42:12,081 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:12,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 16:42:12,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 16:42:12,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 16:42:12,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 16:42:12,082 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2018-12-03 16:42:12,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:12,082 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 16:42:12,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:12,082 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 16:42:12,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 16:42:12,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 16:42:12,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:12,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:14,005 WARN L180 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-12-03 16:42:14,748 WARN L180 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 16:42:14,994 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2018-12-03 16:42:15,143 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 16:42:15,384 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-12-03 16:42:15,743 WARN L180 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-12-03 16:42:15,861 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 16:42:15,981 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 16:42:16,097 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2018-12-03 16:42:16,177 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 74 385) no Hoare annotation was computed. [2018-12-03 16:42:16,177 INFO L444 ceAbstractionStarter]: At program point L318(lines 312 319) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse2 (< 0 (+ (div ~send2 256) 1))) (.cse3 (<= (div ~mode2 256) 0)) (.cse4 (<= 1 ~mode3)) (.cse6 (<= (div ~mode3 256) 0)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse7) (and .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse6 .cse5 .cse7))) [2018-12-03 16:42:16,177 INFO L444 ceAbstractionStarter]: At program point L382(lines 252 382) the Hoare annotation is: (let ((.cse1 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse2 (div ~mode2 256)) (.cse4 (= 0 (+ ~nomsg 1))) (.cse0 (div ~mode3 256))) (or (and (= ~mode3 (* 256 .cse0)) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (= ~mode2 (* 256 .cse2)) .cse3 .cse4 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse1 .cse3 (<= .cse2 0) (<= 1 ~mode3) .cse4 (<= .cse0 0)))) [2018-12-03 16:42:16,177 INFO L444 ceAbstractionStarter]: At program point L275(lines 270 276) the Hoare annotation is: (let ((.cse2 (div ~mode2 256)) (.cse4 (div ~mode3 256)) (.cse0 (<= ~send2 127)) (.cse1 (< 0 (+ (div ~send2 256) 1))) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) (<= 1 ~mode3) .cse3 (<= .cse4 0)) (and (= ~mode2 (* 256 .cse2)) (and (= ~mode3 (* 256 .cse4)) .cse0 .cse1 .cse3 (<= ~r1 (* 256 (div ~r1 256))))))) [2018-12-03 16:42:16,178 INFO L444 ceAbstractionStarter]: At program point L298(lines 289 299) the Hoare annotation is: (let ((.cse8 (div ~mode3 256))) (let ((.cse0 (= ~mode3 (* 256 .cse8))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~send2 127)) (.cse4 (< 0 (+ (div ~send2 256) 1))) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7) (and (and (not (= ~p2_old ~nomsg)) .cse2 .cse4 .cse6) (<= 1 ~mode3) (<= .cse8 0)) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse7)))) [2018-12-03 16:42:16,178 INFO L444 ceAbstractionStarter]: At program point L259(lines 259 271) the Hoare annotation is: (let ((.cse1 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse2 (div ~mode2 256)) (.cse4 (= 0 (+ ~nomsg 1))) (.cse0 (div ~mode3 256))) (or (and (= ~mode3 (* 256 .cse0)) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (= ~mode2 (* 256 .cse2)) .cse3 .cse4 (<= ~r1 (* 256 (div ~r1 256)))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse1 .cse3 (<= .cse2 0) (<= 1 ~mode3) .cse4 (<= .cse0 0)))) [2018-12-03 16:42:16,178 INFO L444 ceAbstractionStarter]: At program point L323(lines 323 333) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse2 (< 0 (+ (div ~send2 256) 1))) (.cse3 (<= (div ~mode2 256) 0)) (.cse4 (<= 1 ~mode3)) (.cse6 (<= (div ~mode3 256) 0)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse7) (and .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse6 .cse5 .cse7))) [2018-12-03 16:42:16,178 INFO L444 ceAbstractionStarter]: At program point L352(lines 352 359) the Hoare annotation is: (let ((.cse0 (not (= ~p2_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= (div ~mode3 256) 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse3 .cse4 .cse5 .cse6 .cse7))) [2018-12-03 16:42:16,179 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 74 385) no Hoare annotation was computed. [2018-12-03 16:42:16,179 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 74 385) no Hoare annotation was computed. [2018-12-03 16:42:16,179 INFO L444 ceAbstractionStarter]: At program point L379(lines 379 383) the Hoare annotation is: false [2018-12-03 16:42:16,179 INFO L444 ceAbstractionStarter]: At program point L280(lines 280 290) the Hoare annotation is: (let ((.cse2 (div ~mode2 256)) (.cse4 (div ~mode3 256)) (.cse0 (<= ~send2 127)) (.cse1 (< 0 (+ (div ~send2 256) 1))) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) (<= 1 ~mode3) .cse3 (<= .cse4 0)) (and (= ~mode2 (* 256 .cse2)) (and (= ~mode3 (* 256 .cse4)) .cse0 .cse1 .cse3 (<= ~r1 (* 256 (div ~r1 256))))))) [2018-12-03 16:42:16,179 INFO L444 ceAbstractionStarter]: At program point L373(lines 373 380) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (not (= 0 ULTIMATE.start_check_~tmp~101)) (<= 1 ~mode2) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= (div ULTIMATE.start_assert_~arg 256) 0) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= (div ~mode3 256) 0) (<= 1 ULTIMATE.start_assert_~arg)) [2018-12-03 16:42:16,179 INFO L444 ceAbstractionStarter]: At program point L338(lines 332 339) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse2 (< 0 (+ (div ~send2 256) 1))) (.cse3 (<= (div ~mode2 256) 0)) (.cse4 (<= 1 ~mode3)) (.cse6 (<= (div ~mode3 256) 0)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse7) (and .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse6 .cse5 .cse7))) [2018-12-03 16:42:16,180 INFO L444 ceAbstractionStarter]: At program point L303(lines 303 313) the Hoare annotation is: (let ((.cse8 (div ~mode3 256))) (let ((.cse0 (= ~mode3 (* 256 .cse8))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~send2 127)) (.cse4 (< 0 (+ (div ~send2 256) 1))) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7) (and (and (not (= ~p2_old ~nomsg)) .cse2 .cse4 .cse6) (<= 1 ~mode3) (<= .cse8 0)) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse7)))) [2018-12-03 16:42:16,180 INFO L444 ceAbstractionStarter]: At program point L363(lines 358 364) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (not (= 0 ULTIMATE.start_check_~tmp~101)) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (<= (div ~mode3 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 16:42:16,180 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 384) no Hoare annotation was computed. [2018-12-03 16:42:16,200 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:42:16 BoogieIcfgContainer [2018-12-03 16:42:16,201 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:42:16,202 INFO L168 Benchmark]: Toolchain (without parser) took 13865.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 822.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -744.3 MB). Peak memory consumption was 617.2 MB. Max. memory is 7.1 GB. [2018-12-03 16:42:16,203 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:42:16,203 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.07 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:42:16,204 INFO L168 Benchmark]: Boogie Preprocessor took 39.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:42:16,205 INFO L168 Benchmark]: RCFGBuilder took 660.82 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-12-03 16:42:16,205 INFO L168 Benchmark]: TraceAbstraction took 13117.60 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 822.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -786.5 MB). Peak memory consumption was 574.9 MB. Max. memory is 7.1 GB. [2018-12-03 16:42:16,209 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.07 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 660.82 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13117.60 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 822.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -786.5 MB). Peak memory consumption was 574.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 384]: 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: 303]: Loop Invariant Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || (((((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && 1 <= ~mode3) && ~mode3 / 256 <= 0)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 323]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 358]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && !(0 == check_~tmp~101)) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 270]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || (~mode2 == 256 * (~mode2 / 256) && (((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && ~r1 <= 256 * (~r1 / 256)) || ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: (((((((((!(~p2_old == ~nomsg) && !(0 == check_~tmp~101)) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && assert_~arg / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && 1 <= assert_~arg - InvariantResult [Line: 289]: Loop Invariant Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || (((((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && 1 <= ~mode3) && ~mode3 / 256 <= 0)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 252]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) - InvariantResult [Line: 312]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && ~mode3 / 256 <= 0) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || (~mode2 == 256 * (~mode2 / 256) && (((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 379]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 13.0s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 3.8s AutomataDifference, 0.0s DeadEndRemovalTime, 4.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 230 SDtfs, 197 SDslu, 195 SDs, 0 SdLazy, 164 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=409occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.6s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 310 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 133 NumberOfFragments, 1019 HoareAnnotationTreeSize, 13 FomulaSimplifications, 15464 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 13 FomulaSimplificationsInter, 180 FormulaSimplificationTreeSizeReductionInter, 3.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 275 ConstructedInterpolants, 8 QuantifiedInterpolants, 30980 SizeOfPredicates, 1 NumberOfNonLiveVariables, 244 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 182/204 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...