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.3.1.ufo.BOUNDED-6.pals.c_13.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:56:50,652 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:56:50,655 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:56:50,676 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:56:50,677 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:56:50,678 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:56:50,680 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:56:50,683 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:56:50,687 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:56:50,688 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:56:50,698 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:56:50,698 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:56:50,699 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:56:50,700 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:56:50,701 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:56:50,708 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:56:50,709 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:56:50,711 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:56:50,713 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:56:50,717 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:56:50,720 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:56:50,722 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:56:50,726 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:56:50,726 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:56:50,727 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:56:50,730 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:56:50,731 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:56:50,732 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:56:50,733 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:56:50,738 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:56:50,738 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:56:50,739 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:56:50,739 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:56:50,741 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:56:50,742 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:56:50,743 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:56:50,743 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:56:50,770 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:56:50,771 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:56:50,772 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:56:50,772 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:56:50,772 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:56:50,772 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:56:50,775 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:56:50,776 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:56:50,776 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:56:50,776 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:56:50,776 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:56:50,776 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:56:50,777 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:56:50,778 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:56:50,779 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:56:50,779 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:56:50,779 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:56:50,779 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:56:50,780 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:56:50,780 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:56:50,780 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:56:50,780 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:56:50,780 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:56:50,782 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:56:50,782 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:56:50,783 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:56:50,783 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:56:50,783 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:56:50,783 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:56:50,784 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:56:50,784 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:56:50,784 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:56:50,784 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:56:50,785 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:56:50,785 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:56:50,785 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:56:50,785 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:56:50,785 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:56:50,786 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:56:50,848 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:56:50,863 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:56:50,871 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:56:50,875 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:56:50,876 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:56:50,877 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl [2018-12-03 17:56:50,877 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl' [2018-12-03 17:56:50,942 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:56:50,944 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:56:50,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:56:50,945 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:56:50,945 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:56:50,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:56:50" (1/1) ... [2018-12-03 17:56:50,974 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:56:50" (1/1) ... [2018-12-03 17:56:50,984 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:56:50,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:56:50,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:56:50,985 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:56:50,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:56:50" (1/1) ... [2018-12-03 17:56:50,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:56:50" (1/1) ... [2018-12-03 17:56:51,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:56:50" (1/1) ... [2018-12-03 17:56:51,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:56:50" (1/1) ... [2018-12-03 17:56:51,011 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:56:50" (1/1) ... [2018-12-03 17:56:51,013 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:56:50" (1/1) ... [2018-12-03 17:56:51,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:56:50" (1/1) ... [2018-12-03 17:56:51,019 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:56:51,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:56:51,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:56:51,020 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:56:51,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:56:50" (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:56:51,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:56:51,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:56:51,661 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:56:51,662 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 17:56:51,662 INFO L202 PluginConnector]: Adding new model pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:56:51 BoogieIcfgContainer [2018-12-03 17:56:51,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:56:51,664 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:56:51,664 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:56:51,668 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:56:51,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:56:50" (1/2) ... [2018-12-03 17:56:51,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f79b50 and model type pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:56:51, skipping insertion in model container [2018-12-03 17:56:51,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:56:51" (2/2) ... [2018-12-03 17:56:51,672 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl [2018-12-03 17:56:51,683 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:56:51,692 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:56:51,710 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:56:51,744 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:56:51,744 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:56:51,744 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:56:51,745 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:56:51,745 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:56:51,745 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:56:51,745 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:56:51,745 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:56:51,762 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-12-03 17:56:51,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 17:56:51,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:51,771 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:56:51,774 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:51,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:51,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1167247547, now seen corresponding path program 1 times [2018-12-03 17:56:51,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:51,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:51,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:51,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:51,844 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:52,045 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:56:52,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:56:52,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:56:52,048 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:56:52,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:56:52,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:56:52,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:52,073 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 3 states. [2018-12-03 17:56:52,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:56:52,139 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2018-12-03 17:56:52,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:56:52,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-03 17:56:52,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:56:52,155 INFO L225 Difference]: With dead ends: 42 [2018-12-03 17:56:52,155 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 17:56:52,160 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:56:52,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 17:56:52,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-12-03 17:56:52,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 17:56:52,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2018-12-03 17:56:52,206 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 13 [2018-12-03 17:56:52,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:56:52,206 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2018-12-03 17:56:52,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:56:52,207 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2018-12-03 17:56:52,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 17:56:52,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:52,208 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:56:52,208 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:52,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:52,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1352712387, now seen corresponding path program 1 times [2018-12-03 17:56:52,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:52,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:52,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:52,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:52,213 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:52,360 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:56:52,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:56:52,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:56:52,361 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:56:52,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:56:52,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:56:52,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:56:52,365 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 4 states. [2018-12-03 17:56:52,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:56:52,486 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2018-12-03 17:56:52,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:56:52,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-12-03 17:56:52,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:56:52,489 INFO L225 Difference]: With dead ends: 53 [2018-12-03 17:56:52,489 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 17:56:52,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:56:52,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 17:56:52,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 29. [2018-12-03 17:56:52,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 17:56:52,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2018-12-03 17:56:52,502 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 13 [2018-12-03 17:56:52,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:56:52,503 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2018-12-03 17:56:52,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:56:52,503 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2018-12-03 17:56:52,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 17:56:52,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:52,504 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:56:52,505 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:52,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:52,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1352652805, now seen corresponding path program 1 times [2018-12-03 17:56:52,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:52,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:52,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:52,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:52,509 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:52,616 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:56:52,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:56:52,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:56:52,617 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:56:52,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:56:52,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:56:52,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:56:52,619 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand 4 states. [2018-12-03 17:56:52,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:56:52,813 INFO L93 Difference]: Finished difference Result 97 states and 135 transitions. [2018-12-03 17:56:52,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 17:56:52,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-12-03 17:56:52,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:56:52,817 INFO L225 Difference]: With dead ends: 97 [2018-12-03 17:56:52,819 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 17:56:52,820 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:56:52,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 17:56:52,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 47. [2018-12-03 17:56:52,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 17:56:52,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2018-12-03 17:56:52,841 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 13 [2018-12-03 17:56:52,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:56:52,841 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2018-12-03 17:56:52,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:56:52,842 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2018-12-03 17:56:52,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 17:56:52,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:52,843 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:56:52,843 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:52,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:52,844 INFO L82 PathProgramCache]: Analyzing trace with hash -653435269, now seen corresponding path program 1 times [2018-12-03 17:56:52,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:52,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:52,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:52,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:52,847 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:52,918 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:56:52,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:56:52,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:56:52,919 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:56:52,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:56:52,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:56:52,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:52,921 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 3 states. [2018-12-03 17:56:52,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:56:52,964 INFO L93 Difference]: Finished difference Result 127 states and 169 transitions. [2018-12-03 17:56:52,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:56:52,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-03 17:56:52,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:56:52,967 INFO L225 Difference]: With dead ends: 127 [2018-12-03 17:56:52,967 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 17:56:52,971 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:56:52,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 17:56:53,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-12-03 17:56:53,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 17:56:53,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 103 transitions. [2018-12-03 17:56:53,011 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 103 transitions. Word has length 13 [2018-12-03 17:56:53,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:56:53,011 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 103 transitions. [2018-12-03 17:56:53,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:56:53,012 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 103 transitions. [2018-12-03 17:56:53,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 17:56:53,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:53,015 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:56:53,015 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:53,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:53,016 INFO L82 PathProgramCache]: Analyzing trace with hash -715001297, now seen corresponding path program 1 times [2018-12-03 17:56:53,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:53,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:53,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:53,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:53,018 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:53,344 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 17:56:53,347 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:56:53,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:56:53,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:56:53,348 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:56:53,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:56:53,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:56:53,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:53,350 INFO L87 Difference]: Start difference. First operand 79 states and 103 transitions. Second operand 3 states. [2018-12-03 17:56:53,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:56:53,409 INFO L93 Difference]: Finished difference Result 235 states and 307 transitions. [2018-12-03 17:56:53,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:56:53,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-03 17:56:53,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:56:53,413 INFO L225 Difference]: With dead ends: 235 [2018-12-03 17:56:53,413 INFO L226 Difference]: Without dead ends: 157 [2018-12-03 17:56:53,414 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:56:53,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-12-03 17:56:53,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2018-12-03 17:56:53,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-12-03 17:56:53,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 198 transitions. [2018-12-03 17:56:53,454 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 198 transitions. Word has length 24 [2018-12-03 17:56:53,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:56:53,454 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 198 transitions. [2018-12-03 17:56:53,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:56:53,455 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 198 transitions. [2018-12-03 17:56:53,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 17:56:53,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:53,457 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:56:53,457 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:53,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:53,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1395059667, now seen corresponding path program 1 times [2018-12-03 17:56:53,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:53,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:53,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:53,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:53,461 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:53,635 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:56:53,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:56:53,636 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:56:53,637 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 17:56:53,640 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [36], [38], [40], [44], [46], [48] [2018-12-03 17:56:53,713 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:56:53,713 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:56:54,501 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 17:57:24,110 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:57:24,112 INFO L272 AbstractInterpreter]: Visited 19 different actions 380 times. Merged at 18 different actions 248 times. Widened at 16 different actions 163 times. Found 78 fixpoints after 13 different actions. Largest state had 0 variables. [2018-12-03 17:57:24,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:57:24,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:57:24,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:57:24,128 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 17:57:24,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:57:24,142 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:57:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:57:24,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:57:24,370 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:57:24,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:57:24,777 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:57:24,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:57:24,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 12 [2018-12-03 17:57:24,804 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:57:24,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:57:24,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:57:24,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-03 17:57:24,806 INFO L87 Difference]: Start difference. First operand 155 states and 198 transitions. Second operand 9 states. [2018-12-03 17:57:24,976 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-03 17:57:26,198 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 17:57:26,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:57:26,534 INFO L93 Difference]: Finished difference Result 399 states and 495 transitions. [2018-12-03 17:57:26,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:57:26,535 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-12-03 17:57:26,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:57:26,536 INFO L225 Difference]: With dead ends: 399 [2018-12-03 17:57:26,536 INFO L226 Difference]: Without dead ends: 152 [2018-12-03 17:57:26,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=167, Invalid=433, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:57:26,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-03 17:57:26,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 113. [2018-12-03 17:57:26,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-03 17:57:26,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2018-12-03 17:57:26,569 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 24 [2018-12-03 17:57:26,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:57:26,569 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2018-12-03 17:57:26,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:57:26,570 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2018-12-03 17:57:26,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 17:57:26,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:57:26,571 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:57:26,572 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:57:26,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:57:26,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1721434125, now seen corresponding path program 2 times [2018-12-03 17:57:26,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:57:26,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:57:26,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:57:26,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:57:26,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:57:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:57:26,654 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-12-03 17:57:26,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:57:26,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:57:26,655 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:57:26,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:57:26,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:57:26,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:57:26,656 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand 3 states. [2018-12-03 17:57:26,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:57:26,662 INFO L93 Difference]: Finished difference Result 113 states and 131 transitions. [2018-12-03 17:57:26,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:57:26,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-03 17:57:26,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:57:26,663 INFO L225 Difference]: With dead ends: 113 [2018-12-03 17:57:26,663 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 17:57:26,664 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:57:26,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 17:57:26,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 17:57:26,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 17:57:26,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 17:57:26,665 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-12-03 17:57:26,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:57:26,665 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 17:57:26,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:57:26,665 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 17:57:26,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 17:57:26,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 17:57:27,912 WARN L180 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2018-12-03 17:57:28,661 WARN L180 SmtUtils]: Spent 746.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2018-12-03 17:57:28,828 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2018-12-03 17:57:28,965 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2018-12-03 17:57:29,073 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2018-12-03 17:57:29,425 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-12-03 17:57:29,634 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 51 305) no Hoare annotation was computed. [2018-12-03 17:57:29,635 INFO L444 ceAbstractionStarter]: At program point L186(lines 186 197) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div ~send1 256) 1))) (.cse2 (div ~mode2 256)) (.cse1 (<= ~send1 127)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) .cse3) (and (= (+ ~st3 ~st2 ~st1) 0) (= ~r1 0) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode2 (* 256 .cse2)) .cse1 .cse3))) [2018-12-03 17:57:29,635 INFO L444 ceAbstractionStarter]: At program point L248(lines 240 249) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) .cse0 (<= ~r1 2) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= (+ ~st3 ~st2 ~st1) 0) (= ~r1 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2018-12-03 17:57:29,636 INFO L444 ceAbstractionStarter]: At program point L209(lines 209 219) the Hoare annotation is: (let ((.cse2 (div ~mode2 256))) (let ((.cse6 (<= 1 ~mode2)) (.cse7 (<= .cse2 0)) (.cse5 (not (= ~p1_old ~nomsg))) (.cse0 (not (= ~p1_new ~nomsg))) (.cse1 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (= 0 (+ ~nomsg 1)))) (or (and (= (+ ~st3 ~st2 ~st1) 0) (= ~r1 0) .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode2 (* 256 .cse2)) .cse3 .cse4) (and .cse5 .cse6 .cse0 .cse1 .cse3 .cse7 .cse4) (and .cse5 (= ~mode1 (* 256 (div ~mode1 256))) .cse6 .cse1 .cse3 .cse7 .cse4) (and .cse5 (<= ~r1 2) .cse0 .cse1 .cse3 .cse4)))) [2018-12-03 17:57:29,636 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 304) no Hoare annotation was computed. [2018-12-03 17:57:29,636 INFO L444 ceAbstractionStarter]: At program point L302(lines 179 302) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div ~send1 256) 1))) (.cse2 (div ~mode2 256)) (.cse1 (<= ~send1 127)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) .cse3) (and (= (+ ~st3 ~st2 ~st1) 0) (= ~r1 0) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode2 (* 256 .cse2)) .cse1 .cse3))) [2018-12-03 17:57:29,636 INFO L444 ceAbstractionStarter]: At program point L269(lines 265 276) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= ~r1 2) (<= 1 ~mode2) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= (div ~mode2 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 17:57:29,636 INFO L444 ceAbstractionStarter]: At program point L296(lines 296 303) the Hoare annotation is: false [2018-12-03 17:57:29,637 INFO L444 ceAbstractionStarter]: At program point L226(lines 218 227) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (= (+ ~st3 ~st2 ~st1) 0) (= ~r1 0) .cse0 .cse1 .cse2 (= ~mode3 (* 256 (div ~mode3 256))) .cse3 .cse4 .cse5) (and (not (= ~p1_old ~nomsg)) .cse0 (<= ~r1 2) .cse1 .cse2 .cse3 .cse4 .cse5))) [2018-12-03 17:57:29,637 INFO L444 ceAbstractionStarter]: At program point L290(lines 290 297) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (= ULTIMATE.start_assert_~arg 1) (<= ~r1 2) (<= 1 ~mode2) (< 0 (+ (div ~send1 256) 1)) (<= 1 ULTIMATE.start_check_~tmp~63) (<= ~send1 127) (<= (div ~mode2 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 17:57:29,637 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 51 305) no Hoare annotation was computed. [2018-12-03 17:57:29,637 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 51 305) no Hoare annotation was computed. [2018-12-03 17:57:29,637 INFO L444 ceAbstractionStarter]: At program point L280(lines 275 281) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= ~r1 2) (<= 1 ~mode2) (< 0 (+ (div ~send1 256) 1)) (<= 1 ULTIMATE.start_check_~tmp~63) (<= ~send1 127) (<= (div ~mode2 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 17:57:29,638 INFO L444 ceAbstractionStarter]: At program point L204(lines 196 205) the Hoare annotation is: (let ((.cse2 (div ~mode2 256))) (let ((.cse6 (<= 1 ~mode2)) (.cse7 (<= .cse2 0)) (.cse5 (not (= ~p1_old ~nomsg))) (.cse0 (not (= ~p1_new ~nomsg))) (.cse1 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (= 0 (+ ~nomsg 1)))) (or (and (= (+ ~st3 ~st2 ~st1) 0) (= ~r1 0) .cse0 .cse1 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode2 (* 256 .cse2)) .cse3 .cse4) (and .cse5 .cse6 .cse0 .cse1 .cse3 .cse7 .cse4) (and .cse5 (= ~mode1 (* 256 (div ~mode1 256))) .cse6 .cse1 .cse3 .cse7 .cse4) (and .cse5 (<= ~r1 2) .cse0 .cse1 .cse3 .cse4)))) [2018-12-03 17:57:29,638 INFO L444 ceAbstractionStarter]: At program point L231(lines 231 241) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (= (+ ~st3 ~st2 ~st1) 0) (= ~r1 0) .cse0 .cse1 .cse2 (= ~mode3 (* 256 (div ~mode3 256))) .cse3 .cse4 .cse5) (and (not (= ~p1_old ~nomsg)) .cse0 (<= ~r1 2) .cse1 .cse2 .cse3 .cse4 .cse5))) [2018-12-03 17:57:29,638 INFO L444 ceAbstractionStarter]: At program point L260(lines 260 266) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= ~r1 2) (<= 1 ~mode2) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= (div ~mode2 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 17:57:29,657 INFO L202 PluginConnector]: Adding new model pals_lcr.3.1.ufo.BOUNDED-6.pals.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 05:57:29 BoogieIcfgContainer [2018-12-03 17:57:29,658 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 17:57:29,659 INFO L168 Benchmark]: Toolchain (without parser) took 38716.06 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-12-03 17:57:29,660 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 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 17:57:29,661 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.95 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 17:57:29,661 INFO L168 Benchmark]: Boogie Preprocessor took 34.48 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 17:57:29,662 INFO L168 Benchmark]: RCFGBuilder took 642.97 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-03 17:57:29,663 INFO L168 Benchmark]: TraceAbstraction took 37993.82 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-12-03 17:57:29,673 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.25 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 39.95 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 34.48 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 642.97 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 37993.82 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 304]: 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: 186]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) || (((((((~st3 + ~st2 + ~st1 == 0 && ~r1 == 0) && ~mode1 == 256 * (~mode1 / 256)) && 0 < ~send1 / 256 + 1) && ~mode3 == 256 * (~mode3 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: (((((((((~st3 + ~st2 + ~st1 == 0 && ~r1 == 0) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~mode3 == 256 * (~mode3 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) || ((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1)) || ((((((!(~p1_old == ~nomsg) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && ~r1 <= 2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: (((((((((~st3 + ~st2 + ~st1 == 0 && ~r1 == 0) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~mode3 == 256 * (~mode3 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) || ((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1)) || ((((((!(~p1_old == ~nomsg) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1)) || (((((!(~p1_old == ~nomsg) && ~r1 <= 2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: ((((((((~st3 + ~st2 + ~st1 == 0 && ~r1 == 0) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~mode3 == 256 * (~mode3 / 256)) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) || (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && ~r1 <= 2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: ((((((((~st3 + ~st2 + ~st1 == 0 && ~r1 == 0) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~mode3 == 256 * (~mode3 / 256)) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) || (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && ~r1 <= 2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && assert_~arg == 1) && ~r1 <= 2) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && 1 <= check_~tmp~63) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && ~r1 <= 2) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 240]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && ~r1 <= 2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) || (((((((~st3 + ~st2 + ~st1 == 0 && ~r1 == 0) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 275]: Loop Invariant Derived loop invariant: ((((((!(~p1_old == ~nomsg) && ~r1 <= 2) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && 1 <= check_~tmp~63) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) || (((((((~st3 + ~st2 + ~st1 == 0 && ~r1 == 0) && ~mode1 == 256 * (~mode1 / 256)) && 0 < ~send1 / 256 + 1) && ~mode3 == 256 * (~mode3 / 256)) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 260]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && ~r1 <= 2) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. SAFE Result, 37.9s OverallTime, 7 OverallIterations, 4 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 2.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 143 SDtfs, 184 SDslu, 151 SDs, 0 SdLazy, 174 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 30.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 89 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 109 NumberOfFragments, 795 HoareAnnotationTreeSize, 12 FomulaSimplifications, 4555 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 780 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 185 ConstructedInterpolants, 0 QuantifiedInterpolants, 19195 SizeOfPredicates, 11 NumberOfNonLiveVariables, 206 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 92/110 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...