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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_0920b_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 16:15:05,517 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 16:15:05,523 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 16:15:05,545 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 16:15:05,545 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 16:15:05,547 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 16:15:05,548 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 16:15:05,551 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 16:15:05,554 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 16:15:05,556 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 16:15:05,559 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 16:15:05,559 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 16:15:05,560 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 16:15:05,561 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 16:15:05,562 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 16:15:05,563 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 16:15:05,567 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 16:15:05,577 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 16:15:05,579 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 16:15:05,583 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 16:15:05,584 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 16:15:05,588 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 16:15:05,591 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 16:15:05,591 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 16:15:05,591 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 16:15:05,592 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 16:15:05,593 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 16:15:05,594 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 16:15:05,594 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 16:15:05,596 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 16:15:05,596 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 16:15:05,596 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 16:15:05,597 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 16:15:05,597 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 16:15:05,598 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 16:15:05,598 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 16:15:05,599 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-19 16:15:05,615 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 16:15:05,616 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 16:15:05,616 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 16:15:05,617 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 16:15:05,617 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 16:15:05,617 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 16:15:05,618 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 16:15:05,618 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 16:15:05,618 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 16:15:05,618 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 16:15:05,618 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 16:15:05,619 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 16:15:05,619 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 16:15:05,619 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 16:15:05,619 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 16:15:05,619 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 16:15:05,620 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 16:15:05,620 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 16:15:05,620 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 16:15:05,620 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 16:15:05,620 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 16:15:05,621 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 16:15:05,621 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 16:15:05,621 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 16:15:05,621 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 16:15:05,621 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 16:15:05,622 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 16:15:05,622 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 16:15:05,622 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 16:15:05,622 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 16:15:05,622 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 16:15:05,622 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 16:15:05,668 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 16:15:05,681 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 16:15:05,685 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 16:15:05,687 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 16:15:05,687 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 16:15:05,688 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_0920b_true-unreach-call.c [2018-09-19 16:15:06,094 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cb1398b5/d3d953d553b84981890cf9932a73d009/FLAGc38c98b26 [2018-09-19 16:15:06,294 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 16:15:06,295 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_0920b_true-unreach-call.c [2018-09-19 16:15:06,307 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cb1398b5/d3d953d553b84981890cf9932a73d009/FLAGc38c98b26 [2018-09-19 16:15:06,324 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cb1398b5/d3d953d553b84981890cf9932a73d009 [2018-09-19 16:15:06,337 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 16:15:06,340 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 16:15:06,342 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 16:15:06,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 16:15:06,349 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 16:15:06,350 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:15:06" (1/1) ... [2018-09-19 16:15:06,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@352193b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:15:06, skipping insertion in model container [2018-09-19 16:15:06,354 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:15:06" (1/1) ... [2018-09-19 16:15:06,368 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 16:15:06,695 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:15:06,715 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 16:15:06,760 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:15:06,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:15:06 WrapperNode [2018-09-19 16:15:06,816 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 16:15:06,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 16:15:06,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 16:15:06,817 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 16:15:06,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:15:06" (1/1) ... [2018-09-19 16:15:06,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:15:06" (1/1) ... [2018-09-19 16:15:06,859 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:15:06" (1/1) ... [2018-09-19 16:15:06,859 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:15:06" (1/1) ... [2018-09-19 16:15:06,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:15:06" (1/1) ... [2018-09-19 16:15:06,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:15:06" (1/1) ... [2018-09-19 16:15:06,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:15:06" (1/1) ... [2018-09-19 16:15:06,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 16:15:06,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 16:15:06,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 16:15:06,900 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 16:15:06,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:15:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 16:15:07,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 16:15:07,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 16:15:07,049 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2018-09-19 16:15:07,050 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_log [2018-09-19 16:15:07,050 INFO L138 BoogieDeclarations]: Found implementation of procedure isfinite_double [2018-09-19 16:15:07,050 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-09-19 16:15:07,050 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 16:15:07,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 16:15:07,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-19 16:15:07,051 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2018-09-19 16:15:07,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-19 16:15:07,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-19 16:15:07,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-19 16:15:07,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-19 16:15:07,051 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_log [2018-09-19 16:15:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-19 16:15:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-19 16:15:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure isfinite_double [2018-09-19 16:15:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-09-19 16:15:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 16:15:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 16:15:07,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 16:15:07,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-19 16:15:07,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-19 16:15:07,318 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:15:07,360 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:15:20,171 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:15:20,194 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:15:20,218 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:15:24,970 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:15:24,989 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:15:25,138 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:15:29,593 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:15:29,637 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:15:29,692 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:15:29,843 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 16:15:29,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:15:29 BoogieIcfgContainer [2018-09-19 16:15:29,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 16:15:29,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 16:15:29,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 16:15:29,848 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 16:15:29,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 04:15:06" (1/3) ... [2018-09-19 16:15:29,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46fe86cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:15:29, skipping insertion in model container [2018-09-19 16:15:29,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:15:06" (2/3) ... [2018-09-19 16:15:29,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46fe86cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:15:29, skipping insertion in model container [2018-09-19 16:15:29,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:15:29" (3/3) ... [2018-09-19 16:15:29,853 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0920b_true-unreach-call.c [2018-09-19 16:15:29,863 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 16:15:29,873 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 16:15:29,918 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 16:15:29,919 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 16:15:29,919 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 16:15:29,919 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 16:15:29,920 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 16:15:29,920 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 16:15:29,920 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 16:15:29,920 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 16:15:29,920 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 16:15:29,947 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2018-09-19 16:15:29,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-19 16:15:29,960 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:15:29,962 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:15:29,964 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:15:29,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1039327380, now seen corresponding path program 1 times [2018-09-19 16:15:29,973 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:15:29,974 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-19 16:15:29,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:15:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:15:30,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:15:30,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:15:30,145 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:15:30,163 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:15:30,163 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-19 16:15:30,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-19 16:15:30,183 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-19 16:15:30,184 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 16:15:30,187 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 2 states. [2018-09-19 16:15:30,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:15:30,216 INFO L93 Difference]: Finished difference Result 134 states and 168 transitions. [2018-09-19 16:15:30,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-19 16:15:30,218 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-09-19 16:15:30,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:15:30,231 INFO L225 Difference]: With dead ends: 134 [2018-09-19 16:15:30,232 INFO L226 Difference]: Without dead ends: 67 [2018-09-19 16:15:30,236 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 16:15:30,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-19 16:15:30,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-19 16:15:30,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-19 16:15:30,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2018-09-19 16:15:30,285 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 21 [2018-09-19 16:15:30,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:15:30,285 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2018-09-19 16:15:30,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-19 16:15:30,286 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2018-09-19 16:15:30,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-19 16:15:30,287 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:15:30,288 INFO L376 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] [2018-09-19 16:15:30,288 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:15:30,288 INFO L82 PathProgramCache]: Analyzing trace with hash -711438788, now seen corresponding path program 1 times [2018-09-19 16:15:30,289 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:15:30,290 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-19 16:15:30,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:15:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:15:30,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:15:30,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 16:15:30,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-19 16:15:30,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:15:30,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:15:30,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:15:30,745 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:15:30,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-19 16:15:30,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-19 16:15:30,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:15:30,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:15:30,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:15:30,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:15:31,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:15:31,089 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:15:31,105 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:15:31,106 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-19 16:15:31,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-19 16:15:31,108 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-19 16:15:31,109 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-19 16:15:31,109 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand 8 states. [2018-09-19 16:15:32,223 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-19 16:15:32,495 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-09-19 16:15:48,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:15:48,260 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2018-09-19 16:15:49,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 16:15:49,035 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-09-19 16:15:49,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:15:49,039 INFO L225 Difference]: With dead ends: 102 [2018-09-19 16:15:49,039 INFO L226 Difference]: Without dead ends: 69 [2018-09-19 16:15:49,040 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-09-19 16:15:49,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-19 16:15:49,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-09-19 16:15:49,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-19 16:15:49,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2018-09-19 16:15:49,051 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 34 [2018-09-19 16:15:49,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:15:49,052 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2018-09-19 16:15:49,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-19 16:15:49,052 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2018-09-19 16:15:49,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-19 16:15:49,053 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:15:49,054 INFO L376 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] [2018-09-19 16:15:49,054 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:15:49,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1152943357, now seen corresponding path program 1 times [2018-09-19 16:15:49,055 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:15:49,055 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-19 16:15:49,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:15:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:15:50,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:15:50,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 16:15:50,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-19 16:15:50,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:15:50,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:15:50,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:15:50,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:15:50,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-19 16:15:50,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-19 16:15:50,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:15:50,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:15:50,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:15:50,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:15:50,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:15:50,404 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:15:50,430 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:15:50,430 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-19 16:15:50,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-19 16:15:50,431 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-19 16:15:50,431 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-19 16:15:50,432 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand 8 states. [2018-09-19 16:15:50,957 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-19 16:16:01,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:16:01,641 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2018-09-19 16:16:01,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-19 16:16:01,644 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-09-19 16:16:01,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:16:01,646 INFO L225 Difference]: With dead ends: 79 [2018-09-19 16:16:01,646 INFO L226 Difference]: Without dead ends: 69 [2018-09-19 16:16:01,647 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-09-19 16:16:01,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-19 16:16:01,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-09-19 16:16:01,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-19 16:16:01,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2018-09-19 16:16:01,657 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 34 [2018-09-19 16:16:01,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:16:01,657 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2018-09-19 16:16:01,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-19 16:16:01,658 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2018-09-19 16:16:01,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-19 16:16:01,659 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:16:01,659 INFO L376 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] [2018-09-19 16:16:01,659 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:16:01,660 INFO L82 PathProgramCache]: Analyzing trace with hash -405271574, now seen corresponding path program 1 times [2018-09-19 16:16:01,660 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:16:01,660 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-09-19 16:16:01,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:16:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:16:02,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:16:07,109 WARN L178 SmtUtils]: Spent 3.95 s on a formula simplification that was a NOOP. DAG size: 10 [2018-09-19 16:16:07,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:16:07,538 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:16:07,566 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:16:07,566 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 16:16:07,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 16:16:07,567 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 16:16:07,567 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-09-19 16:16:07,567 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand 10 states. [2018-09-19 16:16:17,573 WARN L178 SmtUtils]: Spent 4.93 s on a formula simplification that was a NOOP. DAG size: 12 [2018-09-19 16:16:35,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:16:35,770 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2018-09-19 16:16:35,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-19 16:16:35,771 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-09-19 16:16:35,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:16:35,773 INFO L225 Difference]: With dead ends: 76 [2018-09-19 16:16:35,773 INFO L226 Difference]: Without dead ends: 69 [2018-09-19 16:16:35,774 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-09-19 16:16:35,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-19 16:16:35,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-09-19 16:16:35,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-19 16:16:35,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2018-09-19 16:16:35,786 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 35 [2018-09-19 16:16:35,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:16:35,787 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2018-09-19 16:16:35,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 16:16:35,787 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2018-09-19 16:16:35,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-19 16:16:35,789 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:16:35,789 INFO L376 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] [2018-09-19 16:16:35,789 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:16:35,789 INFO L82 PathProgramCache]: Analyzing trace with hash 2025578153, now seen corresponding path program 1 times [2018-09-19 16:16:35,790 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:16:35,790 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-19 16:16:35,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:16:36,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:16:36,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:16:36,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 16:16:36,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-19 16:16:36,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:16:36,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:16:36,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:16:36,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:16:36,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-19 16:16:36,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-19 16:16:36,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:16:36,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:16:36,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:16:36,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:16:36,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:16:36,573 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:16:36,595 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:16:36,595 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-19 16:16:36,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-19 16:16:36,596 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-19 16:16:36,597 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-19 16:16:36,597 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 8 states. [2018-09-19 16:16:44,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:16:44,929 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-09-19 16:16:44,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-19 16:16:44,931 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-09-19 16:16:44,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:16:44,931 INFO L225 Difference]: With dead ends: 67 [2018-09-19 16:16:44,932 INFO L226 Difference]: Without dead ends: 0 [2018-09-19 16:16:44,933 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-09-19 16:16:44,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-19 16:16:44,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-19 16:16:44,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-19 16:16:44,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-19 16:16:44,934 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-09-19 16:16:44,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:16:44,934 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-19 16:16:44,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-19 16:16:44,934 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-19 16:16:44,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-19 16:16:44,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-19 16:16:45,151 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 30 [2018-09-19 16:16:45,356 WARN L178 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 17 [2018-09-19 16:16:45,508 INFO L426 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-09-19 16:16:45,508 INFO L426 ceAbstractionStarter]: For program point L131-2(line 131) no Hoare annotation was computed. [2018-09-19 16:16:45,509 INFO L426 ceAbstractionStarter]: For program point L129-1(line 129) no Hoare annotation was computed. [2018-09-19 16:16:45,509 INFO L426 ceAbstractionStarter]: For program point L129-2(line 129) no Hoare annotation was computed. [2018-09-19 16:16:45,509 INFO L426 ceAbstractionStarter]: For program point L128-1(lines 128 132) no Hoare annotation was computed. [2018-09-19 16:16:45,509 INFO L426 ceAbstractionStarter]: For program point L129-3(line 129) no Hoare annotation was computed. [2018-09-19 16:16:45,509 INFO L426 ceAbstractionStarter]: For program point L128-3(lines 128 132) no Hoare annotation was computed. [2018-09-19 16:16:45,509 INFO L426 ceAbstractionStarter]: For program point L128-4(lines 128 132) no Hoare annotation was computed. [2018-09-19 16:16:45,509 INFO L426 ceAbstractionStarter]: For program point isfinite_doubleFINAL(lines 126 134) no Hoare annotation was computed. [2018-09-19 16:16:45,509 INFO L426 ceAbstractionStarter]: For program point isfinite_doubleEXIT(lines 126 134) no Hoare annotation was computed. [2018-09-19 16:16:45,509 INFO L426 ceAbstractionStarter]: For program point isfinite_doubleENTRY(lines 126 134) no Hoare annotation was computed. [2018-09-19 16:16:45,510 INFO L426 ceAbstractionStarter]: For program point L131(line 131) no Hoare annotation was computed. [2018-09-19 16:16:45,510 INFO L426 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-09-19 16:16:45,510 INFO L426 ceAbstractionStarter]: For program point L131-1(line 131) no Hoare annotation was computed. [2018-09-19 16:16:45,510 INFO L429 ceAbstractionStarter]: At program point isnan_doubleENTRY(line 137) the Hoare annotation is: true [2018-09-19 16:16:45,510 INFO L426 ceAbstractionStarter]: For program point isnan_doubleEXIT(line 137) no Hoare annotation was computed. [2018-09-19 16:16:45,510 INFO L426 ceAbstractionStarter]: For program point isnan_doubleFINAL(line 137) no Hoare annotation was computed. [2018-09-19 16:16:45,511 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-19 16:16:45,511 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-09-19 16:16:45,511 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-19 16:16:45,511 INFO L426 ceAbstractionStarter]: For program point L85(lines 85 92) no Hoare annotation was computed. [2018-09-19 16:16:45,511 INFO L426 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-09-19 16:16:45,511 INFO L426 ceAbstractionStarter]: For program point __ieee754_logEXIT(lines 45 124) no Hoare annotation was computed. [2018-09-19 16:16:45,511 INFO L426 ceAbstractionStarter]: For program point L77(line 77) no Hoare annotation was computed. [2018-09-19 16:16:45,512 INFO L426 ceAbstractionStarter]: For program point L77-1(line 77) no Hoare annotation was computed. [2018-09-19 16:16:45,512 INFO L426 ceAbstractionStarter]: For program point L77-2(line 77) no Hoare annotation was computed. [2018-09-19 16:16:45,512 INFO L426 ceAbstractionStarter]: For program point L77-3(line 77) no Hoare annotation was computed. [2018-09-19 16:16:45,512 INFO L426 ceAbstractionStarter]: For program point L94(lines 94 99) no Hoare annotation was computed. [2018-09-19 16:16:45,512 INFO L426 ceAbstractionStarter]: For program point L61(lines 61 62) no Hoare annotation was computed. [2018-09-19 16:16:45,512 INFO L426 ceAbstractionStarter]: For program point L119(lines 119 122) no Hoare annotation was computed. [2018-09-19 16:16:45,512 INFO L426 ceAbstractionStarter]: For program point L86(lines 86 91) no Hoare annotation was computed. [2018-09-19 16:16:45,512 INFO L426 ceAbstractionStarter]: For program point L53(line 53) no Hoare annotation was computed. [2018-09-19 16:16:45,513 INFO L426 ceAbstractionStarter]: For program point L53-1(line 53) no Hoare annotation was computed. [2018-09-19 16:16:45,513 INFO L426 ceAbstractionStarter]: For program point L53-2(line 53) no Hoare annotation was computed. [2018-09-19 16:16:45,513 INFO L426 ceAbstractionStarter]: For program point L111(lines 111 123) no Hoare annotation was computed. [2018-09-19 16:16:45,513 INFO L426 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-09-19 16:16:45,513 INFO L426 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-09-19 16:16:45,513 INFO L426 ceAbstractionStarter]: For program point L54-1(line 54) no Hoare annotation was computed. [2018-09-19 16:16:45,513 INFO L426 ceAbstractionStarter]: For program point L54-2(line 54) no Hoare annotation was computed. [2018-09-19 16:16:45,513 INFO L426 ceAbstractionStarter]: For program point L54-3(line 54) no Hoare annotation was computed. [2018-09-19 16:16:45,513 INFO L426 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-09-19 16:16:45,514 INFO L429 ceAbstractionStarter]: At program point __ieee754_logENTRY(lines 45 124) the Hoare annotation is: true [2018-09-19 16:16:45,514 INFO L426 ceAbstractionStarter]: For program point __ieee754_logFINAL(lines 45 124) no Hoare annotation was computed. [2018-09-19 16:16:45,514 INFO L426 ceAbstractionStarter]: For program point L113(lines 113 117) no Hoare annotation was computed. [2018-09-19 16:16:45,514 INFO L426 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-09-19 16:16:45,514 INFO L426 ceAbstractionStarter]: For program point L80-1(line 80) no Hoare annotation was computed. [2018-09-19 16:16:45,514 INFO L426 ceAbstractionStarter]: For program point L80-2(line 80) no Hoare annotation was computed. [2018-09-19 16:16:45,514 INFO L426 ceAbstractionStarter]: For program point L80-3(line 80) no Hoare annotation was computed. [2018-09-19 16:16:45,514 INFO L426 ceAbstractionStarter]: For program point L65-1(lines 65 69) no Hoare annotation was computed. [2018-09-19 16:16:45,515 INFO L422 ceAbstractionStarter]: At program point L65-3(lines 65 69) the Hoare annotation is: (or (and (exists ((|v_q#valueAsBitvector_12| (_ BitVec 64))) (and (= |__ieee754_log_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_12|) ((_ extract 62 52) |v_q#valueAsBitvector_12|) ((_ extract 51 0) |v_q#valueAsBitvector_12|))) (= ((_ extract 63 32) |v_q#valueAsBitvector_12|) __ieee754_log_~hx~1))) (exists ((|v_q#valueAsBitvector_14| (_ BitVec 64))) (and (= |__ieee754_log_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_14|) ((_ extract 62 52) |v_q#valueAsBitvector_14|) ((_ extract 51 0) |v_q#valueAsBitvector_14|))) (not (bvslt ((_ extract 63 32) |v_q#valueAsBitvector_14|) (_ bv0 32)))))) (not (= (_ +zero 11 53) ~zero~0))) [2018-09-19 16:16:45,515 INFO L426 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2018-09-19 16:16:45,515 INFO L426 ceAbstractionStarter]: For program point L66-1(line 66) no Hoare annotation was computed. [2018-09-19 16:16:45,515 INFO L426 ceAbstractionStarter]: For program point L66-2(line 66) no Hoare annotation was computed. [2018-09-19 16:16:45,515 INFO L426 ceAbstractionStarter]: For program point L66-3(line 66) no Hoare annotation was computed. [2018-09-19 16:16:45,515 INFO L426 ceAbstractionStarter]: For program point L58(lines 58 70) no Hoare annotation was computed. [2018-09-19 16:16:45,515 INFO L426 ceAbstractionStarter]: For program point L58-1(lines 45 124) no Hoare annotation was computed. [2018-09-19 16:16:45,515 INFO L426 ceAbstractionStarter]: For program point L50-1(lines 50 55) no Hoare annotation was computed. [2018-09-19 16:16:45,516 INFO L422 ceAbstractionStarter]: At program point L50-3(lines 50 55) the Hoare annotation is: (or (= __ieee754_log_~x |__ieee754_log_#in~x|) (not (= (_ +zero 11 53) ~zero~0))) [2018-09-19 16:16:45,516 INFO L426 ceAbstractionStarter]: For program point L50-4(lines 50 55) no Hoare annotation was computed. [2018-09-19 16:16:45,516 INFO L426 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-09-19 16:16:45,516 INFO L426 ceAbstractionStarter]: For program point L59(lines 59 60) no Hoare annotation was computed. [2018-09-19 16:16:45,516 INFO L426 ceAbstractionStarter]: For program point L84(lines 84 100) no Hoare annotation was computed. [2018-09-19 16:16:45,516 INFO L426 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-09-19 16:16:45,516 INFO L426 ceAbstractionStarter]: For program point L51-1(line 51) no Hoare annotation was computed. [2018-09-19 16:16:45,516 INFO L426 ceAbstractionStarter]: For program point L51-2(line 51) no Hoare annotation was computed. [2018-09-19 16:16:45,516 INFO L426 ceAbstractionStarter]: For program point L51-3(line 51) no Hoare annotation was computed. [2018-09-19 16:16:45,516 INFO L426 ceAbstractionStarter]: For program point L76-1(lines 76 81) no Hoare annotation was computed. [2018-09-19 16:16:45,517 INFO L422 ceAbstractionStarter]: At program point L76-3(lines 76 81) the Hoare annotation is: (or (exists ((|v_q#valueAsBitvector_14| (_ BitVec 64))) (and (= |__ieee754_log_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_14|) ((_ extract 62 52) |v_q#valueAsBitvector_14|) ((_ extract 51 0) |v_q#valueAsBitvector_14|))) (not (bvslt ((_ extract 63 32) |v_q#valueAsBitvector_14|) (_ bv0 32))))) (not (= (_ +zero 11 53) ~zero~0))) [2018-09-19 16:16:45,517 INFO L426 ceAbstractionStarter]: For program point L76-4(lines 76 81) no Hoare annotation was computed. [2018-09-19 16:16:45,517 INFO L426 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2018-09-19 16:16:45,517 INFO L426 ceAbstractionStarter]: For program point L68-1(line 68) no Hoare annotation was computed. [2018-09-19 16:16:45,517 INFO L426 ceAbstractionStarter]: For program point L68-2(line 68) no Hoare annotation was computed. [2018-09-19 16:16:45,517 INFO L426 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-09-19 16:16:45,517 INFO L426 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-09-19 16:16:45,517 INFO L426 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-09-19 16:16:45,517 INFO L426 ceAbstractionStarter]: For program point L23-2(line 23) no Hoare annotation was computed. [2018-09-19 16:16:45,518 INFO L426 ceAbstractionStarter]: For program point L21-1(line 21) no Hoare annotation was computed. [2018-09-19 16:16:45,518 INFO L426 ceAbstractionStarter]: For program point L21-2(line 21) no Hoare annotation was computed. [2018-09-19 16:16:45,518 INFO L426 ceAbstractionStarter]: For program point L21-3(line 21) no Hoare annotation was computed. [2018-09-19 16:16:45,518 INFO L426 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-09-19 16:16:45,518 INFO L426 ceAbstractionStarter]: For program point L24-1(line 24) no Hoare annotation was computed. [2018-09-19 16:16:45,518 INFO L426 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-09-19 16:16:45,518 INFO L426 ceAbstractionStarter]: For program point L24-2(line 24) no Hoare annotation was computed. [2018-09-19 16:16:45,518 INFO L426 ceAbstractionStarter]: For program point L24-3(line 24) no Hoare annotation was computed. [2018-09-19 16:16:45,518 INFO L426 ceAbstractionStarter]: For program point L20-1(lines 20 25) no Hoare annotation was computed. [2018-09-19 16:16:45,518 INFO L426 ceAbstractionStarter]: For program point L20-3(lines 20 25) no Hoare annotation was computed. [2018-09-19 16:16:45,519 INFO L426 ceAbstractionStarter]: For program point L20-4(lines 20 25) no Hoare annotation was computed. [2018-09-19 16:16:45,519 INFO L426 ceAbstractionStarter]: For program point isinf_doubleFINAL(lines 18 30) no Hoare annotation was computed. [2018-09-19 16:16:45,519 INFO L426 ceAbstractionStarter]: For program point isinf_doubleEXIT(lines 18 30) no Hoare annotation was computed. [2018-09-19 16:16:45,519 INFO L426 ceAbstractionStarter]: For program point isinf_doubleENTRY(lines 18 30) no Hoare annotation was computed. [2018-09-19 16:16:45,519 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-19 16:16:45,519 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (= (_ +zero 11 53) ~zero~0) [2018-09-19 16:16:45,519 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-19 16:16:45,519 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-19 16:16:45,520 INFO L426 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 151) no Hoare annotation was computed. [2018-09-19 16:16:45,520 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 139 156) the Hoare annotation is: true [2018-09-19 16:16:45,520 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 139 156) no Hoare annotation was computed. [2018-09-19 16:16:45,520 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 139 156) no Hoare annotation was computed. [2018-09-19 16:16:45,520 INFO L426 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-09-19 16:16:45,520 INFO L422 ceAbstractionStarter]: At program point L150(line 150) the Hoare annotation is: (or (let ((.cse0 (fp.div RNE (fp.neg ((_ to_fp 11 53) RNE 1.0)) (_ +zero 11 53)))) (and (= .cse0 main_~x~0) (= main_~res~0 (fp.div RNE (fp.sub RNE .cse0 .cse0) (_ +zero 11 53))))) (not (= (_ +zero 11 53) ~zero~0))) [2018-09-19 16:16:45,520 INFO L426 ceAbstractionStarter]: For program point L150-1(lines 150 153) no Hoare annotation was computed. [2018-09-19 16:16:45,520 INFO L422 ceAbstractionStarter]: At program point L147(line 147) the Hoare annotation is: (or (not (= (_ +zero 11 53) ~zero~0)) (= (fp.div RNE (fp.neg ((_ to_fp 11 53) RNE 1.0)) (_ +zero 11 53)) main_~x~0)) [2018-09-19 16:16:45,521 INFO L426 ceAbstractionStarter]: For program point L147-1(line 147) no Hoare annotation was computed. [2018-09-19 16:16:45,525 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 16:16:45,526 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 16:16:45,526 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 16:16:45,527 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 16:16:45,527 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:16:45,527 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:16:45,527 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:16:45,528 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:16:45,535 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 16:16:45,535 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 16:16:45,536 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 16:16:45,536 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 16:16:45,536 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:16:45,537 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:16:45,537 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:16:45,537 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:16:45,539 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:16:45,539 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:16:45,540 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:16:45,540 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:16:45,540 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:16:45,541 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:16:45,541 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:16:45,541 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:16:45,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 04:16:45 BoogieIcfgContainer [2018-09-19 16:16:45,544 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 16:16:45,545 INFO L168 Benchmark]: Toolchain (without parser) took 99207.10 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -431.5 MB). Peak memory consumption was 309.8 MB. Max. memory is 7.1 GB. [2018-09-19 16:16:45,546 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 16:16:45,547 INFO L168 Benchmark]: CACSL2BoogieTranslator took 475.13 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 16:16:45,547 INFO L168 Benchmark]: Boogie Preprocessor took 82.08 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 16:16:45,548 INFO L168 Benchmark]: RCFGBuilder took 22944.20 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -766.0 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. [2018-09-19 16:16:45,549 INFO L168 Benchmark]: TraceAbstraction took 75699.07 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 313.3 MB). Peak memory consumption was 313.3 MB. Max. memory is 7.1 GB. [2018-09-19 16:16:45,554 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.23 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 475.13 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 82.08 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 22944.20 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -766.0 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 75699.07 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 313.3 MB). Peak memory consumption was 313.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 151]: 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: 65]: Loop Invariant [2018-09-19 16:16:45,563 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 16:16:45,563 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 16:16:45,564 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 16:16:45,564 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 16:16:45,564 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:16:45,564 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:16:45,564 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:16:45,565 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:16:45,566 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 16:16:45,566 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 16:16:45,566 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 16:16:45,566 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 16:16:45,566 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:16:45,567 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:16:45,567 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:16:45,567 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] Derived loop invariant: ((\exists v_q#valueAsBitvector_12 : bv64 :: \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_12[63:63], v_q#valueAsBitvector_12[62:52], v_q#valueAsBitvector_12[51:0]) && v_q#valueAsBitvector_12[63:32] == hx) && (\exists v_q#valueAsBitvector_14 : bv64 :: \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_14[63:63], v_q#valueAsBitvector_14[62:52], v_q#valueAsBitvector_14[51:0]) && !~bvslt32(v_q#valueAsBitvector_14[63:32], 0bv32))) || !(~Pluszero~LONGDOUBLE() == zero) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: x == \old(x) || !(~Pluszero~LONGDOUBLE() == zero) - InvariantResult [Line: 76]: Loop Invariant [2018-09-19 16:16:45,568 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:16:45,568 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:16:45,569 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:16:45,569 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:16:45,569 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:16:45,570 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:16:45,570 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:16:45,570 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] Derived loop invariant: (\exists v_q#valueAsBitvector_14 : bv64 :: \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_14[63:63], v_q#valueAsBitvector_14[62:52], v_q#valueAsBitvector_14[51:0]) && !~bvslt32(v_q#valueAsBitvector_14[63:32], 0bv32)) || !(~Pluszero~LONGDOUBLE() == zero) - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 103 locations, 1 error locations. SAFE Result, 75.6s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 65.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 326 SDtfs, 227 SDslu, 1285 SDs, 0 SdLazy, 342 SolverSat, 30 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 50.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 14.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 15 PreInvPairs, 20 NumberOfFragments, 124 HoareAnnotationTreeSize, 15 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 74 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 165 ConstructedInterpolants, 60 QuantifiedInterpolants, 49171 SizeOfPredicates, 27 NumberOfNonLiveVariables, 515 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...