java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl


--------------------------------------------------------------------------------


This is Ultimate 0.1.23-00a8621
[2018-09-30 10:28:24,503 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2018-09-30 10:28:24,505 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2018-09-30 10:28:24,517 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-09-30 10:28:24,517 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-09-30 10:28:24,519 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-09-30 10:28:24,520 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-09-30 10:28:24,522 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2018-09-30 10:28:24,524 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-09-30 10:28:24,524 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-09-30 10:28:24,525 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-09-30 10:28:24,526 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-09-30 10:28:24,527 INFO  L174        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-09-30 10:28:24,528 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-09-30 10:28:24,529 INFO  L174        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-09-30 10:28:24,530 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-09-30 10:28:24,531 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-09-30 10:28:24,533 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-09-30 10:28:24,535 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2018-09-30 10:28:24,537 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-09-30 10:28:24,538 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-09-30 10:28:24,539 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-09-30 10:28:24,542 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-09-30 10:28:24,542 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-09-30 10:28:24,543 INFO  L174        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-09-30 10:28:24,544 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-09-30 10:28:24,545 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-09-30 10:28:24,546 INFO  L174        SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-09-30 10:28:24,548 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2018-09-30 10:28:24,550 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-09-30 10:28:24,550 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2018-09-30 10:28:24,553 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-09-30 10:28:24,553 INFO  L177        SettingsManager]: ReqParser provides no preferences, ignoring...
[2018-09-30 10:28:24,553 INFO  L174        SettingsManager]: Resetting SmtParser preferences to default values
[2018-09-30 10:28:24,556 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2018-09-30 10:28:24,560 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2018-09-30 10:28:24,560 INFO  L98         SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf
[2018-09-30 10:28:24,592 INFO  L110        SettingsManager]: Loading preferences was successful
[2018-09-30 10:28:24,592 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2018-09-30 10:28:24,594 INFO  L131        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-09-30 10:28:24,594 INFO  L133        SettingsManager]:  * to procedures, called more than once=true
[2018-09-30 10:28:24,594 INFO  L131        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-09-30 10:28:24,595 INFO  L133        SettingsManager]:  * Create parallel compositions if possible=false
[2018-09-30 10:28:24,595 INFO  L133        SettingsManager]:  * Use SBE=true
[2018-09-30 10:28:24,595 INFO  L131        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-09-30 10:28:24,596 INFO  L133        SettingsManager]:  * sizeof long=4
[2018-09-30 10:28:24,596 INFO  L133        SettingsManager]:  * Overapproximate operations on floating types=true
[2018-09-30 10:28:24,597 INFO  L133        SettingsManager]:  * sizeof POINTER=4
[2018-09-30 10:28:24,597 INFO  L133        SettingsManager]:  * Check division by zero=IGNORE
[2018-09-30 10:28:24,597 INFO  L133        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2018-09-30 10:28:24,597 INFO  L133        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-09-30 10:28:24,597 INFO  L133        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2018-09-30 10:28:24,598 INFO  L133        SettingsManager]:  * sizeof long double=12
[2018-09-30 10:28:24,598 INFO  L133        SettingsManager]:  * Check if freed pointer was valid=false
[2018-09-30 10:28:24,598 INFO  L133        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2018-09-30 10:28:24,598 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-09-30 10:28:24,600 INFO  L133        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2018-09-30 10:28:24,600 INFO  L133        SettingsManager]:  * To the following directory=./dump/
[2018-09-30 10:28:24,600 INFO  L133        SettingsManager]:  * SMT solver=External_DefaultMode
[2018-09-30 10:28:24,600 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-09-30 10:28:24,601 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-09-30 10:28:24,601 INFO  L133        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2018-09-30 10:28:24,601 INFO  L133        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-09-30 10:28:24,601 INFO  L133        SettingsManager]:  * Trace refinement strategy=CAMEL
[2018-09-30 10:28:24,602 INFO  L133        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2018-09-30 10:28:24,602 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-09-30 10:28:24,602 INFO  L133        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-09-30 10:28:24,657 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2018-09-30 10:28:24,672 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-09-30 10:28:24,679 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2018-09-30 10:28:24,681 INFO  L271        PluginConnector]: Initializing Boogie PL CUP Parser...
[2018-09-30 10:28:24,681 INFO  L276        PluginConnector]: Boogie PL CUP Parser initialized
[2018-09-30 10:28:24,682 INFO  L418   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl
[2018-09-30 10:28:24,682 INFO  L111           BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl'
[2018-09-30 10:28:24,775 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-09-30 10:28:24,781 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2018-09-30 10:28:24,781 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2018-09-30 10:28:24,782 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2018-09-30 10:28:24,782 INFO  L276        PluginConnector]: Boogie Procedure Inliner initialized
[2018-09-30 10:28:24,801 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:24" (1/1) ...
[2018-09-30 10:28:24,823 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:24" (1/1) ...
[2018-09-30 10:28:24,841 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2018-09-30 10:28:24,842 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-09-30 10:28:24,843 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2018-09-30 10:28:24,843 INFO  L276        PluginConnector]: Boogie Preprocessor initialized
[2018-09-30 10:28:24,855 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:24" (1/1) ...
[2018-09-30 10:28:24,855 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:24" (1/1) ...
[2018-09-30 10:28:24,860 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:24" (1/1) ...
[2018-09-30 10:28:24,861 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:24" (1/1) ...
[2018-09-30 10:28:24,888 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:24" (1/1) ...
[2018-09-30 10:28:24,891 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:24" (1/1) ...
[2018-09-30 10:28:24,900 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:24" (1/1) ...
[2018-09-30 10:28:24,903 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-09-30 10:28:24,904 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-09-30 10:28:24,904 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2018-09-30 10:28:24,906 INFO  L276        PluginConnector]: RCFGBuilder initialized
[2018-09-30 10:28:24,910 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:24" (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-09-30 10:28:24,998 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-09-30 10:28:24,998 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-09-30 10:28:25,674 INFO  L348             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-09-30 10:28:25,675 INFO  L202        PluginConnector]: Adding new model pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:28:25 BoogieIcfgContainer
[2018-09-30 10:28:25,675 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-09-30 10:28:25,676 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-09-30 10:28:25,676 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2018-09-30 10:28:25,679 INFO  L276        PluginConnector]: TraceAbstraction initialized
[2018-09-30 10:28:25,680 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:24" (1/2) ...
[2018-09-30 10:28:25,681 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625a2c2d and model type pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:28:25, skipping insertion in model container
[2018-09-30 10:28:25,681 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:28:25" (2/2) ...
[2018-09-30 10:28:25,683 INFO  L112   eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl
[2018-09-30 10:28:25,693 INFO  L137   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-09-30 10:28:25,701 INFO  L149   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2018-09-30 10:28:25,749 INFO  L133   ementStrategyFactory]: Using default assertion order modulation
[2018-09-30 10:28:25,750 INFO  L381      AbstractCegarLoop]: Interprodecural is true
[2018-09-30 10:28:25,750 INFO  L382      AbstractCegarLoop]: Hoare is true
[2018-09-30 10:28:25,750 INFO  L383      AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-09-30 10:28:25,751 INFO  L384      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2018-09-30 10:28:25,751 INFO  L385      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-09-30 10:28:25,751 INFO  L386      AbstractCegarLoop]: Difference is false
[2018-09-30 10:28:25,751 INFO  L387      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-09-30 10:28:25,751 INFO  L392      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-09-30 10:28:25,768 INFO  L276                IsEmpty]: Start isEmpty. Operand 20 states.
[2018-09-30 10:28:25,775 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2018-09-30 10:28:25,775 INFO  L367         BasicCegarLoop]: Found error trace
[2018-09-30 10:28:25,776 INFO  L375         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-09-30 10:28:25,777 INFO  L423      AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:28:25,783 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:28:25,784 INFO  L82        PathProgramCache]: Analyzing trace with hash -61215035, now seen corresponding path program 1 times
[2018-09-30 10:28:25,786 INFO  L227   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:28:25,787 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:28:25,846 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:28:25,846 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:28:25,846 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:28:25,927 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:28:26,065 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:28:26,068 INFO  L313   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-09-30 10:28:26,068 INFO  L328   seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-09-30 10:28:26,073 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-09-30 10:28:26,086 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-09-30 10:28:26,087 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-09-30 10:28:26,090 INFO  L87              Difference]: Start difference. First operand 20 states. Second operand 3 states.
[2018-09-30 10:28:26,157 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:28:26,157 INFO  L93              Difference]: Finished difference Result 54 states and 77 transitions.
[2018-09-30 10:28:26,158 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-09-30 10:28:26,159 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 17
[2018-09-30 10:28:26,160 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:28:26,171 INFO  L225             Difference]: With dead ends: 54
[2018-09-30 10:28:26,171 INFO  L226             Difference]: Without dead ends: 35
[2018-09-30 10:28:26,175 INFO  L605         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-09-30 10:28:26,194 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 35 states.
[2018-09-30 10:28:26,218 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33.
[2018-09-30 10:28:26,219 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 33 states.
[2018-09-30 10:28:26,220 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions.
[2018-09-30 10:28:26,222 INFO  L78                 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 17
[2018-09-30 10:28:26,222 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:28:26,222 INFO  L480      AbstractCegarLoop]: Abstraction has 33 states and 47 transitions.
[2018-09-30 10:28:26,222 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-09-30 10:28:26,223 INFO  L276                IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions.
[2018-09-30 10:28:26,223 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2018-09-30 10:28:26,223 INFO  L367         BasicCegarLoop]: Found error trace
[2018-09-30 10:28:26,223 INFO  L375         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-09-30 10:28:26,224 INFO  L423      AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:28:26,224 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:28:26,224 INFO  L82        PathProgramCache]: Analyzing trace with hash -1341078713, now seen corresponding path program 1 times
[2018-09-30 10:28:26,224 INFO  L227   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:28:26,224 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:28:26,227 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:28:26,227 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:28:26,228 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:28:26,267 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:28:26,345 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:28:26,345 INFO  L313   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-09-30 10:28:26,345 INFO  L328   seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-09-30 10:28:26,347 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-09-30 10:28:26,347 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-09-30 10:28:26,348 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-09-30 10:28:26,348 INFO  L87              Difference]: Start difference. First operand 33 states and 47 transitions. Second operand 3 states.
[2018-09-30 10:28:26,390 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:28:26,390 INFO  L93              Difference]: Finished difference Result 97 states and 139 transitions.
[2018-09-30 10:28:26,392 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-09-30 10:28:26,392 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 17
[2018-09-30 10:28:26,392 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:28:26,395 INFO  L225             Difference]: With dead ends: 97
[2018-09-30 10:28:26,395 INFO  L226             Difference]: Without dead ends: 65
[2018-09-30 10:28:26,396 INFO  L605         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-09-30 10:28:26,397 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 65 states.
[2018-09-30 10:28:26,420 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63.
[2018-09-30 10:28:26,420 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 63 states.
[2018-09-30 10:28:26,422 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions.
[2018-09-30 10:28:26,424 INFO  L78                 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 17
[2018-09-30 10:28:26,424 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:28:26,425 INFO  L480      AbstractCegarLoop]: Abstraction has 63 states and 90 transitions.
[2018-09-30 10:28:26,428 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-09-30 10:28:26,428 INFO  L276                IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions.
[2018-09-30 10:28:26,429 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2018-09-30 10:28:26,429 INFO  L367         BasicCegarLoop]: Found error trace
[2018-09-30 10:28:26,429 INFO  L375         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-09-30 10:28:26,429 INFO  L423      AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:28:26,431 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:28:26,431 INFO  L82        PathProgramCache]: Analyzing trace with hash -754272699, now seen corresponding path program 1 times
[2018-09-30 10:28:26,431 INFO  L227   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:28:26,431 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:28:26,434 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:28:26,434 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:28:26,435 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:28:26,491 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:28:26,570 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:28:26,570 INFO  L313   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-09-30 10:28:26,571 INFO  L328   seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-09-30 10:28:26,571 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-09-30 10:28:26,571 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-09-30 10:28:26,572 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-09-30 10:28:26,572 INFO  L87              Difference]: Start difference. First operand 63 states and 90 transitions. Second operand 3 states.
[2018-09-30 10:28:26,643 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:28:26,644 INFO  L93              Difference]: Finished difference Result 187 states and 268 transitions.
[2018-09-30 10:28:26,645 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-09-30 10:28:26,645 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 17
[2018-09-30 10:28:26,646 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:28:26,650 INFO  L225             Difference]: With dead ends: 187
[2018-09-30 10:28:26,650 INFO  L226             Difference]: Without dead ends: 125
[2018-09-30 10:28:26,651 INFO  L605         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-09-30 10:28:26,652 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 125 states.
[2018-09-30 10:28:26,678 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123.
[2018-09-30 10:28:26,678 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 123 states.
[2018-09-30 10:28:26,681 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 174 transitions.
[2018-09-30 10:28:26,681 INFO  L78                 Accepts]: Start accepts. Automaton has 123 states and 174 transitions. Word has length 17
[2018-09-30 10:28:26,682 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:28:26,682 INFO  L480      AbstractCegarLoop]: Abstraction has 123 states and 174 transitions.
[2018-09-30 10:28:26,682 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-09-30 10:28:26,682 INFO  L276                IsEmpty]: Start isEmpty. Operand 123 states and 174 transitions.
[2018-09-30 10:28:26,683 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2018-09-30 10:28:26,683 INFO  L367         BasicCegarLoop]: Found error trace
[2018-09-30 10:28:26,683 INFO  L375         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-09-30 10:28:26,684 INFO  L423      AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:28:26,684 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:28:26,684 INFO  L82        PathProgramCache]: Analyzing trace with hash -53208121, now seen corresponding path program 1 times
[2018-09-30 10:28:26,684 INFO  L227   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:28:26,685 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:28:26,688 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:28:26,688 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:28:26,689 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:28:26,714 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:28:26,792 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:28:26,792 INFO  L313   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-09-30 10:28:26,792 INFO  L328   seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-09-30 10:28:26,793 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-09-30 10:28:26,793 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-09-30 10:28:26,793 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-09-30 10:28:26,794 INFO  L87              Difference]: Start difference. First operand 123 states and 174 transitions. Second operand 3 states.
[2018-09-30 10:28:26,854 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:28:26,854 INFO  L93              Difference]: Finished difference Result 367 states and 520 transitions.
[2018-09-30 10:28:26,855 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-09-30 10:28:26,855 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 17
[2018-09-30 10:28:26,855 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:28:26,858 INFO  L225             Difference]: With dead ends: 367
[2018-09-30 10:28:26,858 INFO  L226             Difference]: Without dead ends: 245
[2018-09-30 10:28:26,859 INFO  L605         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-09-30 10:28:26,860 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 245 states.
[2018-09-30 10:28:26,918 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243.
[2018-09-30 10:28:26,919 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 243 states.
[2018-09-30 10:28:26,926 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 338 transitions.
[2018-09-30 10:28:26,927 INFO  L78                 Accepts]: Start accepts. Automaton has 243 states and 338 transitions. Word has length 17
[2018-09-30 10:28:26,927 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:28:26,927 INFO  L480      AbstractCegarLoop]: Abstraction has 243 states and 338 transitions.
[2018-09-30 10:28:26,927 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-09-30 10:28:26,927 INFO  L276                IsEmpty]: Start isEmpty. Operand 243 states and 338 transitions.
[2018-09-30 10:28:26,928 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2018-09-30 10:28:26,928 INFO  L367         BasicCegarLoop]: Found error trace
[2018-09-30 10:28:26,931 INFO  L375         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-09-30 10:28:26,931 INFO  L423      AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:28:26,931 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:28:26,931 INFO  L82        PathProgramCache]: Analyzing trace with hash 1721799241, now seen corresponding path program 1 times
[2018-09-30 10:28:26,932 INFO  L227   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:28:26,932 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:28:26,934 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:28:26,934 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:28:26,934 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:28:26,955 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:28:27,071 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:28:27,071 INFO  L313   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-09-30 10:28:27,072 INFO  L328   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-09-30 10:28:27,072 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-09-30 10:28:27,072 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-09-30 10:28:27,072 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-09-30 10:28:27,073 INFO  L87              Difference]: Start difference. First operand 243 states and 338 transitions. Second operand 4 states.
[2018-09-30 10:28:27,331 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:28:27,331 INFO  L93              Difference]: Finished difference Result 517 states and 707 transitions.
[2018-09-30 10:28:27,332 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2018-09-30 10:28:27,332 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 17
[2018-09-30 10:28:27,333 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:28:27,336 INFO  L225             Difference]: With dead ends: 517
[2018-09-30 10:28:27,336 INFO  L226             Difference]: Without dead ends: 515
[2018-09-30 10:28:27,337 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-09-30 10:28:27,338 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 515 states.
[2018-09-30 10:28:27,410 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 275.
[2018-09-30 10:28:27,410 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 275 states.
[2018-09-30 10:28:27,413 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 370 transitions.
[2018-09-30 10:28:27,413 INFO  L78                 Accepts]: Start accepts. Automaton has 275 states and 370 transitions. Word has length 17
[2018-09-30 10:28:27,416 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:28:27,416 INFO  L480      AbstractCegarLoop]: Abstraction has 275 states and 370 transitions.
[2018-09-30 10:28:27,416 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-09-30 10:28:27,417 INFO  L276                IsEmpty]: Start isEmpty. Operand 275 states and 370 transitions.
[2018-09-30 10:28:27,417 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2018-09-30 10:28:27,417 INFO  L367         BasicCegarLoop]: Found error trace
[2018-09-30 10:28:27,418 INFO  L375         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-09-30 10:28:27,418 INFO  L423      AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:28:27,418 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:28:27,418 INFO  L82        PathProgramCache]: Analyzing trace with hash 1721858823, now seen corresponding path program 1 times
[2018-09-30 10:28:27,418 INFO  L227   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:28:27,419 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:28:27,421 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:28:27,421 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:28:27,421 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:28:27,447 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:28:27,656 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-09-30 10:28:27,656 INFO  L313   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-09-30 10:28:27,656 INFO  L328   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-09-30 10:28:27,657 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-09-30 10:28:27,657 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-09-30 10:28:27,657 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2018-09-30 10:28:27,658 INFO  L87              Difference]: Start difference. First operand 275 states and 370 transitions. Second operand 4 states.
[2018-09-30 10:28:27,968 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:28:27,968 INFO  L93              Difference]: Finished difference Result 879 states and 1193 transitions.
[2018-09-30 10:28:27,970 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2018-09-30 10:28:27,970 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 17
[2018-09-30 10:28:27,970 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:28:27,976 INFO  L225             Difference]: With dead ends: 879
[2018-09-30 10:28:27,976 INFO  L226             Difference]: Without dead ends: 605
[2018-09-30 10:28:27,978 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2018-09-30 10:28:27,981 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 605 states.
[2018-09-30 10:28:28,086 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605.
[2018-09-30 10:28:28,086 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 605 states.
[2018-09-30 10:28:28,089 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 776 transitions.
[2018-09-30 10:28:28,089 INFO  L78                 Accepts]: Start accepts. Automaton has 605 states and 776 transitions. Word has length 17
[2018-09-30 10:28:28,090 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:28:28,090 INFO  L480      AbstractCegarLoop]: Abstraction has 605 states and 776 transitions.
[2018-09-30 10:28:28,090 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-09-30 10:28:28,090 INFO  L276                IsEmpty]: Start isEmpty. Operand 605 states and 776 transitions.
[2018-09-30 10:28:28,103 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 63
[2018-09-30 10:28:28,104 INFO  L367         BasicCegarLoop]: Found error trace
[2018-09-30 10:28:28,104 INFO  L375         BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1]
[2018-09-30 10:28:28,105 INFO  L423      AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:28:28,106 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:28:28,106 INFO  L82        PathProgramCache]: Analyzing trace with hash 868944887, now seen corresponding path program 1 times
[2018-09-30 10:28:28,106 INFO  L227   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:28:28,106 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:28:28,108 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:28:28,109 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:28:28,109 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:28:28,145 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:28:28,247 INFO  L134       CoverageAnalysis]: Checked inductivity of 90 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked.
[2018-09-30 10:28:28,248 INFO  L313   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-09-30 10:28:28,248 INFO  L328   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-09-30 10:28:28,249 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-09-30 10:28:28,249 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-09-30 10:28:28,249 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-09-30 10:28:28,250 INFO  L87              Difference]: Start difference. First operand 605 states and 776 transitions. Second operand 3 states.
[2018-09-30 10:28:28,524 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:28:28,524 INFO  L93              Difference]: Finished difference Result 1809 states and 2322 transitions.
[2018-09-30 10:28:28,525 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-09-30 10:28:28,525 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 62
[2018-09-30 10:28:28,525 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:28:28,532 INFO  L225             Difference]: With dead ends: 1809
[2018-09-30 10:28:28,532 INFO  L226             Difference]: Without dead ends: 1207
[2018-09-30 10:28:28,534 INFO  L605         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-09-30 10:28:28,535 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1207 states.
[2018-09-30 10:28:28,731 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1205.
[2018-09-30 10:28:28,732 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1205 states.
[2018-09-30 10:28:28,737 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1508 transitions.
[2018-09-30 10:28:28,738 INFO  L78                 Accepts]: Start accepts. Automaton has 1205 states and 1508 transitions. Word has length 62
[2018-09-30 10:28:28,738 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:28:28,738 INFO  L480      AbstractCegarLoop]: Abstraction has 1205 states and 1508 transitions.
[2018-09-30 10:28:28,738 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-09-30 10:28:28,738 INFO  L276                IsEmpty]: Start isEmpty. Operand 1205 states and 1508 transitions.
[2018-09-30 10:28:28,742 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 63
[2018-09-30 10:28:28,742 INFO  L367         BasicCegarLoop]: Found error trace
[2018-09-30 10:28:28,743 INFO  L375         BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1]
[2018-09-30 10:28:28,743 INFO  L423      AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:28:28,743 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:28:28,743 INFO  L82        PathProgramCache]: Analyzing trace with hash 2034253683, now seen corresponding path program 1 times
[2018-09-30 10:28:28,744 INFO  L227   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:28:28,744 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:28:28,745 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:28:28,745 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:28:28,745 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:28:28,773 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:28:29,111 WARN  L178               SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4
[2018-09-30 10:28:29,289 INFO  L134       CoverageAnalysis]: Checked inductivity of 90 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked.
[2018-09-30 10:28:29,290 INFO  L301   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-09-30 10:28:29,290 INFO  L227   ckRefinementStrategy]: Switched to mode Z3_FP
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-09-30 10:28:29,307 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:28:29,435 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:28:29,450 INFO  L273         TraceCheckSpWp]: Computing forward predicates...
[2018-09-30 10:28:29,895 WARN  L178               SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17
[2018-09-30 10:28:30,139 INFO  L134       CoverageAnalysis]: Checked inductivity of 90 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked.
[2018-09-30 10:28:30,173 INFO  L313   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-09-30 10:28:30,174 INFO  L328   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6
[2018-09-30 10:28:30,174 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-09-30 10:28:30,175 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-09-30 10:28:30,175 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2018-09-30 10:28:30,175 INFO  L87              Difference]: Start difference. First operand 1205 states and 1508 transitions. Second operand 7 states.
[2018-09-30 10:28:30,690 WARN  L178               SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 20
[2018-09-30 10:28:31,215 WARN  L178               SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 24
[2018-09-30 10:28:31,650 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:28:31,651 INFO  L93              Difference]: Finished difference Result 1889 states and 2370 transitions.
[2018-09-30 10:28:31,652 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2018-09-30 10:28:31,652 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 62
[2018-09-30 10:28:31,652 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:28:31,658 INFO  L225             Difference]: With dead ends: 1889
[2018-09-30 10:28:31,658 INFO  L226             Difference]: Without dead ends: 991
[2018-09-30 10:28:31,660 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90
[2018-09-30 10:28:31,661 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 991 states.
[2018-09-30 10:28:31,851 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 725.
[2018-09-30 10:28:31,851 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 725 states.
[2018-09-30 10:28:31,854 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 892 transitions.
[2018-09-30 10:28:31,854 INFO  L78                 Accepts]: Start accepts. Automaton has 725 states and 892 transitions. Word has length 62
[2018-09-30 10:28:31,855 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:28:31,855 INFO  L480      AbstractCegarLoop]: Abstraction has 725 states and 892 transitions.
[2018-09-30 10:28:31,855 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-09-30 10:28:31,855 INFO  L276                IsEmpty]: Start isEmpty. Operand 725 states and 892 transitions.
[2018-09-30 10:28:31,857 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2018-09-30 10:28:31,857 INFO  L367         BasicCegarLoop]: Found error trace
[2018-09-30 10:28:31,857 INFO  L375         BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1]
[2018-09-30 10:28:31,857 INFO  L423      AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2018-09-30 10:28:31,857 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-09-30 10:28:31,858 INFO  L82        PathProgramCache]: Analyzing trace with hash 1342683145, now seen corresponding path program 2 times
[2018-09-30 10:28:31,858 INFO  L227   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-09-30 10:28:31,858 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-09-30 10:28:31,860 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:28:31,860 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-09-30 10:28:31,860 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-09-30 10:28:31,885 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-09-30 10:28:32,031 INFO  L134       CoverageAnalysis]: Checked inductivity of 150 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2018-09-30 10:28:32,031 INFO  L313   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-09-30 10:28:32,031 INFO  L328   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-09-30 10:28:32,032 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-09-30 10:28:32,032 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-09-30 10:28:32,032 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-09-30 10:28:32,033 INFO  L87              Difference]: Start difference. First operand 725 states and 892 transitions. Second operand 3 states.
[2018-09-30 10:28:32,078 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-09-30 10:28:32,079 INFO  L93              Difference]: Finished difference Result 749 states and 917 transitions.
[2018-09-30 10:28:32,079 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-09-30 10:28:32,079 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 77
[2018-09-30 10:28:32,080 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-09-30 10:28:32,080 INFO  L225             Difference]: With dead ends: 749
[2018-09-30 10:28:32,080 INFO  L226             Difference]: Without dead ends: 0
[2018-09-30 10:28:32,082 INFO  L605         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-09-30 10:28:32,082 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2018-09-30 10:28:32,082 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2018-09-30 10:28:32,082 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2018-09-30 10:28:32,082 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2018-09-30 10:28:32,083 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77
[2018-09-30 10:28:32,083 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-09-30 10:28:32,083 INFO  L480      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2018-09-30 10:28:32,083 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-09-30 10:28:32,083 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2018-09-30 10:28:32,083 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2018-09-30 10:28:32,089 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2018-09-30 10:28:32,413 WARN  L178               SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 30
[2018-09-30 10:28:32,912 WARN  L178               SmtUtils]: Spent 497.00 ms on a formula simplification that was a NOOP. DAG size: 44
[2018-09-30 10:28:33,154 WARN  L178               SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 22
[2018-09-30 10:28:33,323 WARN  L178               SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 22
[2018-09-30 10:28:33,620 INFO  L422   ceAbstractionStarter]: At program point  L320(lines 313 321)  the Hoare annotation is:  (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127))
[2018-09-30 10:28:33,620 INFO  L422   ceAbstractionStarter]: At program point  L411(lines 407 418)  the Hoare annotation is:  (and (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (= .cse0 ~p5_old) (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127))
[2018-09-30 10:28:33,620 INFO  L422   ceAbstractionStarter]: At program point  L279(lines 279 291)  the Hoare annotation is:  (let ((.cse0 (<= 0 ~send5)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= ~r1 (* 256 (div ~r1 256)))) (.cse3 (<= ~send5 127))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 .cse3) (and .cse0 (<= 1 ~mode1) (<= ~mode1 1) (exists ((v_prenex_1 Int)) (let ((.cse4 (mod v_prenex_1 256))) (and (= .cse4 ~p5_old) (<= .cse4 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse1 .cse2 .cse3)))
[2018-09-30 10:28:33,620 INFO  L422   ceAbstractionStarter]: At program point  L432(lines 432 439)  the Hoare annotation is:  (and (<= ULTIMATE.start_assert_~arg 1) (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (= .cse0 ~p5_old) (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (<= 1 ULTIMATE.start_check_~tmp~107) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127))
[2018-09-30 10:28:33,621 INFO  L422   ceAbstractionStarter]: At program point  L325(lines 325 335)  the Hoare annotation is:  (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127))
[2018-09-30 10:28:33,621 INFO  L426   ceAbstractionStarter]: For program point  ULTIMATE.startENTRY(lines 81 444)  no Hoare annotation was computed.
[2018-09-30 10:28:33,621 INFO  L426   ceAbstractionStarter]: For program point  ULTIMATE.startFINAL(lines 81 444)  no Hoare annotation was computed.
[2018-09-30 10:28:33,621 INFO  L422   ceAbstractionStarter]: At program point  L441(lines 272 441)  the Hoare annotation is:  (let ((.cse0 (<= 0 ~send5)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= ~r1 (* 256 (div ~r1 256)))) (.cse3 (<= ~send5 127))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 (div ~mode2 256))) .cse1 .cse2 .cse3) (and .cse0 (<= 1 ~mode1) (<= ~mode1 1) (exists ((v_prenex_1 Int)) (let ((.cse4 (mod v_prenex_1 256))) (and (= .cse4 ~p5_old) (<= .cse4 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) .cse1 .cse2 .cse3)))
[2018-09-30 10:28:33,621 INFO  L422   ceAbstractionStarter]: At program point  L342(lines 334 343)  the Hoare annotation is:  (and (= ~mode5 (* 256 (div ~mode5 256))) (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127))
[2018-09-30 10:28:33,621 INFO  L426   ceAbstractionStarter]: For program point  ULTIMATE.startEXIT(lines 81 444)  no Hoare annotation was computed.
[2018-09-30 10:28:33,621 INFO  L422   ceAbstractionStarter]: At program point  L347(lines 347 357)  the Hoare annotation is:  (and (= ~mode5 (* 256 (div ~mode5 256))) (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127))
[2018-09-30 10:28:33,621 INFO  L422   ceAbstractionStarter]: At program point  L438(lines 438 442)  the Hoare annotation is:  false
[2018-09-30 10:28:33,622 INFO  L422   ceAbstractionStarter]: At program point  L364(lines 356 365)  the Hoare annotation is:  (and (= ~mode5 (* 256 (div ~mode5 256))) (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127))
[2018-09-30 10:28:33,622 INFO  L422   ceAbstractionStarter]: At program point  L298(lines 290 299)  the Hoare annotation is:  (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (= ~mode2 (* 256 (div ~mode2 256))) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127))
[2018-09-30 10:28:33,622 INFO  L422   ceAbstractionStarter]: At program point  L422(lines 417 423)  the Hoare annotation is:  (and (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (= .cse0 ~p5_old) (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (<= 1 ULTIMATE.start_check_~tmp~107) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127))
[2018-09-30 10:28:33,622 INFO  L426   ceAbstractionStarter]: For program point  ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 443)  no Hoare annotation was computed.
[2018-09-30 10:28:33,622 INFO  L422   ceAbstractionStarter]: At program point  L402(lines 402 408)  the Hoare annotation is:  (and (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (= .cse0 ~p5_old) (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127))
[2018-09-30 10:28:33,622 INFO  L422   ceAbstractionStarter]: At program point  L369(lines 369 379)  the Hoare annotation is:  (and (= ~mode5 (* 256 (div ~mode5 256))) (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127))
[2018-09-30 10:28:33,622 INFO  L422   ceAbstractionStarter]: At program point  L303(lines 303 314)  the Hoare annotation is:  (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (= ~mode2 (* 256 (div ~mode2 256))) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (<= ~send5 127))
[2018-09-30 10:28:33,623 INFO  L422   ceAbstractionStarter]: At program point  L386(lines 378 387)  the Hoare annotation is:  (and (<= 0 ~send5) (<= 1 ~mode1) (<= ~mode1 1) (= 0 (+ ~nomsg 1)) (<= ~r1 (* 256 (div ~r1 256))) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 256))) (and (= ~p5_new .cse0) (<= .cse0 127) (<= v_prenex_1 127) (<= 0 v_prenex_1)))) (<= ~send5 127))
[2018-09-30 10:28:33,633 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,635 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,635 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,635 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,637 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,638 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,638 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,638 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,640 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,640 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,640 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,640 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,642 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,642 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,642 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,642 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,646 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,647 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,647 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,647 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,648 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,648 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,649 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,649 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,650 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,651 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,651 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,651 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,653 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,654 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,654 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,654 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,656 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,656 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,656 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,657 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,658 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,658 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,659 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,659 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,660 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,661 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,661 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,661 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,662 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,662 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,663 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,663 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,664 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,664 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,665 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,665 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,666 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,666 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,667 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,667 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,669 INFO  L202        PluginConnector]: Adding new model pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:28:33 BoogieIcfgContainer
[2018-09-30 10:28:33,670 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-09-30 10:28:33,671 INFO  L168              Benchmark]: Toolchain (without parser) took 8895.12 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 38.8 MB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 141.0 MB). Peak memory consumption was 179.8 MB. Max. memory is 7.1 GB.
[2018-09-30 10:28:33,672 INFO  L168              Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-09-30 10:28:33,673 INFO  L168              Benchmark]: Boogie Procedure Inliner took 60.54 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-09-30 10:28:33,673 INFO  L168              Benchmark]: Boogie Preprocessor took 61.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-09-30 10:28:33,674 INFO  L168              Benchmark]: RCFGBuilder took 770.99 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-09-30 10:28:33,674 INFO  L168              Benchmark]: TraceAbstraction took 7994.06 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 38.8 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 109.3 MB). Peak memory consumption was 148.1 MB. Max. memory is 7.1 GB.
[2018-09-30 10:28:33,679 INFO  L336   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 60.54 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 61.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.
 * RCFGBuilder took 770.99 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 7994.06 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 38.8 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 109.3 MB). Peak memory consumption was 148.1 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor:
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - PositiveResult [Line: 443]: 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: 303]: Loop Invariant
    Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && 1 <= ~mode1) && ~mode1 <= 1) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127
  - InvariantResult [Line: 272]: Loop Invariant
[2018-09-30 10:28:33,692 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,692 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,693 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,693 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,694 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,694 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,695 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,695 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
    Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send5) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127) || ((((((0 <= ~send5 && 1 <= ~mode1) && ~mode1 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127)
  - InvariantResult [Line: 378]: Loop Invariant
[2018-09-30 10:28:33,696 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,696 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,696 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,696 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,697 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,697 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,697 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,697 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
    Derived loop invariant: (((((0 <= ~send5 && 1 <= ~mode1) && ~mode1 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && (exists v_prenex_1 : int :: ((~p5_new == v_prenex_1 % 256 && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && ~send5 <= 127
  - InvariantResult [Line: 356]: Loop Invariant
    Derived loop invariant: (((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send5) && 1 <= ~mode1) && ~mode1 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127
  - InvariantResult [Line: 334]: Loop Invariant
    Derived loop invariant: (((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send5) && 1 <= ~mode1) && ~mode1 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127
  - InvariantResult [Line: 438]: Loop Invariant
    Derived loop invariant: false
  - InvariantResult [Line: 313]: Loop Invariant
    Derived loop invariant: ((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && 1 <= ~mode1) && ~mode1 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127
  - InvariantResult [Line: 290]: Loop Invariant
    Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && 1 <= ~mode1) && ~mode1 <= 1) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127
  - InvariantResult [Line: 402]: Loop Invariant
[2018-09-30 10:28:33,702 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,702 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,704 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,705 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,705 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,706 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,706 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,706 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
    Derived loop invariant: (((((0 <= ~send5 && 1 <= ~mode1) && ~mode1 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127
  - InvariantResult [Line: 279]: Loop Invariant
[2018-09-30 10:28:33,707 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,708 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,708 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,708 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,709 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,714 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,714 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,714 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
    Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 <= ~send5) && ~mode2 == 256 * (~mode2 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127) || ((((((0 <= ~send5 && 1 <= ~mode1) && ~mode1 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127)
  - InvariantResult [Line: 369]: Loop Invariant
    Derived loop invariant: (((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send5) && 1 <= ~mode1) && ~mode1 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127
  - InvariantResult [Line: 417]: Loop Invariant
[2018-09-30 10:28:33,716 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,716 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,716 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,716 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,717 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,717 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,717 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,718 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
    Derived loop invariant: ((((((0 <= ~send5 && 1 <= ~mode1) && ~mode1 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 1 <= check_~tmp~107) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127
  - InvariantResult [Line: 347]: Loop Invariant
    Derived loop invariant: (((((~mode5 == 256 * (~mode5 / 256) && 0 <= ~send5) && 1 <= ~mode1) && ~mode1 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127
  - InvariantResult [Line: 407]: Loop Invariant
[2018-09-30 10:28:33,724 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,724 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,724 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,725 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,725 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,728 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,729 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,729 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
    Derived loop invariant: (((((0 <= ~send5 && 1 <= ~mode1) && ~mode1 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127
  - InvariantResult [Line: 432]: Loop Invariant
[2018-09-30 10:28:33,730 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,730 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,730 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,730 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,731 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,731 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,734 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
[2018-09-30 10:28:33,735 WARN  L389   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED]
    Derived loop invariant: ((((((((assert_~arg <= 1 && 0 <= ~send5) && 1 <= ~mode1) && ~mode1 <= 1) && (exists v_prenex_1 : int :: ((v_prenex_1 % 256 == ~p5_old && v_prenex_1 % 256 <= 127) && v_prenex_1 <= 127) && 0 <= v_prenex_1)) && 1 <= check_~tmp~107) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127
  - InvariantResult [Line: 325]: Loop Invariant
    Derived loop invariant: ((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && 0 <= ~send5) && 1 <= ~mode1) && ~mode1 <= 1) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~send5 <= 127
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 20 locations, 1 error locations. SAFE Result, 7.8s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 293 SDtfs, 196 SDslu, 218 SDs, 0 SdLazy, 126 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1205occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 516 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 42 NumberOfFragments, 708 HoareAnnotationTreeSize, 16 FomulaSimplifications, 879 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 365 NumberOfCodeBlocks, 365 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 355 ConstructedInterpolants, 7 QuantifiedInterpolants, 58847 SizeOfPredicates, 4 NumberOfNonLiveVariables, 491 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 416/420 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be correct!
Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-28-33-744.csv
Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.5.ufo.UNBOUNDED.pals.c_19.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_10-28-33-744.csv
Received shutdown request...