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.3.1.ufo.UNBOUNDED.pals.c_9.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:53:19,213 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:53:19,216 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:53:19,232 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:53:19,232 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:53:19,233 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:53:19,236 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:53:19,238 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:53:19,240 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:53:19,241 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:53:19,249 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:53:19,250 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:53:19,251 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:53:19,252 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:53:19,255 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:53:19,256 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:53:19,257 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:53:19,258 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:53:19,266 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:53:19,269 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:53:19,270 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:53:19,271 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:53:19,276 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:53:19,277 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:53:19,277 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:53:19,279 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:53:19,280 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:53:19,281 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:53:19,283 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:53:19,284 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:53:19,285 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:53:19,285 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:53:19,285 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:53:19,287 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:53:19,288 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:53:19,288 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:53:19,289 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:53:19,306 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:53:19,306 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:53:19,307 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:53:19,307 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:53:19,307 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:53:19,307 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:53:19,308 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:53:19,308 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:53:19,308 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:53:19,308 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:53:19,308 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:53:19,308 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:53:19,309 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:53:19,309 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:53:19,309 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:53:19,310 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:53:19,310 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:53:19,310 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:53:19,310 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:53:19,310 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:53:19,311 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:53:19,311 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:53:19,311 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:53:19,311 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:53:19,311 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:53:19,311 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:53:19,312 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:53:19,312 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:53:19,312 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:53:19,312 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:53:19,312 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:53:19,313 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:53:19,313 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:53:19,313 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:53:19,313 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:53:19,313 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:53:19,313 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:53:19,314 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:53:19,314 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:53:19,345 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:53:19,363 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:53:19,371 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:53:19,375 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:53:19,376 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:53:19,377 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.3.1.ufo.UNBOUNDED.pals.c_9.bpl [2018-12-03 17:53:19,377 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl' [2018-12-03 17:53:19,436 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:53:19,438 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:53:19,439 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:53:19,439 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:53:19,439 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:53:19,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:53:19" (1/1) ... [2018-12-03 17:53:19,468 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:53:19" (1/1) ... [2018-12-03 17:53:19,477 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:53:19,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:53:19,479 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:53:19,479 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:53:19,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:53:19" (1/1) ... [2018-12-03 17:53:19,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:53:19" (1/1) ... [2018-12-03 17:53:19,494 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:53:19" (1/1) ... [2018-12-03 17:53:19,494 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:53:19" (1/1) ... [2018-12-03 17:53:19,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:53:19" (1/1) ... [2018-12-03 17:53:19,504 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:53:19" (1/1) ... [2018-12-03 17:53:19,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:53:19" (1/1) ... [2018-12-03 17:53:19,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:53:19,510 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:53:19,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:53:19,511 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:53:19,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:53:19" (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:53:19,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:53:19,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:53:20,147 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:53:20,147 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 17:53:20,148 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:53:20 BoogieIcfgContainer [2018-12-03 17:53:20,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:53:20,149 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:53:20,149 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:53:20,153 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:53:20,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:53:19" (1/2) ... [2018-12-03 17:53:20,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5639e580 and model type pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:53:20, skipping insertion in model container [2018-12-03 17:53:20,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:53:20" (2/2) ... [2018-12-03 17:53:20,156 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl [2018-12-03 17:53:20,167 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:53:20,175 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:53:20,195 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:53:20,246 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:53:20,247 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:53:20,247 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:53:20,247 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:53:20,247 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:53:20,248 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:53:20,248 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:53:20,248 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:53:20,264 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2018-12-03 17:53:20,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:53:20,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:53:20,272 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:53:20,275 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:53:20,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:53:20,281 INFO L82 PathProgramCache]: Analyzing trace with hash -100896173, now seen corresponding path program 1 times [2018-12-03 17:53:20,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:53:20,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:20,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:53:20,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:20,352 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:53:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:53:20,548 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:53:20,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:53:20,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:53:20,550 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:53:20,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:53:20,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:53:20,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:53:20,571 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2018-12-03 17:53:20,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:53:20,652 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2018-12-03 17:53:20,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:53:20,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-03 17:53:20,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:53:20,663 INFO L225 Difference]: With dead ends: 39 [2018-12-03 17:53:20,663 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 17:53:20,668 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:53:20,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 17:53:20,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-12-03 17:53:20,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 17:53:20,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2018-12-03 17:53:20,710 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 12 [2018-12-03 17:53:20,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:53:20,711 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2018-12-03 17:53:20,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:53:20,711 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2018-12-03 17:53:20,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:53:20,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:53:20,712 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:53:20,713 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:53:20,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:53:20,713 INFO L82 PathProgramCache]: Analyzing trace with hash -100955755, now seen corresponding path program 1 times [2018-12-03 17:53:20,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:53:20,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:20,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:53:20,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:20,718 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:53:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:53:20,917 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:53:20,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:53:20,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:53:20,918 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:53:20,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:53:20,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:53:20,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:53:20,921 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 4 states. [2018-12-03 17:53:21,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:53:21,083 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2018-12-03 17:53:21,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:53:21,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-12-03 17:53:21,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:53:21,086 INFO L225 Difference]: With dead ends: 46 [2018-12-03 17:53:21,086 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 17:53:21,088 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:53:21,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 17:53:21,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 25. [2018-12-03 17:53:21,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 17:53:21,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2018-12-03 17:53:21,101 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 12 [2018-12-03 17:53:21,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:53:21,101 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-12-03 17:53:21,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:53:21,104 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2018-12-03 17:53:21,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:53:21,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:53:21,105 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:53:21,106 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:53:21,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:53:21,106 INFO L82 PathProgramCache]: Analyzing trace with hash -493923183, now seen corresponding path program 1 times [2018-12-03 17:53:21,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:53:21,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:21,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:53:21,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:21,112 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:53:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:53:21,187 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:53:21,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:53:21,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:53:21,188 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:53:21,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:53:21,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:53:21,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:53:21,189 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 3 states. [2018-12-03 17:53:21,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:53:21,223 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2018-12-03 17:53:21,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:53:21,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-03 17:53:21,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:53:21,225 INFO L225 Difference]: With dead ends: 55 [2018-12-03 17:53:21,226 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 17:53:21,226 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:53:21,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 17:53:21,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-12-03 17:53:21,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 17:53:21,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2018-12-03 17:53:21,244 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 12 [2018-12-03 17:53:21,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:53:21,244 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-12-03 17:53:21,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:53:21,245 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2018-12-03 17:53:21,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 17:53:21,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:53:21,246 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:53:21,247 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:53:21,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:53:21,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1628792711, now seen corresponding path program 1 times [2018-12-03 17:53:21,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:53:21,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:21,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:53:21,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:21,256 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:53:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:53:21,505 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:53:21,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:53:21,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:53:21,507 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:53:21,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:53:21,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:53:21,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:53:21,508 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand 3 states. [2018-12-03 17:53:21,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:53:21,546 INFO L93 Difference]: Finished difference Result 111 states and 144 transitions. [2018-12-03 17:53:21,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:53:21,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-03 17:53:21,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:53:21,550 INFO L225 Difference]: With dead ends: 111 [2018-12-03 17:53:21,550 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 17:53:21,552 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:53:21,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 17:53:21,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-12-03 17:53:21,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 17:53:21,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 93 transitions. [2018-12-03 17:53:21,591 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 93 transitions. Word has length 22 [2018-12-03 17:53:21,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:53:21,591 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 93 transitions. [2018-12-03 17:53:21,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:53:21,592 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2018-12-03 17:53:21,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 17:53:21,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:53:21,594 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:53:21,594 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:53:21,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:53:21,596 INFO L82 PathProgramCache]: Analyzing trace with hash -819446085, now seen corresponding path program 1 times [2018-12-03 17:53:21,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:53:21,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:21,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:53:21,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:21,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:53:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:53:21,743 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:53:21,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:53:21,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:53:21,744 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:53:21,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:53:21,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:53:21,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:53:21,745 INFO L87 Difference]: Start difference. First operand 73 states and 93 transitions. Second operand 3 states. [2018-12-03 17:53:21,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:53:21,874 INFO L93 Difference]: Finished difference Result 213 states and 273 transitions. [2018-12-03 17:53:21,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:53:21,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-03 17:53:21,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:53:21,889 INFO L225 Difference]: With dead ends: 213 [2018-12-03 17:53:21,889 INFO L226 Difference]: Without dead ends: 143 [2018-12-03 17:53:21,893 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:53:21,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-03 17:53:21,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-12-03 17:53:21,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-03 17:53:21,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 176 transitions. [2018-12-03 17:53:21,946 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 176 transitions. Word has length 22 [2018-12-03 17:53:21,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:53:21,947 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 176 transitions. [2018-12-03 17:53:21,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:53:21,947 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 176 transitions. [2018-12-03 17:53:21,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 17:53:21,952 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:53:21,952 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:53:21,952 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:53:21,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:53:21,953 INFO L82 PathProgramCache]: Analyzing trace with hash -762187783, now seen corresponding path program 1 times [2018-12-03 17:53:21,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:53:21,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:21,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:53:21,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:21,956 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:53:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:53:22,180 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-12-03 17:53:22,197 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:53:22,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:53:22,198 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:53:22,199 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-12-03 17:53:22,201 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42] [2018-12-03 17:53:22,267 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:53:22,268 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:53:23,010 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 17:53:30,566 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:53:30,568 INFO L272 AbstractInterpreter]: Visited 17 different actions 112 times. Merged at 16 different actions 71 times. Widened at 7 different actions 7 times. Found 17 fixpoints after 7 different actions. Largest state had 0 variables. [2018-12-03 17:53:30,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:53:30,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:53:30,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:53:30,618 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:53:30,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:53:30,637 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:53:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:53:30,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:53:30,870 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:53:30,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:53:31,018 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:53:31,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:53:31,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2018-12-03 17:53:31,050 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:53:31,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:53:31,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:53:31,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:53:31,051 INFO L87 Difference]: Start difference. First operand 141 states and 176 transitions. Second operand 7 states. [2018-12-03 17:53:32,180 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 17:53:32,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:53:32,280 INFO L93 Difference]: Finished difference Result 386 states and 480 transitions. [2018-12-03 17:53:32,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:53:32,281 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-12-03 17:53:32,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:53:32,286 INFO L225 Difference]: With dead ends: 386 [2018-12-03 17:53:32,286 INFO L226 Difference]: Without dead ends: 202 [2018-12-03 17:53:32,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:53:32,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-12-03 17:53:32,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 185. [2018-12-03 17:53:32,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-12-03 17:53:32,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 222 transitions. [2018-12-03 17:53:32,363 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 222 transitions. Word has length 22 [2018-12-03 17:53:32,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:53:32,364 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 222 transitions. [2018-12-03 17:53:32,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:53:32,365 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 222 transitions. [2018-12-03 17:53:32,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 17:53:32,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:53:32,367 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 17:53:32,368 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:53:32,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:53:32,368 INFO L82 PathProgramCache]: Analyzing trace with hash 518092167, now seen corresponding path program 2 times [2018-12-03 17:53:32,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:53:32,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:32,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:53:32,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:32,374 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:53:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:53:32,467 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-03 17:53:32,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:53:32,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:53:32,468 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:53:32,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:53:32,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:53:32,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:53:32,469 INFO L87 Difference]: Start difference. First operand 185 states and 222 transitions. Second operand 3 states. [2018-12-03 17:53:32,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:53:32,539 INFO L93 Difference]: Finished difference Result 375 states and 448 transitions. [2018-12-03 17:53:32,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:53:32,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-12-03 17:53:32,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:53:32,541 INFO L225 Difference]: With dead ends: 375 [2018-12-03 17:53:32,542 INFO L226 Difference]: Without dead ends: 187 [2018-12-03 17:53:32,543 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:53:32,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-03 17:53:32,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 151. [2018-12-03 17:53:32,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-03 17:53:32,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 177 transitions. [2018-12-03 17:53:32,576 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 177 transitions. Word has length 42 [2018-12-03 17:53:32,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:53:32,577 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 177 transitions. [2018-12-03 17:53:32,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:53:32,577 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 177 transitions. [2018-12-03 17:53:32,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 17:53:32,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:53:32,579 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 17:53:32,579 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:53:32,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:53:32,579 INFO L82 PathProgramCache]: Analyzing trace with hash -537457785, now seen corresponding path program 3 times [2018-12-03 17:53:32,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:53:32,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:32,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:53:32,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:32,581 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:53:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:53:32,654 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-03 17:53:32,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:53:32,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:53:32,655 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:53:32,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:53:32,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:53:32,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:53:32,656 INFO L87 Difference]: Start difference. First operand 151 states and 177 transitions. Second operand 3 states. [2018-12-03 17:53:32,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:53:32,663 INFO L93 Difference]: Finished difference Result 153 states and 179 transitions. [2018-12-03 17:53:32,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:53:32,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-12-03 17:53:32,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:53:32,663 INFO L225 Difference]: With dead ends: 153 [2018-12-03 17:53:32,663 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 17:53:32,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:53:32,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 17:53:32,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 17:53:32,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 17:53:32,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 17:53:32,665 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2018-12-03 17:53:32,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:53:32,665 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 17:53:32,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:53:32,665 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 17:53:32,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 17:53:32,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 17:53:32,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:53:32,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:53:32,958 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-12-03 17:53:33,087 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-12-03 17:53:33,243 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 17:53:33,555 WARN L180 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-12-03 17:53:33,758 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-12-03 17:53:33,902 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 17:53:34,889 WARN L180 SmtUtils]: Spent 878.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-12-03 17:53:34,892 INFO L444 ceAbstractionStarter]: At program point L289(lines 284 290) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= (div ~mode3 256) 0) (<= 1 ULTIMATE.start_check_~tmp~78)) [2018-12-03 17:53:34,892 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 57 311) no Hoare annotation was computed. [2018-12-03 17:53:34,893 INFO L444 ceAbstractionStarter]: At program point L223(lines 214 224) the Hoare annotation is: (let ((.cse4 (div ~mode3 256)) (.cse0 (<= ~send2 127)) (.cse2 (div ~mode2 256)) (.cse1 (< 0 (+ (div ~send2 256) 1))) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) (<= 1 ~mode3) .cse3 (<= .cse4 0)) (and (= ~mode3 (* 256 .cse4)) .cse0 (= ~mode2 (* 256 .cse2)) .cse1 .cse3 (<= ~r1 (* 256 (div ~r1 256)))))) [2018-12-03 17:53:34,893 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 310) no Hoare annotation was computed. [2018-12-03 17:53:34,893 INFO L444 ceAbstractionStarter]: At program point L246(lines 237 247) the Hoare annotation is: (let ((.cse8 (div ~mode3 256))) (let ((.cse0 (= ~mode3 (* 256 .cse8))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~send2 127)) (.cse4 (< 0 (+ (div ~send2 256) 1))) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7) (and (not (= ~p2_old ~nomsg)) .cse2 .cse4 (<= 1 ~mode3) .cse6 (<= .cse8 0)) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse7)))) [2018-12-03 17:53:34,893 INFO L444 ceAbstractionStarter]: At program point L308(lines 199 308) the Hoare annotation is: (let ((.cse4 (div ~mode3 256)) (.cse0 (<= ~send2 127)) (.cse2 (div ~mode2 256)) (.cse1 (< 0 (+ (div ~send2 256) 1))) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) (<= 1 ~mode3) .cse3 (<= .cse4 0)) (and (= ~mode3 (* 256 .cse4)) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 .cse2)) .cse1 .cse3 (<= ~r1 (* 256 (div ~r1 256)))))) [2018-12-03 17:53:34,893 INFO L444 ceAbstractionStarter]: At program point L228(lines 228 238) the Hoare annotation is: (let ((.cse4 (div ~mode3 256)) (.cse0 (<= ~send2 127)) (.cse2 (div ~mode2 256)) (.cse1 (< 0 (+ (div ~send2 256) 1))) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) (<= 1 ~mode3) .cse3 (<= .cse4 0)) (and (= ~mode3 (* 256 .cse4)) .cse0 (= ~mode2 (* 256 .cse2)) .cse1 .cse3 (<= ~r1 (* 256 (div ~r1 256)))))) [2018-12-03 17:53:34,893 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 57 311) no Hoare annotation was computed. [2018-12-03 17:53:34,893 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 57 311) no Hoare annotation was computed. [2018-12-03 17:53:34,896 INFO L444 ceAbstractionStarter]: At program point L251(lines 251 260) the Hoare annotation is: (let ((.cse8 (div ~mode3 256))) (let ((.cse0 (= ~mode3 (* 256 .cse8))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~send2 127)) (.cse4 (< 0 (+ (div ~send2 256) 1))) (.cse5 (<= (div ~mode2 256) 0)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse3 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse3 1)) (<= .cse3 0)))) .cse4 .cse5 .cse6 .cse7) (and (not (= ~p2_old ~nomsg)) .cse2 .cse4 (<= 1 ~mode3) .cse6 (<= .cse8 0)) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse7)))) [2018-12-03 17:53:34,896 INFO L444 ceAbstractionStarter]: At program point L278(lines 278 285) the Hoare annotation is: (let ((.cse0 (not (= ~p2_old ~nomsg))) (.cse1 (<= 1 ~mode2)) (.cse2 (<= ~send2 127)) (.cse3 (< 0 (+ (div ~send2 256) 1))) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (<= 1 ~mode3)) (.cse6 (= 0 (+ ~nomsg 1))) (.cse7 (<= (div ~mode3 256) 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~r1 (* 256 (div ~r1 256)))) (and .cse0 .cse1 .cse2 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse3 .cse4 .cse5 .cse6 .cse7))) [2018-12-03 17:53:34,896 INFO L444 ceAbstractionStarter]: At program point L305(lines 305 309) the Hoare annotation is: false [2018-12-03 17:53:34,896 INFO L444 ceAbstractionStarter]: At program point L206(lines 206 215) the Hoare annotation is: (let ((.cse4 (div ~mode3 256)) (.cse0 (<= ~send2 127)) (.cse2 (div ~mode2 256)) (.cse1 (< 0 (+ (div ~send2 256) 1))) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) (<= 1 ~mode3) .cse3 (<= .cse4 0)) (and (= ~mode3 (* 256 .cse4)) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 .cse2)) .cse1 .cse3 (<= ~r1 (* 256 (div ~r1 256)))))) [2018-12-03 17:53:34,897 INFO L444 ceAbstractionStarter]: At program point L299(lines 299 306) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= (div ULTIMATE.start_assert_~arg 256) 0) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= (div ~mode3 256) 0) (<= 1 ULTIMATE.start_assert_~arg) (<= 1 ULTIMATE.start_check_~tmp~78)) [2018-12-03 17:53:34,897 INFO L444 ceAbstractionStarter]: At program point L266(lines 259 267) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (<= ~send2 127)) (.cse2 (< 0 (+ (div ~send2 256) 1))) (.cse3 (<= (div ~mode2 256) 0)) (.cse4 (<= 1 ~mode3)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= (div ~mode3 256) 0)) (.cse7 (not (= ~p2_new ~nomsg)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~r1 (* 256 (div ~r1 256))) .cse7) (and .cse0 .cse1 (exists ((v_~r1_7 Int)) (let ((.cse8 (mod v_~r1_7 256))) (and (= ~r1 (+ .cse8 1)) (<= .cse8 0)))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2018-12-03 17:53:34,938 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 05:53:34 BoogieIcfgContainer [2018-12-03 17:53:34,939 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 17:53:34,940 INFO L168 Benchmark]: Toolchain (without parser) took 15502.86 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-12-03 17:53:34,944 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 17:53:34,945 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.34 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 17:53:34,945 INFO L168 Benchmark]: Boogie Preprocessor took 31.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 17:53:34,946 INFO L168 Benchmark]: RCFGBuilder took 638.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-03 17:53:34,949 INFO L168 Benchmark]: TraceAbstraction took 14789.37 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-12-03 17:53:34,955 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.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.34 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 638.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14789.37 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 310]: 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: 199]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 214]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: ((((((((1 <= ~mode2 && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) || ((((((((1 <= ~mode2 && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || (((((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 299]: Loop Invariant Derived loop invariant: (((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && assert_~arg / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && 1 <= assert_~arg) && 1 <= check_~tmp~78 - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: ((((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || (((((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0)) || (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && !(~p2_new == ~nomsg)) - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && ~r1 <= 256 * (~r1 / 256)) || ((((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && (exists v_~r1_7 : int :: ~r1 == v_~r1_7 % 256 + 1 && v_~r1_7 % 256 <= 0)) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) - InvariantResult [Line: 284]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && 1 <= check_~tmp~78 - InvariantResult [Line: 305]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || ((((((~mode3 == 256 * (~mode3 / 256) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 228]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || (((((~mode3 == 256 * (~mode3 / 256) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. SAFE Result, 14.6s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 2.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 163 SDtfs, 137 SDslu, 148 SDs, 0 SdLazy, 135 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=185occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 8.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 80 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 67 NumberOfFragments, 825 HoareAnnotationTreeSize, 11 FomulaSimplifications, 2648 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 40 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 220 ConstructedInterpolants, 6 QuantifiedInterpolants, 19702 SizeOfPredicates, 1 NumberOfNonLiveVariables, 197 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 152/170 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...