java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:39:09,292 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:39:09,294 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:39:09,308 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:39:09,308 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:39:09,309 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:39:09,311 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:39:09,312 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:39:09,314 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:39:09,315 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:39:09,316 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:39:09,316 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:39:09,317 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:39:09,318 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:39:09,320 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:39:09,321 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:39:09,321 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:39:09,323 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:39:09,326 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:39:09,327 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:39:09,329 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:39:09,330 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:39:09,332 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:39:09,333 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:39:09,333 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:39:09,334 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:39:09,335 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:39:09,336 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:39:09,337 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:39:09,338 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:39:09,338 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:39:09,339 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:39:09,339 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:39:09,339 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:39:09,341 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:39:09,341 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:39:09,342 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:39:09,354 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:39:09,355 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:39:09,356 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:39:09,356 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:39:09,356 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:39:09,356 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:39:09,357 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:39:09,357 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:39:09,357 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:39:09,357 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:39:09,357 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:39:09,358 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:39:09,358 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:39:09,358 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:39:09,358 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:39:09,359 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:39:09,359 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:39:09,360 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:39:09,360 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:39:09,360 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:39:09,360 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:39:09,360 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:39:09,361 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:39:09,361 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:39:09,361 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:39:09,361 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:39:09,361 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:39:09,362 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:39:09,364 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:39:09,364 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:39:09,364 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:39:09,364 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:39:09,364 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:39:09,365 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:39:09,365 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:39:09,366 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:39:09,366 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:39:09,366 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:39:09,366 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:39:09,366 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:39:09,367 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:39:09,426 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:39:09,446 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:39:09,453 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:39:09,455 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:39:09,455 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:39:09,456 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.5.2.ufo.BOUNDED-10.pals.c_11.bpl [2018-12-03 15:39:09,456 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl' [2018-12-03 15:39:09,531 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:39:09,534 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:39:09,535 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:39:09,536 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:39:09,536 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:39:09,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:39:09" (1/1) ... [2018-12-03 15:39:09,576 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:39:09" (1/1) ... [2018-12-03 15:39:09,594 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:39:09,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:39:09,595 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:39:09,596 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:39:09,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:39:09" (1/1) ... [2018-12-03 15:39:09,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:39:09" (1/1) ... [2018-12-03 15:39:09,614 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:39:09" (1/1) ... [2018-12-03 15:39:09,614 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:39:09" (1/1) ... [2018-12-03 15:39:09,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:39:09" (1/1) ... [2018-12-03 15:39:09,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:39:09" (1/1) ... [2018-12-03 15:39:09,643 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:39:09" (1/1) ... [2018-12-03 15:39:09,647 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:39:09,648 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:39:09,648 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:39:09,649 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:39:09,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:39:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:39:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:39:09,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:39:10,467 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:39:10,468 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:39:10,469 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:39:10 BoogieIcfgContainer [2018-12-03 15:39:10,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:39:10,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:39:10,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:39:10,473 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:39:10,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:39:09" (1/2) ... [2018-12-03 15:39:10,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2870a6dd and model type pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:39:10, skipping insertion in model container [2018-12-03 15:39:10,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:39:10" (2/2) ... [2018-12-03 15:39:10,478 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl [2018-12-03 15:39:10,489 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:39:10,500 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:39:10,515 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:39:10,547 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:39:10,548 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:39:10,548 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:39:10,548 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:39:10,548 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:39:10,548 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:39:10,549 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:39:10,549 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:39:10,565 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-12-03 15:39:10,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:39:10,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:10,575 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:39:10,577 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:10,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:10,584 INFO L82 PathProgramCache]: Analyzing trace with hash -417618601, now seen corresponding path program 1 times [2018-12-03 15:39:10,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:10,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:10,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:10,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:10,643 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:10,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:10,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:10,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:39:10,835 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:10,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:39:10,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:39:10,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:10,857 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-12-03 15:39:10,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:10,916 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2018-12-03 15:39:10,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:39:10,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 15:39:10,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:10,930 INFO L225 Difference]: With dead ends: 51 [2018-12-03 15:39:10,931 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 15:39:10,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:10,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 15:39:10,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-12-03 15:39:10,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 15:39:10,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-12-03 15:39:10,981 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 16 [2018-12-03 15:39:10,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:10,982 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-12-03 15:39:10,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:39:10,982 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-12-03 15:39:10,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:39:10,983 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:10,983 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:39:10,984 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:10,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:10,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1428735851, now seen corresponding path program 1 times [2018-12-03 15:39:10,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:10,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:10,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:10,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:10,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:11,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:11,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:11,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:39:11,124 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:11,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:39:11,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:39:11,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:11,128 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 3 states. [2018-12-03 15:39:11,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:11,185 INFO L93 Difference]: Finished difference Result 91 states and 127 transitions. [2018-12-03 15:39:11,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:39:11,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 15:39:11,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:11,195 INFO L225 Difference]: With dead ends: 91 [2018-12-03 15:39:11,195 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 15:39:11,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:11,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 15:39:11,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-12-03 15:39:11,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 15:39:11,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2018-12-03 15:39:11,232 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 16 [2018-12-03 15:39:11,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:11,232 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2018-12-03 15:39:11,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:39:11,234 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-12-03 15:39:11,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:39:11,235 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:11,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:39:11,235 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:11,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:11,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1821762861, now seen corresponding path program 1 times [2018-12-03 15:39:11,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:11,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:11,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:11,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:11,246 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:11,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:11,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:39:11,405 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:11,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:39:11,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:39:11,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:11,407 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 3 states. [2018-12-03 15:39:11,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:11,492 INFO L93 Difference]: Finished difference Result 175 states and 244 transitions. [2018-12-03 15:39:11,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:39:11,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 15:39:11,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:11,501 INFO L225 Difference]: With dead ends: 175 [2018-12-03 15:39:11,501 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 15:39:11,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:11,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 15:39:11,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-12-03 15:39:11,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 15:39:11,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2018-12-03 15:39:11,553 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 158 transitions. Word has length 16 [2018-12-03 15:39:11,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:11,553 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 158 transitions. [2018-12-03 15:39:11,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:39:11,554 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 158 transitions. [2018-12-03 15:39:11,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:39:11,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:11,555 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:39:11,555 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:11,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:11,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1012416235, now seen corresponding path program 1 times [2018-12-03 15:39:11,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:11,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:11,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:11,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:11,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:11,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:11,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:11,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:39:11,690 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:11,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:39:11,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:39:11,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:11,691 INFO L87 Difference]: Start difference. First operand 115 states and 158 transitions. Second operand 3 states. [2018-12-03 15:39:11,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:11,766 INFO L93 Difference]: Finished difference Result 343 states and 472 transitions. [2018-12-03 15:39:11,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:39:11,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 15:39:11,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:11,769 INFO L225 Difference]: With dead ends: 343 [2018-12-03 15:39:11,769 INFO L226 Difference]: Without dead ends: 229 [2018-12-03 15:39:11,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:11,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-12-03 15:39:11,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2018-12-03 15:39:11,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-12-03 15:39:11,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 306 transitions. [2018-12-03 15:39:11,813 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 306 transitions. Word has length 16 [2018-12-03 15:39:11,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:11,814 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 306 transitions. [2018-12-03 15:39:11,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:39:11,814 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 306 transitions. [2018-12-03 15:39:11,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:39:11,815 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:11,815 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:39:11,815 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:11,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:11,816 INFO L82 PathProgramCache]: Analyzing trace with hash -955157933, now seen corresponding path program 1 times [2018-12-03 15:39:11,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:11,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:11,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:11,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:11,818 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:11,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:11,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:11,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:39:11,900 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:11,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:39:11,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:39:11,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:11,901 INFO L87 Difference]: Start difference. First operand 227 states and 306 transitions. Second operand 3 states. [2018-12-03 15:39:12,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:12,009 INFO L93 Difference]: Finished difference Result 569 states and 770 transitions. [2018-12-03 15:39:12,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:39:12,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 15:39:12,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:12,013 INFO L225 Difference]: With dead ends: 569 [2018-12-03 15:39:12,014 INFO L226 Difference]: Without dead ends: 343 [2018-12-03 15:39:12,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:12,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-12-03 15:39:12,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2018-12-03 15:39:12,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-12-03 15:39:12,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 456 transitions. [2018-12-03 15:39:12,078 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 456 transitions. Word has length 16 [2018-12-03 15:39:12,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:12,079 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 456 transitions. [2018-12-03 15:39:12,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:39:12,079 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 456 transitions. [2018-12-03 15:39:12,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:39:12,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:12,080 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:39:12,080 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:12,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:12,081 INFO L82 PathProgramCache]: Analyzing trace with hash -955217515, now seen corresponding path program 1 times [2018-12-03 15:39:12,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:12,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:12,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:12,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:12,084 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:12,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:12,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:12,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:39:12,264 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:12,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:39:12,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:39:12,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:39:12,266 INFO L87 Difference]: Start difference. First operand 341 states and 456 transitions. Second operand 4 states. [2018-12-03 15:39:12,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:12,512 INFO L93 Difference]: Finished difference Result 610 states and 805 transitions. [2018-12-03 15:39:12,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:39:12,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-03 15:39:12,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:12,516 INFO L225 Difference]: With dead ends: 610 [2018-12-03 15:39:12,516 INFO L226 Difference]: Without dead ends: 608 [2018-12-03 15:39:12,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:39:12,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-12-03 15:39:12,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 373. [2018-12-03 15:39:12,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-12-03 15:39:12,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 480 transitions. [2018-12-03 15:39:12,590 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 480 transitions. Word has length 16 [2018-12-03 15:39:12,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:12,590 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 480 transitions. [2018-12-03 15:39:12,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:39:12,591 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 480 transitions. [2018-12-03 15:39:12,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 15:39:12,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:12,593 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:39:12,593 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:12,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:12,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1530501555, now seen corresponding path program 1 times [2018-12-03 15:39:12,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:12,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:12,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:12,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:12,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:12,858 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 15:39:12,866 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:12,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:12,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:39:12,869 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:12,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:39:12,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:39:12,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:12,871 INFO L87 Difference]: Start difference. First operand 373 states and 480 transitions. Second operand 3 states. [2018-12-03 15:39:13,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:13,054 INFO L93 Difference]: Finished difference Result 1113 states and 1434 transitions. [2018-12-03 15:39:13,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:39:13,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-03 15:39:13,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:13,059 INFO L225 Difference]: With dead ends: 1113 [2018-12-03 15:39:13,060 INFO L226 Difference]: Without dead ends: 743 [2018-12-03 15:39:13,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:13,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-12-03 15:39:13,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2018-12-03 15:39:13,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-12-03 15:39:13,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 932 transitions. [2018-12-03 15:39:13,184 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 932 transitions. Word has length 30 [2018-12-03 15:39:13,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:13,184 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 932 transitions. [2018-12-03 15:39:13,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:39:13,184 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 932 transitions. [2018-12-03 15:39:13,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 15:39:13,188 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:13,188 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:39:13,188 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:13,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:13,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1272336117, now seen corresponding path program 1 times [2018-12-03 15:39:13,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:13,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:13,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:13,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:13,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:13,586 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-12-03 15:39:13,614 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:39:13,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:13,615 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:39:13,616 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-12-03 15:39:13,618 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42], [46], [48], [50], [54], [56], [58] [2018-12-03 15:39:13,664 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:39:13,664 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:39:15,066 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:39:15,068 INFO L272 AbstractInterpreter]: Visited 23 different actions 146 times. Merged at 22 different actions 90 times. Widened at 1 different actions 1 times. Found 33 fixpoints after 11 different actions. Largest state had 0 variables. [2018-12-03 15:39:15,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:15,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:39:15,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:39:15,114 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:39:15,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:15,129 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:39:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:15,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:39:15,735 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:39:15,736 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:39:16,238 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-03 15:39:16,247 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:39:16,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:39:16,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2018-12-03 15:39:16,278 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:39:16,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:39:16,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:39:16,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:39:16,279 INFO L87 Difference]: Start difference. First operand 741 states and 932 transitions. Second operand 8 states. [2018-12-03 15:39:16,497 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-03 15:39:17,655 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-03 15:39:17,974 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-03 15:39:19,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:19,741 INFO L93 Difference]: Finished difference Result 1749 states and 2207 transitions. [2018-12-03 15:39:19,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:39:19,742 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-12-03 15:39:19,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:19,750 INFO L225 Difference]: With dead ends: 1749 [2018-12-03 15:39:19,751 INFO L226 Difference]: Without dead ends: 1011 [2018-12-03 15:39:19,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:39:19,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2018-12-03 15:39:19,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 647. [2018-12-03 15:39:19,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2018-12-03 15:39:19,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 783 transitions. [2018-12-03 15:39:19,905 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 783 transitions. Word has length 30 [2018-12-03 15:39:19,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:19,906 INFO L480 AbstractCegarLoop]: Abstraction has 647 states and 783 transitions. [2018-12-03 15:39:19,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:39:19,906 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 783 transitions. [2018-12-03 15:39:19,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 15:39:19,911 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:39:19,911 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 15:39:19,912 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:39:19,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:39:19,912 INFO L82 PathProgramCache]: Analyzing trace with hash 661288113, now seen corresponding path program 2 times [2018-12-03 15:39:19,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:39:19,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:19,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:39:19,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:39:19,915 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:39:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:39:20,133 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 15:39:20,140 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 15:39:20,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:39:20,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:39:20,140 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:39:20,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:39:20,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:39:20,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:20,142 INFO L87 Difference]: Start difference. First operand 647 states and 783 transitions. Second operand 3 states. [2018-12-03 15:39:20,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:39:20,196 INFO L93 Difference]: Finished difference Result 727 states and 879 transitions. [2018-12-03 15:39:20,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:39:20,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-12-03 15:39:20,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:39:20,198 INFO L225 Difference]: With dead ends: 727 [2018-12-03 15:39:20,198 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:39:20,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:39:20,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:39:20,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:39:20,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:39:20,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:39:20,200 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-12-03 15:39:20,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:39:20,201 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:39:20,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:39:20,201 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:39:20,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:39:20,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:39:20,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:20,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:39:21,924 WARN L180 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-12-03 15:39:22,244 WARN L180 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2018-12-03 15:39:22,367 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-12-03 15:39:22,574 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-12-03 15:39:22,729 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2018-12-03 15:39:22,947 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-12-03 15:39:23,134 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2018-12-03 15:39:23,475 WARN L180 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2018-12-03 15:39:23,640 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-12-03 15:39:23,833 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2018-12-03 15:39:24,050 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2018-12-03 15:39:24,206 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-12-03 15:39:24,513 WARN L180 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2018-12-03 15:39:24,517 INFO L444 ceAbstractionStarter]: At program point L316(lines 316 327) the Hoare annotation is: (let ((.cse1 (= ~r1 0)) (.cse2 (<= ~send4 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (< 0 (+ (div ~send4 256) 1))) (.cse0 (div ~mode5 256))) (or (and (= ~mode5 (* 256 .cse0)) .cse1 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse1 (<= 1 ULTIMATE.start_check_~tmp~127) (<= 1 ~mode5) .cse2 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse3 (<= 1 ULTIMATE.start_assert_~arg) (not (= ~p4_old ~nomsg)) .cse4 (<= .cse0 0)))) [2018-12-03 15:39:24,518 INFO L444 ceAbstractionStarter]: At program point L399(lines 399 409) the Hoare annotation is: (let ((.cse11 (div ~mode5 256))) (let ((.cse8 (= ~mode4 (* 256 (div ~mode4 256)))) (.cse13 (= ~mode1 (* 256 (div ~mode1 256)))) (.cse14 (<= ~r1 1)) (.cse2 (<= 1 ~mode5)) (.cse10 (<= .cse11 0)) (.cse0 (= ~r1 0)) (.cse1 (<= 1 ULTIMATE.start_check_~tmp~127)) (.cse12 (not (= ~p4_new ~nomsg))) (.cse3 (<= ~send4 127)) (.cse4 (<= (div ULTIMATE.start_assert_~arg 256) 0)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 1 ULTIMATE.start_assert_~arg)) (.cse7 (not (= ~p4_old ~nomsg))) (.cse9 (< 0 (+ (div ~send4 256) 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= ~mode5 (* 256 .cse11)) .cse0 .cse12 .cse3 .cse5 .cse9) (and .cse13 .cse14 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse13 .cse12 .cse14 .cse2 .cse3 .cse5 .cse7 .cse9 .cse10) (and .cse0 .cse1 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9)))) [2018-12-03 15:39:24,518 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 465) no Hoare annotation was computed. [2018-12-03 15:39:24,518 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 91 466) no Hoare annotation was computed. [2018-12-03 15:39:24,518 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 91 466) no Hoare annotation was computed. [2018-12-03 15:39:24,518 INFO L444 ceAbstractionStarter]: At program point L441(lines 436 442) the Hoare annotation is: (and (= ~r1 0) (<= 1 ULTIMATE.start_check_~tmp~127) (<= 1 ~mode5) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (not (= ~p4_old ~nomsg)) (< 0 (+ (div ~send4 256) 1)) (<= (div ~mode5 256) 0)) [2018-12-03 15:39:24,519 INFO L444 ceAbstractionStarter]: At program point L371(lines 365 372) the Hoare annotation is: (let ((.cse6 (div ~mode5 256))) (let ((.cse7 (= ~r1 0)) (.cse0 (<= 1 ~mode5)) (.cse1 (<= ~send4 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (not (= ~p4_old ~nomsg))) (.cse4 (< 0 (+ (div ~send4 256) 1))) (.cse5 (<= .cse6 0))) (or (and (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= ~mode5 (* 256 .cse6)) .cse7 .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse7 (<= 1 ULTIMATE.start_check_~tmp~127) .cse0 .cse1 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse2 (<= 1 ULTIMATE.start_assert_~arg) .cse3 .cse4 .cse5)))) [2018-12-03 15:39:24,519 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 91 466) no Hoare annotation was computed. [2018-12-03 15:39:24,519 INFO L444 ceAbstractionStarter]: At program point L351(lines 345 352) the Hoare annotation is: (let ((.cse6 (div ~mode5 256))) (let ((.cse7 (= ~r1 0)) (.cse0 (<= 1 ~mode5)) (.cse1 (<= ~send4 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (not (= ~p4_old ~nomsg))) (.cse4 (< 0 (+ (div ~send4 256) 1))) (.cse5 (<= .cse6 0))) (or (and (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= ~mode5 (* 256 .cse6)) .cse7 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse7 (<= 1 ULTIMATE.start_check_~tmp~127) .cse0 .cse1 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse2 (<= 1 ULTIMATE.start_assert_~arg) .cse3 .cse4 .cse5)))) [2018-12-03 15:39:24,519 INFO L444 ceAbstractionStarter]: At program point L376(lines 376 388) the Hoare annotation is: (let ((.cse6 (div ~mode5 256))) (let ((.cse7 (= ~r1 0)) (.cse0 (<= 1 ~mode5)) (.cse1 (<= ~send4 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (not (= ~p4_old ~nomsg))) (.cse4 (< 0 (+ (div ~send4 256) 1))) (.cse5 (<= .cse6 0))) (or (and (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= ~mode5 (* 256 .cse6)) .cse7 .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse7 (<= 1 ULTIMATE.start_check_~tmp~127) .cse0 .cse1 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse2 (<= 1 ULTIMATE.start_assert_~arg) .cse3 .cse4 .cse5)))) [2018-12-03 15:39:24,519 INFO L444 ceAbstractionStarter]: At program point L463(lines 463 464) the Hoare annotation is: false [2018-12-03 15:39:24,519 INFO L444 ceAbstractionStarter]: At program point L430(lines 430 437) the Hoare annotation is: (and (= ~r1 0) (<= 1 ~mode5) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (not (= ~p4_old ~nomsg)) (< 0 (+ (div ~send4 256) 1)) (<= (div ~mode5 256) 0)) [2018-12-03 15:39:24,519 INFO L444 ceAbstractionStarter]: At program point L331(lines 326 332) the Hoare annotation is: (let ((.cse6 (div ~mode5 256))) (let ((.cse7 (= ~r1 0)) (.cse0 (<= 1 ~mode5)) (.cse1 (<= ~send4 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (not (= ~p4_old ~nomsg))) (.cse4 (< 0 (+ (div ~send4 256) 1))) (.cse5 (<= .cse6 0))) (or (and (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= ~mode5 (* 256 .cse6)) .cse7 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse7 (<= 1 ULTIMATE.start_check_~tmp~127) .cse0 .cse1 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse2 (<= 1 ULTIMATE.start_assert_~arg) .cse3 .cse4 .cse5)))) [2018-12-03 15:39:24,520 INFO L444 ceAbstractionStarter]: At program point L459(lines 309 459) the Hoare annotation is: (let ((.cse1 (= ~r1 0)) (.cse2 (<= ~send4 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (< 0 (+ (div ~send4 256) 1))) (.cse0 (div ~mode5 256))) (or (and (= ~mode5 (* 256 .cse0)) .cse1 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse1 (<= 1 ULTIMATE.start_check_~tmp~127) (<= 1 ~mode5) .cse2 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse3 (<= 1 ULTIMATE.start_assert_~arg) (not (= ~p4_old ~nomsg)) .cse4 (<= .cse0 0)))) [2018-12-03 15:39:24,520 INFO L444 ceAbstractionStarter]: At program point L356(lines 356 366) the Hoare annotation is: (let ((.cse6 (div ~mode5 256))) (let ((.cse7 (= ~r1 0)) (.cse0 (<= 1 ~mode5)) (.cse1 (<= ~send4 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (not (= ~p4_old ~nomsg))) (.cse4 (< 0 (+ (div ~send4 256) 1))) (.cse5 (<= .cse6 0))) (or (and (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= ~mode5 (* 256 .cse6)) .cse7 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse7 (<= 1 ULTIMATE.start_check_~tmp~127) .cse0 .cse1 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse2 (<= 1 ULTIMATE.start_assert_~arg) .cse3 .cse4 .cse5)))) [2018-12-03 15:39:24,520 INFO L444 ceAbstractionStarter]: At program point L451(lines 451 460) the Hoare annotation is: (and (= ~r1 0) (<= 1 ULTIMATE.start_check_~tmp~127) (<= 1 ~mode5) (<= ~send4 127) (<= (div ULTIMATE.start_assert_~arg 256) 0) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg) (not (= ~p4_old ~nomsg)) (< 0 (+ (div ~send4 256) 1)) (<= (div ~mode5 256) 0)) [2018-12-03 15:39:24,520 INFO L444 ceAbstractionStarter]: At program point L414(lines 408 415) the Hoare annotation is: (and (= ~r1 0) (not (= ~p4_new ~nomsg)) (<= 1 ~mode5) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (< 0 (+ (div ~send4 256) 1)) (<= (div ~mode5 256) 0)) [2018-12-03 15:39:24,520 INFO L444 ceAbstractionStarter]: At program point L336(lines 336 346) the Hoare annotation is: (let ((.cse6 (div ~mode5 256))) (let ((.cse7 (= ~r1 0)) (.cse0 (<= 1 ~mode5)) (.cse1 (<= ~send4 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (not (= ~p4_old ~nomsg))) (.cse4 (< 0 (+ (div ~send4 256) 1))) (.cse5 (<= .cse6 0))) (or (and (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= ~mode5 (* 256 .cse6)) .cse7 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse7 (<= 1 ULTIMATE.start_check_~tmp~127) .cse0 .cse1 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse2 (<= 1 ULTIMATE.start_assert_~arg) .cse3 .cse4 .cse5)))) [2018-12-03 15:39:24,520 INFO L444 ceAbstractionStarter]: At program point L394(lines 387 395) the Hoare annotation is: (let ((.cse11 (div ~mode5 256))) (let ((.cse8 (= ~mode4 (* 256 (div ~mode4 256)))) (.cse13 (= ~mode1 (* 256 (div ~mode1 256)))) (.cse14 (<= ~r1 1)) (.cse2 (<= 1 ~mode5)) (.cse10 (<= .cse11 0)) (.cse0 (= ~r1 0)) (.cse1 (<= 1 ULTIMATE.start_check_~tmp~127)) (.cse12 (not (= ~p4_new ~nomsg))) (.cse3 (<= ~send4 127)) (.cse4 (<= (div ULTIMATE.start_assert_~arg 256) 0)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 1 ULTIMATE.start_assert_~arg)) (.cse7 (not (= ~p4_old ~nomsg))) (.cse9 (< 0 (+ (div ~send4 256) 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= ~mode5 (* 256 .cse11)) .cse0 .cse12 .cse3 .cse5 .cse9) (and .cse13 .cse14 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse13 .cse12 .cse14 .cse2 .cse3 .cse5 .cse7 .cse9 .cse10) (and .cse0 .cse1 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9)))) [2018-12-03 15:39:24,542 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:39:24 BoogieIcfgContainer [2018-12-03 15:39:24,542 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:39:24,543 INFO L168 Benchmark]: Toolchain (without parser) took 15010.29 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 840.4 MB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -688.1 MB). Peak memory consumption was 604.3 MB. Max. memory is 7.1 GB. [2018-12-03 15:39:24,544 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 15:39:24,545 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.34 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:39:24,545 INFO L168 Benchmark]: Boogie Preprocessor took 52.60 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:39:24,546 INFO L168 Benchmark]: RCFGBuilder took 820.59 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-03 15:39:24,547 INFO L168 Benchmark]: TraceAbstraction took 14072.29 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 840.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -719.8 MB). Peak memory consumption was 572.6 MB. Max. memory is 7.1 GB. [2018-12-03 15:39:24,551 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 59.34 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 52.60 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 820.59 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 14072.29 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 840.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -719.8 MB). Peak memory consumption was 572.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 465]: 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: 356]: Loop Invariant Derived loop invariant: ((((((((~mode1 == 256 * (~mode1 / 256) && 1 <= ~mode5) && ~r1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) || ((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1)) || (((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) - InvariantResult [Line: 436]: Loop Invariant Derived loop invariant: ((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0 - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: (((((~r1 == 0 && 1 <= ~mode5) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0 - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: ((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0 - InvariantResult [Line: 376]: Loop Invariant Derived loop invariant: ((((((((~mode1 == 256 * (~mode1 / 256) && 1 <= ~mode5) && ~r1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) || (((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1)) || (((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1) || (((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: ((((((((~mode1 == 256 * (~mode1 / 256) && 1 <= ~mode5) && ~r1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) || ((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1)) || (((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((((((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) || (((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && !(~p4_new == ~nomsg)) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 < ~send4 / 256 + 1)) || ((((((((~mode1 == 256 * (~mode1 / 256) && ~r1 <= 1) && 1 <= ~mode5) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0)) || ((((((((~mode1 == 256 * (~mode1 / 256) && !(~p4_new == ~nomsg)) && ~r1 <= 1) && 1 <= ~mode5) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0)) || ((((((((~r1 == 0 && 1 <= check_~tmp~127) && !(~p4_new == ~nomsg)) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: ((((((((~mode1 == 256 * (~mode1 / 256) && 1 <= ~mode5) && ~r1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) || ((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1)) || (((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: (((((~r1 == 0 && !(~p4_new == ~nomsg)) && 1 <= ~mode5) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0 - InvariantResult [Line: 365]: Loop Invariant Derived loop invariant: ((((((((~mode1 == 256 * (~mode1 / 256) && 1 <= ~mode5) && ~r1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) || (((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1)) || (((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) - InvariantResult [Line: 316]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1) || (((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: ((((((((~mode1 == 256 * (~mode1 / 256) && 1 <= ~mode5) && ~r1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) || ((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1)) || (((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: (((((((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) || (((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && !(~p4_new == ~nomsg)) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 < ~send4 / 256 + 1)) || ((((((((~mode1 == 256 * (~mode1 / 256) && ~r1 <= 1) && 1 <= ~mode5) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0)) || ((((((((~mode1 == 256 * (~mode1 / 256) && !(~p4_new == ~nomsg)) && ~r1 <= 1) && 1 <= ~mode5) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0)) || ((((((((~r1 == 0 && 1 <= check_~tmp~127) && !(~p4_new == ~nomsg)) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) - InvariantResult [Line: 463]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. SAFE Result, 13.9s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 4.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 284 SDtfs, 230 SDslu, 231 SDs, 0 SdLazy, 167 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=741occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 611 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 107 NumberOfFragments, 1441 HoareAnnotationTreeSize, 15 FomulaSimplifications, 10115 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 15 FomulaSimplificationsInter, 78 FormulaSimplificationTreeSizeReductionInter, 3.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 244 NumberOfCodeBlocks, 244 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 263 ConstructedInterpolants, 0 QuantifiedInterpolants, 34017 SizeOfPredicates, 8 NumberOfNonLiveVariables, 299 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 110/140 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...