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_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:38:54,741 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:38:54,743 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:38:54,759 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:38:54,760 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:38:54,761 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:38:54,762 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:38:54,764 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:38:54,766 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:38:54,767 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:38:54,768 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:38:54,768 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:38:54,769 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:38:54,772 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:38:54,773 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:38:54,774 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:38:54,777 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:38:54,779 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:38:54,785 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:38:54,788 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:38:54,790 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:38:54,793 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:38:54,796 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:38:54,800 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:38:54,800 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:38:54,801 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:38:54,802 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:38:54,803 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:38:54,808 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:38:54,810 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:38:54,811 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:38:54,811 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:38:54,811 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:38:54,813 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:38:54,814 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:38:54,815 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:38:54,815 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:38:54,840 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:38:54,841 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:38:54,842 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:38:54,842 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:38:54,842 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:38:54,842 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:38:54,842 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:38:54,843 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:38:54,843 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:38:54,843 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:38:54,843 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:38:54,843 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:38:54,846 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:38:54,846 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:38:54,847 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:38:54,847 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:38:54,848 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:38:54,848 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:38:54,848 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:38:54,848 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:38:54,848 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:38:54,850 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:38:54,850 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:38:54,851 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:38:54,851 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:38:54,851 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:38:54,851 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:38:54,851 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:38:54,853 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:38:54,853 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:38:54,853 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:38:54,853 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:38:54,853 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:38:54,854 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:38:54,854 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:38:54,854 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:38:54,854 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:38:54,854 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:38:54,855 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:38:54,855 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:38:54,855 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:38:54,901 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:38:54,913 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:38:54,917 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:38:54,919 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:38:54,919 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:38:54,920 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl [2018-12-03 15:38:54,921 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl' [2018-12-03 15:38:54,999 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:38:55,001 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:38:55,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:38:55,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:38:55,002 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:38:55,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:38:54" (1/1) ... [2018-12-03 15:38:55,033 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:38:54" (1/1) ... [2018-12-03 15:38:55,048 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:38:55,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:38:55,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:38:55,049 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:38:55,062 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:38:54" (1/1) ... [2018-12-03 15:38:55,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:38:54" (1/1) ... [2018-12-03 15:38:55,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:38:54" (1/1) ... [2018-12-03 15:38:55,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:38:54" (1/1) ... [2018-12-03 15:38:55,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:38:54" (1/1) ... [2018-12-03 15:38:55,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:38:54" (1/1) ... [2018-12-03 15:38:55,103 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:38:54" (1/1) ... [2018-12-03 15:38:55,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:38:55,107 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:38:55,107 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:38:55,108 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:38:55,109 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:38:54" (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 15:38:55,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:38:55,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:38:55,812 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:38:55,813 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:38:55,813 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:38:55 BoogieIcfgContainer [2018-12-03 15:38:55,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:38:55,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:38:55,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:38:55,820 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:38:55,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:38:54" (1/2) ... [2018-12-03 15:38:55,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bac715f and model type pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:38:55, skipping insertion in model container [2018-12-03 15:38:55,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:38:55" (2/2) ... [2018-12-03 15:38:55,823 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl [2018-12-03 15:38:55,833 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:38:55,845 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:38:55,868 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:38:55,916 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:38:55,916 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:38:55,917 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:38:55,917 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:38:55,917 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:38:55,917 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:38:55,917 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:38:55,917 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:38:55,939 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-12-03 15:38:55,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:38:55,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:55,952 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:38:55,955 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:55,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:55,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1823027031, now seen corresponding path program 1 times [2018-12-03 15:38:55,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:56,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:56,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:56,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:56,028 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:56,198 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 15:38:56,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:38:56,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:38:56,201 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:38:56,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:38:56,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:38:56,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:38:56,224 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-12-03 15:38:56,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:56,283 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2018-12-03 15:38:56,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:38:56,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 15:38:56,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:56,296 INFO L225 Difference]: With dead ends: 45 [2018-12-03 15:38:56,296 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:38:56,300 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 15:38:56,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:38:56,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-12-03 15:38:56,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 15:38:56,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-03 15:38:56,346 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2018-12-03 15:38:56,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:56,346 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-03 15:38:56,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:38:56,346 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-03 15:38:56,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:38:56,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:56,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:38:56,348 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:56,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:56,348 INFO L82 PathProgramCache]: Analyzing trace with hash 2081192469, now seen corresponding path program 1 times [2018-12-03 15:38:56,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:56,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:56,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:56,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:56,352 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:56,526 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 15:38:56,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:38:56,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:38:56,527 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:38:56,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:38:56,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:38:56,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:38:56,532 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 3 states. [2018-12-03 15:38:56,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:56,583 INFO L93 Difference]: Finished difference Result 79 states and 109 transitions. [2018-12-03 15:38:56,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:38:56,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 15:38:56,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:56,586 INFO L225 Difference]: With dead ends: 79 [2018-12-03 15:38:56,586 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 15:38:56,587 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 15:38:56,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 15:38:56,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-12-03 15:38:56,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 15:38:56,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2018-12-03 15:38:56,606 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 14 [2018-12-03 15:38:56,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:56,607 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2018-12-03 15:38:56,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:38:56,607 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2018-12-03 15:38:56,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:38:56,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:56,608 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:38:56,608 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:56,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:56,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1271845843, now seen corresponding path program 1 times [2018-12-03 15:38:56,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:56,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:56,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:56,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:56,612 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:56,939 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 8 [2018-12-03 15:38:56,941 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 15:38:56,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:38:56,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:38:56,942 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:38:56,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:38:56,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:38:56,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:38:56,943 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand 4 states. [2018-12-03 15:38:57,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:57,217 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2018-12-03 15:38:57,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:38:57,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-03 15:38:57,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:57,222 INFO L225 Difference]: With dead ends: 109 [2018-12-03 15:38:57,223 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 15:38:57,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:38:57,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 15:38:57,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 59. [2018-12-03 15:38:57,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 15:38:57,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2018-12-03 15:38:57,260 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 14 [2018-12-03 15:38:57,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:57,260 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2018-12-03 15:38:57,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:38:57,261 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2018-12-03 15:38:57,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:38:57,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:57,262 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:38:57,263 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:57,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:57,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1271905425, now seen corresponding path program 1 times [2018-12-03 15:38:57,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:57,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:57,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:57,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:57,267 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:57,362 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 15:38:57,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:38:57,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:38:57,364 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:38:57,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:38:57,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:38:57,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:38:57,366 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand 3 states. [2018-12-03 15:38:57,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:57,473 INFO L93 Difference]: Finished difference Result 143 states and 190 transitions. [2018-12-03 15:38:57,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:38:57,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 15:38:57,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:57,481 INFO L225 Difference]: With dead ends: 143 [2018-12-03 15:38:57,481 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 15:38:57,484 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 15:38:57,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 15:38:57,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 15:38:57,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 15:38:57,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2018-12-03 15:38:57,526 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 14 [2018-12-03 15:38:57,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:57,526 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2018-12-03 15:38:57,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:38:57,527 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2018-12-03 15:38:57,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:38:57,529 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:57,529 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:38:57,530 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:57,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:57,530 INFO L82 PathProgramCache]: Analyzing trace with hash -602166477, now seen corresponding path program 1 times [2018-12-03 15:38:57,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:57,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:57,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:57,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:57,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:57,807 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 15:38:57,812 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:57,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:38:57,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:38:57,815 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:38:57,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:38:57,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:38:57,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:38:57,816 INFO L87 Difference]: Start difference. First operand 85 states and 111 transitions. Second operand 3 states. [2018-12-03 15:38:57,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:57,879 INFO L93 Difference]: Finished difference Result 249 states and 327 transitions. [2018-12-03 15:38:57,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:38:57,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-03 15:38:57,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:57,881 INFO L225 Difference]: With dead ends: 249 [2018-12-03 15:38:57,881 INFO L226 Difference]: Without dead ends: 167 [2018-12-03 15:38:57,882 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 15:38:57,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-03 15:38:57,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-12-03 15:38:57,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-03 15:38:57,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 212 transitions. [2018-12-03 15:38:57,920 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 212 transitions. Word has length 26 [2018-12-03 15:38:57,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:57,921 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 212 transitions. [2018-12-03 15:38:57,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:38:57,921 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 212 transitions. [2018-12-03 15:38:57,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:38:57,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:57,923 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:38:57,923 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:57,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:57,924 INFO L82 PathProgramCache]: Analyzing trace with hash -209139467, now seen corresponding path program 1 times [2018-12-03 15:38:57,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:57,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:57,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:57,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:57,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:58,068 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:58,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:38:58,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:38:58,069 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:38:58,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:38:58,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:38:58,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:38:58,070 INFO L87 Difference]: Start difference. First operand 165 states and 212 transitions. Second operand 3 states. [2018-12-03 15:38:58,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:58,171 INFO L93 Difference]: Finished difference Result 489 states and 630 transitions. [2018-12-03 15:38:58,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:38:58,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-03 15:38:58,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:58,175 INFO L225 Difference]: With dead ends: 489 [2018-12-03 15:38:58,176 INFO L226 Difference]: Without dead ends: 327 [2018-12-03 15:38:58,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:38:58,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-12-03 15:38:58,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2018-12-03 15:38:58,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-12-03 15:38:58,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 408 transitions. [2018-12-03 15:38:58,266 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 408 transitions. Word has length 26 [2018-12-03 15:38:58,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:58,267 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 408 transitions. [2018-12-03 15:38:58,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:38:58,267 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 408 transitions. [2018-12-03 15:38:58,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:38:58,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:58,270 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:38:58,270 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:58,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:58,270 INFO L82 PathProgramCache]: Analyzing trace with hash -266397769, now seen corresponding path program 1 times [2018-12-03 15:38:58,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:58,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:58,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:58,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:58,275 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:58,562 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 15:38:58,594 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:38:58,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:58,595 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:58,596 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-03 15:38:58,602 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42], [46], [48], [50] [2018-12-03 15:38:58,661 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:38:58,661 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:38:59,961 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:38:59,963 INFO L272 AbstractInterpreter]: Visited 20 different actions 132 times. Merged at 19 different actions 82 times. Widened at 10 different actions 10 times. Found 29 fixpoints after 13 different actions. Largest state had 0 variables. [2018-12-03 15:39:00,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:00,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:39:00,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:00,010 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 15:39:00,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:00,032 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:39:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:00,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:39:00,169 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:39:00,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:39:00,295 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:39:00,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:39:00,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 3] total 7 [2018-12-03 15:39:00,326 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:39:00,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:39:00,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:39:00,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:39:00,330 INFO L87 Difference]: Start difference. First operand 325 states and 408 transitions. Second operand 6 states. [2018-12-03 15:39:00,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:00,687 INFO L93 Difference]: Finished difference Result 757 states and 954 transitions. [2018-12-03 15:39:00,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:39:00,688 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-03 15:39:00,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:00,692 INFO L225 Difference]: With dead ends: 757 [2018-12-03 15:39:00,692 INFO L226 Difference]: Without dead ends: 531 [2018-12-03 15:39:00,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:39:00,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-12-03 15:39:00,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 517. [2018-12-03 15:39:00,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2018-12-03 15:39:00,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 632 transitions. [2018-12-03 15:39:00,796 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 632 transitions. Word has length 26 [2018-12-03 15:39:00,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:00,796 INFO L480 AbstractCegarLoop]: Abstraction has 517 states and 632 transitions. [2018-12-03 15:39:00,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:39:00,796 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 632 transitions. [2018-12-03 15:39:00,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 15:39:00,805 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:00,805 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 15:39:00,808 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:00,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:00,808 INFO L82 PathProgramCache]: Analyzing trace with hash 536917755, now seen corresponding path program 2 times [2018-12-03 15:39:00,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:00,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:00,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:00,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:00,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:01,167 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 10 [2018-12-03 15:39:01,378 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 44 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 15:39:01,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:01,379 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:39:01,379 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:39:01,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:39:01,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:01,380 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:39:01,397 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:39:01,398 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:39:01,483 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:39:01,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:39:01,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:39:01,878 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-12-03 15:39:02,083 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-03 15:39:02,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:39:02,357 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-03 15:39:02,382 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-03 15:39:02,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:39:02,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 15:39:02,415 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:39:02,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:39:02,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:39:02,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:39:02,416 INFO L87 Difference]: Start difference. First operand 517 states and 632 transitions. Second operand 7 states. [2018-12-03 15:39:02,861 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-03 15:39:03,148 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-03 15:39:03,622 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-03 15:39:03,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:03,891 INFO L93 Difference]: Finished difference Result 957 states and 1170 transitions. [2018-12-03 15:39:03,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:39:03,892 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-12-03 15:39:03,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:03,894 INFO L225 Difference]: With dead ends: 957 [2018-12-03 15:39:03,894 INFO L226 Difference]: Without dead ends: 297 [2018-12-03 15:39:03,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:39:03,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-12-03 15:39:03,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 267. [2018-12-03 15:39:03,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-12-03 15:39:03,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 308 transitions. [2018-12-03 15:39:03,963 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 308 transitions. Word has length 50 [2018-12-03 15:39:03,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:03,964 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 308 transitions. [2018-12-03 15:39:03,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:39:03,964 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 308 transitions. [2018-12-03 15:39:03,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 15:39:03,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:03,970 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 15:39:03,970 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:03,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:03,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1932160773, now seen corresponding path program 3 times [2018-12-03 15:39:03,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:03,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:03,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:39:03,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:03,975 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:04,053 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-03 15:39:04,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:04,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:39:04,054 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:04,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:39:04,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:39:04,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:04,055 INFO L87 Difference]: Start difference. First operand 267 states and 308 transitions. Second operand 3 states. [2018-12-03 15:39:04,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:04,073 INFO L93 Difference]: Finished difference Result 277 states and 319 transitions. [2018-12-03 15:39:04,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:39:04,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-03 15:39:04,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:04,073 INFO L225 Difference]: With dead ends: 277 [2018-12-03 15:39:04,074 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:39:04,075 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 15:39:04,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:39:04,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:39:04,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:39:04,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:39:04,076 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2018-12-03 15:39:04,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:04,076 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:39:04,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:39:04,077 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:39:04,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:39:04,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:39:04,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:04,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:04,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:04,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:04,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:04,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:04,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:04,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:04,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:04,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:04,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:04,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:04,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:05,004 WARN L180 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-12-03 15:39:05,157 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-12-03 15:39:05,563 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-12-03 15:39:05,894 WARN L180 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-12-03 15:39:06,184 WARN L180 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2018-12-03 15:39:06,598 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-12-03 15:39:06,601 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 74 391) no Hoare annotation was computed. [2018-12-03 15:39:06,601 INFO L444 ceAbstractionStarter]: At program point L382(lines 382 389) the Hoare annotation is: false [2018-12-03 15:39:06,601 INFO L444 ceAbstractionStarter]: At program point L283(lines 283 293) the Hoare annotation is: (let ((.cse1 (<= ~send3 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse0 (div ~mode4 256)) (.cse4 (<= 0 ~send3))) (or (and (<= .cse0 0) .cse1 (<= 1 ~mode4) (exists ((v_prenex_1 Int)) (let ((.cse2 (mod v_prenex_1 256))) (and (<= .cse2 127) (<= v_prenex_1 127) (= .cse2 ~p3_old) (<= 0 v_prenex_1)))) .cse3 .cse4) (and (= ~r1 0) .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse3 (= ~mode4 (* 256 .cse0)) .cse4))) [2018-12-03 15:39:06,601 INFO L444 ceAbstractionStarter]: At program point L376(lines 376 383) the Hoare annotation is: (and (<= (div ~mode4 256) 0) (<= ~send3 127) (<= 1 ~mode4) (= 1 ULTIMATE.start_check_~tmp~101) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (<= .cse0 127) (<= v_prenex_1 127) (= .cse0 ~p3_old) (<= 0 v_prenex_1)))) (<= (div ULTIMATE.start_assert_~arg 256) 0) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg) (<= 0 ~send3)) [2018-12-03 15:39:06,602 INFO L444 ceAbstractionStarter]: At program point L341(lines 335 342) the Hoare annotation is: (let ((.cse0 (<= (div ~mode4 256) 0)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse4 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse6 (exists ((v_prenex_1 Int)) (let ((.cse7 (mod v_prenex_1 256))) (and (<= .cse7 127) (<= v_prenex_1 127) (= ~p3_new .cse7) (<= 0 v_prenex_1)))))) (or (and .cse0 .cse1 .cse2 (exists ((v_prenex_1 Int)) (let ((.cse3 (mod v_prenex_1 256))) (and (<= .cse3 127) (<= v_prenex_1 127) (= .cse3 ~p3_old) (<= 0 v_prenex_1)))) (<= ~r1 1) .cse4 .cse5 .cse6) (and .cse0 (= ~r1 0) .cse1 .cse2 .cse4 .cse5 .cse6))) [2018-12-03 15:39:06,602 INFO L444 ceAbstractionStarter]: At program point L366(lines 361 367) 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 (<= .cse0 127) (<= v_prenex_1 127) (= .cse0 ~p3_old) (<= 0 v_prenex_1)))) (= 1 ULTIMATE.start_check_~tmp~101) (= 0 (+ ~nomsg 1)) (<= 0 ~send3)) [2018-12-03 15:39:06,602 INFO L444 ceAbstractionStarter]: At program point L298(lines 292 299) the Hoare annotation is: (let ((.cse1 (<= ~send3 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse0 (div ~mode4 256)) (.cse4 (<= 0 ~send3))) (or (and (<= .cse0 0) .cse1 (<= 1 ~mode4) (exists ((v_prenex_1 Int)) (let ((.cse2 (mod v_prenex_1 256))) (and (<= .cse2 127) (<= v_prenex_1 127) (= .cse2 ~p3_old) (<= 0 v_prenex_1)))) .cse3 .cse4) (and (= ~r1 0) .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse3 (= ~mode4 (* 256 .cse0)) .cse4))) [2018-12-03 15:39:06,602 INFO L444 ceAbstractionStarter]: At program point L321(lines 312 322) the Hoare annotation is: (let ((.cse7 (div ~mode4 256))) (let ((.cse0 (<= .cse7 0)) (.cse2 (<= 1 ~mode4)) (.cse1 (<= ~send3 127)) (.cse3 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (<= .cse9 127) (<= v_prenex_1 127) (= .cse9 ~p3_old) (<= 0 v_prenex_1))))) (.cse4 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse6 (exists ((v_prenex_1 Int)) (let ((.cse8 (mod v_prenex_1 256))) (and (<= .cse8 127) (<= v_prenex_1 127) (= ~p3_new .cse8) (<= 0 v_prenex_1)))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (= ~mode3 (* 256 (div ~mode3 256))) .cse4 .cse5) (and (= ~r1 0) .cse1 .cse4 (= ~mode4 (* 256 .cse7)) .cse5 .cse6) (and .cse1 .cse3 (<= ~r1 1) .cse4 .cse5 .cse6)))) [2018-12-03 15:39:06,603 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 74 391) no Hoare annotation was computed. [2018-12-03 15:39:06,603 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 390) no Hoare annotation was computed. [2018-12-03 15:39:06,603 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 74 391) no Hoare annotation was computed. [2018-12-03 15:39:06,603 INFO L444 ceAbstractionStarter]: At program point L278(lines 272 279) the Hoare annotation is: (let ((.cse1 (<= ~send3 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse0 (div ~mode4 256)) (.cse4 (<= 0 ~send3))) (or (and (<= .cse0 0) .cse1 (<= 1 ~mode4) (exists ((v_prenex_1 Int)) (let ((.cse2 (mod v_prenex_1 256))) (and (<= .cse2 127) (<= v_prenex_1 127) (= .cse2 ~p3_old) (<= 0 v_prenex_1)))) .cse3 .cse4) (and (= ~r1 0) .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse3 (= ~mode4 (* 256 .cse0)) .cse4))) [2018-12-03 15:39:06,603 INFO L444 ceAbstractionStarter]: At program point L303(lines 303 313) the Hoare annotation is: (let ((.cse1 (<= ~send3 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse0 (div ~mode4 256)) (.cse4 (<= 0 ~send3))) (or (and (<= .cse0 0) .cse1 (<= 1 ~mode4) (exists ((v_prenex_1 Int)) (let ((.cse2 (mod v_prenex_1 256))) (and (<= .cse2 127) (<= v_prenex_1 127) (= .cse2 ~p3_old) (<= 0 v_prenex_1)))) .cse3 .cse4) (and (= ~r1 0) .cse1 (= ~mode3 (* 256 (div ~mode3 256))) .cse3 (= ~mode4 (* 256 .cse0)) .cse4))) [2018-12-03 15:39:06,604 INFO L444 ceAbstractionStarter]: At program point L262(lines 262 273) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= ~r1 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (= ~mode4 (* 256 .cse2)) .cse3) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) (exists ((v_prenex_1 Int)) (let ((.cse4 (mod v_prenex_1 256))) (and (<= .cse4 127) (<= v_prenex_1 127) (= .cse4 ~p3_old) (<= 0 v_prenex_1)))) .cse1 .cse3))) [2018-12-03 15:39:06,604 INFO L444 ceAbstractionStarter]: At program point L326(lines 326 336) the Hoare annotation is: (let ((.cse7 (div ~mode4 256))) (let ((.cse0 (<= .cse7 0)) (.cse2 (<= 1 ~mode4)) (.cse1 (<= ~send3 127)) (.cse3 (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 256))) (and (<= .cse9 127) (<= v_prenex_1 127) (= .cse9 ~p3_old) (<= 0 v_prenex_1))))) (.cse4 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse6 (exists ((v_prenex_1 Int)) (let ((.cse8 (mod v_prenex_1 256))) (and (<= .cse8 127) (<= v_prenex_1 127) (= ~p3_new .cse8) (<= 0 v_prenex_1)))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (= ~mode3 (* 256 (div ~mode3 256))) .cse4 .cse5) (and (= ~r1 0) .cse1 .cse4 (= ~mode4 (* 256 .cse7)) .cse5 .cse6) (and .cse1 .cse3 (<= ~r1 1) .cse4 .cse5 .cse6)))) [2018-12-03 15:39:06,604 INFO L444 ceAbstractionStarter]: At program point L388(lines 255 388) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= ~r1 0) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (= ~mode4 (* 256 .cse2)) .cse3) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) (exists ((v_prenex_1 Int)) (let ((.cse4 (mod v_prenex_1 256))) (and (<= .cse4 127) (<= v_prenex_1 127) (= .cse4 ~p3_old) (<= 0 v_prenex_1)))) .cse1 .cse3))) [2018-12-03 15:39:06,604 INFO L444 ceAbstractionStarter]: At program point L355(lines 355 362) 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 (<= .cse0 127) (<= v_prenex_1 127) (= .cse0 ~p3_old) (<= 0 v_prenex_1)))) (<= ~r1 1) (= 0 (+ ~nomsg 1)) (<= 0 ~send3)) [2018-12-03 15:39:06,625 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:39:06 BoogieIcfgContainer [2018-12-03 15:39:06,626 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:39:06,627 INFO L168 Benchmark]: Toolchain (without parser) took 11626.91 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 835.7 MB). Free memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: -854.1 MB). Peak memory consumption was 599.1 MB. Max. memory is 7.1 GB. [2018-12-03 15:39:06,628 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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 15:39:06,629 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.81 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:39:06,629 INFO L168 Benchmark]: Boogie Preprocessor took 58.04 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 15:39:06,630 INFO L168 Benchmark]: RCFGBuilder took 706.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-03 15:39:06,630 INFO L168 Benchmark]: TraceAbstraction took 10810.79 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 835.7 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -885.8 MB). Peak memory consumption was 567.3 MB. Max. memory is 7.1 GB. [2018-12-03 15:39:06,634 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.20 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 46.81 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 58.04 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 706.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10810.79 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 835.7 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -885.8 MB). Peak memory consumption was 567.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 390]: 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: 255]: Loop Invariant Derived loop invariant: ((((((~r1 == 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) || (((((~r1 == 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 1 == check_~tmp~101) && 0 == ~nomsg + 1) && 0 <= ~send3 - InvariantResult [Line: 355]: Loop Invariant Derived loop invariant: (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && ~r1 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3 - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) || (((((~r1 == 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 376]: Loop Invariant Derived loop invariant: (((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 1 == check_~tmp~101) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && 0 <= ~send3 - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: ((((((~r1 == 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) - InvariantResult [Line: 312]: Loop Invariant Derived loop invariant: ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p3_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) || ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((~r1 == 0 && ~send3 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p3_new == v_prenex_1 % 256) && 0 <= v_prenex_1))) || (((((~send3 <= 127 && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && ~r1 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p3_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: (((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && ~r1 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p3_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) || ((((((~mode4 / 256 <= 0 && ~r1 == 0) && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p3_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) - InvariantResult [Line: 292]: Loop Invariant Derived loop invariant: (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) || (((((~r1 == 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 382]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) || (((((~r1 == 0 && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: ((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && 0 <= ~send3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p3_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) || ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && 0 <= ~send3)) || (((((~r1 == 0 && ~send3 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p3_new == v_prenex_1 % 256) && 0 <= v_prenex_1))) || (((((~send3 <= 127 && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && v_prenex_1 % 256 == ~p3_old) && 0 <= v_prenex_1)) && ~r1 <= 1) && 0 == ~nomsg + 1) && 0 <= ~send3) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 <= 127 && v_prenex_1 <= 127) && ~p3_new == v_prenex_1 % 256) && 0 <= v_prenex_1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 10.7s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 2.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 228 SDtfs, 117 SDslu, 225 SDs, 0 SdLazy, 118 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 153 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=517occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 100 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 171 NumberOfFragments, 1041 HoareAnnotationTreeSize, 13 FomulaSimplifications, 9755 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 13 FomulaSimplificationsInter, 180 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 310 NumberOfCodeBlocks, 286 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 373 ConstructedInterpolants, 14 QuantifiedInterpolants, 110189 SizeOfPredicates, 11 NumberOfNonLiveVariables, 502 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 244/348 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...