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_0970b_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 16:16:29,178 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 16:16:29,182 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 16:16:29,200 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 16:16:29,201 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 16:16:29,204 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 16:16:29,206 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 16:16:29,209 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 16:16:29,212 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 16:16:29,214 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 16:16:29,215 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 16:16:29,217 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 16:16:29,219 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 16:16:29,220 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 16:16:29,223 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 16:16:29,224 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 16:16:29,226 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 16:16:29,229 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 16:16:29,231 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 16:16:29,241 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 16:16:29,242 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 16:16:29,246 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 16:16:29,249 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 16:16:29,250 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 16:16:29,250 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 16:16:29,251 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 16:16:29,252 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 16:16:29,252 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 16:16:29,253 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 16:16:29,257 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 16:16:29,257 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 16:16:29,258 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 16:16:29,260 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 16:16:29,260 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 16:16:29,261 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 16:16:29,263 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 16:16:29,263 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:16:29,278 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 16:16:29,279 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 16:16:29,279 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 16:16:29,280 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 16:16:29,280 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 16:16:29,280 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 16:16:29,281 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 16:16:29,281 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 16:16:29,281 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 16:16:29,281 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 16:16:29,281 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 16:16:29,282 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 16:16:29,282 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 16:16:29,282 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 16:16:29,282 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 16:16:29,282 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 16:16:29,282 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 16:16:29,283 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 16:16:29,283 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 16:16:29,283 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 16:16:29,283 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 16:16:29,283 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 16:16:29,284 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 16:16:29,284 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 16:16:29,284 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 16:16:29,284 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 16:16:29,284 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 16:16:29,285 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 16:16:29,285 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 16:16:29,285 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 16:16:29,285 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 16:16:29,285 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 16:16:29,329 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 16:16:29,343 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 16:16:29,347 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 16:16:29,349 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 16:16:29,349 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 16:16:29,350 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_0970b_true-unreach-call.c [2018-09-19 16:16:29,711 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/162e3b089/3411127a5286452884d021056ffde870/FLAG251e21192 [2018-09-19 16:16:29,946 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 16:16:29,947 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_0970b_true-unreach-call.c [2018-09-19 16:16:29,963 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/162e3b089/3411127a5286452884d021056ffde870/FLAG251e21192 [2018-09-19 16:16:29,980 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/162e3b089/3411127a5286452884d021056ffde870 [2018-09-19 16:16:29,992 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 16:16:29,996 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 16:16:29,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 16:16:29,998 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 16:16:30,006 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 16:16:30,007 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:16:29" (1/1) ... [2018-09-19 16:16:30,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5293bdec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:16:30, skipping insertion in model container [2018-09-19 16:16:30,011 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:16:29" (1/1) ... [2018-09-19 16:16:30,025 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 16:16:30,374 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:16:30,403 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 16:16:30,490 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:16:30,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:16:30 WrapperNode [2018-09-19 16:16:30,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 16:16:30,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 16:16:30,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 16:16:30,558 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 16:16:30,574 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:16:30" (1/1) ... [2018-09-19 16:16:30,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:16:30" (1/1) ... [2018-09-19 16:16:30,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:16:30" (1/1) ... [2018-09-19 16:16:30,605 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:16:30" (1/1) ... [2018-09-19 16:16:30,636 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:16:30" (1/1) ... [2018-09-19 16:16:30,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:16:30" (1/1) ... [2018-09-19 16:16:30,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:16:30" (1/1) ... [2018-09-19 16:16:30,653 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 16:16:30,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 16:16:30,654 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 16:16:30,654 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 16:16:30,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:16:30" (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:16:30,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 16:16:30,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 16:16:30,822 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_log [2018-09-19 16:16:30,822 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_log10 [2018-09-19 16:16:30,823 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-09-19 16:16:30,823 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 16:16:30,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 16:16:30,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-19 16:16:30,823 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_log [2018-09-19 16:16:30,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-19 16:16:30,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-19 16:16:30,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-19 16:16:30,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-19 16:16:30,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-19 16:16:30,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-19 16:16:30,827 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_log10 [2018-09-19 16:16:30,827 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-09-19 16:16:30,827 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 16:16:30,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 16:16:30,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 16:16:30,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-19 16:16:30,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-19 16:16:31,232 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:16:31,259 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:16:31,292 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:16:36,485 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:16:36,503 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:16:37,042 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:16:42,094 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:16:42,134 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:16:42,291 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:17:00,909 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:17:00,920 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:17:00,937 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:17:03,383 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 16:17:03,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:17:03 BoogieIcfgContainer [2018-09-19 16:17:03,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 16:17:03,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 16:17:03,385 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 16:17:03,388 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 16:17:03,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 04:16:29" (1/3) ... [2018-09-19 16:17:03,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f21d78a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:17:03, skipping insertion in model container [2018-09-19 16:17:03,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:16:30" (2/3) ... [2018-09-19 16:17:03,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f21d78a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:17:03, skipping insertion in model container [2018-09-19 16:17:03,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:17:03" (3/3) ... [2018-09-19 16:17:03,392 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0970b_true-unreach-call.c [2018-09-19 16:17:03,400 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 16:17:03,408 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 16:17:03,456 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 16:17:03,457 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 16:17:03,457 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 16:17:03,457 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 16:17:03,457 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 16:17:03,457 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 16:17:03,457 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 16:17:03,458 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 16:17:03,458 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 16:17:03,477 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states. [2018-09-19 16:17:03,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-19 16:17:03,486 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:17:03,487 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:17:03,489 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:17:03,494 INFO L82 PathProgramCache]: Analyzing trace with hash 152353763, now seen corresponding path program 1 times [2018-09-19 16:17:03,498 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:17:03,499 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:17:03,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:17:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:17:03,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:17:03,744 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:17:03,745 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:17:03,772 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:17:03,773 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-19 16:17:03,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-19 16:17:03,793 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-19 16:17:03,794 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 16:17:03,799 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 2 states. [2018-09-19 16:17:03,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:17:03,835 INFO L93 Difference]: Finished difference Result 226 states and 281 transitions. [2018-09-19 16:17:03,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-19 16:17:03,837 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-09-19 16:17:03,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:17:03,850 INFO L225 Difference]: With dead ends: 226 [2018-09-19 16:17:03,851 INFO L226 Difference]: Without dead ends: 113 [2018-09-19 16:17:03,855 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:17:03,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-09-19 16:17:03,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-09-19 16:17:03,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-19 16:17:03,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2018-09-19 16:17:03,919 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 21 [2018-09-19 16:17:03,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:17:03,920 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2018-09-19 16:17:03,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-19 16:17:03,920 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2018-09-19 16:17:03,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-19 16:17:03,924 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:17:03,924 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:17:03,924 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:17:03,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1572343579, now seen corresponding path program 1 times [2018-09-19 16:17:03,925 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:17:03,926 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:17:03,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:17:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:17:04,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:17:04,205 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:17:04,214 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:17:04,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:17:04,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:17:04,242 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:17:04,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:17:04,308 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:17:04,320 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:17:04,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:17:04,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:17:04,342 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:17:04,342 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:17:04,774 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:17:04,775 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:17:04,792 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:17:04,792 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-19 16:17:04,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-19 16:17:04,795 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-19 16:17:04,795 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-19 16:17:04,795 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 8 states. [2018-09-19 16:17:05,631 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-09-19 16:17:15,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:17:15,600 INFO L93 Difference]: Finished difference Result 142 states and 157 transitions. [2018-09-19 16:17:15,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 16:17:15,601 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-09-19 16:17:15,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:17:15,606 INFO L225 Difference]: With dead ends: 142 [2018-09-19 16:17:15,606 INFO L226 Difference]: Without dead ends: 115 [2018-09-19 16:17:15,607 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-09-19 16:17:15,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-19 16:17:15,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2018-09-19 16:17:15,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-19 16:17:15,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2018-09-19 16:17:15,627 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 34 [2018-09-19 16:17:15,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:17:15,628 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2018-09-19 16:17:15,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-19 16:17:15,628 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2018-09-19 16:17:15,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-19 16:17:15,629 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:17:15,630 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:17:15,630 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:17:15,630 INFO L82 PathProgramCache]: Analyzing trace with hash -858241572, now seen corresponding path program 1 times [2018-09-19 16:17:15,631 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:17:15,631 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:17:15,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:17:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:17:16,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:17:16,648 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:17:16,655 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:17:16,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:17:16,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:17:16,679 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:17:16,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:17:16,728 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:17:16,735 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:17:16,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:17:16,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:17:16,750 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:17:16,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:17:17,017 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:17:17,018 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:17:17,048 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:17:17,048 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-19 16:17:17,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-19 16:17:17,049 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-19 16:17:17,049 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-19 16:17:17,049 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand 8 states. [2018-09-19 16:17:29,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:17:29,419 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2018-09-19 16:17:29,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-19 16:17:29,421 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-09-19 16:17:29,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:17:29,423 INFO L225 Difference]: With dead ends: 125 [2018-09-19 16:17:29,423 INFO L226 Difference]: Without dead ends: 115 [2018-09-19 16:17:29,424 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-09-19 16:17:29,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-19 16:17:29,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2018-09-19 16:17:29,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-19 16:17:29,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2018-09-19 16:17:29,436 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 34 [2018-09-19 16:17:29,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:17:29,437 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2018-09-19 16:17:29,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-19 16:17:29,437 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2018-09-19 16:17:29,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-19 16:17:29,438 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:17:29,438 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:17:29,439 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:17:29,439 INFO L82 PathProgramCache]: Analyzing trace with hash 554353977, now seen corresponding path program 1 times [2018-09-19 16:17:29,440 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:17:29,440 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:17:29,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:17:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:17:30,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:17:33,051 WARN L819 $PredicateComparison]: unable to prove that (and (= (fp.div RNE (fp.sub RNE |c___ieee754_log10_#in~x| |c___ieee754_log10_#in~x|) c_~zero_log10~0) |c___ieee754_log10_#res|) (= (_ +zero 11 53) c_~zero_log10~0)) is different from true [2018-09-19 16:17:33,262 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:17:33,263 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:17:33,286 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:17:33,287 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 16:17:33,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 16:17:33,288 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 16:17:33,288 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=56, Unknown=1, NotChecked=14, Total=90 [2018-09-19 16:17:33,288 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand 10 states. [2018-09-19 16:17:41,640 WARN L178 SmtUtils]: Spent 4.09 s on a formula simplification that was a NOOP. DAG size: 12 [2018-09-19 16:17:44,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:17:44,050 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2018-09-19 16:17:44,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-19 16:17:44,051 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-09-19 16:17:44,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:17:44,055 INFO L225 Difference]: With dead ends: 120 [2018-09-19 16:17:44,055 INFO L226 Difference]: Without dead ends: 113 [2018-09-19 16:17:44,056 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=44, Invalid=141, Unknown=1, NotChecked=24, Total=210 [2018-09-19 16:17:44,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-09-19 16:17:44,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-09-19 16:17:44,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-19 16:17:44,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 124 transitions. [2018-09-19 16:17:44,067 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 124 transitions. Word has length 35 [2018-09-19 16:17:44,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:17:44,067 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 124 transitions. [2018-09-19 16:17:44,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 16:17:44,068 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 124 transitions. [2018-09-19 16:17:44,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-19 16:17:44,069 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:17:44,069 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:17:44,070 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:17:44,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1956023416, now seen corresponding path program 1 times [2018-09-19 16:17:44,070 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:17:44,070 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:17:44,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:17:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:17:44,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:17:44,558 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:17:44,566 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:17:44,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:17:44,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:17:44,590 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:17:44,591 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:17:44,650 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:17:44,655 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:17:44,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:17:44,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:17:44,672 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:17:44,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:17:44,858 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:17:44,859 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:17:44,879 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:17:44,879 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-19 16:17:44,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-19 16:17:44,880 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-19 16:17:44,881 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-19 16:17:44,881 INFO L87 Difference]: Start difference. First operand 113 states and 124 transitions. Second operand 8 states. [2018-09-19 16:17:48,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:17:48,945 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2018-09-19 16:17:48,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-19 16:17:48,947 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-09-19 16:17:48,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:17:48,948 INFO L225 Difference]: With dead ends: 113 [2018-09-19 16:17:48,948 INFO L226 Difference]: Without dead ends: 0 [2018-09-19 16:17:48,950 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-09-19 16:17:48,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-19 16:17:48,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-19 16:17:48,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-19 16:17:48,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-19 16:17:48,951 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-09-19 16:17:48,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:17:48,951 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-19 16:17:48,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-19 16:17:48,951 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-19 16:17:48,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-19 16:17:48,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-19 16:17:49,163 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-09-19 16:17:49,313 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 30 [2018-09-19 16:17:49,572 INFO L429 ceAbstractionStarter]: At program point isnan_doubleENTRY(line 161) the Hoare annotation is: true [2018-09-19 16:17:49,573 INFO L426 ceAbstractionStarter]: For program point isnan_doubleEXIT(line 161) no Hoare annotation was computed. [2018-09-19 16:17:49,573 INFO L426 ceAbstractionStarter]: For program point isnan_doubleFINAL(line 161) no Hoare annotation was computed. [2018-09-19 16:17:49,573 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-19 16:17:49,573 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-09-19 16:17:49,573 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-19 16:17:49,573 INFO L426 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-09-19 16:17:49,574 INFO L426 ceAbstractionStarter]: For program point L126-1(line 126) no Hoare annotation was computed. [2018-09-19 16:17:49,574 INFO L426 ceAbstractionStarter]: For program point L126-2(line 126) no Hoare annotation was computed. [2018-09-19 16:17:49,574 INFO L426 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-09-19 16:17:49,574 INFO L426 ceAbstractionStarter]: For program point L151-1(line 151) no Hoare annotation was computed. [2018-09-19 16:17:49,574 INFO L426 ceAbstractionStarter]: For program point L151-2(line 151) no Hoare annotation was computed. [2018-09-19 16:17:49,574 INFO L426 ceAbstractionStarter]: For program point L151-3(line 151) no Hoare annotation was computed. [2018-09-19 16:17:49,574 INFO L426 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-09-19 16:17:49,575 INFO L426 ceAbstractionStarter]: For program point L139-1(line 139) no Hoare annotation was computed. [2018-09-19 16:17:49,575 INFO L426 ceAbstractionStarter]: For program point L139-2(line 139) no Hoare annotation was computed. [2018-09-19 16:17:49,575 INFO L426 ceAbstractionStarter]: For program point L139-3(line 139) no Hoare annotation was computed. [2018-09-19 16:17:49,575 INFO L426 ceAbstractionStarter]: For program point L131(lines 131 143) no Hoare annotation was computed. [2018-09-19 16:17:49,575 INFO L426 ceAbstractionStarter]: For program point __ieee754_log10EXIT(lines 118 158) no Hoare annotation was computed. [2018-09-19 16:17:49,575 INFO L426 ceAbstractionStarter]: For program point L131-1(lines 118 158) no Hoare annotation was computed. [2018-09-19 16:17:49,576 INFO L426 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-09-19 16:17:49,576 INFO L426 ceAbstractionStarter]: For program point L127-1(line 127) no Hoare annotation was computed. [2018-09-19 16:17:49,576 INFO L426 ceAbstractionStarter]: For program point L127-2(line 127) no Hoare annotation was computed. [2018-09-19 16:17:49,576 INFO L426 ceAbstractionStarter]: For program point L127-3(line 127) no Hoare annotation was computed. [2018-09-19 16:17:49,576 INFO L426 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-09-19 16:17:49,576 INFO L426 ceAbstractionStarter]: For program point L123-1(lines 123 128) no Hoare annotation was computed. [2018-09-19 16:17:49,576 INFO L422 ceAbstractionStarter]: At program point L123-3(lines 123 128) the Hoare annotation is: (or (not (= (_ +zero 11 53) ~zero_log10~0)) (= __ieee754_log10_~x |__ieee754_log10_#in~x|)) [2018-09-19 16:17:49,576 INFO L426 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-09-19 16:17:49,577 INFO L426 ceAbstractionStarter]: For program point L123-4(lines 123 128) no Hoare annotation was computed. [2018-09-19 16:17:49,577 INFO L426 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-09-19 16:17:49,577 INFO L426 ceAbstractionStarter]: For program point L132(lines 132 133) no Hoare annotation was computed. [2018-09-19 16:17:49,577 INFO L426 ceAbstractionStarter]: For program point __ieee754_log10FINAL(lines 118 158) no Hoare annotation was computed. [2018-09-19 16:17:49,577 INFO L426 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-09-19 16:17:49,577 INFO L426 ceAbstractionStarter]: For program point L124-1(line 124) no Hoare annotation was computed. [2018-09-19 16:17:49,577 INFO L426 ceAbstractionStarter]: For program point L124-2(line 124) no Hoare annotation was computed. [2018-09-19 16:17:49,577 INFO L426 ceAbstractionStarter]: For program point L124-3(line 124) no Hoare annotation was computed. [2018-09-19 16:17:49,578 INFO L426 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-09-19 16:17:49,578 INFO L426 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-09-19 16:17:49,578 INFO L426 ceAbstractionStarter]: For program point L141-1(line 141) no Hoare annotation was computed. [2018-09-19 16:17:49,578 INFO L426 ceAbstractionStarter]: For program point L141-2(line 141) no Hoare annotation was computed. [2018-09-19 16:17:49,578 INFO L429 ceAbstractionStarter]: At program point __ieee754_log10ENTRY(lines 118 158) the Hoare annotation is: true [2018-09-19 16:17:49,578 INFO L426 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2018-09-19 16:17:49,578 INFO L426 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-09-19 16:17:49,578 INFO L426 ceAbstractionStarter]: For program point L154-1(line 154) no Hoare annotation was computed. [2018-09-19 16:17:49,578 INFO L426 ceAbstractionStarter]: For program point L154-2(line 154) no Hoare annotation was computed. [2018-09-19 16:17:49,578 INFO L426 ceAbstractionStarter]: For program point L154-3(line 154) no Hoare annotation was computed. [2018-09-19 16:17:49,579 INFO L426 ceAbstractionStarter]: For program point L150-1(lines 150 155) no Hoare annotation was computed. [2018-09-19 16:17:49,579 INFO L422 ceAbstractionStarter]: At program point L150-3(lines 150 155) the Hoare annotation is: (or (exists ((|v_q#valueAsBitvector_15| (_ BitVec 64))) (and (not (bvslt ((_ extract 63 32) |v_q#valueAsBitvector_15|) (_ bv0 32))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_15|) ((_ extract 62 52) |v_q#valueAsBitvector_15|) ((_ extract 51 0) |v_q#valueAsBitvector_15|)) |__ieee754_log10_#in~x|))) (not (= (_ +zero 11 53) ~zero_log10~0))) [2018-09-19 16:17:49,579 INFO L422 ceAbstractionStarter]: At program point L150-4(lines 150 155) the Hoare annotation is: (or (exists ((|v_q#valueAsBitvector_15| (_ BitVec 64))) (and (not (bvslt ((_ extract 63 32) |v_q#valueAsBitvector_15|) (_ bv0 32))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_15|) ((_ extract 62 52) |v_q#valueAsBitvector_15|) ((_ extract 51 0) |v_q#valueAsBitvector_15|)) |__ieee754_log10_#in~x|))) (not (= (_ +zero 11 53) ~zero_log10~0))) [2018-09-19 16:17:49,579 INFO L426 ceAbstractionStarter]: For program point L138-1(lines 138 142) no Hoare annotation was computed. [2018-09-19 16:17:49,579 INFO L422 ceAbstractionStarter]: At program point L138-3(lines 138 142) the Hoare annotation is: (or (and (exists ((|v_q#valueAsBitvector_14| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_q#valueAsBitvector_14|) __ieee754_log10_~hx~1) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_14|) ((_ extract 62 52) |v_q#valueAsBitvector_14|) ((_ extract 51 0) |v_q#valueAsBitvector_14|)) |__ieee754_log10_#in~x|))) (exists ((|v_q#valueAsBitvector_15| (_ BitVec 64))) (and (not (bvslt ((_ extract 63 32) |v_q#valueAsBitvector_15|) (_ bv0 32))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_15|) ((_ extract 62 52) |v_q#valueAsBitvector_15|) ((_ extract 51 0) |v_q#valueAsBitvector_15|)) |__ieee754_log10_#in~x|)))) (not (= (_ +zero 11 53) ~zero_log10~0))) [2018-09-19 16:17:49,579 INFO L426 ceAbstractionStarter]: For program point L134(lines 134 135) no Hoare annotation was computed. [2018-09-19 16:17:49,579 INFO L429 ceAbstractionStarter]: At program point L35-3(lines 35 40) the Hoare annotation is: true [2018-09-19 16:17:49,580 INFO L426 ceAbstractionStarter]: For program point L35-4(lines 35 40) no Hoare annotation was computed. [2018-09-19 16:17:49,580 INFO L426 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-09-19 16:17:49,580 INFO L426 ceAbstractionStarter]: For program point __ieee754_logEXIT(lines 30 109) no Hoare annotation was computed. [2018-09-19 16:17:49,580 INFO L426 ceAbstractionStarter]: For program point L44(lines 44 45) no Hoare annotation was computed. [2018-09-19 16:17:49,580 INFO L426 ceAbstractionStarter]: For program point L69(lines 69 85) no Hoare annotation was computed. [2018-09-19 16:17:49,580 INFO L426 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-09-19 16:17:49,580 INFO L426 ceAbstractionStarter]: For program point L36-1(line 36) no Hoare annotation was computed. [2018-09-19 16:17:49,580 INFO L426 ceAbstractionStarter]: For program point L36-2(line 36) no Hoare annotation was computed. [2018-09-19 16:17:49,580 INFO L426 ceAbstractionStarter]: For program point L36-3(line 36) no Hoare annotation was computed. [2018-09-19 16:17:49,581 INFO L426 ceAbstractionStarter]: For program point L61-1(lines 61 66) no Hoare annotation was computed. [2018-09-19 16:17:49,581 INFO L429 ceAbstractionStarter]: At program point L61-3(lines 61 66) the Hoare annotation is: true [2018-09-19 16:17:49,581 INFO L426 ceAbstractionStarter]: For program point L61-4(lines 61 66) no Hoare annotation was computed. [2018-09-19 16:17:49,581 INFO L426 ceAbstractionStarter]: For program point L53(line 53) no Hoare annotation was computed. [2018-09-19 16:17:49,581 INFO L426 ceAbstractionStarter]: For program point L53-1(line 53) no Hoare annotation was computed. [2018-09-19 16:17:49,581 INFO L426 ceAbstractionStarter]: For program point L53-2(line 53) no Hoare annotation was computed. [2018-09-19 16:17:49,581 INFO L426 ceAbstractionStarter]: For program point L70(lines 70 77) no Hoare annotation was computed. [2018-09-19 16:17:49,581 INFO L426 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-09-19 16:17:49,581 INFO L426 ceAbstractionStarter]: For program point L62(line 62) no Hoare annotation was computed. [2018-09-19 16:17:49,582 INFO L426 ceAbstractionStarter]: For program point L62-1(line 62) no Hoare annotation was computed. [2018-09-19 16:17:49,582 INFO L426 ceAbstractionStarter]: For program point L62-2(line 62) no Hoare annotation was computed. [2018-09-19 16:17:49,582 INFO L426 ceAbstractionStarter]: For program point L62-3(line 62) no Hoare annotation was computed. [2018-09-19 16:17:49,582 INFO L426 ceAbstractionStarter]: For program point L79(lines 79 84) no Hoare annotation was computed. [2018-09-19 16:17:49,582 INFO L426 ceAbstractionStarter]: For program point L46(lines 46 47) no Hoare annotation was computed. [2018-09-19 16:17:49,582 INFO L429 ceAbstractionStarter]: At program point __ieee754_logENTRY(lines 30 109) the Hoare annotation is: true [2018-09-19 16:17:49,582 INFO L426 ceAbstractionStarter]: For program point __ieee754_logFINAL(lines 30 109) no Hoare annotation was computed. [2018-09-19 16:17:49,582 INFO L426 ceAbstractionStarter]: For program point L104(lines 104 107) no Hoare annotation was computed. [2018-09-19 16:17:49,582 INFO L426 ceAbstractionStarter]: For program point L71(lines 71 76) no Hoare annotation was computed. [2018-09-19 16:17:49,583 INFO L426 ceAbstractionStarter]: For program point L38(line 38) no Hoare annotation was computed. [2018-09-19 16:17:49,583 INFO L426 ceAbstractionStarter]: For program point L38-1(line 38) no Hoare annotation was computed. [2018-09-19 16:17:49,583 INFO L426 ceAbstractionStarter]: For program point L38-2(line 38) no Hoare annotation was computed. [2018-09-19 16:17:49,583 INFO L426 ceAbstractionStarter]: For program point L96(lines 96 108) no Hoare annotation was computed. [2018-09-19 16:17:49,583 INFO L426 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2018-09-19 16:17:49,583 INFO L426 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-09-19 16:17:49,583 INFO L426 ceAbstractionStarter]: For program point L39-1(line 39) no Hoare annotation was computed. [2018-09-19 16:17:49,583 INFO L426 ceAbstractionStarter]: For program point L39-2(line 39) no Hoare annotation was computed. [2018-09-19 16:17:49,584 INFO L426 ceAbstractionStarter]: For program point L39-3(line 39) no Hoare annotation was computed. [2018-09-19 16:17:49,584 INFO L426 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-09-19 16:17:49,585 INFO L426 ceAbstractionStarter]: For program point L98(lines 98 102) no Hoare annotation was computed. [2018-09-19 16:17:49,585 INFO L426 ceAbstractionStarter]: For program point L65(line 65) no Hoare annotation was computed. [2018-09-19 16:17:49,585 INFO L426 ceAbstractionStarter]: For program point L65-1(line 65) no Hoare annotation was computed. [2018-09-19 16:17:49,585 INFO L426 ceAbstractionStarter]: For program point L65-2(line 65) no Hoare annotation was computed. [2018-09-19 16:17:49,585 INFO L426 ceAbstractionStarter]: For program point L65-3(line 65) no Hoare annotation was computed. [2018-09-19 16:17:49,585 INFO L426 ceAbstractionStarter]: For program point L50-1(lines 50 54) no Hoare annotation was computed. [2018-09-19 16:17:49,585 INFO L429 ceAbstractionStarter]: At program point L50-3(lines 50 54) the Hoare annotation is: true [2018-09-19 16:17:49,586 INFO L426 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-09-19 16:17:49,586 INFO L426 ceAbstractionStarter]: For program point L51-1(line 51) no Hoare annotation was computed. [2018-09-19 16:17:49,586 INFO L426 ceAbstractionStarter]: For program point L51-2(line 51) no Hoare annotation was computed. [2018-09-19 16:17:49,586 INFO L426 ceAbstractionStarter]: For program point L51-3(line 51) no Hoare annotation was computed. [2018-09-19 16:17:49,586 INFO L426 ceAbstractionStarter]: For program point L43(lines 43 55) no Hoare annotation was computed. [2018-09-19 16:17:49,586 INFO L426 ceAbstractionStarter]: For program point L43-1(lines 30 109) no Hoare annotation was computed. [2018-09-19 16:17:49,587 INFO L426 ceAbstractionStarter]: For program point L35-1(lines 35 40) no Hoare annotation was computed. [2018-09-19 16:17:49,587 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-19 16:17:49,587 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (= (_ +zero 11 53) ~zero_log10~0) [2018-09-19 16:17:49,587 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-19 16:17:49,587 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-19 16:17:49,587 INFO L426 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-09-19 16:17:49,588 INFO L422 ceAbstractionStarter]: At program point L174(line 174) 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_log10~0))) [2018-09-19 16:17:49,588 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 163 180) the Hoare annotation is: true [2018-09-19 16:17:49,589 INFO L426 ceAbstractionStarter]: For program point L174-1(lines 174 177) no Hoare annotation was computed. [2018-09-19 16:17:49,589 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 163 180) no Hoare annotation was computed. [2018-09-19 16:17:49,589 INFO L422 ceAbstractionStarter]: At program point L171(line 171) the Hoare annotation is: (or (= (fp.div RNE (fp.neg ((_ to_fp 11 53) RNE 1.0)) (_ +zero 11 53)) main_~x~0) (not (= (_ +zero 11 53) ~zero_log10~0))) [2018-09-19 16:17:49,589 INFO L426 ceAbstractionStarter]: For program point L171-1(line 171) no Hoare annotation was computed. [2018-09-19 16:17:49,589 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 163 180) no Hoare annotation was computed. [2018-09-19 16:17:49,590 INFO L426 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2018-09-19 16:17:49,596 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:17:49,597 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:17:49,597 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:17:49,597 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:17:49,598 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:49,598 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:49,598 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:49,598 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:49,606 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:17:49,606 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:17:49,607 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:17:49,607 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:17:49,607 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:49,608 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:49,608 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:49,608 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:49,610 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:49,610 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:49,610 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:49,610 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:49,611 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:49,611 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:49,611 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:49,612 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:49,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 04:17:49 BoogieIcfgContainer [2018-09-19 16:17:49,614 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 16:17:49,615 INFO L168 Benchmark]: Toolchain (without parser) took 79622.57 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 724.6 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -393.6 MB). Peak memory consumption was 331.0 MB. Max. memory is 7.1 GB. [2018-09-19 16:17:49,617 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-09-19 16:17:49,617 INFO L168 Benchmark]: CACSL2BoogieTranslator took 559.60 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:17:49,618 INFO L168 Benchmark]: Boogie Preprocessor took 95.75 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:17:49,619 INFO L168 Benchmark]: RCFGBuilder took 32730.17 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 724.6 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -745.9 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. [2018-09-19 16:17:49,620 INFO L168 Benchmark]: TraceAbstraction took 46229.77 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 331.2 MB). Peak memory consumption was 331.2 MB. Max. memory is 7.1 GB. [2018-09-19 16:17:49,625 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 559.60 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 95.75 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 32730.17 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 724.6 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -745.9 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 46229.77 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 331.2 MB). Peak memory consumption was 331.2 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_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_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,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_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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: 138]: Loop Invariant [2018-09-19 16:17:49,643 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:17:49,643 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:17:49,643 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:17:49,643 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:17:49,645 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:49,646 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:49,646 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:49,646 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:49,647 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:17:49,647 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:17:49,647 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:17:49,648 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_14,QUANTIFIED] [2018-09-19 16:17:49,648 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:49,648 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:49,648 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:49,648 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] Derived loop invariant: ((\exists v_q#valueAsBitvector_14 : bv64 :: v_q#valueAsBitvector_14[63:32] == hx && ~fp~LONGDOUBLE(v_q#valueAsBitvector_14[63:63], v_q#valueAsBitvector_14[62:52], v_q#valueAsBitvector_14[51:0]) == \old(x)) && (\exists v_q#valueAsBitvector_15 : bv64 :: !~bvslt32(v_q#valueAsBitvector_15[63:32], 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_15[63:63], v_q#valueAsBitvector_15[62:52], v_q#valueAsBitvector_15[51:0]) == \old(x))) || !(~Pluszero~LONGDOUBLE() == zero_log10) - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 150]: Loop Invariant [2018-09-19 16:17:49,650 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:49,650 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:49,650 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:49,650 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:49,651 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:49,651 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:49,651 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:49,652 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] Derived loop invariant: (\exists v_q#valueAsBitvector_15 : bv64 :: !~bvslt32(v_q#valueAsBitvector_15[63:32], 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_15[63:63], v_q#valueAsBitvector_15[62:52], v_q#valueAsBitvector_15[51:0]) == \old(x)) || !(~Pluszero~LONGDOUBLE() == zero_log10) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: !(~Pluszero~LONGDOUBLE() == zero_log10) || x == \old(x) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 117 locations, 1 error locations. SAFE Result, 46.1s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 38.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 582 SDtfs, 242 SDslu, 2441 SDs, 0 SdLazy, 353 SolverSat, 25 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 28.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 10.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred 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, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 28 PreInvPairs, 41 NumberOfFragments, 149 HoareAnnotationTreeSize, 28 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 122 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 165 ConstructedInterpolants, 60 QuantifiedInterpolants, 49171 SizeOfPredicates, 27 NumberOfNonLiveVariables, 590 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...