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_0970a_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 16:15:59,065 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 16:15:59,067 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 16:15:59,085 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 16:15:59,086 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 16:15:59,087 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 16:15:59,089 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 16:15:59,092 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 16:15:59,094 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 16:15:59,095 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 16:15:59,097 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 16:15:59,097 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 16:15:59,098 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 16:15:59,099 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 16:15:59,100 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 16:15:59,101 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 16:15:59,102 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 16:15:59,104 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 16:15:59,106 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 16:15:59,108 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 16:15:59,109 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 16:15:59,111 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 16:15:59,113 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 16:15:59,114 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 16:15:59,114 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 16:15:59,115 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 16:15:59,116 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 16:15:59,117 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 16:15:59,118 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 16:15:59,123 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 16:15:59,123 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 16:15:59,124 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 16:15:59,124 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 16:15:59,124 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 16:15:59,126 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 16:15:59,127 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 16:15:59,128 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:59,162 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 16:15:59,163 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 16:15:59,165 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 16:15:59,165 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 16:15:59,165 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 16:15:59,166 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 16:15:59,166 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 16:15:59,166 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 16:15:59,166 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 16:15:59,167 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 16:15:59,167 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 16:15:59,167 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 16:15:59,167 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 16:15:59,167 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 16:15:59,167 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 16:15:59,168 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 16:15:59,168 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 16:15:59,168 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 16:15:59,168 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 16:15:59,170 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 16:15:59,170 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 16:15:59,170 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 16:15:59,170 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 16:15:59,171 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 16:15:59,171 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 16:15:59,171 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 16:15:59,171 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 16:15:59,171 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 16:15:59,172 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 16:15:59,172 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 16:15:59,172 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 16:15:59,172 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 16:15:59,229 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 16:15:59,247 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 16:15:59,250 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 16:15:59,252 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 16:15:59,252 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 16:15:59,253 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_0970a_true-unreach-call.c [2018-09-19 16:15:59,588 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c71797f4e/90b0c16e01964143b626e3fa8c228ba0/FLAG146b2f26e [2018-09-19 16:15:59,757 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 16:15:59,758 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_0970a_true-unreach-call.c [2018-09-19 16:15:59,767 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c71797f4e/90b0c16e01964143b626e3fa8c228ba0/FLAG146b2f26e [2018-09-19 16:15:59,781 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c71797f4e/90b0c16e01964143b626e3fa8c228ba0 [2018-09-19 16:15:59,790 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 16:15:59,794 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 16:15:59,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 16:15:59,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 16:15:59,802 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 16:15:59,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:15:59" (1/1) ... [2018-09-19 16:15:59,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b14f91f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:15:59, skipping insertion in model container [2018-09-19 16:15:59,806 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:15:59" (1/1) ... [2018-09-19 16:15:59,820 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 16:16:00,119 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:16:00,138 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 16:16:00,204 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:16:00,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:16:00 WrapperNode [2018-09-19 16:16:00,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 16:16:00,259 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 16:16:00,259 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 16:16:00,259 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 16:16:00,275 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:00" (1/1) ... [2018-09-19 16:16:00,276 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:00" (1/1) ... [2018-09-19 16:16:00,293 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:00" (1/1) ... [2018-09-19 16:16:00,293 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:00" (1/1) ... [2018-09-19 16:16:00,309 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:00" (1/1) ... [2018-09-19 16:16:00,317 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:00" (1/1) ... [2018-09-19 16:16:00,322 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:00" (1/1) ... [2018-09-19 16:16:00,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 16:16:00,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 16:16:00,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 16:16:00,329 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 16:16:00,330 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:16:00" (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:00,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 16:16:00,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 16:16:00,483 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_log [2018-09-19 16:16:00,483 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_log10 [2018-09-19 16:16:00,484 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-09-19 16:16:00,484 INFO L138 BoogieDeclarations]: Found implementation of procedure isfinite_double [2018-09-19 16:16:00,484 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 16:16:00,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 16:16:00,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-19 16:16:00,484 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_log [2018-09-19 16:16:00,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-19 16:16:00,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-19 16:16:00,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-19 16:16:00,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-19 16:16:00,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-19 16:16:00,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-19 16:16:00,486 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_log10 [2018-09-19 16:16:00,486 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-09-19 16:16:00,486 INFO L130 BoogieDeclarations]: Found specification of procedure isfinite_double [2018-09-19 16:16:00,486 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 16:16:00,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 16:16:00,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 16:16:00,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-19 16:16:00,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-19 16:16:00,758 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:16:00,809 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:16:00,975 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:16:01,005 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:16:01,026 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:16:06,159 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:16:06,179 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:16:06,495 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:16:08,764 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:16:14,522 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:16:14,532 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:16:14,635 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:16:33,167 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:16:33,182 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:16:33,231 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 16:16:33,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:16:33 BoogieIcfgContainer [2018-09-19 16:16:33,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 16:16:33,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 16:16:33,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 16:16:33,236 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 16:16:33,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 04:15:59" (1/3) ... [2018-09-19 16:16:33,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473b446d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:16:33, skipping insertion in model container [2018-09-19 16:16:33,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:16:00" (2/3) ... [2018-09-19 16:16:33,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473b446d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:16:33, skipping insertion in model container [2018-09-19 16:16:33,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:16:33" (3/3) ... [2018-09-19 16:16:33,241 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0970a_true-unreach-call.c [2018-09-19 16:16:33,251 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 16:16:33,261 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 16:16:33,318 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 16:16:33,319 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 16:16:33,319 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 16:16:33,319 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 16:16:33,320 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 16:16:33,320 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 16:16:33,320 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 16:16:33,320 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 16:16:33,320 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 16:16:33,359 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2018-09-19 16:16:33,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-19 16:16:33,376 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:16:33,378 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] [2018-09-19 16:16:33,381 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:16:33,387 INFO L82 PathProgramCache]: Analyzing trace with hash 47096371, now seen corresponding path program 1 times [2018-09-19 16:16:33,392 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:16:33,393 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) [2018-09-19 16:16:33,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-19 16:16:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:16:33,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:16:33,596 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:33,596 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:16:33,621 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:16:33,622 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-19 16:16:33,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-19 16:16:33,643 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-19 16:16:33,644 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 16:16:33,646 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 2 states. [2018-09-19 16:16:33,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:16:33,699 INFO L93 Difference]: Finished difference Result 263 states and 326 transitions. [2018-09-19 16:16:33,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-19 16:16:33,701 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-09-19 16:16:33,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:16:33,715 INFO L225 Difference]: With dead ends: 263 [2018-09-19 16:16:33,715 INFO L226 Difference]: Without dead ends: 131 [2018-09-19 16:16:33,723 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 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:16:33,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-19 16:16:33,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-09-19 16:16:33,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-19 16:16:33,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 146 transitions. [2018-09-19 16:16:33,803 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 146 transitions. Word has length 23 [2018-09-19 16:16:33,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:16:33,804 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 146 transitions. [2018-09-19 16:16:33,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-19 16:16:33,804 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 146 transitions. [2018-09-19 16:16:33,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-19 16:16:33,806 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:16:33,807 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] [2018-09-19 16:16:33,807 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:16:33,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1932889769, now seen corresponding path program 1 times [2018-09-19 16:16:33,808 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:16:33,809 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) [2018-09-19 16:16:33,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-19 16:16:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:16:34,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:16:34,052 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:34,052 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:16:34,066 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:16:34,066 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-19 16:16:34,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-19 16:16:34,068 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-19 16:16:34,068 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-19 16:16:34,069 INFO L87 Difference]: Start difference. First operand 131 states and 146 transitions. Second operand 3 states. [2018-09-19 16:16:34,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:16:34,130 INFO L93 Difference]: Finished difference Result 239 states and 268 transitions. [2018-09-19 16:16:34,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-19 16:16:34,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-09-19 16:16:34,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:16:34,133 INFO L225 Difference]: With dead ends: 239 [2018-09-19 16:16:34,134 INFO L226 Difference]: Without dead ends: 131 [2018-09-19 16:16:34,136 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-19 16:16:34,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-19 16:16:34,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-09-19 16:16:34,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-19 16:16:34,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 145 transitions. [2018-09-19 16:16:34,148 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 145 transitions. Word has length 36 [2018-09-19 16:16:34,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:16:34,149 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 145 transitions. [2018-09-19 16:16:34,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-19 16:16:34,149 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 145 transitions. [2018-09-19 16:16:34,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-19 16:16:34,151 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:16:34,151 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, 1, 1, 1, 1, 1, 1] [2018-09-19 16:16:34,152 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:16:34,152 INFO L82 PathProgramCache]: Analyzing trace with hash 678677723, now seen corresponding path program 1 times [2018-09-19 16:16:34,153 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:16:34,153 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:16:34,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:16:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:16:34,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:16:34,678 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:34,685 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:34,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:16:34,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:16:34,709 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:34,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:16:34,794 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:34,801 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:34,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:16:34,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:16:34,818 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:34,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:16:35,229 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:35,230 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:16:35,246 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:16:35,246 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 16:16:35,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 16:16:35,249 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 16:16:35,249 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-19 16:16:35,250 INFO L87 Difference]: Start difference. First operand 131 states and 145 transitions. Second operand 9 states. [2018-09-19 16:16:36,025 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-09-19 16:16:36,891 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-19 16:16:38,079 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-19 16:16:46,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:16:46,401 INFO L93 Difference]: Finished difference Result 160 states and 175 transitions. [2018-09-19 16:16:46,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 16:16:46,403 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2018-09-19 16:16:46,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:16:46,408 INFO L225 Difference]: With dead ends: 160 [2018-09-19 16:16:46,408 INFO L226 Difference]: Without dead ends: 133 [2018-09-19 16:16:46,409 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-09-19 16:16:46,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-09-19 16:16:46,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-09-19 16:16:46,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-19 16:16:46,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 144 transitions. [2018-09-19 16:16:46,427 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 144 transitions. Word has length 52 [2018-09-19 16:16:46,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:16:46,428 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 144 transitions. [2018-09-19 16:16:46,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 16:16:46,428 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 144 transitions. [2018-09-19 16:16:46,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-19 16:16:46,430 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:16:46,430 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, 1, 1, 1, 1, 1, 1] [2018-09-19 16:16:46,431 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:16:46,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1751907428, now seen corresponding path program 1 times [2018-09-19 16:16:46,432 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:16:46,432 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:46,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:16:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:16:47,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:16:47,765 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:16:47,768 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:16:47,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 27 treesize of output 35 [2018-09-19 16:16:47,782 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:16:47,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-19 16:16:47,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:16:47,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:16:47,849 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:47,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-19 16:16:48,113 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:16:48,115 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:16:48,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 54 treesize of output 56 [2018-09-19 16:16:48,130 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:16:48,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-09-19 16:16:48,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:16:48,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:16:48,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-19 16:16:48,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-09-19 16:16:48,321 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 35 treesize of output 27 [2018-09-19 16:16:48,375 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:16:48,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-09-19 16:16:48,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:16:48,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:16:48,436 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:48,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-09-19 16:16:48,704 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:48,705 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:16:48,734 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:16:48,734 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 16:16:48,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 16:16:48,735 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 16:16:48,735 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-09-19 16:16:48,736 INFO L87 Difference]: Start difference. First operand 131 states and 144 transitions. Second operand 11 states. [2018-09-19 16:16:49,939 WARN L178 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-09-19 16:16:50,774 WARN L178 SmtUtils]: Spent 708.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-19 16:17:00,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:17:00,127 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2018-09-19 16:17:00,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 16:17:00,128 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-09-19 16:17:00,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:17:00,130 INFO L225 Difference]: With dead ends: 143 [2018-09-19 16:17:00,130 INFO L226 Difference]: Without dead ends: 133 [2018-09-19 16:17:00,131 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2018-09-19 16:17:00,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-09-19 16:17:00,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-09-19 16:17:00,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-19 16:17:00,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2018-09-19 16:17:00,143 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 52 [2018-09-19 16:17:00,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:17:00,143 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2018-09-19 16:17:00,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 16:17:00,144 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2018-09-19 16:17:00,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-19 16:17:00,145 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:17:00,145 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, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:17:00,146 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:17:00,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1291923205, now seen corresponding path program 1 times [2018-09-19 16:17:00,147 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:17:00,147 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:00,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:17:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:17:01,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:17:04,597 WARN L178 SmtUtils]: Spent 3.05 s on a formula simplification that was a NOOP. DAG size: 11 [2018-09-19 16:17:05,944 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:05,945 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:17:05,976 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:17:05,976 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-19 16:17:05,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-19 16:17:05,977 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-19 16:17:05,977 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-19 16:17:05,977 INFO L87 Difference]: Start difference. First operand 131 states and 143 transitions. Second operand 8 states. [2018-09-19 16:17:11,733 WARN L178 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-19 16:17:13,045 WARN L178 SmtUtils]: Spent 506.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-19 16:17:15,246 WARN L178 SmtUtils]: Spent 997.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-19 16:17:18,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:17:18,614 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2018-09-19 16:17:18,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-19 16:17:18,615 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-09-19 16:17:18,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:17:18,618 INFO L225 Difference]: With dead ends: 138 [2018-09-19 16:17:18,618 INFO L226 Difference]: Without dead ends: 131 [2018-09-19 16:17:18,619 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-09-19 16:17:18,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-19 16:17:18,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-09-19 16:17:18,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-19 16:17:18,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2018-09-19 16:17:18,630 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 53 [2018-09-19 16:17:18,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:17:18,631 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2018-09-19 16:17:18,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-19 16:17:18,631 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2018-09-19 16:17:18,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-19 16:17:18,633 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:17:18,634 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:17:18,634 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:17:18,634 INFO L82 PathProgramCache]: Analyzing trace with hash -675636664, now seen corresponding path program 1 times [2018-09-19 16:17:18,635 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:17:18,635 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-09-19 16:17:18,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:17:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:17:19,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:17:19,161 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:19,168 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:19,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:17:19,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:17:19,191 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:19,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:17:19,251 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:19,256 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:19,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:17:19,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:17:19,297 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:19,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:17:19,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:17:19,657 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:17:19,678 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:17:19,678 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 16:17:19,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 16:17:19,679 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 16:17:19,679 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-19 16:17:19,680 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand 10 states. [2018-09-19 16:17:20,626 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-19 16:17:21,258 WARN L178 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-19 16:17:22,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:17:22,982 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2018-09-19 16:17:22,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 16:17:22,983 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2018-09-19 16:17:22,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:17:22,984 INFO L225 Difference]: With dead ends: 131 [2018-09-19 16:17:22,984 INFO L226 Difference]: Without dead ends: 0 [2018-09-19 16:17:22,986 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-09-19 16:17:22,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-19 16:17:22,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-19 16:17:22,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-19 16:17:22,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-19 16:17:22,987 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2018-09-19 16:17:22,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:17:22,987 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-19 16:17:22,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 16:17:22,987 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-19 16:17:22,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-19 16:17:22,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-19 16:17:23,322 WARN L178 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2018-09-19 16:17:23,541 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-09-19 16:17:24,694 WARN L178 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 17 DAG size of output: 17 [2018-09-19 16:17:24,849 INFO L429 ceAbstractionStarter]: At program point isnan_doubleENTRY(line 161) the Hoare annotation is: true [2018-09-19 16:17:24,850 INFO L426 ceAbstractionStarter]: For program point isnan_doubleEXIT(line 161) no Hoare annotation was computed. [2018-09-19 16:17:24,850 INFO L426 ceAbstractionStarter]: For program point isnan_doubleFINAL(line 161) no Hoare annotation was computed. [2018-09-19 16:17:24,850 INFO L426 ceAbstractionStarter]: For program point L165-4(lines 165 169) no Hoare annotation was computed. [2018-09-19 16:17:24,850 INFO L426 ceAbstractionStarter]: For program point isfinite_doubleFINAL(lines 163 171) no Hoare annotation was computed. [2018-09-19 16:17:24,850 INFO L426 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-09-19 16:17:24,850 INFO L426 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2018-09-19 16:17:24,850 INFO L426 ceAbstractionStarter]: For program point L168-1(line 168) no Hoare annotation was computed. [2018-09-19 16:17:24,850 INFO L426 ceAbstractionStarter]: For program point isfinite_doubleEXIT(lines 163 171) no Hoare annotation was computed. [2018-09-19 16:17:24,851 INFO L426 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-09-19 16:17:24,851 INFO L426 ceAbstractionStarter]: For program point L168-2(line 168) no Hoare annotation was computed. [2018-09-19 16:17:24,851 INFO L426 ceAbstractionStarter]: For program point L166-1(line 166) no Hoare annotation was computed. [2018-09-19 16:17:24,851 INFO L426 ceAbstractionStarter]: For program point L166-2(line 166) no Hoare annotation was computed. [2018-09-19 16:17:24,851 INFO L426 ceAbstractionStarter]: For program point L165-1(lines 165 169) no Hoare annotation was computed. [2018-09-19 16:17:24,851 INFO L429 ceAbstractionStarter]: At program point isfinite_doubleENTRY(lines 163 171) the Hoare annotation is: true [2018-09-19 16:17:24,851 INFO L426 ceAbstractionStarter]: For program point L166-3(line 166) no Hoare annotation was computed. [2018-09-19 16:17:24,852 INFO L429 ceAbstractionStarter]: At program point L165-3(lines 165 169) the Hoare annotation is: true [2018-09-19 16:17:24,852 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-19 16:17:24,852 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-09-19 16:17:24,852 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-19 16:17:24,852 INFO L426 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-09-19 16:17:24,852 INFO L426 ceAbstractionStarter]: For program point L126-1(line 126) no Hoare annotation was computed. [2018-09-19 16:17:24,852 INFO L426 ceAbstractionStarter]: For program point L126-2(line 126) no Hoare annotation was computed. [2018-09-19 16:17:24,852 INFO L426 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-09-19 16:17:24,852 INFO L426 ceAbstractionStarter]: For program point L151-1(line 151) no Hoare annotation was computed. [2018-09-19 16:17:24,853 INFO L426 ceAbstractionStarter]: For program point L151-2(line 151) no Hoare annotation was computed. [2018-09-19 16:17:24,853 INFO L426 ceAbstractionStarter]: For program point L151-3(line 151) no Hoare annotation was computed. [2018-09-19 16:17:24,853 INFO L426 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-09-19 16:17:24,853 INFO L426 ceAbstractionStarter]: For program point L139-1(line 139) no Hoare annotation was computed. [2018-09-19 16:17:24,853 INFO L426 ceAbstractionStarter]: For program point L139-2(line 139) no Hoare annotation was computed. [2018-09-19 16:17:24,853 INFO L426 ceAbstractionStarter]: For program point L139-3(line 139) no Hoare annotation was computed. [2018-09-19 16:17:24,853 INFO L426 ceAbstractionStarter]: For program point L131(lines 131 143) no Hoare annotation was computed. [2018-09-19 16:17:24,853 INFO L426 ceAbstractionStarter]: For program point __ieee754_log10EXIT(lines 118 158) no Hoare annotation was computed. [2018-09-19 16:17:24,853 INFO L426 ceAbstractionStarter]: For program point L131-1(lines 118 158) no Hoare annotation was computed. [2018-09-19 16:17:24,854 INFO L426 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-09-19 16:17:24,854 INFO L426 ceAbstractionStarter]: For program point L127-1(line 127) no Hoare annotation was computed. [2018-09-19 16:17:24,854 INFO L426 ceAbstractionStarter]: For program point L127-2(line 127) no Hoare annotation was computed. [2018-09-19 16:17:24,854 INFO L426 ceAbstractionStarter]: For program point L127-3(line 127) no Hoare annotation was computed. [2018-09-19 16:17:24,854 INFO L426 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-09-19 16:17:24,854 INFO L426 ceAbstractionStarter]: For program point L123-1(lines 123 128) no Hoare annotation was computed. [2018-09-19 16:17:24,854 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:24,854 INFO L426 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-09-19 16:17:24,854 INFO L426 ceAbstractionStarter]: For program point L123-4(lines 123 128) no Hoare annotation was computed. [2018-09-19 16:17:24,854 INFO L426 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-09-19 16:17:24,855 INFO L426 ceAbstractionStarter]: For program point L132(lines 132 133) no Hoare annotation was computed. [2018-09-19 16:17:24,855 INFO L426 ceAbstractionStarter]: For program point __ieee754_log10FINAL(lines 118 158) no Hoare annotation was computed. [2018-09-19 16:17:24,855 INFO L426 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-09-19 16:17:24,855 INFO L426 ceAbstractionStarter]: For program point L124-1(line 124) no Hoare annotation was computed. [2018-09-19 16:17:24,855 INFO L426 ceAbstractionStarter]: For program point L124-2(line 124) no Hoare annotation was computed. [2018-09-19 16:17:24,855 INFO L426 ceAbstractionStarter]: For program point L124-3(line 124) no Hoare annotation was computed. [2018-09-19 16:17:24,855 INFO L426 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-09-19 16:17:24,855 INFO L426 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-09-19 16:17:24,856 INFO L426 ceAbstractionStarter]: For program point L141-1(line 141) no Hoare annotation was computed. [2018-09-19 16:17:24,856 INFO L426 ceAbstractionStarter]: For program point L141-2(line 141) no Hoare annotation was computed. [2018-09-19 16:17:24,856 INFO L429 ceAbstractionStarter]: At program point __ieee754_log10ENTRY(lines 118 158) the Hoare annotation is: true [2018-09-19 16:17:24,856 INFO L426 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2018-09-19 16:17:24,856 INFO L426 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-09-19 16:17:24,856 INFO L426 ceAbstractionStarter]: For program point L154-1(line 154) no Hoare annotation was computed. [2018-09-19 16:17:24,856 INFO L426 ceAbstractionStarter]: For program point L154-2(line 154) no Hoare annotation was computed. [2018-09-19 16:17:24,856 INFO L426 ceAbstractionStarter]: For program point L154-3(line 154) no Hoare annotation was computed. [2018-09-19 16:17:24,857 INFO L426 ceAbstractionStarter]: For program point L150-1(lines 150 155) no Hoare annotation was computed. [2018-09-19 16:17:24,857 INFO L422 ceAbstractionStarter]: At program point L150-3(lines 150 155) the Hoare annotation is: (or (and (= __ieee754_log10_~x |__ieee754_log10_#in~x|) (exists ((|v_q#valueAsBitvector_15| (_ BitVec 64))) (and (not (bvslt ((_ extract 63 32) |v_q#valueAsBitvector_15|) (_ bv1048576 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|)))) (exists ((|v_q#valueAsBitvector_18| (_ BitVec 64))) (let ((.cse0 ((_ extract 63 32) |v_q#valueAsBitvector_18|))) (and (bvslt .cse0 (_ bv1048576 32)) (not (bvslt .cse0 (_ bv0 32))) (= |__ieee754_log10_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_18|) ((_ extract 62 52) |v_q#valueAsBitvector_18|) ((_ extract 51 0) |v_q#valueAsBitvector_18|)))))) (not (= (_ +zero 11 53) ~zero_log10~0))) [2018-09-19 16:17:24,857 INFO L422 ceAbstractionStarter]: At program point L150-4(lines 150 155) the Hoare annotation is: (or (exists ((|v_q#valueAsBitvector_18| (_ BitVec 64))) (let ((.cse0 ((_ extract 63 32) |v_q#valueAsBitvector_18|))) (and (bvslt .cse0 (_ bv1048576 32)) (not (bvslt .cse0 (_ bv0 32))) (= |__ieee754_log10_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_18|) ((_ extract 62 52) |v_q#valueAsBitvector_18|) ((_ extract 51 0) |v_q#valueAsBitvector_18|)))))) (exists ((|v_q#valueAsBitvector_15| (_ BitVec 64))) (and (not (bvslt ((_ extract 63 32) |v_q#valueAsBitvector_15|) (_ bv1048576 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:24,857 INFO L426 ceAbstractionStarter]: For program point L138-1(lines 138 142) no Hoare annotation was computed. [2018-09-19 16:17:24,857 INFO L422 ceAbstractionStarter]: At program point L138-3(lines 138 142) the Hoare annotation is: (or (and (exists ((|v_q#valueAsBitvector_16| (_ BitVec 64))) (and (= __ieee754_log10_~lx~1 ((_ extract 31 0) |v_q#valueAsBitvector_16|)) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_16|) ((_ extract 62 52) |v_q#valueAsBitvector_16|) ((_ extract 51 0) |v_q#valueAsBitvector_16|)) |__ieee754_log10_#in~x|) (= __ieee754_log10_~hx~1 ((_ extract 63 32) |v_q#valueAsBitvector_16|)))) (exists ((|v_q#valueAsBitvector_18| (_ BitVec 64))) (let ((.cse0 ((_ extract 63 32) |v_q#valueAsBitvector_18|))) (and (bvslt .cse0 (_ bv1048576 32)) (not (bvslt .cse0 (_ bv0 32))) (= |__ieee754_log10_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_18|) ((_ extract 62 52) |v_q#valueAsBitvector_18|) ((_ extract 51 0) |v_q#valueAsBitvector_18|))))))) (not (= (_ +zero 11 53) ~zero_log10~0))) [2018-09-19 16:17:24,858 INFO L426 ceAbstractionStarter]: For program point L134(lines 134 135) no Hoare annotation was computed. [2018-09-19 16:17:24,858 INFO L429 ceAbstractionStarter]: At program point L35-3(lines 35 40) the Hoare annotation is: true [2018-09-19 16:17:24,858 INFO L426 ceAbstractionStarter]: For program point L35-4(lines 35 40) no Hoare annotation was computed. [2018-09-19 16:17:24,858 INFO L426 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-09-19 16:17:24,858 INFO L426 ceAbstractionStarter]: For program point __ieee754_logEXIT(lines 30 109) no Hoare annotation was computed. [2018-09-19 16:17:24,858 INFO L426 ceAbstractionStarter]: For program point L44(lines 44 45) no Hoare annotation was computed. [2018-09-19 16:17:24,859 INFO L426 ceAbstractionStarter]: For program point L69(lines 69 85) no Hoare annotation was computed. [2018-09-19 16:17:24,859 INFO L426 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-09-19 16:17:24,859 INFO L426 ceAbstractionStarter]: For program point L36-1(line 36) no Hoare annotation was computed. [2018-09-19 16:17:24,859 INFO L426 ceAbstractionStarter]: For program point L36-2(line 36) no Hoare annotation was computed. [2018-09-19 16:17:24,859 INFO L426 ceAbstractionStarter]: For program point L36-3(line 36) no Hoare annotation was computed. [2018-09-19 16:17:24,859 INFO L426 ceAbstractionStarter]: For program point L61-1(lines 61 66) no Hoare annotation was computed. [2018-09-19 16:17:24,859 INFO L429 ceAbstractionStarter]: At program point L61-3(lines 61 66) the Hoare annotation is: true [2018-09-19 16:17:24,860 INFO L426 ceAbstractionStarter]: For program point L61-4(lines 61 66) no Hoare annotation was computed. [2018-09-19 16:17:24,860 INFO L426 ceAbstractionStarter]: For program point L53(line 53) no Hoare annotation was computed. [2018-09-19 16:17:24,860 INFO L426 ceAbstractionStarter]: For program point L53-1(line 53) no Hoare annotation was computed. [2018-09-19 16:17:24,860 INFO L426 ceAbstractionStarter]: For program point L53-2(line 53) no Hoare annotation was computed. [2018-09-19 16:17:24,860 INFO L426 ceAbstractionStarter]: For program point L70(lines 70 77) no Hoare annotation was computed. [2018-09-19 16:17:24,860 INFO L426 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-09-19 16:17:24,860 INFO L426 ceAbstractionStarter]: For program point L62(line 62) no Hoare annotation was computed. [2018-09-19 16:17:24,860 INFO L426 ceAbstractionStarter]: For program point L62-1(line 62) no Hoare annotation was computed. [2018-09-19 16:17:24,861 INFO L426 ceAbstractionStarter]: For program point L62-2(line 62) no Hoare annotation was computed. [2018-09-19 16:17:24,861 INFO L426 ceAbstractionStarter]: For program point L62-3(line 62) no Hoare annotation was computed. [2018-09-19 16:17:24,861 INFO L426 ceAbstractionStarter]: For program point L79(lines 79 84) no Hoare annotation was computed. [2018-09-19 16:17:24,861 INFO L426 ceAbstractionStarter]: For program point L46(lines 46 47) no Hoare annotation was computed. [2018-09-19 16:17:24,861 INFO L429 ceAbstractionStarter]: At program point __ieee754_logENTRY(lines 30 109) the Hoare annotation is: true [2018-09-19 16:17:24,861 INFO L426 ceAbstractionStarter]: For program point __ieee754_logFINAL(lines 30 109) no Hoare annotation was computed. [2018-09-19 16:17:24,861 INFO L426 ceAbstractionStarter]: For program point L104(lines 104 107) no Hoare annotation was computed. [2018-09-19 16:17:24,861 INFO L426 ceAbstractionStarter]: For program point L71(lines 71 76) no Hoare annotation was computed. [2018-09-19 16:17:24,861 INFO L426 ceAbstractionStarter]: For program point L38(line 38) no Hoare annotation was computed. [2018-09-19 16:17:24,862 INFO L426 ceAbstractionStarter]: For program point L38-1(line 38) no Hoare annotation was computed. [2018-09-19 16:17:24,862 INFO L426 ceAbstractionStarter]: For program point L38-2(line 38) no Hoare annotation was computed. [2018-09-19 16:17:24,862 INFO L426 ceAbstractionStarter]: For program point L96(lines 96 108) no Hoare annotation was computed. [2018-09-19 16:17:24,862 INFO L426 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2018-09-19 16:17:24,862 INFO L426 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-09-19 16:17:24,862 INFO L426 ceAbstractionStarter]: For program point L39-1(line 39) no Hoare annotation was computed. [2018-09-19 16:17:24,862 INFO L426 ceAbstractionStarter]: For program point L39-2(line 39) no Hoare annotation was computed. [2018-09-19 16:17:24,862 INFO L426 ceAbstractionStarter]: For program point L39-3(line 39) no Hoare annotation was computed. [2018-09-19 16:17:24,863 INFO L426 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-09-19 16:17:24,863 INFO L426 ceAbstractionStarter]: For program point L98(lines 98 102) no Hoare annotation was computed. [2018-09-19 16:17:24,863 INFO L426 ceAbstractionStarter]: For program point L65(line 65) no Hoare annotation was computed. [2018-09-19 16:17:24,863 INFO L426 ceAbstractionStarter]: For program point L65-1(line 65) no Hoare annotation was computed. [2018-09-19 16:17:24,863 INFO L426 ceAbstractionStarter]: For program point L65-2(line 65) no Hoare annotation was computed. [2018-09-19 16:17:24,863 INFO L426 ceAbstractionStarter]: For program point L65-3(line 65) no Hoare annotation was computed. [2018-09-19 16:17:24,863 INFO L426 ceAbstractionStarter]: For program point L50-1(lines 50 54) no Hoare annotation was computed. [2018-09-19 16:17:24,863 INFO L429 ceAbstractionStarter]: At program point L50-3(lines 50 54) the Hoare annotation is: true [2018-09-19 16:17:24,863 INFO L426 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-09-19 16:17:24,864 INFO L426 ceAbstractionStarter]: For program point L51-1(line 51) no Hoare annotation was computed. [2018-09-19 16:17:24,864 INFO L426 ceAbstractionStarter]: For program point L51-2(line 51) no Hoare annotation was computed. [2018-09-19 16:17:24,864 INFO L426 ceAbstractionStarter]: For program point L51-3(line 51) no Hoare annotation was computed. [2018-09-19 16:17:24,864 INFO L426 ceAbstractionStarter]: For program point L43(lines 43 55) no Hoare annotation was computed. [2018-09-19 16:17:24,864 INFO L426 ceAbstractionStarter]: For program point L43-1(lines 30 109) no Hoare annotation was computed. [2018-09-19 16:17:24,864 INFO L426 ceAbstractionStarter]: For program point L35-1(lines 35 40) no Hoare annotation was computed. [2018-09-19 16:17:24,864 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-19 16:17:24,864 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:24,865 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-19 16:17:24,865 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-19 16:17:24,865 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 173 194) the Hoare annotation is: true [2018-09-19 16:17:24,865 INFO L426 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2018-09-19 16:17:24,865 INFO L422 ceAbstractionStarter]: At program point L187(line 187) the Hoare annotation is: (or (and (exists ((__ieee754_log10_~x (_ FloatingPoint 11 53))) (= (fp.div RNE (fp.sub RNE __ieee754_log10_~x __ieee754_log10_~x) (_ +zero 11 53)) main_~res~0)) (fp.lt main_~x~0 ((_ to_fp 11 53) RNE (_ bv0 32)))) (not (= (_ +zero 11 53) ~zero_log10~0))) [2018-09-19 16:17:24,865 INFO L426 ceAbstractionStarter]: For program point L187-1(lines 187 190) no Hoare annotation was computed. [2018-09-19 16:17:24,865 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 173 194) no Hoare annotation was computed. [2018-09-19 16:17:24,866 INFO L422 ceAbstractionStarter]: At program point L184(line 184) the Hoare annotation is: (or (fp.lt main_~x~0 ((_ to_fp 11 53) RNE (_ bv0 32))) (not (= (_ +zero 11 53) ~zero_log10~0))) [2018-09-19 16:17:24,866 INFO L426 ceAbstractionStarter]: For program point L184-1(line 184) no Hoare annotation was computed. [2018-09-19 16:17:24,866 INFO L426 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2018-09-19 16:17:24,866 INFO L422 ceAbstractionStarter]: At program point L182-1(line 182) the Hoare annotation is: (or (not (= (_ +zero 11 53) ~zero_log10~0)) (and (fp.lt main_~x~0 ((_ to_fp 11 53) RNE (_ bv0 32))) |main_#t~short21|)) [2018-09-19 16:17:24,866 INFO L426 ceAbstractionStarter]: For program point L182-2(line 182) no Hoare annotation was computed. [2018-09-19 16:17:24,866 INFO L426 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 188) no Hoare annotation was computed. [2018-09-19 16:17:24,866 INFO L426 ceAbstractionStarter]: For program point L182-4(lines 182 191) no Hoare annotation was computed. [2018-09-19 16:17:24,867 INFO L426 ceAbstractionStarter]: For program point L182-6(lines 182 191) no Hoare annotation was computed. [2018-09-19 16:17:24,867 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 173 194) no Hoare annotation was computed. [2018-09-19 16:17:24,872 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-09-19 16:17:24,873 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-09-19 16:17:24,873 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-09-19 16:17:24,873 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-09-19 16:17:24,873 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-09-19 16:17:24,873 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,874 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,874 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,874 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,874 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,881 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-09-19 16:17:24,881 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-09-19 16:17:24,881 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-09-19 16:17:24,881 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-09-19 16:17:24,882 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-09-19 16:17:24,882 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,882 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,882 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,882 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,883 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,884 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:24,884 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:24,885 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:24,885 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:24,885 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,885 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,885 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,885 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,885 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,886 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:24,886 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:24,887 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:24,887 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:24,887 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,887 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,887 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,888 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,888 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 04:17:24 BoogieIcfgContainer [2018-09-19 16:17:24,890 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 16:17:24,891 INFO L168 Benchmark]: Toolchain (without parser) took 85100.30 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.7 GB in the end (delta: -287.1 MB). Peak memory consumption was 454.2 MB. Max. memory is 7.1 GB. [2018-09-19 16:17:24,893 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:24,893 INFO L168 Benchmark]: CACSL2BoogieTranslator took 463.64 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:24,894 INFO L168 Benchmark]: Boogie Preprocessor took 68.99 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:24,895 INFO L168 Benchmark]: RCFGBuilder took 32903.23 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: -770.3 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. [2018-09-19 16:17:24,896 INFO L168 Benchmark]: TraceAbstraction took 51657.97 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 462.1 MB). Peak memory consumption was 462.1 MB. Max. memory is 7.1 GB. [2018-09-19 16:17:24,900 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 463.64 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 68.99 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 32903.23 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: -770.3 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 51657.97 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 462.1 MB). Peak memory consumption was 462.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,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_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,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_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 188]: 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:24,911 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-09-19 16:17:24,911 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-09-19 16:17:24,911 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-09-19 16:17:24,911 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-09-19 16:17:24,911 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-09-19 16:17:24,912 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,912 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,912 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,912 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,912 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,913 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-09-19 16:17:24,913 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-09-19 16:17:24,913 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-09-19 16:17:24,914 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-09-19 16:17:24,914 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-09-19 16:17:24,914 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,914 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,914 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,914 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,915 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] Derived loop invariant: ((\exists v_q#valueAsBitvector_16 : bv64 :: (lx == v_q#valueAsBitvector_16[31:0] && ~fp~LONGDOUBLE(v_q#valueAsBitvector_16[63:63], v_q#valueAsBitvector_16[62:52], v_q#valueAsBitvector_16[51:0]) == \old(x)) && hx == v_q#valueAsBitvector_16[63:32]) && (\exists v_q#valueAsBitvector_18 : bv64 :: (~bvslt32(v_q#valueAsBitvector_18[63:32], 1048576bv32) && !~bvslt32(v_q#valueAsBitvector_18[63:32], 0bv32)) && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_18[63:63], v_q#valueAsBitvector_18[62:52], v_q#valueAsBitvector_18[51:0]))) || !(~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:24,916 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:24,916 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:24,916 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:24,916 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:24,916 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,917 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,917 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,917 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,917 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,918 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:24,918 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:24,918 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:24,918 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_15,QUANTIFIED] [2018-09-19 16:17:24,919 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,919 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,919 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,919 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-09-19 16:17:24,919 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] Derived loop invariant: ((x == \old(x) && (\exists v_q#valueAsBitvector_15 : bv64 :: !~bvslt32(v_q#valueAsBitvector_15[63:32], 1048576bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_15[63:63], v_q#valueAsBitvector_15[62:52], v_q#valueAsBitvector_15[51:0]) == \old(x))) || (\exists v_q#valueAsBitvector_18 : bv64 :: (~bvslt32(v_q#valueAsBitvector_18[63:32], 1048576bv32) && !~bvslt32(v_q#valueAsBitvector_18[63:32], 0bv32)) && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_18[63:63], v_q#valueAsBitvector_18[62:52], v_q#valueAsBitvector_18[51:0]))) || !(~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 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 136 locations, 1 error locations. SAFE Result, 51.5s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 38.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 819 SDtfs, 248 SDslu, 3242 SDs, 0 SdLazy, 442 SolverSat, 30 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 28.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 304 GetRequests, 242 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 13.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred 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.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 46 PreInvPairs, 61 NumberOfFragments, 196 HoareAnnotationTreeSize, 46 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 19 FomulaSimplificationsInter, 118 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 280 NumberOfCodeBlocks, 280 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 274 ConstructedInterpolants, 64 QuantifiedInterpolants, 89353 SizeOfPredicates, 30 NumberOfNonLiveVariables, 846 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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...