java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:54:27,066 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:54:27,068 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:54:27,081 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:54:27,081 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:54:27,082 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:54:27,084 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:54:27,086 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:54:27,087 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:54:27,088 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:54:27,089 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:54:27,089 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:54:27,090 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:54:27,091 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:54:27,093 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:54:27,093 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:54:27,094 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:54:27,096 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:54:27,099 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:54:27,100 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:54:27,101 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:54:27,103 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:54:27,105 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:54:27,105 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:54:27,106 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:54:27,106 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:54:27,107 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:54:27,108 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:54:27,109 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:54:27,110 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:54:27,110 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:54:27,111 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:54:27,111 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:54:27,112 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:54:27,113 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:54:27,114 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:54:27,114 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 17:54:27,132 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:54:27,133 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:54:27,134 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:54:27,134 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:54:27,134 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:54:27,135 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:54:27,135 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:54:27,135 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:54:27,135 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:54:27,135 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:54:27,136 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:54:27,136 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:54:27,136 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:54:27,137 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:54:27,137 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:54:27,137 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:54:27,139 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:54:27,139 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:54:27,139 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:54:27,139 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:54:27,139 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:54:27,140 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:54:27,140 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:54:27,140 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:54:27,140 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:54:27,140 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:54:27,141 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:54:27,141 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:54:27,141 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:54:27,141 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:54:27,141 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:54:27,143 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:54:27,143 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:54:27,143 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:54:27,144 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:54:27,144 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:54:27,144 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:54:27,144 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:54:27,144 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:54:27,176 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:54:27,191 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:54:27,197 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:54:27,199 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:54:27,200 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:54:27,200 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 17:54:27,201 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 17:54:27,300 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:54:27,302 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:54:27,303 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:54:27,303 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:54:27,303 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:54:27,323 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 05:54:27" (1/1) ... [2018-12-03 17:54:27,339 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 05:54:27" (1/1) ... [2018-12-03 17:54:27,360 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:54:27,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:54:27,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:54:27,361 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:54:27,375 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 05:54:27" (1/1) ... [2018-12-03 17:54:27,375 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 05:54:27" (1/1) ... [2018-12-03 17:54:27,379 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 05:54:27" (1/1) ... [2018-12-03 17:54:27,379 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 05:54:27" (1/1) ... [2018-12-03 17:54:27,400 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 05:54:27" (1/1) ... [2018-12-03 17:54:27,406 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 05:54:27" (1/1) ... [2018-12-03 17:54:27,409 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 05:54:27" (1/1) ... [2018-12-03 17:54:27,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:54:27,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:54:27,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:54:27,422 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:54:27,427 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 05:54:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:54:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:54:27,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:54:28,087 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:54:28,088 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 17:54:28,089 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 05:54:28 BoogieIcfgContainer [2018-12-03 17:54:28,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:54:28,090 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:54:28,090 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:54:28,093 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:54:28,094 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 05:54:27" (1/2) ... [2018-12-03 17:54:28,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e8b80b9 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 05:54:28, skipping insertion in model container [2018-12-03 17:54:28,095 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 05:54:28" (2/2) ... [2018-12-03 17:54:28,097 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_10.bpl [2018-12-03 17:54:28,107 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:54:28,116 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:54:28,134 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:54:28,169 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:54:28,170 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:54:28,170 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:54:28,170 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:54:28,170 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:54:28,170 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:54:28,171 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:54:28,171 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:54:28,187 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-12-03 17:54:28,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:54:28,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:54:28,195 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:54:28,198 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:54:28,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:28,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1823027031, now seen corresponding path program 1 times [2018-12-03 17:54:28,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:54:28,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:28,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:28,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:28,276 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:54:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:28,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:54:28,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:54:28,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:54:28,453 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:54:28,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:54:28,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:54:28,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:54:28,475 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-12-03 17:54:28,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:54:28,537 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2018-12-03 17:54:28,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:54:28,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 17:54:28,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:54:28,555 INFO L225 Difference]: With dead ends: 45 [2018-12-03 17:54:28,555 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 17:54:28,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:54:28,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 17:54:28,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-12-03 17:54:28,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 17:54:28,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-03 17:54:28,612 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2018-12-03 17:54:28,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:54:28,612 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-03 17:54:28,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:54:28,613 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-03 17:54:28,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:54:28,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:54:28,614 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:54:28,614 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:54:28,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:28,615 INFO L82 PathProgramCache]: Analyzing trace with hash 2081192469, now seen corresponding path program 1 times [2018-12-03 17:54:28,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:54:28,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:28,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:28,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:28,618 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:54:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:28,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:54:28,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:54:28,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:54:28,722 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:54:28,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:54:28,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:54:28,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:54:28,726 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 3 states. [2018-12-03 17:54:28,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:54:28,759 INFO L93 Difference]: Finished difference Result 79 states and 109 transitions. [2018-12-03 17:54:28,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:54:28,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 17:54:28,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:54:28,761 INFO L225 Difference]: With dead ends: 79 [2018-12-03 17:54:28,761 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 17:54:28,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:54:28,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 17:54:28,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-12-03 17:54:28,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 17:54:28,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2018-12-03 17:54:28,777 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 14 [2018-12-03 17:54:28,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:54:28,778 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2018-12-03 17:54:28,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:54:28,778 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2018-12-03 17:54:28,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:54:28,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:54:28,779 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:54:28,779 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:54:28,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:28,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1271845843, now seen corresponding path program 1 times [2018-12-03 17:54:28,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:54:28,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:28,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:28,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:28,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:54:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:29,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:54:29,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:54:29,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:54:29,029 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:54:29,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:54:29,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:54:29,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:54:29,031 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand 4 states. [2018-12-03 17:54:29,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:54:29,213 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2018-12-03 17:54:29,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:54:29,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-03 17:54:29,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:54:29,224 INFO L225 Difference]: With dead ends: 109 [2018-12-03 17:54:29,224 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 17:54:29,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:54:29,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 17:54:29,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 59. [2018-12-03 17:54:29,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 17:54:29,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2018-12-03 17:54:29,271 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 14 [2018-12-03 17:54:29,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:54:29,273 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2018-12-03 17:54:29,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:54:29,274 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2018-12-03 17:54:29,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:54:29,274 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:54:29,275 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:54:29,276 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:54:29,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:29,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1271905425, now seen corresponding path program 1 times [2018-12-03 17:54:29,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:54:29,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:29,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:29,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:29,280 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:54:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:29,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:54:29,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:54:29,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:54:29,390 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:54:29,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:54:29,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:54:29,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:54:29,392 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand 3 states. [2018-12-03 17:54:29,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:54:29,467 INFO L93 Difference]: Finished difference Result 143 states and 190 transitions. [2018-12-03 17:54:29,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:54:29,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 17:54:29,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:54:29,470 INFO L225 Difference]: With dead ends: 143 [2018-12-03 17:54:29,470 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 17:54:29,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:54:29,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 17:54:29,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 17:54:29,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 17:54:29,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2018-12-03 17:54:29,493 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 14 [2018-12-03 17:54:29,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:54:29,493 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2018-12-03 17:54:29,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:54:29,493 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2018-12-03 17:54:29,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 17:54:29,495 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:54:29,495 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 17:54:29,495 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:54:29,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:29,496 INFO L82 PathProgramCache]: Analyzing trace with hash -602166477, now seen corresponding path program 1 times [2018-12-03 17:54:29,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:54:29,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:29,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:29,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:29,500 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:54:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:29,632 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 17:54:29,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:54:29,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:54:29,632 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:54:29,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:54:29,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:54:29,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:54:29,634 INFO L87 Difference]: Start difference. First operand 85 states and 111 transitions. Second operand 3 states. [2018-12-03 17:54:29,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:54:29,688 INFO L93 Difference]: Finished difference Result 249 states and 327 transitions. [2018-12-03 17:54:29,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:54:29,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-03 17:54:29,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:54:29,691 INFO L225 Difference]: With dead ends: 249 [2018-12-03 17:54:29,691 INFO L226 Difference]: Without dead ends: 167 [2018-12-03 17:54:29,693 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 17:54:29,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-03 17:54:29,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-12-03 17:54:29,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-03 17:54:29,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 212 transitions. [2018-12-03 17:54:29,731 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 212 transitions. Word has length 26 [2018-12-03 17:54:29,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:54:29,732 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 212 transitions. [2018-12-03 17:54:29,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:54:29,732 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 212 transitions. [2018-12-03 17:54:29,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 17:54:29,733 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:54:29,734 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 17:54:29,734 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:54:29,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:29,735 INFO L82 PathProgramCache]: Analyzing trace with hash -209139467, now seen corresponding path program 1 times [2018-12-03 17:54:29,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:54:29,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:29,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:29,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:29,737 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:54:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:30,013 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 17:54:30,016 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 17:54:30,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:54:30,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:54:30,017 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:54:30,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:54:30,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:54:30,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:54:30,020 INFO L87 Difference]: Start difference. First operand 165 states and 212 transitions. Second operand 3 states. [2018-12-03 17:54:30,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:54:30,152 INFO L93 Difference]: Finished difference Result 489 states and 630 transitions. [2018-12-03 17:54:30,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:54:30,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-03 17:54:30,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:54:30,156 INFO L225 Difference]: With dead ends: 489 [2018-12-03 17:54:30,156 INFO L226 Difference]: Without dead ends: 327 [2018-12-03 17:54:30,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:54:30,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-12-03 17:54:30,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2018-12-03 17:54:30,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-12-03 17:54:30,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 408 transitions. [2018-12-03 17:54:30,250 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 408 transitions. Word has length 26 [2018-12-03 17:54:30,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:54:30,251 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 408 transitions. [2018-12-03 17:54:30,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:54:30,251 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 408 transitions. [2018-12-03 17:54:30,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 17:54:30,254 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:54:30,254 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 17:54:30,254 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:54:30,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:54:30,255 INFO L82 PathProgramCache]: Analyzing trace with hash -266397769, now seen corresponding path program 1 times [2018-12-03 17:54:30,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:54:30,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:30,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:54:30,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:54:30,259 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:54:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:54:30,461 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 17:54:30,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:54:30,462 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:54:30,463 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-03 17:54:30,465 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 17:54:30,531 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:54:30,531 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:54:31,631 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 17:55:17,830 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:55:17,831 INFO L272 AbstractInterpreter]: Visited 20 different actions 407 times. Merged at 19 different actions 292 times. Widened at 18 different actions 187 times. Found 79 fixpoints after 14 different actions. Largest state had 0 variables. [2018-12-03 17:55:17,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:55:17,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:55:17,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:55:17,850 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:55:17,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:55:17,878 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:55:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:55:18,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:55:18,191 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 17:55:18,194 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:55:18,360 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 17:55:18,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:55:18,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 3] total 7 [2018-12-03 17:55:18,391 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:55:18,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 17:55:18,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 17:55:18,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:55:18,392 INFO L87 Difference]: Start difference. First operand 325 states and 408 transitions. Second operand 6 states. [2018-12-03 17:55:18,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:55:18,782 INFO L93 Difference]: Finished difference Result 757 states and 954 transitions. [2018-12-03 17:55:18,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:55:18,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-03 17:55:18,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:55:18,787 INFO L225 Difference]: With dead ends: 757 [2018-12-03 17:55:18,787 INFO L226 Difference]: Without dead ends: 531 [2018-12-03 17:55:18,789 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 17:55:18,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-12-03 17:55:18,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 517. [2018-12-03 17:55:18,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2018-12-03 17:55:18,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 632 transitions. [2018-12-03 17:55:18,896 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 632 transitions. Word has length 26 [2018-12-03 17:55:18,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:55:18,896 INFO L480 AbstractCegarLoop]: Abstraction has 517 states and 632 transitions. [2018-12-03 17:55:18,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 17:55:18,897 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 632 transitions. [2018-12-03 17:55:18,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 17:55:18,905 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:55:18,905 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 17:55:18,907 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:55:18,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:55:18,908 INFO L82 PathProgramCache]: Analyzing trace with hash 536917755, now seen corresponding path program 2 times [2018-12-03 17:55:18,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:55:18,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:18,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:55:18,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:18,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:55:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:55:19,427 WARN L180 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 10 [2018-12-03 17:55:19,687 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-12-03 17:55:20,001 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-12-03 17:55:20,022 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 17:55:20,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:55:20,022 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:55:20,022 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:55:20,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:55:20,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:55:20,023 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 17:55:20,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:55:20,041 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:55:20,109 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 17:55:20,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:55:20,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:55:20,377 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-12-03 17:55:20,527 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 17:55:20,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:55:20,816 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-03 17:55:20,837 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 17:55:20,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:55:20,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 17:55:20,865 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:55:20,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:55:20,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:55:20,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:55:20,867 INFO L87 Difference]: Start difference. First operand 517 states and 632 transitions. Second operand 7 states. [2018-12-03 17:55:21,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:55:21,555 INFO L93 Difference]: Finished difference Result 957 states and 1170 transitions. [2018-12-03 17:55:21,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 17:55:21,556 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-12-03 17:55:21,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:55:21,558 INFO L225 Difference]: With dead ends: 957 [2018-12-03 17:55:21,559 INFO L226 Difference]: Without dead ends: 297 [2018-12-03 17:55:21,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-03 17:55:21,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-12-03 17:55:21,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 267. [2018-12-03 17:55:21,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-12-03 17:55:21,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 308 transitions. [2018-12-03 17:55:21,611 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 308 transitions. Word has length 50 [2018-12-03 17:55:21,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:55:21,612 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 308 transitions. [2018-12-03 17:55:21,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:55:21,612 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 308 transitions. [2018-12-03 17:55:21,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 17:55:21,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:55:21,617 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 17:55:21,618 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:55:21,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:55:21,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1932160773, now seen corresponding path program 3 times [2018-12-03 17:55:21,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:55:21,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:21,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:55:21,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:21,620 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:55:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:55:21,699 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 17:55:21,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:55:21,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:55:21,700 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:55:21,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:55:21,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:55:21,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:55:21,702 INFO L87 Difference]: Start difference. First operand 267 states and 308 transitions. Second operand 3 states. [2018-12-03 17:55:21,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:55:21,714 INFO L93 Difference]: Finished difference Result 277 states and 319 transitions. [2018-12-03 17:55:21,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:55:21,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-03 17:55:21,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:55:21,715 INFO L225 Difference]: With dead ends: 277 [2018-12-03 17:55:21,716 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 17:55:21,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:55:21,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 17:55:21,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 17:55:21,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 17:55:21,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 17:55:21,717 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2018-12-03 17:55:21,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:55:21,718 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 17:55:21,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:55:21,718 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 17:55:21,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 17:55:21,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 17:55:21,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:55:21,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:55:21,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:55:21,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:55:21,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:55:21,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:55:21,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:55:21,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:55:21,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:55:21,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:55:21,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:55:21,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:55:21,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:55:22,818 WARN L180 SmtUtils]: Spent 900.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-12-03 17:55:23,171 WARN L180 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-12-03 17:55:23,357 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2018-12-03 17:55:23,561 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-12-03 17:55:23,714 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-12-03 17:55:24,025 WARN L180 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-12-03 17:55:24,312 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2018-12-03 17:55:24,680 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-12-03 17:55:24,683 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 74 391) no Hoare annotation was computed. [2018-12-03 17:55:24,683 INFO L444 ceAbstractionStarter]: At program point L382(lines 382 389) the Hoare annotation is: false [2018-12-03 17:55:24,684 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 17:55:24,684 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 17:55:24,684 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 17:55:24,685 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 17:55:24,685 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 17:55:24,685 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 17:55:24,685 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 390) no Hoare annotation was computed. [2018-12-03 17:55:24,686 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 74 391) no Hoare annotation was computed. [2018-12-03 17:55:24,686 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 74 391) no Hoare annotation was computed. [2018-12-03 17:55:24,686 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 17:55:24,686 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 17:55:24,686 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 17:55:24,687 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 17:55:24,687 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 17:55:24,687 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 17:55:24,710 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 05:55:24 BoogieIcfgContainer [2018-12-03 17:55:24,710 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 17:55:24,711 INFO L168 Benchmark]: Toolchain (without parser) took 57410.32 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -436.6 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-12-03 17:55:24,713 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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 17:55:24,713 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.30 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 17:55:24,714 INFO L168 Benchmark]: Boogie Preprocessor took 60.86 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 17:55:24,714 INFO L168 Benchmark]: RCFGBuilder took 666.84 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 17:55:24,715 INFO L168 Benchmark]: TraceAbstraction took 56620.43 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -468.3 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-12-03 17:55:24,719 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.21 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 57.30 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 60.86 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 666.84 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 56620.43 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -468.3 MB). Peak memory consumption was 2.2 GB. 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, 56.5s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 2.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 228 SDtfs, 117 SDslu, 225 SDs, 0 SdLazy, 118 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 153 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.5s 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, 47.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 100 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 171 NumberOfFragments, 1041 HoareAnnotationTreeSize, 13 FomulaSimplifications, 9755 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 180 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s 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...