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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label21_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 07:08:05,577 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 07:08:05,579 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 07:08:05,595 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 07:08:05,596 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 07:08:05,597 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 07:08:05,600 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 07:08:05,604 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 07:08:05,606 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 07:08:05,609 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 07:08:05,610 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 07:08:05,610 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 07:08:05,612 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 07:08:05,614 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 07:08:05,623 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 07:08:05,624 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 07:08:05,624 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 07:08:05,627 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 07:08:05,630 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 07:08:05,634 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 07:08:05,635 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 07:08:05,637 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 07:08:05,640 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 07:08:05,640 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 07:08:05,641 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 07:08:05,643 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 07:08:05,644 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 07:08:05,645 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 07:08:05,646 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 07:08:05,648 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 07:08:05,649 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 07:08:05,650 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 07:08:05,650 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 07:08:05,650 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 07:08:05,651 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 07:08:05,654 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 07:08:05,654 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 07:08:05,681 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 07:08:05,682 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 07:08:05,682 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 07:08:05,686 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 07:08:05,686 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 07:08:05,686 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 07:08:05,686 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 07:08:05,687 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 07:08:05,687 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 07:08:05,687 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 07:08:05,687 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 07:08:05,687 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 07:08:05,687 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 07:08:05,688 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 07:08:05,689 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 07:08:05,689 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 07:08:05,689 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 07:08:05,690 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 07:08:05,692 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 07:08:05,692 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 07:08:05,692 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 07:08:05,692 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 07:08:05,693 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 07:08:05,693 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 07:08:05,693 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 07:08:05,694 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 07:08:05,694 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 07:08:05,694 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 07:08:05,694 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 07:08:05,694 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 07:08:05,695 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 07:08:05,695 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 07:08:05,695 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 07:08:05,695 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 07:08:05,695 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 07:08:05,696 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 07:08:05,749 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 07:08:05,762 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 07:08:05,766 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 07:08:05,768 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 07:08:05,768 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 07:08:05,769 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label21_true-unreach-call_false-termination.c [2018-11-07 07:08:05,829 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfcd2807d/77de485de0914840ab606af9c22ba3c0/FLAG69a020f00 [2018-11-07 07:08:06,440 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 07:08:06,441 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label21_true-unreach-call_false-termination.c [2018-11-07 07:08:06,454 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfcd2807d/77de485de0914840ab606af9c22ba3c0/FLAG69a020f00 [2018-11-07 07:08:06,487 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfcd2807d/77de485de0914840ab606af9c22ba3c0 [2018-11-07 07:08:06,498 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 07:08:06,500 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 07:08:06,501 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 07:08:06,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 07:08:06,507 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 07:08:06,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:08:06" (1/1) ... [2018-11-07 07:08:06,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bce9b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:08:06, skipping insertion in model container [2018-11-07 07:08:06,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:08:06" (1/1) ... [2018-11-07 07:08:06,524 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 07:08:06,579 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 07:08:07,058 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 07:08:07,066 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 07:08:07,188 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 07:08:07,205 INFO L193 MainTranslator]: Completed translation [2018-11-07 07:08:07,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:08:07 WrapperNode [2018-11-07 07:08:07,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 07:08:07,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 07:08:07,207 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 07:08:07,207 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 07:08:07,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:08:07" (1/1) ... [2018-11-07 07:08:07,236 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:08:07" (1/1) ... [2018-11-07 07:08:07,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 07:08:07,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 07:08:07,329 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 07:08:07,329 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 07:08:07,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:08:07" (1/1) ... [2018-11-07 07:08:07,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:08:07" (1/1) ... [2018-11-07 07:08:07,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:08:07" (1/1) ... [2018-11-07 07:08:07,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:08:07" (1/1) ... [2018-11-07 07:08:07,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:08:07" (1/1) ... [2018-11-07 07:08:07,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:08:07" (1/1) ... [2018-11-07 07:08:07,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:08:07" (1/1) ... [2018-11-07 07:08:07,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 07:08:07,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 07:08:07,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 07:08:07,436 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 07:08:07,437 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:08:07" (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-11-07 07:08:07,505 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 07:08:07,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 07:08:07,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 07:08:07,506 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 07:08:07,506 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 07:08:07,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 07:08:07,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 07:08:07,507 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 07:08:07,507 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 07:08:10,699 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 07:08:10,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:08:10 BoogieIcfgContainer [2018-11-07 07:08:10,700 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 07:08:10,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 07:08:10,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 07:08:10,705 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 07:08:10,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:08:06" (1/3) ... [2018-11-07 07:08:10,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8ea896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:08:10, skipping insertion in model container [2018-11-07 07:08:10,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:08:07" (2/3) ... [2018-11-07 07:08:10,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8ea896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:08:10, skipping insertion in model container [2018-11-07 07:08:10,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:08:10" (3/3) ... [2018-11-07 07:08:10,709 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label21_true-unreach-call_false-termination.c [2018-11-07 07:08:10,721 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 07:08:10,733 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 07:08:10,752 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 07:08:10,796 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 07:08:10,796 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 07:08:10,796 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 07:08:10,797 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 07:08:10,797 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 07:08:10,797 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 07:08:10,798 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 07:08:10,798 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 07:08:10,843 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-07 07:08:10,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-07 07:08:10,864 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:08:10,867 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:08:10,870 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:08:10,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:08:10,879 INFO L82 PathProgramCache]: Analyzing trace with hash 64907071, now seen corresponding path program 1 times [2018-11-07 07:08:10,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:08:10,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:08:10,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:08:10,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:08:10,939 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:08:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:08:11,571 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 07:08:11,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:08:11,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:08:11,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 07:08:11,732 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:08:11,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:08:11,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:08:11,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:08:11,758 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-07 07:08:13,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:08:13,580 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2018-11-07 07:08:13,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:08:13,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2018-11-07 07:08:13,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:08:13,602 INFO L225 Difference]: With dead ends: 618 [2018-11-07 07:08:13,603 INFO L226 Difference]: Without dead ends: 379 [2018-11-07 07:08:13,610 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:08:13,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-11-07 07:08:13,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-11-07 07:08:13,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-11-07 07:08:13,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 621 transitions. [2018-11-07 07:08:13,697 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 621 transitions. Word has length 103 [2018-11-07 07:08:13,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:08:13,698 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 621 transitions. [2018-11-07 07:08:13,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:08:13,699 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 621 transitions. [2018-11-07 07:08:13,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 07:08:13,708 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:08:13,709 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:08:13,709 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:08:13,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:08:13,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1456017738, now seen corresponding path program 1 times [2018-11-07 07:08:13,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:08:13,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:08:13,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:08:13,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:08:13,714 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:08:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:08:14,005 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 07:08:14,082 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:08:14,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:08:14,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 07:08:14,083 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:08:14,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 07:08:14,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 07:08:14,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 07:08:14,086 INFO L87 Difference]: Start difference. First operand 379 states and 621 transitions. Second operand 6 states. [2018-11-07 07:08:15,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:08:15,161 INFO L93 Difference]: Finished difference Result 750 states and 1238 transitions. [2018-11-07 07:08:15,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 07:08:15,162 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-11-07 07:08:15,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:08:15,166 INFO L225 Difference]: With dead ends: 750 [2018-11-07 07:08:15,167 INFO L226 Difference]: Without dead ends: 377 [2018-11-07 07:08:15,171 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 07:08:15,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-11-07 07:08:15,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 372. [2018-11-07 07:08:15,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-11-07 07:08:15,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 580 transitions. [2018-11-07 07:08:15,219 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 580 transitions. Word has length 119 [2018-11-07 07:08:15,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:08:15,220 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 580 transitions. [2018-11-07 07:08:15,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 07:08:15,220 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 580 transitions. [2018-11-07 07:08:15,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-07 07:08:15,224 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:08:15,225 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:08:15,225 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:08:15,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:08:15,225 INFO L82 PathProgramCache]: Analyzing trace with hash 641817781, now seen corresponding path program 1 times [2018-11-07 07:08:15,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:08:15,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:08:15,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:08:15,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:08:15,228 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:08:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:08:15,516 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 07:08:15,590 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:08:15,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:08:15,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 07:08:15,591 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:08:15,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 07:08:15,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 07:08:15,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 07:08:15,594 INFO L87 Difference]: Start difference. First operand 372 states and 580 transitions. Second operand 6 states. [2018-11-07 07:08:17,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:08:17,346 INFO L93 Difference]: Finished difference Result 952 states and 1493 transitions. [2018-11-07 07:08:17,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 07:08:17,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2018-11-07 07:08:17,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:08:17,355 INFO L225 Difference]: With dead ends: 952 [2018-11-07 07:08:17,355 INFO L226 Difference]: Without dead ends: 586 [2018-11-07 07:08:17,358 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:08:17,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2018-11-07 07:08:17,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 563. [2018-11-07 07:08:17,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-11-07 07:08:17,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 823 transitions. [2018-11-07 07:08:17,391 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 823 transitions. Word has length 126 [2018-11-07 07:08:17,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:08:17,392 INFO L480 AbstractCegarLoop]: Abstraction has 563 states and 823 transitions. [2018-11-07 07:08:17,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 07:08:17,392 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 823 transitions. [2018-11-07 07:08:17,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-07 07:08:17,395 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:08:17,396 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:08:17,396 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:08:17,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:08:17,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1176628157, now seen corresponding path program 1 times [2018-11-07 07:08:17,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:08:17,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:08:17,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:08:17,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:08:17,399 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:08:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:08:17,853 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-07 07:08:18,035 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:08:18,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:08:18,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 07:08:18,035 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:08:18,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 07:08:18,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 07:08:18,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:08:18,037 INFO L87 Difference]: Start difference. First operand 563 states and 823 transitions. Second operand 5 states. [2018-11-07 07:08:20,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:08:20,628 INFO L93 Difference]: Finished difference Result 1269 states and 1897 transitions. [2018-11-07 07:08:20,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 07:08:20,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2018-11-07 07:08:20,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:08:20,637 INFO L225 Difference]: With dead ends: 1269 [2018-11-07 07:08:20,637 INFO L226 Difference]: Without dead ends: 562 [2018-11-07 07:08:20,640 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:08:20,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2018-11-07 07:08:20,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2018-11-07 07:08:20,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2018-11-07 07:08:20,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 811 transitions. [2018-11-07 07:08:20,666 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 811 transitions. Word has length 130 [2018-11-07 07:08:20,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:08:20,667 INFO L480 AbstractCegarLoop]: Abstraction has 562 states and 811 transitions. [2018-11-07 07:08:20,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 07:08:20,667 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 811 transitions. [2018-11-07 07:08:20,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-07 07:08:20,670 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:08:20,670 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:08:20,671 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:08:20,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:08:20,671 INFO L82 PathProgramCache]: Analyzing trace with hash 956906181, now seen corresponding path program 1 times [2018-11-07 07:08:20,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:08:20,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:08:20,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:08:20,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:08:20,673 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:08:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:08:20,946 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 07:08:21,311 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:08:21,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:08:21,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 07:08:21,312 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:08:21,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 07:08:21,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 07:08:21,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 07:08:21,313 INFO L87 Difference]: Start difference. First operand 562 states and 811 transitions. Second operand 6 states. [2018-11-07 07:08:23,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:08:23,495 INFO L93 Difference]: Finished difference Result 1544 states and 2298 transitions. [2018-11-07 07:08:23,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 07:08:23,502 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2018-11-07 07:08:23,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:08:23,509 INFO L225 Difference]: With dead ends: 1544 [2018-11-07 07:08:23,509 INFO L226 Difference]: Without dead ends: 988 [2018-11-07 07:08:23,512 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:08:23,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-11-07 07:08:23,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 962. [2018-11-07 07:08:23,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2018-11-07 07:08:23,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1349 transitions. [2018-11-07 07:08:23,544 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1349 transitions. Word has length 134 [2018-11-07 07:08:23,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:08:23,545 INFO L480 AbstractCegarLoop]: Abstraction has 962 states and 1349 transitions. [2018-11-07 07:08:23,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 07:08:23,545 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1349 transitions. [2018-11-07 07:08:23,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-07 07:08:23,549 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:08:23,549 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:08:23,549 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:08:23,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:08:23,550 INFO L82 PathProgramCache]: Analyzing trace with hash -973773874, now seen corresponding path program 1 times [2018-11-07 07:08:23,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:08:23,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:08:23,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:08:23,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:08:23,551 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:08:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:08:23,785 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:08:23,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:08:23,786 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:08:23,786 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2018-11-07 07:08:23,789 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [495], [497], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 07:08:23,836 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:08:23,836 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:08:24,836 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:08:24,837 INFO L272 AbstractInterpreter]: Visited 108 different actions 318 times. Merged at 7 different actions 18 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 07:08:24,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:08:24,871 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:08:24,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:08:24,872 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 07:08:24,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:08:24,888 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:08:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:08:24,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:08:25,226 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 07:08:25,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:08:25,600 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 07:08:25,632 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:08:25,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 10 [2018-11-07 07:08:25,635 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:08:25,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:08:25,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:08:25,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:08:25,636 INFO L87 Difference]: Start difference. First operand 962 states and 1349 transitions. Second operand 3 states. [2018-11-07 07:08:27,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:08:27,161 INFO L93 Difference]: Finished difference Result 2213 states and 3145 transitions. [2018-11-07 07:08:27,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:08:27,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2018-11-07 07:08:27,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:08:27,178 INFO L225 Difference]: With dead ends: 2213 [2018-11-07 07:08:27,178 INFO L226 Difference]: Without dead ends: 1257 [2018-11-07 07:08:27,183 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 282 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:08:27,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2018-11-07 07:08:27,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1255. [2018-11-07 07:08:27,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1255 states. [2018-11-07 07:08:27,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1670 transitions. [2018-11-07 07:08:27,225 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1670 transitions. Word has length 140 [2018-11-07 07:08:27,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:08:27,225 INFO L480 AbstractCegarLoop]: Abstraction has 1255 states and 1670 transitions. [2018-11-07 07:08:27,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:08:27,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1670 transitions. [2018-11-07 07:08:27,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-07 07:08:27,230 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:08:27,231 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:08:27,231 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:08:27,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:08:27,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1528509422, now seen corresponding path program 1 times [2018-11-07 07:08:27,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:08:27,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:08:27,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:08:27,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:08:27,233 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:08:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:08:27,467 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 41 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:08:27,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:08:27,467 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:08:27,467 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 144 with the following transitions: [2018-11-07 07:08:27,468 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [495], [497], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 07:08:27,473 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:08:27,474 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:08:27,637 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:08:27,637 INFO L272 AbstractInterpreter]: Visited 104 different actions 104 times. Never merged. Never widened. Never found a fixpoint. Largest state had 38 variables. [2018-11-07 07:08:27,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:08:27,671 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:08:28,055 INFO L227 lantSequenceWeakener]: Weakened 134 states. On average, predicates are now at 80.69% of their original sizes. [2018-11-07 07:08:28,055 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:08:28,297 INFO L415 sIntCurrentIteration]: We unified 142 AI predicates to 142 [2018-11-07 07:08:28,297 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:08:28,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:08:28,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-11-07 07:08:28,298 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:08:28,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 07:08:28,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 07:08:28,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 07:08:28,302 INFO L87 Difference]: Start difference. First operand 1255 states and 1670 transitions. Second operand 6 states. [2018-11-07 07:08:35,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:08:35,951 INFO L93 Difference]: Finished difference Result 2651 states and 3541 transitions. [2018-11-07 07:08:35,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 07:08:35,951 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2018-11-07 07:08:35,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:08:35,960 INFO L225 Difference]: With dead ends: 2651 [2018-11-07 07:08:35,961 INFO L226 Difference]: Without dead ends: 1402 [2018-11-07 07:08:35,966 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 143 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 07:08:35,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2018-11-07 07:08:36,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1400. [2018-11-07 07:08:36,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1400 states. [2018-11-07 07:08:36,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1824 transitions. [2018-11-07 07:08:36,008 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1824 transitions. Word has length 143 [2018-11-07 07:08:36,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:08:36,008 INFO L480 AbstractCegarLoop]: Abstraction has 1400 states and 1824 transitions. [2018-11-07 07:08:36,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 07:08:36,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1824 transitions. [2018-11-07 07:08:36,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-07 07:08:36,013 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:08:36,013 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:08:36,014 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:08:36,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:08:36,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1955101065, now seen corresponding path program 1 times [2018-11-07 07:08:36,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:08:36,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:08:36,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:08:36,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:08:36,016 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:08:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:08:36,487 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:08:36,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:08:36,488 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:08:36,488 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 170 with the following transitions: [2018-11-07 07:08:36,488 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [495], [497], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 07:08:36,495 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:08:36,495 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:08:36,706 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:08:36,706 INFO L272 AbstractInterpreter]: Visited 107 different actions 208 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-07 07:08:36,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:08:36,737 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:08:36,998 INFO L227 lantSequenceWeakener]: Weakened 166 states. On average, predicates are now at 82.3% of their original sizes. [2018-11-07 07:08:36,998 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:08:37,347 INFO L415 sIntCurrentIteration]: We unified 168 AI predicates to 168 [2018-11-07 07:08:37,347 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:08:37,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:08:37,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-07 07:08:37,348 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:08:37,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 07:08:37,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 07:08:37,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:08:37,349 INFO L87 Difference]: Start difference. First operand 1400 states and 1824 transitions. Second operand 10 states. [2018-11-07 07:08:45,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:08:45,588 INFO L93 Difference]: Finished difference Result 3397 states and 4528 transitions. [2018-11-07 07:08:45,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 07:08:45,588 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 169 [2018-11-07 07:08:45,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:08:45,597 INFO L225 Difference]: With dead ends: 3397 [2018-11-07 07:08:45,597 INFO L226 Difference]: Without dead ends: 2001 [2018-11-07 07:08:45,603 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 177 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-11-07 07:08:45,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2018-11-07 07:08:45,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 1995. [2018-11-07 07:08:45,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1995 states. [2018-11-07 07:08:45,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 2484 transitions. [2018-11-07 07:08:45,652 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 2484 transitions. Word has length 169 [2018-11-07 07:08:45,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:08:45,652 INFO L480 AbstractCegarLoop]: Abstraction has 1995 states and 2484 transitions. [2018-11-07 07:08:45,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 07:08:45,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2484 transitions. [2018-11-07 07:08:45,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-07 07:08:45,659 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:08:45,659 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:08:45,660 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:08:45,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:08:45,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1922332512, now seen corresponding path program 1 times [2018-11-07 07:08:45,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:08:45,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:08:45,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:08:45,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:08:45,662 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:08:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:08:45,813 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 07:08:45,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:08:45,813 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:08:45,813 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 179 with the following transitions: [2018-11-07 07:08:45,814 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [495], [497], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 07:08:45,818 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:08:45,818 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:08:46,010 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:08:46,010 INFO L272 AbstractInterpreter]: Visited 108 different actions 323 times. Merged at 7 different actions 21 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-07 07:08:46,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:08:46,025 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:08:46,271 INFO L227 lantSequenceWeakener]: Weakened 175 states. On average, predicates are now at 84.07% of their original sizes. [2018-11-07 07:08:46,271 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:08:46,368 INFO L415 sIntCurrentIteration]: We unified 177 AI predicates to 177 [2018-11-07 07:08:46,369 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:08:46,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:08:46,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-07 07:08:46,369 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:08:46,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 07:08:46,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 07:08:46,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:08:46,370 INFO L87 Difference]: Start difference. First operand 1995 states and 2484 transitions. Second operand 10 states. [2018-11-07 07:08:52,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:08:52,893 INFO L93 Difference]: Finished difference Result 4644 states and 5987 transitions. [2018-11-07 07:08:52,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 07:08:52,893 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 178 [2018-11-07 07:08:52,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:08:52,907 INFO L225 Difference]: With dead ends: 4644 [2018-11-07 07:08:52,907 INFO L226 Difference]: Without dead ends: 3028 [2018-11-07 07:08:52,916 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 188 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2018-11-07 07:08:52,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3028 states. [2018-11-07 07:08:52,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3028 to 2953. [2018-11-07 07:08:52,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2953 states. [2018-11-07 07:08:52,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 3452 transitions. [2018-11-07 07:08:52,987 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 3452 transitions. Word has length 178 [2018-11-07 07:08:52,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:08:52,988 INFO L480 AbstractCegarLoop]: Abstraction has 2953 states and 3452 transitions. [2018-11-07 07:08:52,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 07:08:52,988 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 3452 transitions. [2018-11-07 07:08:52,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-07 07:08:52,997 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:08:52,998 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:08:52,998 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:08:52,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:08:52,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1686996135, now seen corresponding path program 1 times [2018-11-07 07:08:52,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:08:52,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:08:52,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:08:53,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:08:53,000 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:08:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:08:53,295 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 07:08:53,869 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 71 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:08:53,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:08:53,869 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:08:53,869 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-11-07 07:08:53,870 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [324], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [495], [497], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 07:08:53,873 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:08:53,873 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:08:54,097 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:08:54,097 INFO L272 AbstractInterpreter]: Visited 108 different actions 318 times. Merged at 7 different actions 18 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 07:08:54,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:08:54,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:08:54,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:08:54,133 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 07:08:54,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:08:54,154 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:08:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:08:54,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:08:54,346 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-07 07:08:54,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:08:54,433 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-07 07:08:54,454 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:08:54,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 9 [2018-11-07 07:08:54,454 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:08:54,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:08:54,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:08:54,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:08:54,455 INFO L87 Difference]: Start difference. First operand 2953 states and 3452 transitions. Second operand 3 states. [2018-11-07 07:08:55,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:08:55,262 INFO L93 Difference]: Finished difference Result 5300 states and 6213 transitions. [2018-11-07 07:08:55,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:08:55,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-11-07 07:08:55,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:08:55,264 INFO L225 Difference]: With dead ends: 5300 [2018-11-07 07:08:55,264 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 07:08:55,275 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 422 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:08:55,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 07:08:55,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 07:08:55,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 07:08:55,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 07:08:55,276 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 211 [2018-11-07 07:08:55,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:08:55,276 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 07:08:55,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:08:55,277 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 07:08:55,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 07:08:55,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 07:08:55,526 WARN L179 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2018-11-07 07:08:55,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:55,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:55,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:55,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:55,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:55,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:55,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:55,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:55,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:55,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:55,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:55,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:55,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:55,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:55,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:55,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:55,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:55,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:55,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:55,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:55,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:55,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:55,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:55,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:55,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:55,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:55,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:55,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:55,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:08:56,149 WARN L179 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 17 [2018-11-07 07:08:56,288 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 34 [2018-11-07 07:08:57,175 WARN L179 SmtUtils]: Spent 880.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 74 [2018-11-07 07:08:57,296 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2018-11-07 07:08:57,431 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2018-11-07 07:08:57,434 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 07:08:57,435 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a28~0)| ~a28~0) (= |old(~a17~0)| ~a17~0)) [2018-11-07 07:08:57,435 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 07:08:57,435 INFO L425 ceAbstractionStarter]: For program point L564(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,435 INFO L425 ceAbstractionStarter]: For program point L531(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,436 INFO L425 ceAbstractionStarter]: For program point L498(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,436 INFO L425 ceAbstractionStarter]: For program point L465(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,436 INFO L425 ceAbstractionStarter]: For program point L432(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,436 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-07 07:08:57,436 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-07 07:08:57,436 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-07 07:08:57,436 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-07 07:08:57,436 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-07 07:08:57,436 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-07 07:08:57,436 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-07 07:08:57,437 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-07 07:08:57,437 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-07 07:08:57,437 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-07 07:08:57,437 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-07 07:08:57,437 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-07 07:08:57,437 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-07 07:08:57,437 INFO L425 ceAbstractionStarter]: For program point L567(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,437 INFO L425 ceAbstractionStarter]: For program point L534(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,437 INFO L425 ceAbstractionStarter]: For program point L501(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,437 INFO L425 ceAbstractionStarter]: For program point L468(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,438 INFO L425 ceAbstractionStarter]: For program point L435(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,438 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-07 07:08:57,438 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-07 07:08:57,438 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-07 07:08:57,438 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-07 07:08:57,438 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-07 07:08:57,438 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-07 07:08:57,438 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-07 07:08:57,439 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-07 07:08:57,439 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-07 07:08:57,439 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-07 07:08:57,439 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-07 07:08:57,439 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-07 07:08:57,439 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-07 07:08:57,439 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-07 07:08:57,439 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-07 07:08:57,440 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-07 07:08:57,440 INFO L425 ceAbstractionStarter]: For program point L570(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,440 INFO L425 ceAbstractionStarter]: For program point L537(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,440 INFO L425 ceAbstractionStarter]: For program point L504(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,440 INFO L425 ceAbstractionStarter]: For program point L471(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,440 INFO L425 ceAbstractionStarter]: For program point L438(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,440 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-07 07:08:57,440 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-07 07:08:57,440 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-07 07:08:57,441 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-07 07:08:57,441 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-07 07:08:57,441 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-07 07:08:57,441 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-07 07:08:57,441 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-07 07:08:57,441 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-07 07:08:57,441 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-07 07:08:57,441 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-07 07:08:57,441 INFO L425 ceAbstractionStarter]: For program point L573(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,442 INFO L425 ceAbstractionStarter]: For program point L540(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,442 INFO L425 ceAbstractionStarter]: For program point L507(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,442 INFO L425 ceAbstractionStarter]: For program point L474(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,442 INFO L425 ceAbstractionStarter]: For program point L441(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,442 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-07 07:08:57,442 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-07 07:08:57,442 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-07 07:08:57,442 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-07 07:08:57,442 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-07 07:08:57,443 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-07 07:08:57,443 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-07 07:08:57,443 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-07 07:08:57,443 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-07 07:08:57,443 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-07 07:08:57,443 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-07 07:08:57,443 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-07 07:08:57,443 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-07 07:08:57,443 INFO L425 ceAbstractionStarter]: For program point L576(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,443 INFO L425 ceAbstractionStarter]: For program point L543(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,443 INFO L425 ceAbstractionStarter]: For program point L510(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,443 INFO L425 ceAbstractionStarter]: For program point L477(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,443 INFO L425 ceAbstractionStarter]: For program point L444(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,444 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-07 07:08:57,444 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-07 07:08:57,444 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-07 07:08:57,444 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-07 07:08:57,444 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-07 07:08:57,444 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-07 07:08:57,444 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-07 07:08:57,444 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-07 07:08:57,444 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-07 07:08:57,444 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-07 07:08:57,444 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-07 07:08:57,445 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-07 07:08:57,445 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-07 07:08:57,445 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-07 07:08:57,445 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-07 07:08:57,445 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-07 07:08:57,445 INFO L425 ceAbstractionStarter]: For program point L579(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,445 INFO L425 ceAbstractionStarter]: For program point L546(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,445 INFO L425 ceAbstractionStarter]: For program point L513(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,445 INFO L425 ceAbstractionStarter]: For program point L480(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,445 INFO L425 ceAbstractionStarter]: For program point L447(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,445 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-07 07:08:57,445 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-07 07:08:57,445 INFO L425 ceAbstractionStarter]: For program point L414-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,445 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-07 07:08:57,446 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-07 07:08:57,446 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-07 07:08:57,446 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,446 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,446 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-07 07:08:57,446 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-07 07:08:57,446 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-07 07:08:57,446 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-07 07:08:57,446 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-07 07:08:57,446 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-07 07:08:57,446 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-07 07:08:57,446 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-07 07:08:57,446 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-07 07:08:57,446 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-07 07:08:57,447 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-07 07:08:57,447 INFO L425 ceAbstractionStarter]: For program point L582(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,447 INFO L425 ceAbstractionStarter]: For program point L549(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,447 INFO L425 ceAbstractionStarter]: For program point L516(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,447 INFO L425 ceAbstractionStarter]: For program point L483(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,447 INFO L425 ceAbstractionStarter]: For program point L450(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,447 INFO L425 ceAbstractionStarter]: For program point L417(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,447 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-07 07:08:57,447 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-07 07:08:57,447 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-07 07:08:57,447 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-07 07:08:57,447 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-07 07:08:57,447 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-07 07:08:57,447 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-07 07:08:57,448 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-07 07:08:57,448 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-07 07:08:57,448 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-07 07:08:57,448 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-07 07:08:57,448 INFO L425 ceAbstractionStarter]: For program point L585(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,448 INFO L425 ceAbstractionStarter]: For program point L552(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,448 INFO L425 ceAbstractionStarter]: For program point L519(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,448 INFO L425 ceAbstractionStarter]: For program point L486(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,448 INFO L425 ceAbstractionStarter]: For program point L453(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,448 INFO L425 ceAbstractionStarter]: For program point L420(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,448 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-07 07:08:57,449 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-07 07:08:57,449 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-07 07:08:57,449 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-07 07:08:57,449 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-07 07:08:57,449 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-07 07:08:57,449 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-07 07:08:57,449 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-07 07:08:57,449 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-07 07:08:57,449 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-07 07:08:57,450 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-07 07:08:57,450 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-07 07:08:57,450 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-07 07:08:57,450 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-07 07:08:57,450 INFO L425 ceAbstractionStarter]: For program point L588(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,450 INFO L425 ceAbstractionStarter]: For program point L555(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,450 INFO L425 ceAbstractionStarter]: For program point L522(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,450 INFO L425 ceAbstractionStarter]: For program point L489(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,451 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse2 (= 0 |old(~a28~0)|)) (.cse13 (not (= 0 |old(~a11~0)|))) (.cse0 (not (= 1 ~a21~0))) (.cse10 (not (= 1 |old(~a25~0)|))) (.cse1 (not (= 1 |old(~a19~0)|))) (.cse17 (not (= 9 |old(~a28~0)|))) (.cse5 (= |old(~a28~0)| ~a28~0)) (.cse11 (= |old(~a17~0)| ~a17~0))) (let ((.cse8 (and .cse5 .cse11)) (.cse12 (= 7 |old(~a17~0)|)) (.cse6 (= 9 |old(~a17~0)|)) (.cse7 (= 11 |old(~a28~0)|)) (.cse9 (not (= 7 |old(~a28~0)|))) (.cse16 (and (= ~a28~0 9) (= ~a25~0 1))) (.cse14 (and (or .cse0 .cse1 .cse2 .cse13) (or .cse0 .cse10 .cse1 .cse17))) (.cse3 (not (= 8 |old(~a17~0)|))) (.cse4 (= |calculate_output_#in~input| 0)) (.cse15 (= ~a11~0 0))) (and (or .cse0 .cse1 .cse2 (= ~a19~0 1) .cse3 .cse4) (or .cse0 .cse1 (and .cse5 (= ~a17~0 8)) .cse3 .cse4) (or .cse0 (< |old(~a28~0)| 9) .cse6 .cse7 .cse8) (or .cse0 .cse9 .cse10 .cse1 (not (= 1 |old(~a11~0)|)) (and .cse5 (= 1 ~a11~0) .cse11 (= 1 ~a25~0) (= 1 ~a19~0)) (not .cse12)) (or .cse0 .cse8 .cse12 .cse6 .cse7) (or .cse0 .cse9 (= ~a25~0 0) .cse13 .cse4 .cse1 .cse3 (not (= 0 |old(~a25~0)|))) (or .cse14 .cse3 .cse4 (or .cse15 .cse16)) (or .cse4 .cse16 (or .cse0 .cse10 .cse1 .cse13 .cse3 .cse17)) (or .cse14 .cse13 .cse3 .cse4 .cse15)))) [2018-11-07 07:08:57,451 INFO L425 ceAbstractionStarter]: For program point L456(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,451 INFO L425 ceAbstractionStarter]: For program point L423(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,451 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-07 07:08:57,451 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-07 07:08:57,452 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-07 07:08:57,452 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-07 07:08:57,452 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-07 07:08:57,452 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-07 07:08:57,452 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-07 07:08:57,452 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-07 07:08:57,452 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-07 07:08:57,452 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-07 07:08:57,452 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-07 07:08:57,453 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-07 07:08:57,453 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-07 07:08:57,453 INFO L425 ceAbstractionStarter]: For program point L591(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,453 INFO L425 ceAbstractionStarter]: For program point L558(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,453 INFO L425 ceAbstractionStarter]: For program point L525(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,453 INFO L425 ceAbstractionStarter]: For program point L492(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,453 INFO L425 ceAbstractionStarter]: For program point L426(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,453 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,453 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-07 07:08:57,453 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-07 07:08:57,454 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-07 07:08:57,454 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-07 07:08:57,454 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-07 07:08:57,454 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-07 07:08:57,454 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-07 07:08:57,454 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-07 07:08:57,454 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-07 07:08:57,454 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-07 07:08:57,454 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-07 07:08:57,455 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-07 07:08:57,455 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-07 07:08:57,455 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-07 07:08:57,455 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-07 07:08:57,455 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 596) no Hoare annotation was computed. [2018-11-07 07:08:57,455 INFO L425 ceAbstractionStarter]: For program point L561(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,455 INFO L425 ceAbstractionStarter]: For program point L528(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,455 INFO L425 ceAbstractionStarter]: For program point L495(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,455 INFO L425 ceAbstractionStarter]: For program point L462(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,456 INFO L425 ceAbstractionStarter]: For program point L429(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:08:57,456 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-07 07:08:57,456 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-07 07:08:57,456 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-07 07:08:57,456 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-07 07:08:57,456 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-07 07:08:57,456 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-07 07:08:57,456 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-07 07:08:57,456 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-07 07:08:57,457 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-07 07:08:57,457 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-07 07:08:57,457 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-07 07:08:57,457 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-07 07:08:57,457 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-07 07:08:57,457 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-07 07:08:57,457 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-07 07:08:57,457 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-07 07:08:57,457 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-07 07:08:57,458 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 460) no Hoare annotation was computed. [2018-11-07 07:08:57,458 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-07 07:08:57,458 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-07 07:08:57,458 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 07:08:57,458 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 7) (= ~a21~0 1)) [2018-11-07 07:08:57,458 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 07:08:57,458 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 07:08:57,459 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 1 |old(~a19~0)|)) (not (= 0 |old(~a11~0)|)) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|)) (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 7))) [2018-11-07 07:08:57,459 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-07 07:08:57,459 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse1 (not (= ~a28~0 11))) (.cse0 (not (= ~a17~0 9)))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (and (<= 9 ~a28~0) .cse0 .cse1) (not (= 1 |old(~a19~0)|)) (not (= 8 |old(~a17~0)|)) (and (= ~a17~0 8) (= ~a19~0 1)) (and (not (= ~a17~0 7)) .cse0 .cse1) (and (= 7 ~a28~0) (= 1 ~a11~0) (= 1 ~a25~0) (= 1 ~a19~0) .cse0) (not (= 0 |old(~a25~0)|)))) [2018-11-07 07:08:57,459 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-07 07:08:57,459 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-07 07:08:57,459 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse1 (not (= ~a28~0 11))) (.cse0 (not (= ~a17~0 9)))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (and (<= 9 ~a28~0) .cse0 .cse1) (not (= 1 |old(~a19~0)|)) (not (= 8 |old(~a17~0)|)) (and (not (= ~a17~0 7)) .cse0 .cse1) (and (= 7 ~a28~0) (= 1 ~a11~0) (= 1 ~a25~0) (= 1 ~a19~0) .cse0) (and (not (= main_~input~0 0)) (= ~a17~0 8) (= ~a19~0 1)) (not (= 0 |old(~a25~0)|)))) [2018-11-07 07:08:57,460 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-07 07:08:57,460 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-07 07:08:57,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:08:57 BoogieIcfgContainer [2018-11-07 07:08:57,478 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 07:08:57,479 INFO L168 Benchmark]: Toolchain (without parser) took 50980.61 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-11-07 07:08:57,484 INFO L168 Benchmark]: CDTParser took 0.22 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-11-07 07:08:57,484 INFO L168 Benchmark]: CACSL2BoogieTranslator took 705.38 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-11-07 07:08:57,485 INFO L168 Benchmark]: Boogie Procedure Inliner took 118.63 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -836.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 7.1 GB. [2018-11-07 07:08:57,486 INFO L168 Benchmark]: Boogie Preprocessor took 109.72 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 07:08:57,486 INFO L168 Benchmark]: RCFGBuilder took 3265.00 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 103.0 MB). Peak memory consumption was 103.0 MB. Max. memory is 7.1 GB. [2018-11-07 07:08:57,487 INFO L168 Benchmark]: TraceAbstraction took 46776.85 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 783.8 MB). Free memory was 2.1 GB in the beginning and 2.7 GB in the end (delta: -551.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-11-07 07:08:57,498 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 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. * CACSL2BoogieTranslator took 705.38 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 118.63 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -836.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 109.72 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3265.00 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 103.0 MB). Peak memory consumption was 103.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 46776.85 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 783.8 MB). Free memory was 2.1 GB in the beginning and 2.7 GB in the end (delta: -551.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 460]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((!(1 == a21) || !(7 == \old(a28))) || !(0 == \old(a11))) || ((9 <= a28 && !(a17 == 9)) && !(a28 == 11))) || !(1 == \old(a19))) || !(8 == \old(a17))) || (a17 == 8 && a19 == 1)) || ((!(a17 == 7) && !(a17 == 9)) && !(a28 == 11))) || ((((7 == a28 && 1 == a11) && 1 == a25) && 1 == a19) && !(a17 == 9))) || !(0 == \old(a25)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 46.6s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 34.3s AutomataDifference, 0.0s DeadEndRemovalTime, 2.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1615 SDtfs, 5716 SDslu, 1273 SDs, 0 SdLazy, 6010 SolverSat, 1240 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.0s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 1273 GetRequests, 1184 SyntacticMatches, 10 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2953occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.0s AbstIntTime, 5 AbstIntIterations, 3 AbstIntStrong, 0.9970276578019308 AbsIntWeakeningRatio, 0.21560574948665298 AbsIntAvgWeakeningVarsNumRemoved, 25.531827515400412 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 139 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 77 PreInvPairs, 114 NumberOfFragments, 519 HoareAnnotationTreeSize, 77 FomulaSimplifications, 5798 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1465 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 1804 NumberOfCodeBlocks, 1804 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2141 ConstructedInterpolants, 0 QuantifiedInterpolants, 994781 SizeOfPredicates, 4 NumberOfNonLiveVariables, 864 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 14 InterpolantComputations, 9 PerfectInterpolantSequences, 780/880 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...