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_oct_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:58:58,025 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:58:58,027 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:58:58,043 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:58:58,043 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:58:58,044 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:58:58,046 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:58:58,049 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:58:58,051 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:58:58,052 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:58:58,053 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:58:58,053 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:58:58,056 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:58:58,057 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:58:58,058 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:58:58,067 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:58:58,068 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:58:58,071 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:58:58,074 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:58:58,076 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:58:58,077 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:58:58,079 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:58:58,082 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:58:58,082 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:58:58,082 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:58:58,083 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:58:58,084 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:58:58,089 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:58:58,090 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:58:58,091 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:58:58,092 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:58:58,092 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:58:58,092 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:58:58,094 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:58:58,095 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:58:58,096 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:58:58,096 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 17:58:58,117 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:58:58,117 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:58:58,118 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:58:58,119 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:58:58,119 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:58:58,119 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:58:58,119 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:58:58,119 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:58:58,120 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:58:58,120 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:58:58,120 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:58:58,120 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:58:58,120 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:58:58,122 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:58:58,122 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:58:58,122 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:58:58,122 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:58:58,123 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:58:58,124 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:58:58,124 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:58:58,124 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:58:58,124 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:58:58,124 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:58:58,126 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:58:58,126 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:58:58,126 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:58:58,126 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:58:58,127 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:58:58,127 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:58:58,127 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:58:58,127 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:58:58,127 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:58:58,128 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:58:58,129 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:58:58,129 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:58:58,129 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:58:58,129 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:58:58,129 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:58:58,129 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:58:58,161 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:58:58,178 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:58:58,183 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:58:58,184 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:58:58,185 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:58:58,186 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl [2018-12-03 17:58:58,186 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl' [2018-12-03 17:58:58,271 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:58:58,273 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:58:58,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:58:58,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:58:58,274 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:58:58,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:58:58" (1/1) ... [2018-12-03 17:58:58,305 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:58:58" (1/1) ... [2018-12-03 17:58:58,314 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:58:58,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:58:58,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:58:58,315 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:58:58,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:58:58" (1/1) ... [2018-12-03 17:58:58,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:58:58" (1/1) ... [2018-12-03 17:58:58,333 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:58:58" (1/1) ... [2018-12-03 17:58:58,333 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:58:58" (1/1) ... [2018-12-03 17:58:58,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:58:58" (1/1) ... [2018-12-03 17:58:58,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:58:58" (1/1) ... [2018-12-03 17:58:58,368 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:58:58" (1/1) ... [2018-12-03 17:58:58,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:58:58,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:58:58,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:58:58,382 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:58:58,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:58:58" (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 17:58:58,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:58:58,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:58:59,171 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:58:59,171 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 17:58:59,172 INFO L202 PluginConnector]: Adding new model pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:58:59 BoogieIcfgContainer [2018-12-03 17:58:59,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:58:59,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:58:59,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:58:59,176 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:58:59,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:58:58" (1/2) ... [2018-12-03 17:58:59,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ce73c8 and model type pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:58:59, skipping insertion in model container [2018-12-03 17:58:59,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:58:59" (2/2) ... [2018-12-03 17:58:59,180 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl [2018-12-03 17:58:59,190 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:58:59,198 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:58:59,216 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:58:59,248 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:58:59,248 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:58:59,248 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:58:59,248 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:58:59,249 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:58:59,249 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:58:59,249 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:58:59,249 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:58:59,263 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-12-03 17:58:59,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 17:58:59,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:58:59,270 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:58:59,273 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:58:59,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:58:59,279 INFO L82 PathProgramCache]: Analyzing trace with hash -61215035, now seen corresponding path program 1 times [2018-12-03 17:58:59,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:58:59,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:58:59,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:58:59,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:58:59,341 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:58:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:58:59,533 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 17:58:59,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:58:59,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:58:59,536 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:58:59,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:58:59,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:58:59,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:58:59,555 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-12-03 17:58:59,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:58:59,614 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2018-12-03 17:58:59,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:58:59,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-03 17:58:59,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:58:59,630 INFO L225 Difference]: With dead ends: 54 [2018-12-03 17:58:59,630 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 17:58:59,634 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 17:58:59,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 17:58:59,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-12-03 17:58:59,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 17:58:59,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2018-12-03 17:58:59,681 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 17 [2018-12-03 17:58:59,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:58:59,681 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2018-12-03 17:58:59,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:58:59,682 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2018-12-03 17:58:59,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 17:58:59,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:58:59,683 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:58:59,684 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:58:59,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:58:59,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1341078713, now seen corresponding path program 1 times [2018-12-03 17:58:59,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:58:59,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:58:59,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:58:59,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:58:59,690 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:58:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:58:59,861 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 17:58:59,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:58:59,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:58:59,862 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:58:59,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:58:59,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:58:59,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:58:59,865 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand 3 states. [2018-12-03 17:58:59,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:58:59,952 INFO L93 Difference]: Finished difference Result 97 states and 139 transitions. [2018-12-03 17:58:59,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:58:59,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-03 17:58:59,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:58:59,957 INFO L225 Difference]: With dead ends: 97 [2018-12-03 17:58:59,957 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 17:58:59,958 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 17:58:59,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 17:58:59,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-12-03 17:58:59,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 17:58:59,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2018-12-03 17:58:59,981 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 17 [2018-12-03 17:58:59,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:58:59,981 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2018-12-03 17:58:59,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:58:59,981 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2018-12-03 17:58:59,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 17:58:59,982 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:58:59,982 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:58:59,983 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:58:59,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:58:59,983 INFO L82 PathProgramCache]: Analyzing trace with hash -754272699, now seen corresponding path program 1 times [2018-12-03 17:58:59,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:58:59,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:58:59,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:58:59,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:58:59,987 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:59:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:59:00,108 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 17:59:00,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:59:00,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:59:00,113 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:59:00,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:59:00,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:59:00,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:59:00,114 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand 3 states. [2018-12-03 17:59:00,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:59:00,160 INFO L93 Difference]: Finished difference Result 187 states and 268 transitions. [2018-12-03 17:59:00,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:59:00,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-03 17:59:00,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:59:00,165 INFO L225 Difference]: With dead ends: 187 [2018-12-03 17:59:00,165 INFO L226 Difference]: Without dead ends: 125 [2018-12-03 17:59:00,166 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 17:59:00,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-03 17:59:00,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-12-03 17:59:00,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-03 17:59:00,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 174 transitions. [2018-12-03 17:59:00,197 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 174 transitions. Word has length 17 [2018-12-03 17:59:00,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:59:00,198 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 174 transitions. [2018-12-03 17:59:00,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:59:00,198 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 174 transitions. [2018-12-03 17:59:00,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 17:59:00,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:59:00,199 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:59:00,200 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:59:00,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:59:00,200 INFO L82 PathProgramCache]: Analyzing trace with hash -53208121, now seen corresponding path program 1 times [2018-12-03 17:59:00,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:59:00,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:00,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:59:00,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:00,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:59:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:59:00,286 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 17:59:00,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:59:00,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:59:00,287 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:59:00,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:59:00,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:59:00,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:59:00,289 INFO L87 Difference]: Start difference. First operand 123 states and 174 transitions. Second operand 3 states. [2018-12-03 17:59:00,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:59:00,369 INFO L93 Difference]: Finished difference Result 367 states and 520 transitions. [2018-12-03 17:59:00,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:59:00,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-03 17:59:00,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:59:00,373 INFO L225 Difference]: With dead ends: 367 [2018-12-03 17:59:00,374 INFO L226 Difference]: Without dead ends: 245 [2018-12-03 17:59:00,375 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 17:59:00,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-12-03 17:59:00,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-12-03 17:59:00,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-12-03 17:59:00,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 338 transitions. [2018-12-03 17:59:00,451 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 338 transitions. Word has length 17 [2018-12-03 17:59:00,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:59:00,452 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 338 transitions. [2018-12-03 17:59:00,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:59:00,453 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 338 transitions. [2018-12-03 17:59:00,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 17:59:00,454 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:59:00,454 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:59:00,454 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:59:00,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:59:00,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1721799241, now seen corresponding path program 1 times [2018-12-03 17:59:00,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:59:00,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:00,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:59:00,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:00,459 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:59:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:59:00,685 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 17:59:00,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:59:00,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:59:00,686 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:59:00,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:59:00,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:59:00,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:59:00,687 INFO L87 Difference]: Start difference. First operand 243 states and 338 transitions. Second operand 4 states. [2018-12-03 17:59:00,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:59:00,906 INFO L93 Difference]: Finished difference Result 517 states and 707 transitions. [2018-12-03 17:59:00,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:59:00,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-12-03 17:59:00,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:59:00,910 INFO L225 Difference]: With dead ends: 517 [2018-12-03 17:59:00,910 INFO L226 Difference]: Without dead ends: 515 [2018-12-03 17:59:00,911 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 17:59:00,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-12-03 17:59:00,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 275. [2018-12-03 17:59:00,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-12-03 17:59:00,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 370 transitions. [2018-12-03 17:59:00,982 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 370 transitions. Word has length 17 [2018-12-03 17:59:00,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:59:00,983 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 370 transitions. [2018-12-03 17:59:00,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:59:00,983 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 370 transitions. [2018-12-03 17:59:00,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 17:59:00,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:59:00,990 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:59:00,990 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:59:00,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:59:00,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1721858823, now seen corresponding path program 1 times [2018-12-03 17:59:00,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:59:00,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:00,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:59:00,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:00,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:59:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:59:01,146 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 17:59:01,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:59:01,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:59:01,147 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:59:01,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:59:01,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:59:01,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:59:01,148 INFO L87 Difference]: Start difference. First operand 275 states and 370 transitions. Second operand 4 states. [2018-12-03 17:59:01,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:59:01,422 INFO L93 Difference]: Finished difference Result 799 states and 1085 transitions. [2018-12-03 17:59:01,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 17:59:01,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-12-03 17:59:01,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:59:01,426 INFO L225 Difference]: With dead ends: 799 [2018-12-03 17:59:01,426 INFO L226 Difference]: Without dead ends: 525 [2018-12-03 17:59:01,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:59:01,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-12-03 17:59:01,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 403. [2018-12-03 17:59:01,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-12-03 17:59:01,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 526 transitions. [2018-12-03 17:59:01,521 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 526 transitions. Word has length 17 [2018-12-03 17:59:01,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:59:01,522 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 526 transitions. [2018-12-03 17:59:01,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:59:01,522 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 526 transitions. [2018-12-03 17:59:01,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 17:59:01,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:59:01,526 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, 1, 1] [2018-12-03 17:59:01,526 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:59:01,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:59:01,527 INFO L82 PathProgramCache]: Analyzing trace with hash 2097839419, now seen corresponding path program 1 times [2018-12-03 17:59:01,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:59:01,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:01,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:59:01,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:01,529 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:59:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:59:01,710 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:59:01,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:59:01,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:59:01,711 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:59:01,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:59:01,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:59:01,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:59:01,712 INFO L87 Difference]: Start difference. First operand 403 states and 526 transitions. Second operand 3 states. [2018-12-03 17:59:01,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:59:01,936 INFO L93 Difference]: Finished difference Result 1207 states and 1576 transitions. [2018-12-03 17:59:01,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:59:01,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-03 17:59:01,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:59:01,942 INFO L225 Difference]: With dead ends: 1207 [2018-12-03 17:59:01,943 INFO L226 Difference]: Without dead ends: 805 [2018-12-03 17:59:01,944 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 17:59:01,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2018-12-03 17:59:02,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 803. [2018-12-03 17:59:02,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2018-12-03 17:59:02,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1026 transitions. [2018-12-03 17:59:02,105 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1026 transitions. Word has length 32 [2018-12-03 17:59:02,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:59:02,105 INFO L480 AbstractCegarLoop]: Abstraction has 803 states and 1026 transitions. [2018-12-03 17:59:02,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:59:02,105 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1026 transitions. [2018-12-03 17:59:02,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 17:59:02,117 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:59:02,117 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, 1, 1] [2018-12-03 17:59:02,118 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:59:02,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:59:02,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1417781049, now seen corresponding path program 1 times [2018-12-03 17:59:02,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:59:02,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:02,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:59:02,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:02,123 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:59:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:59:02,468 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 10 [2018-12-03 17:59:02,497 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:59:02,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:59:02,497 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:59:02,498 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-12-03 17:59:02,500 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42], [46], [48], [52], [54], [56], [60], [62], [64] [2018-12-03 17:59:02,564 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:59:02,565 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:59:03,914 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 18:01:21,057 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:01:21,059 INFO L272 AbstractInterpreter]: Visited 25 different actions 734 times. Merged at 24 different actions 511 times. Widened at 23 different actions 349 times. Found 175 fixpoints after 21 different actions. Largest state had 0 variables. [2018-12-03 18:01:21,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:21,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:01:21,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:21,086 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 18:01:21,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:21,097 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:01:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:21,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:01:21,847 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-12-03 18:01:22,136 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:22,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:01:22,766 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:22,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:01:22,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2018-12-03 18:01:22,800 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:01:22,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 18:01:22,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 18:01:22,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-03 18:01:22,803 INFO L87 Difference]: Start difference. First operand 803 states and 1026 transitions. Second operand 8 states. [2018-12-03 18:01:23,050 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-12-03 18:01:23,455 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2018-12-03 18:01:23,825 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2018-12-03 18:01:25,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:01:25,381 INFO L93 Difference]: Finished difference Result 1347 states and 1711 transitions. [2018-12-03 18:01:25,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 18:01:25,385 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-12-03 18:01:25,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:01:25,388 INFO L225 Difference]: With dead ends: 1347 [2018-12-03 18:01:25,388 INFO L226 Difference]: Without dead ends: 374 [2018-12-03 18:01:25,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2018-12-03 18:01:25,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-12-03 18:01:25,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 212. [2018-12-03 18:01:25,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-12-03 18:01:25,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 260 transitions. [2018-12-03 18:01:25,456 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 260 transitions. Word has length 32 [2018-12-03 18:01:25,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:01:25,456 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 260 transitions. [2018-12-03 18:01:25,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 18:01:25,457 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 260 transitions. [2018-12-03 18:01:25,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 18:01:25,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:01:25,459 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, 1, 1] [2018-12-03 18:01:25,460 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:01:25,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:25,461 INFO L82 PathProgramCache]: Analyzing trace with hash -2063114371, now seen corresponding path program 2 times [2018-12-03 18:01:25,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:01:25,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:25,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:25,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:25,463 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:01:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:25,549 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 18:01:25,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:01:25,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:01:25,550 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:01:25,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:01:25,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:01:25,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:01:25,551 INFO L87 Difference]: Start difference. First operand 212 states and 260 transitions. Second operand 3 states. [2018-12-03 18:01:25,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:01:25,562 INFO L93 Difference]: Finished difference Result 220 states and 268 transitions. [2018-12-03 18:01:25,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:01:25,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-03 18:01:25,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:01:25,562 INFO L225 Difference]: With dead ends: 220 [2018-12-03 18:01:25,563 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 18:01:25,563 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 18:01:25,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 18:01:25,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 18:01:25,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 18:01:25,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 18:01:25,564 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-12-03 18:01:25,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:01:25,565 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 18:01:25,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:01:25,565 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 18:01:25,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 18:01:25,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 18:01:25,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:01:25,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:01:25,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:01:25,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:01:25,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:01:25,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 18:01:26,537 WARN L180 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-12-03 18:01:27,467 WARN L180 SmtUtils]: Spent 928.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2018-12-03 18:01:27,717 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2018-12-03 18:01:27,968 WARN L180 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2018-12-03 18:01:28,163 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-12-03 18:01:28,335 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-12-03 18:01:28,495 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2018-12-03 18:01:28,708 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2018-12-03 18:01:29,143 WARN L180 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2018-12-03 18:01:29,327 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-12-03 18:01:29,462 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2018-12-03 18:01:29,633 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-12-03 18:01:29,787 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2018-12-03 18:01:29,791 INFO L444 ceAbstractionStarter]: At program point L403(lines 403 409) the Hoare annotation is: (and (<= (div ~mode4 256) 0) (<= ~send3 127) (<= 1 ~mode4) (<= 0 ~send4) (<= ~send4 127) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= .cse0 ~p4_old) (<= 0 v_prenex_1)))) (= 0 (+ ~nomsg 1)) (<= ~r1 4) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-12-03 18:01:29,791 INFO L444 ceAbstractionStarter]: At program point L370(lines 370 380) the Hoare annotation is: (let ((.cse0 (<= (div ~mode4 256) 0)) (.cse2 (<= ~send3 127)) (.cse3 (<= 1 ~mode4)) (.cse4 (exists ((v_prenex_1 Int)) (let ((.cse10 (mod v_prenex_1 256))) (and (= ~p4_new .cse10) (<= .cse10 127) (<= v_prenex_1 127) (<= 0 v_prenex_1))))) (.cse5 (<= 0 ~send4)) (.cse6 (<= ~send4 127)) (.cse7 (not (= ~p3_new ~nomsg))) (.cse8 (= 0 (+ ~nomsg 1))) (.cse1 (<= ~r1 4)) (.cse9 (<= 0 ~send3))) (or (and .cse0 (and (= ~mode5 (* 256 (div ~mode5 256))) .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse1 .cse9 (not (= ~p3_old ~nomsg))))) [2018-12-03 18:01:29,791 INFO L444 ceAbstractionStarter]: At program point L304(lines 304 315) the Hoare annotation is: (let ((.cse1 (<= ~send3 127)) (.cse2 (<= 0 ~send4)) (.cse3 (<= ~send4 127)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3)) (.cse0 (div ~mode4 256))) (or (and (<= .cse0 0) .cse1 (<= 1 ~mode4) .cse2 .cse3 (exists ((v_prenex_1 Int)) (let ((.cse4 (mod v_prenex_1 256))) (and (<= .cse4 127) (<= v_prenex_1 127) (= .cse4 ~p4_old) (<= 0 v_prenex_1)))) .cse5 .cse6 (not (= ~p3_old ~nomsg))) (and (and .cse1 .cse2 .cse3 (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode2 (* 256 (div ~mode2 256))) (<= ~r1 4)) .cse5 .cse6) (= ~mode4 (* 256 .cse0))))) [2018-12-03 18:01:29,792 INFO L444 ceAbstractionStarter]: At program point L387(lines 379 388) the Hoare annotation is: (and (<= (div ~mode4 256) 0) (<= ~send3 127) (<= 1 ~mode4) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (= ~p4_new .cse0) (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (<= 0 ~send4) (<= ~send4 127) (not (= ~p3_new ~nomsg)) (= 0 (+ ~nomsg 1)) (<= ~r1 4) (<= 0 ~send3)) [2018-12-03 18:01:29,792 INFO L444 ceAbstractionStarter]: At program point L321(lines 314 322) the Hoare annotation is: (let ((.cse1 (<= ~send3 127)) (.cse2 (<= 0 ~send4)) (.cse3 (<= ~send4 127)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3)) (.cse0 (div ~mode4 256))) (or (and (<= .cse0 0) .cse1 (<= 1 ~mode4) .cse2 .cse3 (exists ((v_prenex_1 Int)) (let ((.cse4 (mod v_prenex_1 256))) (and (<= .cse4 127) (<= v_prenex_1 127) (= .cse4 ~p4_old) (<= 0 v_prenex_1)))) .cse5 .cse6 (not (= ~p3_old ~nomsg))) (and (and .cse1 .cse2 .cse3 (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (<= ~r1 4)) .cse5 .cse6) (= ~mode4 (* 256 .cse0))))) [2018-12-03 18:01:29,792 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 81 448) no Hoare annotation was computed. [2018-12-03 18:01:29,793 INFO L444 ceAbstractionStarter]: At program point L445(lines 274 445) the Hoare annotation is: (let ((.cse5 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (<= 0 ~send4)) (.cse2 (<= ~send4 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3))) (or (and (and .cse0 .cse1 .cse2 .cse3 (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) (<= ~r1 4)) .cse4) (= ~mode4 (* 256 .cse5))) (and (<= .cse5 0) .cse0 (<= 1 ~mode4) .cse1 .cse2 (exists ((v_prenex_1 Int)) (let ((.cse6 (mod v_prenex_1 256))) (and (<= .cse6 127) (<= v_prenex_1 127) (= .cse6 ~p4_old) (<= 0 v_prenex_1)))) .cse3 .cse4 (not (= ~p3_old ~nomsg))))) [2018-12-03 18:01:29,793 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 81 448) no Hoare annotation was computed. [2018-12-03 18:01:29,793 INFO L444 ceAbstractionStarter]: At program point L412(lines 408 419) the Hoare annotation is: (and (<= (div ~mode4 256) 0) (<= ~send3 127) (<= 1 ~mode4) (<= 0 ~send4) (<= ~send4 127) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= .cse0 ~p4_old) (<= 0 v_prenex_1)))) (= 0 (+ ~nomsg 1)) (<= ~r1 4) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-12-03 18:01:29,793 INFO L444 ceAbstractionStarter]: At program point L433(lines 433 440) the Hoare annotation is: (and (<= ~send3 127) (<= 1 ~mode4) (<= 0 ~send4) (<= (div ULTIMATE.start_assert_~arg 256) 0) (= 0 (+ ~nomsg 1)) (<= ~r1 4) (<= 0 ~send3) (not (= ~p3_old ~nomsg)) (<= (div ~mode4 256) 0) (<= ~send4 127) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= .cse0 ~p4_old) (<= 0 v_prenex_1)))) (<= 1 ULTIMATE.start_assert_~arg) (<= 1 ULTIMATE.start_check_~tmp~106)) [2018-12-03 18:01:29,794 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 447) no Hoare annotation was computed. [2018-12-03 18:01:29,794 INFO L444 ceAbstractionStarter]: At program point L326(lines 326 336) the Hoare annotation is: (let ((.cse1 (<= ~send3 127)) (.cse2 (<= 0 ~send4)) (.cse3 (<= ~send4 127)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3)) (.cse0 (div ~mode4 256))) (or (and (<= .cse0 0) .cse1 (<= 1 ~mode4) .cse2 .cse3 (exists ((v_prenex_1 Int)) (let ((.cse4 (mod v_prenex_1 256))) (and (<= .cse4 127) (<= v_prenex_1 127) (= .cse4 ~p4_old) (<= 0 v_prenex_1)))) .cse5 .cse6 (not (= ~p3_old ~nomsg))) (and (and .cse1 .cse2 .cse3 (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (<= ~r1 4)) .cse5 .cse6) (= ~mode4 (* 256 .cse0))))) [2018-12-03 18:01:29,794 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 81 448) no Hoare annotation was computed. [2018-12-03 18:01:29,794 INFO L444 ceAbstractionStarter]: At program point L281(lines 281 292) the Hoare annotation is: (let ((.cse5 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (<= 0 ~send4)) (.cse2 (<= ~send4 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3))) (or (and (and .cse0 .cse1 .cse2 .cse3 (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) (= ~mode2 (* 256 (div ~mode2 256))) (<= ~r1 4)) .cse4) (= ~mode4 (* 256 .cse5))) (and (<= .cse5 0) .cse0 (<= 1 ~mode4) .cse1 .cse2 (exists ((v_prenex_1 Int)) (let ((.cse6 (mod v_prenex_1 256))) (and (<= .cse6 127) (<= v_prenex_1 127) (= .cse6 ~p4_old) (<= 0 v_prenex_1)))) .cse3 .cse4 (not (= ~p3_old ~nomsg))))) [2018-12-03 18:01:29,795 INFO L444 ceAbstractionStarter]: At program point L343(lines 335 344) the Hoare annotation is: (let ((.cse11 (div ~mode4 256))) (let ((.cse0 (<= .cse11 0)) (.cse2 (<= 1 ~mode4)) (.cse5 (exists ((v_prenex_1 Int)) (let ((.cse12 (mod v_prenex_1 256))) (and (<= .cse12 127) (<= v_prenex_1 127) (= .cse12 ~p4_old) (<= 0 v_prenex_1))))) (.cse1 (<= ~send3 127)) (.cse3 (<= 0 ~send4)) (.cse4 (<= ~send4 127)) (.cse6 (not (= ~p3_new ~nomsg))) (.cse7 (= 0 (+ ~nomsg 1))) (.cse10 (<= ~r1 4)) (.cse8 (<= 0 ~send3)) (.cse9 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 (= ~mode3 (* 256 (div ~mode3 256))) .cse3 .cse4 .cse5 .cse7 .cse8 .cse9) (and (and (and (= ~mode5 (* 256 (div ~mode5 256))) .cse10) .cse1 .cse3 .cse4 .cse6 .cse7 .cse8) (= ~mode4 (* 256 .cse11))) (and .cse1 .cse3 .cse4 .cse6 .cse7 .cse10 .cse8 .cse9)))) [2018-12-03 18:01:29,795 INFO L444 ceAbstractionStarter]: At program point L348(lines 348 358) the Hoare annotation is: (let ((.cse11 (div ~mode4 256))) (let ((.cse0 (<= .cse11 0)) (.cse2 (<= 1 ~mode4)) (.cse5 (exists ((v_prenex_1 Int)) (let ((.cse12 (mod v_prenex_1 256))) (and (<= .cse12 127) (<= v_prenex_1 127) (= .cse12 ~p4_old) (<= 0 v_prenex_1))))) (.cse1 (<= ~send3 127)) (.cse3 (<= 0 ~send4)) (.cse4 (<= ~send4 127)) (.cse6 (not (= ~p3_new ~nomsg))) (.cse7 (= 0 (+ ~nomsg 1))) (.cse10 (<= ~r1 4)) (.cse8 (<= 0 ~send3)) (.cse9 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 (= ~mode3 (* 256 (div ~mode3 256))) .cse3 .cse4 .cse5 .cse7 .cse8 .cse9) (and (and (and (= ~mode5 (* 256 (div ~mode5 256))) .cse10) .cse1 .cse3 .cse4 .cse6 .cse7 .cse8) (= ~mode4 (* 256 .cse11))) (and .cse1 .cse3 .cse4 .cse6 .cse7 .cse10 .cse8 .cse9)))) [2018-12-03 18:01:29,795 INFO L444 ceAbstractionStarter]: At program point L439(lines 439 446) the Hoare annotation is: false [2018-12-03 18:01:29,795 INFO L444 ceAbstractionStarter]: At program point L365(lines 357 366) the Hoare annotation is: (let ((.cse0 (<= (div ~mode4 256) 0)) (.cse2 (<= ~send3 127)) (.cse3 (<= 1 ~mode4)) (.cse4 (exists ((v_prenex_1 Int)) (let ((.cse10 (mod v_prenex_1 256))) (and (= ~p4_new .cse10) (<= .cse10 127) (<= v_prenex_1 127) (<= 0 v_prenex_1))))) (.cse5 (<= 0 ~send4)) (.cse6 (<= ~send4 127)) (.cse7 (not (= ~p3_new ~nomsg))) (.cse8 (= 0 (+ ~nomsg 1))) (.cse1 (<= ~r1 4)) (.cse9 (<= 0 ~send3))) (or (and .cse0 (and (= ~mode5 (* 256 (div ~mode5 256))) .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse1 .cse9 (not (= ~p3_old ~nomsg))))) [2018-12-03 18:01:29,796 INFO L444 ceAbstractionStarter]: At program point L299(lines 291 300) the Hoare annotation is: (let ((.cse1 (<= ~send3 127)) (.cse2 (<= 0 ~send4)) (.cse3 (<= ~send4 127)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3)) (.cse0 (div ~mode4 256))) (or (and (<= .cse0 0) .cse1 (<= 1 ~mode4) .cse2 .cse3 (exists ((v_prenex_1 Int)) (let ((.cse4 (mod v_prenex_1 256))) (and (<= .cse4 127) (<= v_prenex_1 127) (= .cse4 ~p4_old) (<= 0 v_prenex_1)))) .cse5 .cse6 (not (= ~p3_old ~nomsg))) (and (and .cse1 .cse2 .cse3 (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode2 (* 256 (div ~mode2 256))) (<= ~r1 4)) .cse5 .cse6) (= ~mode4 (* 256 .cse0))))) [2018-12-03 18:01:29,796 INFO L444 ceAbstractionStarter]: At program point L423(lines 418 424) the Hoare annotation is: (and (<= (div ~mode4 256) 0) (<= ~send3 127) (<= 1 ~mode4) (<= 0 ~send4) (<= ~send4 127) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= .cse0 ~p4_old) (<= 0 v_prenex_1)))) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_check_~tmp~106) (<= ~r1 4) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-12-03 18:01:29,822 INFO L202 PluginConnector]: Adding new model pals_lcr.5.ufo.BOUNDED-10.pals.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 06:01:29 BoogieIcfgContainer [2018-12-03 18:01:29,822 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 18:01:29,823 INFO L168 Benchmark]: Toolchain (without parser) took 151551.09 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-12-03 18:01:29,824 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 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 18:01:29,825 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.55 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 18:01:29,825 INFO L168 Benchmark]: Boogie Preprocessor took 66.06 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 18:01:29,826 INFO L168 Benchmark]: RCFGBuilder took 790.93 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 18:01:29,827 INFO L168 Benchmark]: TraceAbstraction took 150649.15 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-12-03 18:01:29,831 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.22 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 40.55 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 66.06 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 790.93 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 150649.15 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 447]: 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: 379]: Loop Invariant Derived loop invariant: ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && (exists v_prenex_1 : int :: ((~p4_new == v_prenex_1 % 256 && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send4) && ~send4 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 4) && 0 <= ~send3 - InvariantResult [Line: 357]: Loop Invariant Derived loop invariant: (((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256) && ~r1 <= 4) && ~send3 <= 127) && 1 <= ~mode4) && (exists v_prenex_1 : int :: ((~p4_new == v_prenex_1 % 256 && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send4) && ~send4 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) || ((((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && (exists v_prenex_1 : int :: ((~p4_new == v_prenex_1 % 256 && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send4) && ~send4 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: (((((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send4) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~r1 <= 4) && ~send3 <= 127) && 0 <= ~send4) && ~send4 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode4 == 256 * (~mode4 / 256))) || (((((((~send3 <= 127 && 0 <= ~send4) && ~send4 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 439]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send4) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 0 <= ~send4) && ~send4 <= 127) && (~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~r1 <= 4) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode4 == 256 * (~mode4 / 256)) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send4) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 291]: Loop Invariant Derived loop invariant: ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send4) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 0 <= ~send4) && ~send4 <= 127) && ((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~r1 <= 4) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode4 == 256 * (~mode4 / 256)) - InvariantResult [Line: 274]: Loop Invariant Derived loop invariant: ((((((~send3 <= 127 && 0 <= ~send4) && ~send4 <= 127) && 0 == ~nomsg + 1) && (((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~r1 <= 4) && 0 <= ~send3) && ~mode4 == 256 * (~mode4 / 256)) || ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send4) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 370]: Loop Invariant Derived loop invariant: (((((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256) && ~r1 <= 4) && ~send3 <= 127) && 1 <= ~mode4) && (exists v_prenex_1 : int :: ((~p4_new == v_prenex_1 % 256 && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send4) && ~send4 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) || ((((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && (exists v_prenex_1 : int :: ((~p4_new == v_prenex_1 % 256 && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 <= ~send4) && ~send4 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: (((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send4) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 1 <= check_~tmp~106) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 348]: Loop Invariant Derived loop invariant: (((((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send4) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send4) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((((~mode5 == 256 * (~mode5 / 256) && ~r1 <= 4) && ~send3 <= 127) && 0 <= ~send4) && ~send4 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode4 == 256 * (~mode4 / 256))) || (((((((~send3 <= 127 && 0 <= ~send4) && ~send4 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send4) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 433]: Loop Invariant Derived loop invariant: (((((((((((~send3 <= 127 && 1 <= ~mode4) && 0 <= ~send4) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 4) && 0 <= ~send3) && !(~p3_old == ~nomsg)) && ~mode4 / 256 <= 0) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 1 <= assert_~arg) && 1 <= check_~tmp~106 - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send4) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 0 <= ~send4) && ~send4 <= 127) && (~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~r1 <= 4) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode4 == 256 * (~mode4 / 256)) - InvariantResult [Line: 304]: Loop Invariant Derived loop invariant: ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send4) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~send3 <= 127 && 0 <= ~send4) && ~send4 <= 127) && ((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~r1 <= 4) && 0 == ~nomsg + 1) && 0 <= ~send3) && ~mode4 == 256 * (~mode4 / 256)) - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ((((((~send3 <= 127 && 0 <= ~send4) && ~send4 <= 127) && 0 == ~nomsg + 1) && (((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~r1 <= 4) && 0 <= ~send3) && ~mode4 == 256 * (~mode4 / 256)) || ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 <= ~send4) && ~send4 <= 127) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p4_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. SAFE Result, 150.5s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 4.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 287 SDtfs, 265 SDslu, 246 SDs, 0 SdLazy, 184 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=803occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 138.5s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 534 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 195 NumberOfFragments, 1458 HoareAnnotationTreeSize, 16 FomulaSimplifications, 16272 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 16 FomulaSimplificationsInter, 1376 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 251 ConstructedInterpolants, 17 QuantifiedInterpolants, 40742 SizeOfPredicates, 4 NumberOfNonLiveVariables, 307 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 47/75 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...