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/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:22:03,989 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:22:03,991 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:22:04,004 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:22:04,004 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:22:04,006 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:22:04,007 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:22:04,009 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:22:04,011 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:22:04,012 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:22:04,013 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:22:04,013 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:22:04,014 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:22:04,015 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:22:04,016 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:22:04,017 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:22:04,018 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:22:04,020 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:22:04,022 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:22:04,024 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:22:04,025 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:22:04,026 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:22:04,029 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:22:04,029 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:22:04,029 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:22:04,030 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:22:04,031 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:22:04,032 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:22:04,033 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:22:04,034 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:22:04,034 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:22:04,035 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:22:04,035 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:22:04,035 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:22:04,036 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:22:04,037 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:22:04,038 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:22:04,051 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:22:04,051 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:22:04,052 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:22:04,052 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:22:04,053 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:22:04,053 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:22:04,053 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:22:04,053 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:22:04,054 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:22:04,054 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:22:04,054 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:22:04,054 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:22:04,054 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:22:04,054 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:22:04,055 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:22:04,055 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:22:04,056 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:22:04,057 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:22:04,057 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:22:04,057 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:22:04,058 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:22:04,058 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:22:04,058 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:22:04,058 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:22:04,059 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:22:04,059 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:22:04,059 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:22:04,059 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:22:04,059 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:22:04,060 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:22:04,060 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:22:04,060 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:22:04,060 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:22:04,061 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:22:04,061 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:22:04,061 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:22:04,062 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:22:04,062 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:22:04,062 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:22:04,062 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:22:04,062 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:22:04,117 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:22:04,132 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:22:04,136 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:22:04,138 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:22:04,139 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:22:04,140 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl [2018-12-03 15:22:04,140 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl' [2018-12-03 15:22:04,204 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:22:04,206 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:22:04,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:22:04,207 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:22:04,207 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:22:04,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:04" (1/1) ... [2018-12-03 15:22:04,243 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:04" (1/1) ... [2018-12-03 15:22:04,263 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:22:04,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:22:04,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:22:04,264 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:22:04,279 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:04" (1/1) ... [2018-12-03 15:22:04,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:04" (1/1) ... [2018-12-03 15:22:04,283 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:04" (1/1) ... [2018-12-03 15:22:04,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:04" (1/1) ... [2018-12-03 15:22:04,304 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:04" (1/1) ... [2018-12-03 15:22:04,313 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:04" (1/1) ... [2018-12-03 15:22:04,315 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:04" (1/1) ... [2018-12-03 15:22:04,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:22:04,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:22:04,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:22:04,326 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:22:04,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:04" (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:22:04,402 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 15:22:04,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:22:04,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:22:04,978 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:22:04,979 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 15:22:04,979 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:22:04 BoogieIcfgContainer [2018-12-03 15:22:04,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:22:04,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:22:04,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:22:04,986 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:22:04,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:04" (1/2) ... [2018-12-03 15:22:04,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103e9869 and model type pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:22:04, skipping insertion in model container [2018-12-03 15:22:04,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:22:04" (2/2) ... [2018-12-03 15:22:04,989 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl [2018-12-03 15:22:05,000 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:22:05,011 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:22:05,029 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:22:05,071 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:22:05,071 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:22:05,071 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:22:05,071 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:22:05,072 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:22:05,072 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:22:05,072 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:22:05,072 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:22:05,093 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-12-03 15:22:05,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:22:05,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:05,105 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:22:05,112 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:05,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:05,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1823027093, now seen corresponding path program 1 times [2018-12-03 15:22:05,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:05,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:05,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:05,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:05,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:05,345 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:22:05,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:22:05,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:22:05,349 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:22:05,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:22:05,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:22:05,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:22:05,371 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-12-03 15:22:05,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:05,408 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2018-12-03 15:22:05,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:22:05,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 15:22:05,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:05,422 INFO L225 Difference]: With dead ends: 45 [2018-12-03 15:22:05,422 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:22:05,427 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:22:05,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:22:05,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-12-03 15:22:05,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 15:22:05,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-03 15:22:05,469 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2018-12-03 15:22:05,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:05,470 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-03 15:22:05,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:22:05,470 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-03 15:22:05,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:22:05,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:05,471 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:22:05,471 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:05,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:05,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1013680467, now seen corresponding path program 1 times [2018-12-03 15:22:05,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:05,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:05,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:05,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:05,474 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:05,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:05,604 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:22:05,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:22:05,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:22:05,607 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:22:05,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:22:05,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:22:05,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:22:05,611 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2018-12-03 15:22:05,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:05,749 INFO L93 Difference]: Finished difference Result 83 states and 113 transitions. [2018-12-03 15:22:05,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:22:05,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-03 15:22:05,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:05,751 INFO L225 Difference]: With dead ends: 83 [2018-12-03 15:22:05,751 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 15:22:05,753 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 15:22:05,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 15:22:05,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 31. [2018-12-03 15:22:05,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 15:22:05,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2018-12-03 15:22:05,765 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 14 [2018-12-03 15:22:05,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:05,765 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2018-12-03 15:22:05,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:22:05,766 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2018-12-03 15:22:05,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:22:05,767 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:05,767 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:22:05,767 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:05,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:05,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1013740049, now seen corresponding path program 1 times [2018-12-03 15:22:05,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:05,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:05,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:05,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:05,770 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:05,904 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:22:05,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:22:05,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:22:05,905 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:22:05,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:22:05,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:22:05,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:22:05,906 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand 4 states. [2018-12-03 15:22:06,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:06,056 INFO L93 Difference]: Finished difference Result 75 states and 99 transitions. [2018-12-03 15:22:06,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:22:06,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-03 15:22:06,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:06,067 INFO L225 Difference]: With dead ends: 75 [2018-12-03 15:22:06,067 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 15:22:06,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:22:06,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 15:22:06,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 35. [2018-12-03 15:22:06,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 15:22:06,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2018-12-03 15:22:06,089 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 14 [2018-12-03 15:22:06,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:06,089 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2018-12-03 15:22:06,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:22:06,090 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2018-12-03 15:22:06,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:22:06,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:06,091 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:22:06,092 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:06,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:06,093 INFO L82 PathProgramCache]: Analyzing trace with hash 956422165, now seen corresponding path program 1 times [2018-12-03 15:22:06,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:06,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:06,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:06,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:06,095 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:06,213 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:22:06,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:22:06,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:22:06,215 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:22:06,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:22:06,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:22:06,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:22:06,217 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand 3 states. [2018-12-03 15:22:06,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:06,283 INFO L93 Difference]: Finished difference Result 93 states and 120 transitions. [2018-12-03 15:22:06,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:22:06,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 15:22:06,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:06,286 INFO L225 Difference]: With dead ends: 93 [2018-12-03 15:22:06,286 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 15:22:06,287 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:22:06,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 15:22:06,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 15:22:06,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 15:22:06,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2018-12-03 15:22:06,305 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 14 [2018-12-03 15:22:06,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:06,305 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2018-12-03 15:22:06,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:22:06,308 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2018-12-03 15:22:06,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:22:06,309 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:06,309 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:22:06,309 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:06,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:06,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1214587603, now seen corresponding path program 1 times [2018-12-03 15:22:06,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:06,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:06,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:06,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:06,315 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:06,393 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:22:06,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:22:06,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:22:06,393 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:22:06,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:22:06,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:22:06,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:22:06,394 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand 3 states. [2018-12-03 15:22:06,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:06,428 INFO L93 Difference]: Finished difference Result 95 states and 121 transitions. [2018-12-03 15:22:06,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:22:06,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 15:22:06,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:06,430 INFO L225 Difference]: With dead ends: 95 [2018-12-03 15:22:06,430 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 15:22:06,431 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:22:06,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 15:22:06,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 15:22:06,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 15:22:06,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2018-12-03 15:22:06,448 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 14 [2018-12-03 15:22:06,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:06,449 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2018-12-03 15:22:06,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:22:06,449 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2018-12-03 15:22:06,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:22:06,450 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:06,451 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:22:06,451 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:06,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:06,451 INFO L82 PathProgramCache]: Analyzing trace with hash -277256459, now seen corresponding path program 1 times [2018-12-03 15:22:06,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:06,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:06,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:06,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:06,453 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:06,545 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:22:06,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:22:06,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:22:06,545 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:22:06,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:22:06,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:22:06,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:22:06,547 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand 3 states. [2018-12-03 15:22:06,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:06,586 INFO L93 Difference]: Finished difference Result 121 states and 152 transitions. [2018-12-03 15:22:06,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:22:06,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-03 15:22:06,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:06,588 INFO L225 Difference]: With dead ends: 121 [2018-12-03 15:22:06,588 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 15:22:06,589 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:22:06,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 15:22:06,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 15:22:06,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 15:22:06,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2018-12-03 15:22:06,610 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 26 [2018-12-03 15:22:06,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:06,610 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2018-12-03 15:22:06,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:22:06,611 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2018-12-03 15:22:06,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:22:06,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:06,614 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:22:06,614 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:06,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:06,615 INFO L82 PathProgramCache]: Analyzing trace with hash 115770551, now seen corresponding path program 1 times [2018-12-03 15:22:06,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:06,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:06,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:06,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:06,616 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:06,862 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:06,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:06,862 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:06,863 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-03 15:22:06,865 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:22:06,927 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:22:06,928 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:22:07,878 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:22:07,879 INFO L272 AbstractInterpreter]: Visited 20 different actions 102 times. Merged at 19 different actions 56 times. Widened at 1 different actions 1 times. Found 21 fixpoints after 12 different actions. Largest state had 0 variables. [2018-12-03 15:22:07,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:07,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:22:07,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:07,924 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:22:07,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:07,943 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:08,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:08,238 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:22:08,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:08,437 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:22:08,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:08,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2018-12-03 15:22:08,470 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:08,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:22:08,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:22:08,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:22:08,474 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand 7 states. [2018-12-03 15:22:09,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:09,067 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2018-12-03 15:22:09,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:22:09,068 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-03 15:22:09,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:09,069 INFO L225 Difference]: With dead ends: 77 [2018-12-03 15:22:09,069 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:22:09,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:22:09,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:22:09,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:22:09,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:22:09,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:22:09,071 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-12-03 15:22:09,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:09,071 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:22:09,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:22:09,071 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:22:09,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:22:09,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:22:09,293 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-03 15:22:09,408 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 15:22:09,634 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-03 15:22:09,943 WARN L180 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2018-12-03 15:22:10,127 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2018-12-03 15:22:10,197 INFO L444 ceAbstractionStarter]: At program point L225(lines 225 235) the Hoare annotation is: (let ((.cse0 (= 0 (+ ~nomsg 1)))) (or (and (<= ~r1 0) .cse0 (<= 0 ~p1_new) (= ~mode3 0)) (and (not (= 0 ULTIMATE.start_assert_~arg)) (<= ~mode2 1) (<= ~r1 1) .cse0 (not (= (+ ~p1_old 1) 0))))) [2018-12-03 15:22:10,197 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 47 318) no Hoare annotation was computed. [2018-12-03 15:22:10,197 INFO L444 ceAbstractionStarter]: At program point L283(lines 279 284) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode2 1) (<= 1 ULTIMATE.start_check_~tmp~76) (= 0 (+ ~nomsg 1)) (not (= (+ ~p1_old 1) 0))) [2018-12-03 15:22:10,198 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 317) no Hoare annotation was computed. [2018-12-03 15:22:10,198 INFO L444 ceAbstractionStarter]: At program point L312(lines 193 312) the Hoare annotation is: (let ((.cse0 (<= ~r1 0)) (.cse1 (= 0 (+ ~nomsg 1)))) (or (and .cse0 (not (= 0 ULTIMATE.start_assert_~arg)) (<= ~mode2 1) .cse1 (not (= (+ ~p1_old 1) 0))) (and .cse0 (<= 512 ~mode1) .cse1 (= ~mode3 0)))) [2018-12-03 15:22:10,198 INFO L444 ceAbstractionStarter]: At program point L240(lines 234 241) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode2 1) (= 0 (+ ~nomsg 1)) (<= 0 ~p1_new) (= ~mode3 0)) [2018-12-03 15:22:10,198 INFO L444 ceAbstractionStarter]: At program point L304(lines 304 313) the Hoare annotation is: (and (<= ~r1 0) (not (= 0 ULTIMATE.start_assert_~arg)) (<= ~mode2 1) (not (= 0 |ULTIMATE.start_assert_#in~arg|)) (= 0 (+ ~nomsg 1)) (not (= (+ ~p1_old 1) 0))) [2018-12-03 15:22:10,199 INFO L444 ceAbstractionStarter]: At program point L300(lines 296 301) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode2 1) (= 0 (+ ~nomsg 1)) (not (= (+ ~p1_old 1) 0)) (not (= 0 |ULTIMATE.start_assert_#in~arg|))) [2018-12-03 15:22:10,199 INFO L444 ceAbstractionStarter]: At program point L199(lines 199 212) the Hoare annotation is: (let ((.cse0 (<= ~r1 0)) (.cse1 (= 0 (+ ~nomsg 1)))) (or (and .cse0 (not (= 0 ULTIMATE.start_assert_~arg)) (<= ~mode2 1) .cse1 (not (= (+ ~p1_old 1) 0))) (and .cse0 (<= 512 ~mode1) .cse1 (= ~mode3 0)))) [2018-12-03 15:22:10,199 INFO L444 ceAbstractionStarter]: At program point L290(lines 290 297) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode2 1) (<= 1 ULTIMATE.start_check_~tmp~76) (<= 1 ULTIMATE.start_main_~c1~83) (= 0 (+ ~nomsg 1)) (not (= (+ ~p1_old 1) 0))) [2018-12-03 15:22:10,199 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 47 318) no Hoare annotation was computed. [2018-12-03 15:22:10,200 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 47 318) no Hoare annotation was computed. [2018-12-03 15:22:10,200 INFO L444 ceAbstractionStarter]: At program point L220(lines 211 221) the Hoare annotation is: (let ((.cse0 (= 0 (+ ~nomsg 1)))) (or (and (<= ~r1 0) .cse0 (<= 0 ~p1_new) (= ~mode3 0)) (and (not (= 0 ULTIMATE.start_assert_~arg)) (<= ~mode2 1) (<= ~r1 1) .cse0 (not (= (+ ~p1_old 1) 0))))) [2018-12-03 15:22:10,200 INFO L444 ceAbstractionStarter]: At program point L315(lines 315 316) the Hoare annotation is: false [2018-12-03 15:22:10,200 INFO L444 ceAbstractionStarter]: At program point L245(lines 245 255) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode2 1) (= 0 (+ ~nomsg 1)) (<= 0 ~p1_new) (= ~mode3 0)) [2018-12-03 15:22:10,200 INFO L444 ceAbstractionStarter]: At program point L272(lines 272 280) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode2 1) (= 0 (+ ~nomsg 1)) (not (= (+ ~p1_old 1) 0))) [2018-12-03 15:22:10,201 INFO L444 ceAbstractionStarter]: At program point L260(lines 254 261) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode2 1) (= 0 (+ ~nomsg 1)) (<= 0 ~p1_new)) [2018-12-03 15:22:10,214 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:22:10 BoogieIcfgContainer [2018-12-03 15:22:10,214 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:22:10,215 INFO L168 Benchmark]: Toolchain (without parser) took 6010.32 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 712.5 MB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -551.4 MB). Peak memory consumption was 161.1 MB. Max. memory is 7.1 GB. [2018-12-03 15:22:10,216 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:22:10,217 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.52 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:22:10,218 INFO L168 Benchmark]: Boogie Preprocessor took 61.08 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:22:10,218 INFO L168 Benchmark]: RCFGBuilder took 653.72 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:22:10,219 INFO L168 Benchmark]: TraceAbstraction took 5233.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 712.5 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -583.1 MB). Peak memory consumption was 129.4 MB. Max. memory is 7.1 GB. [2018-12-03 15:22:10,224 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 56.52 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 61.08 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 653.72 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 5233.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 712.5 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -583.1 MB). Peak memory consumption was 129.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 317]: 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: 234]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && ~mode2 <= 1) && 0 == ~nomsg + 1) && 0 <= ~p1_new) && ~mode3 == 0 - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: ((~r1 <= 0 && ~mode2 <= 1) && 0 == ~nomsg + 1) && !(~p1_old + 1 == 0) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((((~r1 <= 0 && !(0 == assert_~arg)) && ~mode2 <= 1) && 0 == ~nomsg + 1) && !(~p1_old + 1 == 0)) || (((~r1 <= 0 && 512 <= ~mode1) && 0 == ~nomsg + 1) && ~mode3 == 0) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && ~mode2 <= 1) && 1 <= check_~tmp~76) && 0 == ~nomsg + 1) && !(~p1_old + 1 == 0) - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && 0 == ~nomsg + 1) && 0 <= ~p1_new) && ~mode3 == 0) || ((((!(0 == assert_~arg) && ~mode2 <= 1) && ~r1 <= 1) && 0 == ~nomsg + 1) && !(~p1_old + 1 == 0)) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: ((((~r1 <= 0 && !(0 == assert_~arg)) && ~mode2 <= 1) && 0 == ~nomsg + 1) && !(~p1_old + 1 == 0)) || (((~r1 <= 0 && 512 <= ~mode1) && 0 == ~nomsg + 1) && ~mode3 == 0) - InvariantResult [Line: 245]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && ~mode2 <= 1) && 0 == ~nomsg + 1) && 0 <= ~p1_new) && ~mode3 == 0 - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && 0 == ~nomsg + 1) && 0 <= ~p1_new) && ~mode3 == 0) || ((((!(0 == assert_~arg) && ~mode2 <= 1) && ~r1 <= 1) && 0 == ~nomsg + 1) && !(~p1_old + 1 == 0)) - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: (((~r1 <= 0 && ~mode2 <= 1) && 0 == ~nomsg + 1) && !(~p1_old + 1 == 0)) && !(0 == assert_#in~arg) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((~r1 <= 0 && ~mode2 <= 1) && 1 <= check_~tmp~76) && 1 <= main_~c1~83) && 0 == ~nomsg + 1) && !(~p1_old + 1 == 0) - InvariantResult [Line: 315]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 304]: Loop Invariant Derived loop invariant: ((((~r1 <= 0 && !(0 == assert_~arg)) && ~mode2 <= 1) && !(0 == assert_#in~arg)) && 0 == ~nomsg + 1) && !(~p1_old + 1 == 0) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: ((~r1 <= 0 && ~mode2 <= 1) && 0 == ~nomsg + 1) && 0 <= ~p1_new - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 5.1s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 157 SDtfs, 127 SDslu, 136 SDs, 0 SdLazy, 62 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.0s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 66 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 31 NumberOfFragments, 315 HoareAnnotationTreeSize, 13 FomulaSimplifications, 459 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 50 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 148 NumberOfCodeBlocks, 148 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 165 ConstructedInterpolants, 0 QuantifiedInterpolants, 10166 SizeOfPredicates, 1 NumberOfNonLiveVariables, 227 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 34/48 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...