./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_0833.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_0833.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b5f03ef8422f7b7708e900a4e8a8defb18a5d0c6a337d34a875dec58ac2c0349 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:42:56,405 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:42:56,406 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:42:56,425 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:42:56,429 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:42:56,430 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:42:56,431 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:42:56,435 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:42:56,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:42:56,441 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:42:56,442 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:42:56,443 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:42:56,443 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:42:56,444 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:42:56,444 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:42:56,445 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:42:56,445 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:42:56,446 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:42:56,447 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:42:56,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:42:56,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:42:56,450 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:42:56,451 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:42:56,451 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:42:56,453 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:42:56,453 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:42:56,453 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:42:56,454 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:42:56,454 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:42:56,455 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:42:56,471 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:42:56,472 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:42:56,472 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:42:56,473 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:42:56,474 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:42:56,474 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:42:56,474 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:42:56,475 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:42:56,475 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:42:56,476 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:42:56,476 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:42:56,477 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:42:56,503 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:42:56,503 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:42:56,503 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:42:56,503 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:42:56,504 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:42:56,504 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:42:56,504 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:42:56,504 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:42:56,505 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:42:56,505 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:42:56,505 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:42:56,506 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:42:56,506 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:42:56,506 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:42:56,506 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:42:56,506 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:42:56,507 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:42:56,507 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:42:56,507 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:42:56,507 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:42:56,507 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:42:56,507 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:42:56,507 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:42:56,508 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:42:56,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:42:56,508 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:42:56,508 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:42:56,509 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:42:56,509 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:42:56,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:42:56,510 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:42:56,510 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:42:56,510 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:42:56,510 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b5f03ef8422f7b7708e900a4e8a8defb18a5d0c6a337d34a875dec58ac2c0349 [2022-02-20 16:42:56,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:42:56,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:42:56,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:42:56,719 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:42:56,719 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:42:56,720 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0833.c [2022-02-20 16:42:56,779 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce98f007b/b8efc2c087004beab655c8caded126ea/FLAG913f68509 [2022-02-20 16:42:57,125 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:42:57,125 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0833.c [2022-02-20 16:42:57,130 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce98f007b/b8efc2c087004beab655c8caded126ea/FLAG913f68509 [2022-02-20 16:42:57,138 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce98f007b/b8efc2c087004beab655c8caded126ea [2022-02-20 16:42:57,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:42:57,141 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:42:57,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:42:57,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:42:57,145 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:42:57,146 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:42:57" (1/1) ... [2022-02-20 16:42:57,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30d91798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:57, skipping insertion in model container [2022-02-20 16:42:57,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:42:57" (1/1) ... [2022-02-20 16:42:57,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:42:57,167 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:42:57,334 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0833.c[3348,3361] [2022-02-20 16:42:57,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:42:57,342 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:42:57,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0833.c[3348,3361] [2022-02-20 16:42:57,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:42:57,402 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:42:57,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:57 WrapperNode [2022-02-20 16:42:57,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:42:57,403 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:42:57,404 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:42:57,404 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:42:57,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:57" (1/1) ... [2022-02-20 16:42:57,417 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:57" (1/1) ... [2022-02-20 16:42:57,449 INFO L137 Inliner]: procedures = 18, calls = 47, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 208 [2022-02-20 16:42:57,459 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:42:57,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:42:57,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:42:57,460 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:42:57,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:57" (1/1) ... [2022-02-20 16:42:57,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:57" (1/1) ... [2022-02-20 16:42:57,469 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:57" (1/1) ... [2022-02-20 16:42:57,469 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:57" (1/1) ... [2022-02-20 16:42:57,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:57" (1/1) ... [2022-02-20 16:42:57,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:57" (1/1) ... [2022-02-20 16:42:57,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:57" (1/1) ... [2022-02-20 16:42:57,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:42:57,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:42:57,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:42:57,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:42:57,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:57" (1/1) ... [2022-02-20 16:42:57,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:42:57,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:42:57,530 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:42:57,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:42:57,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:42:57,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:42:57,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:42:57,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:42:57,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:42:57,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:42:57,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:42:57,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:42:57,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:42:57,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-02-20 16:42:57,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:42:57,644 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:42:57,645 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:42:57,993 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:42:57,998 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:42:57,998 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2022-02-20 16:42:57,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:57 BoogieIcfgContainer [2022-02-20 16:42:57,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:42:58,000 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:42:58,000 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:42:58,013 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:42:58,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:42:57" (1/3) ... [2022-02-20 16:42:58,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292b9fca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:42:58, skipping insertion in model container [2022-02-20 16:42:58,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:57" (2/3) ... [2022-02-20 16:42:58,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292b9fca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:42:58, skipping insertion in model container [2022-02-20 16:42:58,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:57" (3/3) ... [2022-02-20 16:42:58,016 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0833.c [2022-02-20 16:42:58,026 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:42:58,027 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:42:58,066 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:42:58,071 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:42:58,071 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:42:58,082 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 46 states have (on average 1.7391304347826086) internal successors, (80), 47 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:58,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:42:58,085 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:58,086 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:58,086 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:58,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:58,090 INFO L85 PathProgramCache]: Analyzing trace with hash -879945327, now seen corresponding path program 1 times [2022-02-20 16:42:58,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:42:58,096 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903967194] [2022-02-20 16:42:58,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:58,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:42:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:58,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~one_exp~0 := 1.0;~#halF_exp~0.base, ~#halF_exp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~real(0.5, ~#halF_exp~0.base, ~#halF_exp~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.5), ~#halF_exp~0.base, 4 + ~#halF_exp~0.offset, 4);~huge_exp~0 := 1.0E30;~twom100_exp~0 := 7.8886090522E-31;~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~real(0.69313812256, ~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.69313812256), ~#ln2HI_exp~0.base, 4 + ~#ln2HI_exp~0.offset, 4);~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset := 6, 0;call #Ultimate.allocInit(8, 6);call write~init~real(9.0580006145E-6, ~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(9.0580006145E-6), ~#ln2LO_exp~0.base, 4 + ~#ln2LO_exp~0.offset, 4);~invln2_exp~0 := 1.4426950216;~P1_exp~0 := 0.16666667163;~P2_exp~0 := ~someUnaryDOUBLEoperation(0.002777777845);~P3_exp~0 := 6.613755977E-5;~P4_exp~0 := ~someUnaryDOUBLEoperation(1.6533901999E-6);~P5_exp~0 := 4.1381369442E-8; {51#true} is VALID [2022-02-20 16:42:58,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1, main_#t~ret19#1, main_#t~short20#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0);assume { :begin_inline___ieee754_expf } true;__ieee754_expf_#in~x#1 := main_~x~0#1;havoc __ieee754_expf_#res#1;havoc __ieee754_expf_#t~mem4#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, __ieee754_expf_#t~ite7#1, __ieee754_expf_#t~mem8#1, __ieee754_expf_#t~mem9#1, __ieee754_expf_#t~mem10#1, __ieee754_expf_#t~mem11#1, __ieee754_expf_#t~mem12#1, __ieee754_expf_#t~mem13#1, __ieee754_expf_~#gf_u~1#1.base, __ieee754_expf_~#gf_u~1#1.offset, __ieee754_expf_#t~mem14#1, __ieee754_expf_~#sf_u~0#1.base, __ieee754_expf_~#sf_u~0#1.offset, __ieee754_expf_~hy~0#1, __ieee754_expf_#t~mem15#1, __ieee754_expf_~#gf_u~2#1.base, __ieee754_expf_~#gf_u~2#1.offset, __ieee754_expf_#t~mem16#1, __ieee754_expf_~#sf_u~1#1.base, __ieee754_expf_~#sf_u~1#1.offset, __ieee754_expf_~hy~1#1, __ieee754_expf_~x#1, __ieee754_expf_~y~0#1, __ieee754_expf_~hi~0#1, __ieee754_expf_~lo~0#1, __ieee754_expf_~c~0#1, __ieee754_expf_~t~0#1, __ieee754_expf_~k~0#1, __ieee754_expf_~xsb~0#1, __ieee754_expf_~sx~0#1, __ieee754_expf_~hx~0#1, __ieee754_expf_#t~nondet5#1, __ieee754_expf_#t~nondet6#1;__ieee754_expf_~x#1 := __ieee754_expf_#in~x#1;havoc __ieee754_expf_~y~0#1;havoc __ieee754_expf_~hi~0#1;havoc __ieee754_expf_~lo~0#1;havoc __ieee754_expf_~c~0#1;havoc __ieee754_expf_~t~0#1;__ieee754_expf_~k~0#1 := 0;havoc __ieee754_expf_~xsb~0#1;havoc __ieee754_expf_~sx~0#1;havoc __ieee754_expf_~hx~0#1; {51#true} is VALID [2022-02-20 16:42:58,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {51#true} assume !true; {52#false} is VALID [2022-02-20 16:42:58,243 INFO L290 TraceCheckUtils]: 3: Hoare triple {52#false} assume 0 == (if __ieee754_expf_~sx~0#1 >= 0 then 0 else 1);__ieee754_expf_~xsb~0#1 := 0; {52#false} is VALID [2022-02-20 16:42:58,243 INFO L290 TraceCheckUtils]: 4: Hoare triple {52#false} assume 0 == __ieee754_expf_~sx~0#1;__ieee754_expf_~hx~0#1 := 0; {52#false} is VALID [2022-02-20 16:42:58,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {52#false} assume __ieee754_expf_~hx~0#1 % 4294967296 > 2139095040;__ieee754_expf_#res#1 := ~someBinaryArithmeticFLOAToperation(__ieee754_expf_~x#1, __ieee754_expf_~x#1); {52#false} is VALID [2022-02-20 16:42:58,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {52#false} main_#t~ret18#1 := __ieee754_expf_#res#1;assume { :end_inline___ieee754_expf } true;main_~res~0#1 := main_#t~ret18#1;havoc main_#t~ret18#1;main_#t~short20#1 := ~someBinaryFLOATComparisonOperation(main_~res~0#1, 0.0); {52#false} is VALID [2022-02-20 16:42:58,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {52#false} assume !main_#t~short20#1; {52#false} is VALID [2022-02-20 16:42:58,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {52#false} assume !main_#t~short20#1;havoc main_#t~ret19#1;havoc main_#t~short20#1; {52#false} is VALID [2022-02-20 16:42:58,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {52#false} assume !false; {52#false} is VALID [2022-02-20 16:42:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:42:58,247 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:42:58,247 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903967194] [2022-02-20 16:42:58,248 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903967194] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:58,248 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:58,249 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:42:58,250 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735753390] [2022-02-20 16:42:58,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:58,256 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:42:58,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:58,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:58,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:58,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:42:58,316 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:42:58,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:42:58,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:42:58,340 INFO L87 Difference]: Start difference. First operand has 48 states, 46 states have (on average 1.7391304347826086) internal successors, (80), 47 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:58,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:58,413 INFO L93 Difference]: Finished difference Result 93 states and 156 transitions. [2022-02-20 16:42:58,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:42:58,414 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:42:58,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:58,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:58,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 156 transitions. [2022-02-20 16:42:58,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:58,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 156 transitions. [2022-02-20 16:42:58,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 156 transitions. [2022-02-20 16:42:58,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:58,548 INFO L225 Difference]: With dead ends: 93 [2022-02-20 16:42:58,549 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 16:42:58,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:42:58,557 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:42:58,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:42:58,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 16:42:58,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-02-20 16:42:58,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:58,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 43 states have (on average 1.372093023255814) internal successors, (59), 43 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:58,585 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 43 states have (on average 1.372093023255814) internal successors, (59), 43 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:58,586 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 43 states have (on average 1.372093023255814) internal successors, (59), 43 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:58,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:58,590 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2022-02-20 16:42:58,590 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2022-02-20 16:42:58,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:58,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:58,593 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 43 states have (on average 1.372093023255814) internal successors, (59), 43 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 44 states. [2022-02-20 16:42:58,593 INFO L87 Difference]: Start difference. First operand has 44 states, 43 states have (on average 1.372093023255814) internal successors, (59), 43 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 44 states. [2022-02-20 16:42:58,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:58,598 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2022-02-20 16:42:58,598 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2022-02-20 16:42:58,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:58,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:58,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:58,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:58,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.372093023255814) internal successors, (59), 43 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:58,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2022-02-20 16:42:58,605 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 59 transitions. Word has length 10 [2022-02-20 16:42:58,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:58,605 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 59 transitions. [2022-02-20 16:42:58,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:58,606 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2022-02-20 16:42:58,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:42:58,607 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:58,607 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:58,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:42:58,610 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:58,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:58,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1079714772, now seen corresponding path program 1 times [2022-02-20 16:42:58,613 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:42:58,613 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131855848] [2022-02-20 16:42:58,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:58,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:42:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:58,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {300#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~one_exp~0 := 1.0;~#halF_exp~0.base, ~#halF_exp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~real(0.5, ~#halF_exp~0.base, ~#halF_exp~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.5), ~#halF_exp~0.base, 4 + ~#halF_exp~0.offset, 4);~huge_exp~0 := 1.0E30;~twom100_exp~0 := 7.8886090522E-31;~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~real(0.69313812256, ~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.69313812256), ~#ln2HI_exp~0.base, 4 + ~#ln2HI_exp~0.offset, 4);~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset := 6, 0;call #Ultimate.allocInit(8, 6);call write~init~real(9.0580006145E-6, ~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(9.0580006145E-6), ~#ln2LO_exp~0.base, 4 + ~#ln2LO_exp~0.offset, 4);~invln2_exp~0 := 1.4426950216;~P1_exp~0 := 0.16666667163;~P2_exp~0 := ~someUnaryDOUBLEoperation(0.002777777845);~P3_exp~0 := 6.613755977E-5;~P4_exp~0 := ~someUnaryDOUBLEoperation(1.6533901999E-6);~P5_exp~0 := 4.1381369442E-8; {300#true} is VALID [2022-02-20 16:42:58,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {300#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1, main_#t~ret19#1, main_#t~short20#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0);assume { :begin_inline___ieee754_expf } true;__ieee754_expf_#in~x#1 := main_~x~0#1;havoc __ieee754_expf_#res#1;havoc __ieee754_expf_#t~mem4#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, __ieee754_expf_#t~ite7#1, __ieee754_expf_#t~mem8#1, __ieee754_expf_#t~mem9#1, __ieee754_expf_#t~mem10#1, __ieee754_expf_#t~mem11#1, __ieee754_expf_#t~mem12#1, __ieee754_expf_#t~mem13#1, __ieee754_expf_~#gf_u~1#1.base, __ieee754_expf_~#gf_u~1#1.offset, __ieee754_expf_#t~mem14#1, __ieee754_expf_~#sf_u~0#1.base, __ieee754_expf_~#sf_u~0#1.offset, __ieee754_expf_~hy~0#1, __ieee754_expf_#t~mem15#1, __ieee754_expf_~#gf_u~2#1.base, __ieee754_expf_~#gf_u~2#1.offset, __ieee754_expf_#t~mem16#1, __ieee754_expf_~#sf_u~1#1.base, __ieee754_expf_~#sf_u~1#1.offset, __ieee754_expf_~hy~1#1, __ieee754_expf_~x#1, __ieee754_expf_~y~0#1, __ieee754_expf_~hi~0#1, __ieee754_expf_~lo~0#1, __ieee754_expf_~c~0#1, __ieee754_expf_~t~0#1, __ieee754_expf_~k~0#1, __ieee754_expf_~xsb~0#1, __ieee754_expf_~sx~0#1, __ieee754_expf_~hx~0#1, __ieee754_expf_#t~nondet5#1, __ieee754_expf_#t~nondet6#1;__ieee754_expf_~x#1 := __ieee754_expf_#in~x#1;havoc __ieee754_expf_~y~0#1;havoc __ieee754_expf_~hi~0#1;havoc __ieee754_expf_~lo~0#1;havoc __ieee754_expf_~c~0#1;havoc __ieee754_expf_~t~0#1;__ieee754_expf_~k~0#1 := 0;havoc __ieee754_expf_~xsb~0#1;havoc __ieee754_expf_~sx~0#1;havoc __ieee754_expf_~hx~0#1; {300#true} is VALID [2022-02-20 16:42:58,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {300#true} call __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4);call write~real(__ieee754_expf_~x#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4);call __ieee754_expf_#t~mem4#1 := read~int(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4);__ieee754_expf_~sx~0#1 := (if __ieee754_expf_#t~mem4#1 % 4294967296 % 4294967296 <= 2147483647 then __ieee754_expf_#t~mem4#1 % 4294967296 % 4294967296 else __ieee754_expf_#t~mem4#1 % 4294967296 % 4294967296 - 4294967296);havoc __ieee754_expf_#t~mem4#1;call ULTIMATE.dealloc(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset);havoc __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset; {300#true} is VALID [2022-02-20 16:42:58,720 INFO L290 TraceCheckUtils]: 3: Hoare triple {300#true} goto; {300#true} is VALID [2022-02-20 16:42:58,720 INFO L290 TraceCheckUtils]: 4: Hoare triple {300#true} assume 0 == (if __ieee754_expf_~sx~0#1 >= 0 then 0 else 1);__ieee754_expf_~xsb~0#1 := 0; {300#true} is VALID [2022-02-20 16:42:58,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {300#true} assume 0 == __ieee754_expf_~sx~0#1;__ieee754_expf_~hx~0#1 := 0; {302#(= |ULTIMATE.start___ieee754_expf_~hx~0#1| 0)} is VALID [2022-02-20 16:42:58,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {302#(= |ULTIMATE.start___ieee754_expf_~hx~0#1| 0)} assume __ieee754_expf_~hx~0#1 % 4294967296 > 2139095040;__ieee754_expf_#res#1 := ~someBinaryArithmeticFLOAToperation(__ieee754_expf_~x#1, __ieee754_expf_~x#1); {301#false} is VALID [2022-02-20 16:42:58,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {301#false} main_#t~ret18#1 := __ieee754_expf_#res#1;assume { :end_inline___ieee754_expf } true;main_~res~0#1 := main_#t~ret18#1;havoc main_#t~ret18#1;main_#t~short20#1 := ~someBinaryFLOATComparisonOperation(main_~res~0#1, 0.0); {301#false} is VALID [2022-02-20 16:42:58,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {301#false} assume !main_#t~short20#1; {301#false} is VALID [2022-02-20 16:42:58,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {301#false} assume !main_#t~short20#1;havoc main_#t~ret19#1;havoc main_#t~short20#1; {301#false} is VALID [2022-02-20 16:42:58,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {301#false} assume !false; {301#false} is VALID [2022-02-20 16:42:58,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:42:58,723 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:42:58,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131855848] [2022-02-20 16:42:58,724 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131855848] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:58,724 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:58,724 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:42:58,725 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801669140] [2022-02-20 16:42:58,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:58,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:42:58,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:58,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:58,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:58,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:42:58,736 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:42:58,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:42:58,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:42:58,737 INFO L87 Difference]: Start difference. First operand 44 states and 59 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:58,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:58,844 INFO L93 Difference]: Finished difference Result 99 states and 127 transitions. [2022-02-20 16:42:58,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:42:58,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:42:58,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:58,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:58,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2022-02-20 16:42:58,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:58,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2022-02-20 16:42:58,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 127 transitions. [2022-02-20 16:42:58,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:58,959 INFO L225 Difference]: With dead ends: 99 [2022-02-20 16:42:58,960 INFO L226 Difference]: Without dead ends: 73 [2022-02-20 16:42:58,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:42:58,965 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 33 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:42:58,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 97 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:42:58,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-02-20 16:42:58,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 50. [2022-02-20 16:42:58,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:58,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 50 states, 49 states have (on average 1.346938775510204) internal successors, (66), 49 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:58,974 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 50 states, 49 states have (on average 1.346938775510204) internal successors, (66), 49 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:58,974 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 50 states, 49 states have (on average 1.346938775510204) internal successors, (66), 49 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:58,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:58,977 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2022-02-20 16:42:58,977 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2022-02-20 16:42:58,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:58,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:58,978 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 49 states have (on average 1.346938775510204) internal successors, (66), 49 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 73 states. [2022-02-20 16:42:58,978 INFO L87 Difference]: Start difference. First operand has 50 states, 49 states have (on average 1.346938775510204) internal successors, (66), 49 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 73 states. [2022-02-20 16:42:58,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:58,983 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2022-02-20 16:42:58,983 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2022-02-20 16:42:58,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:58,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:58,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:58,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:58,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.346938775510204) internal successors, (66), 49 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:58,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2022-02-20 16:42:58,990 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 11 [2022-02-20 16:42:58,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:58,991 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2022-02-20 16:42:58,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:58,991 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-02-20 16:42:58,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:42:58,992 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:58,992 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:58,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:42:58,992 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:58,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:58,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1499420217, now seen corresponding path program 1 times [2022-02-20 16:42:58,993 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:42:58,994 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838907016] [2022-02-20 16:42:58,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:58,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:42:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:59,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {622#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~one_exp~0 := 1.0;~#halF_exp~0.base, ~#halF_exp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~real(0.5, ~#halF_exp~0.base, ~#halF_exp~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.5), ~#halF_exp~0.base, 4 + ~#halF_exp~0.offset, 4);~huge_exp~0 := 1.0E30;~twom100_exp~0 := 7.8886090522E-31;~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~real(0.69313812256, ~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.69313812256), ~#ln2HI_exp~0.base, 4 + ~#ln2HI_exp~0.offset, 4);~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset := 6, 0;call #Ultimate.allocInit(8, 6);call write~init~real(9.0580006145E-6, ~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(9.0580006145E-6), ~#ln2LO_exp~0.base, 4 + ~#ln2LO_exp~0.offset, 4);~invln2_exp~0 := 1.4426950216;~P1_exp~0 := 0.16666667163;~P2_exp~0 := ~someUnaryDOUBLEoperation(0.002777777845);~P3_exp~0 := 6.613755977E-5;~P4_exp~0 := ~someUnaryDOUBLEoperation(1.6533901999E-6);~P5_exp~0 := 4.1381369442E-8; {622#true} is VALID [2022-02-20 16:42:59,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {622#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1, main_#t~ret19#1, main_#t~short20#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0);assume { :begin_inline___ieee754_expf } true;__ieee754_expf_#in~x#1 := main_~x~0#1;havoc __ieee754_expf_#res#1;havoc __ieee754_expf_#t~mem4#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, __ieee754_expf_#t~ite7#1, __ieee754_expf_#t~mem8#1, __ieee754_expf_#t~mem9#1, __ieee754_expf_#t~mem10#1, __ieee754_expf_#t~mem11#1, __ieee754_expf_#t~mem12#1, __ieee754_expf_#t~mem13#1, __ieee754_expf_~#gf_u~1#1.base, __ieee754_expf_~#gf_u~1#1.offset, __ieee754_expf_#t~mem14#1, __ieee754_expf_~#sf_u~0#1.base, __ieee754_expf_~#sf_u~0#1.offset, __ieee754_expf_~hy~0#1, __ieee754_expf_#t~mem15#1, __ieee754_expf_~#gf_u~2#1.base, __ieee754_expf_~#gf_u~2#1.offset, __ieee754_expf_#t~mem16#1, __ieee754_expf_~#sf_u~1#1.base, __ieee754_expf_~#sf_u~1#1.offset, __ieee754_expf_~hy~1#1, __ieee754_expf_~x#1, __ieee754_expf_~y~0#1, __ieee754_expf_~hi~0#1, __ieee754_expf_~lo~0#1, __ieee754_expf_~c~0#1, __ieee754_expf_~t~0#1, __ieee754_expf_~k~0#1, __ieee754_expf_~xsb~0#1, __ieee754_expf_~sx~0#1, __ieee754_expf_~hx~0#1, __ieee754_expf_#t~nondet5#1, __ieee754_expf_#t~nondet6#1;__ieee754_expf_~x#1 := __ieee754_expf_#in~x#1;havoc __ieee754_expf_~y~0#1;havoc __ieee754_expf_~hi~0#1;havoc __ieee754_expf_~lo~0#1;havoc __ieee754_expf_~c~0#1;havoc __ieee754_expf_~t~0#1;__ieee754_expf_~k~0#1 := 0;havoc __ieee754_expf_~xsb~0#1;havoc __ieee754_expf_~sx~0#1;havoc __ieee754_expf_~hx~0#1; {622#true} is VALID [2022-02-20 16:42:59,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {622#true} call __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4);call write~real(__ieee754_expf_~x#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4);call __ieee754_expf_#t~mem4#1 := read~int(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4);__ieee754_expf_~sx~0#1 := (if __ieee754_expf_#t~mem4#1 % 4294967296 % 4294967296 <= 2147483647 then __ieee754_expf_#t~mem4#1 % 4294967296 % 4294967296 else __ieee754_expf_#t~mem4#1 % 4294967296 % 4294967296 - 4294967296);havoc __ieee754_expf_#t~mem4#1;call ULTIMATE.dealloc(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset);havoc __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset; {622#true} is VALID [2022-02-20 16:42:59,052 INFO L290 TraceCheckUtils]: 3: Hoare triple {622#true} goto; {622#true} is VALID [2022-02-20 16:42:59,053 INFO L290 TraceCheckUtils]: 4: Hoare triple {622#true} assume 0 == (if __ieee754_expf_~sx~0#1 >= 0 then 0 else 1);__ieee754_expf_~xsb~0#1 := 0; {622#true} is VALID [2022-02-20 16:42:59,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {622#true} assume 0 == __ieee754_expf_~sx~0#1;__ieee754_expf_~hx~0#1 := 0; {624#(<= |ULTIMATE.start___ieee754_expf_~sx~0#1| 0)} is VALID [2022-02-20 16:42:59,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {624#(<= |ULTIMATE.start___ieee754_expf_~sx~0#1| 0)} assume !(__ieee754_expf_~hx~0#1 % 4294967296 > 2139095040); {624#(<= |ULTIMATE.start___ieee754_expf_~sx~0#1| 0)} is VALID [2022-02-20 16:42:59,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {624#(<= |ULTIMATE.start___ieee754_expf_~sx~0#1| 0)} assume !(2139095040 == __ieee754_expf_~hx~0#1 % 4294967296); {624#(<= |ULTIMATE.start___ieee754_expf_~sx~0#1| 0)} is VALID [2022-02-20 16:42:59,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {624#(<= |ULTIMATE.start___ieee754_expf_~sx~0#1| 0)} assume __ieee754_expf_~sx~0#1 > 1118925335;__ieee754_expf_#res#1 := ~someBinaryArithmeticFLOAToperation(~huge_exp~0, ~huge_exp~0); {623#false} is VALID [2022-02-20 16:42:59,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {623#false} main_#t~ret18#1 := __ieee754_expf_#res#1;assume { :end_inline___ieee754_expf } true;main_~res~0#1 := main_#t~ret18#1;havoc main_#t~ret18#1;main_#t~short20#1 := ~someBinaryFLOATComparisonOperation(main_~res~0#1, 0.0); {623#false} is VALID [2022-02-20 16:42:59,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {623#false} assume !main_#t~short20#1; {623#false} is VALID [2022-02-20 16:42:59,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {623#false} assume !main_#t~short20#1;havoc main_#t~ret19#1;havoc main_#t~short20#1; {623#false} is VALID [2022-02-20 16:42:59,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {623#false} assume !false; {623#false} is VALID [2022-02-20 16:42:59,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:42:59,056 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:42:59,056 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838907016] [2022-02-20 16:42:59,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838907016] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:59,057 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:59,057 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:42:59,057 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87103088] [2022-02-20 16:42:59,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:59,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:42:59,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:59,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:59,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:59,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:42:59,068 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:42:59,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:42:59,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:42:59,069 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:59,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:59,168 INFO L93 Difference]: Finished difference Result 96 states and 125 transitions. [2022-02-20 16:42:59,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:42:59,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:42:59,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:59,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:59,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2022-02-20 16:42:59,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:59,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2022-02-20 16:42:59,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 118 transitions. [2022-02-20 16:42:59,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:59,264 INFO L225 Difference]: With dead ends: 96 [2022-02-20 16:42:59,264 INFO L226 Difference]: Without dead ends: 87 [2022-02-20 16:42:59,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:42:59,267 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 47 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:42:59,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 119 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:42:59,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-02-20 16:42:59,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 57. [2022-02-20 16:42:59,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:59,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 57 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 56 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:59,274 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 57 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 56 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:59,275 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 57 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 56 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:59,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:59,277 INFO L93 Difference]: Finished difference Result 87 states and 114 transitions. [2022-02-20 16:42:59,277 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 114 transitions. [2022-02-20 16:42:59,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:59,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:59,279 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 56 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 87 states. [2022-02-20 16:42:59,279 INFO L87 Difference]: Start difference. First operand has 57 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 56 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 87 states. [2022-02-20 16:42:59,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:59,281 INFO L93 Difference]: Finished difference Result 87 states and 114 transitions. [2022-02-20 16:42:59,282 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 114 transitions. [2022-02-20 16:42:59,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:59,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:59,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:59,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:59,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 56 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:59,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 76 transitions. [2022-02-20 16:42:59,284 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 76 transitions. Word has length 13 [2022-02-20 16:42:59,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:59,284 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 76 transitions. [2022-02-20 16:42:59,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:59,284 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2022-02-20 16:42:59,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:42:59,285 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:59,285 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:59,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:42:59,285 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:59,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:59,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1894275170, now seen corresponding path program 1 times [2022-02-20 16:42:59,286 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:42:59,286 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652476719] [2022-02-20 16:42:59,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:59,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:42:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:42:59,337 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:42:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:42:59,391 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:42:59,391 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:42:59,395 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:42:59,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 16:42:59,398 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 16:42:59,400 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:42:59,425 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:42:59,425 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:42:59,425 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-02-20 16:42:59,425 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-02-20 16:42:59,425 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-02-20 16:42:59,425 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-02-20 16:42:59,425 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2022-02-20 16:42:59,425 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2022-02-20 16:42:59,425 WARN L170 areAnnotationChecker]: L45-7 has no Hoare annotation [2022-02-20 16:42:59,426 WARN L170 areAnnotationChecker]: L45-7 has no Hoare annotation [2022-02-20 16:42:59,426 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2022-02-20 16:42:59,426 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2022-02-20 16:42:59,426 WARN L170 areAnnotationChecker]: L46-7 has no Hoare annotation [2022-02-20 16:42:59,426 WARN L170 areAnnotationChecker]: L46-7 has no Hoare annotation [2022-02-20 16:42:59,426 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-02-20 16:42:59,426 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-02-20 16:42:59,426 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2022-02-20 16:42:59,426 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2022-02-20 16:42:59,426 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2022-02-20 16:42:59,426 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-02-20 16:42:59,426 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-02-20 16:42:59,426 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2022-02-20 16:42:59,426 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2022-02-20 16:42:59,426 WARN L170 areAnnotationChecker]: L45-5 has no Hoare annotation [2022-02-20 16:42:59,426 WARN L170 areAnnotationChecker]: L45-5 has no Hoare annotation [2022-02-20 16:42:59,426 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2022-02-20 16:42:59,426 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2022-02-20 16:42:59,426 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-02-20 16:42:59,426 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-02-20 16:42:59,426 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-02-20 16:42:59,426 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-02-20 16:42:59,426 WARN L170 areAnnotationChecker]: L46-5 has no Hoare annotation [2022-02-20 16:42:59,427 WARN L170 areAnnotationChecker]: L46-5 has no Hoare annotation [2022-02-20 16:42:59,427 WARN L170 areAnnotationChecker]: L113-2 has no Hoare annotation [2022-02-20 16:42:59,427 WARN L170 areAnnotationChecker]: L113-2 has no Hoare annotation [2022-02-20 16:42:59,427 WARN L170 areAnnotationChecker]: L132-2 has no Hoare annotation [2022-02-20 16:42:59,427 WARN L170 areAnnotationChecker]: L132-2 has no Hoare annotation [2022-02-20 16:42:59,427 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2022-02-20 16:42:59,427 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:42:59,427 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:42:59,427 WARN L170 areAnnotationChecker]: L113-1 has no Hoare annotation [2022-02-20 16:42:59,427 WARN L170 areAnnotationChecker]: L113-1 has no Hoare annotation [2022-02-20 16:42:59,427 WARN L170 areAnnotationChecker]: L113-3 has no Hoare annotation [2022-02-20 16:42:59,427 WARN L170 areAnnotationChecker]: L133 has no Hoare annotation [2022-02-20 16:42:59,427 WARN L170 areAnnotationChecker]: L133 has no Hoare annotation [2022-02-20 16:42:59,427 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2022-02-20 16:42:59,427 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:42:59,427 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:42:59,427 WARN L170 areAnnotationChecker]: L119 has no Hoare annotation [2022-02-20 16:42:59,427 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:42:59,427 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-02-20 16:42:59,427 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-02-20 16:42:59,427 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:42:59,427 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:42:59,427 WARN L170 areAnnotationChecker]: L58-2 has no Hoare annotation [2022-02-20 16:42:59,428 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-02-20 16:42:59,428 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-02-20 16:42:59,428 WARN L170 areAnnotationChecker]: L69-2 has no Hoare annotation [2022-02-20 16:42:59,428 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2022-02-20 16:42:59,428 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2022-02-20 16:42:59,428 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-02-20 16:42:59,428 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-02-20 16:42:59,428 WARN L170 areAnnotationChecker]: L83-2 has no Hoare annotation [2022-02-20 16:42:59,428 WARN L170 areAnnotationChecker]: L83-2 has no Hoare annotation [2022-02-20 16:42:59,428 WARN L170 areAnnotationChecker]: L96-2 has no Hoare annotation [2022-02-20 16:42:59,428 WARN L170 areAnnotationChecker]: L96-2 has no Hoare annotation [2022-02-20 16:42:59,428 WARN L170 areAnnotationChecker]: L83-1 has no Hoare annotation [2022-02-20 16:42:59,428 WARN L170 areAnnotationChecker]: L83-1 has no Hoare annotation [2022-02-20 16:42:59,428 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2022-02-20 16:42:59,428 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2022-02-20 16:42:59,428 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2022-02-20 16:42:59,428 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2022-02-20 16:42:59,428 WARN L170 areAnnotationChecker]: L101-1 has no Hoare annotation [2022-02-20 16:42:59,428 WARN L170 areAnnotationChecker]: L101-1 has no Hoare annotation [2022-02-20 16:42:59,428 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:42:59,428 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:42:59,428 WARN L170 areAnnotationChecker]: L88-2 has no Hoare annotation [2022-02-20 16:42:59,428 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2022-02-20 16:42:59,428 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2022-02-20 16:42:59,429 WARN L170 areAnnotationChecker]: L101-2 has no Hoare annotation [2022-02-20 16:42:59,429 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:42:59,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:42:59 BoogieIcfgContainer [2022-02-20 16:42:59,429 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:42:59,430 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:42:59,430 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:42:59,430 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:42:59,430 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:57" (3/4) ... [2022-02-20 16:42:59,433 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:42:59,433 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:42:59,434 INFO L158 Benchmark]: Toolchain (without parser) took 2292.85ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 72.4MB in the beginning and 62.1MB in the end (delta: 10.3MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. [2022-02-20 16:42:59,435 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 107.0MB. Free memory was 77.3MB in the beginning and 77.3MB in the end (delta: 21.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:42:59,435 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.48ms. Allocated memory is still 107.0MB. Free memory was 72.2MB in the beginning and 79.7MB in the end (delta: -7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:42:59,436 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.81ms. Allocated memory is still 107.0MB. Free memory was 79.7MB in the beginning and 77.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:42:59,436 INFO L158 Benchmark]: Boogie Preprocessor took 26.33ms. Allocated memory is still 107.0MB. Free memory was 77.1MB in the beginning and 75.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:42:59,437 INFO L158 Benchmark]: RCFGBuilder took 512.56ms. Allocated memory is still 107.0MB. Free memory was 75.0MB in the beginning and 54.6MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-02-20 16:42:59,437 INFO L158 Benchmark]: TraceAbstraction took 1429.06ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 54.1MB in the beginning and 62.6MB in the end (delta: -8.5MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2022-02-20 16:42:59,439 INFO L158 Benchmark]: Witness Printer took 3.74ms. Allocated memory is still 130.0MB. Free memory was 62.6MB in the beginning and 62.1MB in the end (delta: 443.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:42:59,440 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 107.0MB. Free memory was 77.3MB in the beginning and 77.3MB in the end (delta: 21.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.48ms. Allocated memory is still 107.0MB. Free memory was 72.2MB in the beginning and 79.7MB in the end (delta: -7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.81ms. Allocated memory is still 107.0MB. Free memory was 79.7MB in the beginning and 77.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.33ms. Allocated memory is still 107.0MB. Free memory was 77.1MB in the beginning and 75.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 512.56ms. Allocated memory is still 107.0MB. Free memory was 75.0MB in the beginning and 54.6MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1429.06ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 54.1MB in the beginning and 62.6MB in the end (delta: -8.5MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * Witness Printer took 3.74ms. Allocated memory is still 130.0MB. Free memory was 62.6MB in the beginning and 62.1MB in the end (delta: 443.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 133]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 132, overapproximation of someUnaryDOUBLEoperation at line 18, overapproximation of someBinaryArithmeticFLOAToperation at line 49. Possible FailurePath: [L14-L33] static const float one_exp = 1.0, halF_exp[2] = { 0.5, -0.5, }, huge_exp = 1.0e+30, twom100_exp = 7.8886090522e-31, ln2HI_exp[2] = { 6.9313812256e-01, -6.9313812256e-01, }, ln2LO_exp[2] = { 9.0580006145e-06, -9.0580006145e-06, }, invln2_exp = 1.4426950216e+00, P1_exp = 1.6666667163e-01, P2_exp = -2.7777778450e-03, P3_exp = 6.6137559770e-05, P4_exp = -1.6533901999e-06, P5_exp = 4.1381369442e-08; VAL [halF_exp={4:0}, huge_exp=1000000000000000000000000000000, invln2_exp=1803368777/1250000000, ln2HI_exp={5:0}, ln2LO_exp={6:0}, one_exp=1, P1_exp=16666667163/100000000000, P3_exp=6613755977/100000000000000, P5_exp=20690684721/500000000000000000, twom100_exp=39443045261/50000000000000000000000000000000000000000] [L128] float x = -1.0f / 0.0f; [L129] CALL, EXPR __ieee754_expf(x) [L36] float y, hi, lo, c, t; [L37] __int32_t k = 0, xsb, sx; [L38] __uint32_t hx; VAL [\old(x)=1000000000000000000000000000001, halF_exp={4:0}, huge_exp=1000000000000000000000000000000, invln2_exp=1803368777/1250000000, k=0, ln2HI_exp={5:0}, ln2LO_exp={6:0}, one_exp=1, P1_exp=16666667163/100000000000, P3_exp=6613755977/100000000000000, P5_exp=20690684721/500000000000000000, twom100_exp=39443045261/50000000000000000000000000000000000000000, x=1000000000000000000000000000001] [L41] ieee_float_shape_type gf_u; [L42] gf_u.value = (x) [L43] EXPR gf_u.word [L43] (sx) = gf_u.word [L45] xsb = (sx >> 31) & 1 VAL [\old(x)=1000000000000000000000000000001, halF_exp={4:0}, huge_exp=1000000000000000000000000000000, invln2_exp=1803368777/1250000000, k=0, ln2HI_exp={5:0}, ln2LO_exp={6:0}, one_exp=1, P1_exp=16666667163/100000000000, P3_exp=6613755977/100000000000000, P5_exp=20690684721/500000000000000000, sx=2147483647, twom100_exp=39443045261/50000000000000000000000000000000000000000, x=1000000000000000000000000000001, xsb=0] [L46] hx = sx & 0x7fffffff VAL [\old(x)=1000000000000000000000000000001, halF_exp={4:0}, huge_exp=1000000000000000000000000000000, hx=2139095041, hx = sx & 0x7fffffff=2147483647, invln2_exp=1803368777/1250000000, k=0, ln2HI_exp={5:0}, ln2LO_exp={6:0}, one_exp=1, P1_exp=16666667163/100000000000, P3_exp=6613755977/100000000000000, P5_exp=20690684721/500000000000000000, sx=2147483647, twom100_exp=39443045261/50000000000000000000000000000000000000000, x=1000000000000000000000000000001, xsb=0] [L48] COND TRUE ((hx) > 0x7f800000L) [L49] return x + x; VAL [\old(x)=1000000000000000000000000000001, halF_exp={4:0}, huge_exp=1000000000000000000000000000000, hx=2139095041, hx = sx & 0x7fffffff=2147483647, invln2_exp=1803368777/1250000000, k=0, ln2HI_exp={5:0}, ln2LO_exp={6:0}, one_exp=1, P1_exp=16666667163/100000000000, P3_exp=6613755977/100000000000000, P5_exp=20690684721/500000000000000000, sx=2147483647, twom100_exp=39443045261/50000000000000000000000000000000000000000, x=1000000000000000000000000000001, xsb=0] [L129] RET, EXPR __ieee754_expf(x) [L129] float res = __ieee754_expf(x); [L132] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [halF_exp={4:0}, huge_exp=1000000000000000000000000000000, hx = sx & 0x7fffffff=2147483647, invln2_exp=1803368777/1250000000, ln2HI_exp={5:0}, ln2LO_exp={6:0}, one_exp=1, P1_exp=16666667163/100000000000, P3_exp=6613755977/100000000000000, P5_exp=20690684721/500000000000000000, res=1000000000000000000000000000002, res == 0.0f && __signbit_float(res) == 0=0, twom100_exp=39443045261/50000000000000000000000000000000000000000, x=1000000000000000000000000000001] [L132] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L133] reach_error() VAL [halF_exp={4:0}, huge_exp=1000000000000000000000000000000, hx = sx & 0x7fffffff=2147483647, invln2_exp=1803368777/1250000000, ln2HI_exp={5:0}, ln2LO_exp={6:0}, one_exp=1, P1_exp=16666667163/100000000000, P3_exp=6613755977/100000000000000, P5_exp=20690684721/500000000000000000, res=1000000000000000000000000000002, twom100_exp=39443045261/50000000000000000000000000000000000000000, x=1000000000000000000000000000001] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 80 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 278 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 38 IncrementalHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 191 mSDtfsCounter, 38 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=3, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 53 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 31 ConstructedInterpolants, 0 QuantifiedInterpolants, 39 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-20 16:42:59,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_0833.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b5f03ef8422f7b7708e900a4e8a8defb18a5d0c6a337d34a875dec58ac2c0349 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:43:01,192 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:43:01,194 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:43:01,232 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:43:01,233 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:43:01,236 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:43:01,237 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:43:01,240 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:43:01,242 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:43:01,246 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:43:01,247 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:43:01,250 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:43:01,250 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:43:01,252 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:43:01,253 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:43:01,255 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:43:01,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:43:01,256 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:43:01,258 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:43:01,262 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:43:01,264 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:43:01,264 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:43:01,266 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:43:01,267 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:43:01,271 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:43:01,271 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:43:01,272 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:43:01,273 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:43:01,273 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:43:01,274 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:43:01,274 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:43:01,274 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:43:01,275 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:43:01,276 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:43:01,277 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:43:01,277 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:43:01,278 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:43:01,278 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:43:01,278 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:43:01,279 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:43:01,280 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:43:01,280 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:43:01,308 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:43:01,309 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:43:01,309 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:43:01,310 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:43:01,310 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:43:01,310 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:43:01,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:43:01,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:43:01,312 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:43:01,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:43:01,312 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:43:01,313 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:43:01,313 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:43:01,313 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:43:01,313 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:43:01,313 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:43:01,313 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:43:01,314 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:43:01,314 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:43:01,314 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:43:01,314 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:43:01,314 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:43:01,314 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:43:01,314 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:43:01,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:43:01,315 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:43:01,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:43:01,315 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:43:01,315 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:43:01,315 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:43:01,315 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:43:01,316 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:43:01,316 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:43:01,316 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:43:01,316 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:43:01,316 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:43:01,316 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b5f03ef8422f7b7708e900a4e8a8defb18a5d0c6a337d34a875dec58ac2c0349 [2022-02-20 16:43:01,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:43:01,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:43:01,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:43:01,609 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:43:01,610 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:43:01,611 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0833.c [2022-02-20 16:43:01,675 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36d7c5fa5/e72a9f3d0edd458ebc979cd285bf5c77/FLAGc17a9adea [2022-02-20 16:43:02,072 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:43:02,073 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0833.c [2022-02-20 16:43:02,078 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36d7c5fa5/e72a9f3d0edd458ebc979cd285bf5c77/FLAGc17a9adea [2022-02-20 16:43:02,447 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36d7c5fa5/e72a9f3d0edd458ebc979cd285bf5c77 [2022-02-20 16:43:02,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:43:02,451 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:43:02,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:43:02,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:43:02,457 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:43:02,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:43:02" (1/1) ... [2022-02-20 16:43:02,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@556caf6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:02, skipping insertion in model container [2022-02-20 16:43:02,460 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:43:02" (1/1) ... [2022-02-20 16:43:02,467 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:43:02,486 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:43:02,620 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0833.c[3348,3361] [2022-02-20 16:43:02,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:43:02,669 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:43:02,726 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0833.c[3348,3361] [2022-02-20 16:43:02,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:43:02,750 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:43:02,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:02 WrapperNode [2022-02-20 16:43:02,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:43:02,752 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:43:02,752 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:43:02,752 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:43:02,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:02" (1/1) ... [2022-02-20 16:43:02,778 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:02" (1/1) ... [2022-02-20 16:43:02,818 INFO L137 Inliner]: procedures = 21, calls = 47, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 185 [2022-02-20 16:43:02,820 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:43:02,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:43:02,821 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:43:02,821 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:43:02,827 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:02" (1/1) ... [2022-02-20 16:43:02,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:02" (1/1) ... [2022-02-20 16:43:02,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:02" (1/1) ... [2022-02-20 16:43:02,843 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:02" (1/1) ... [2022-02-20 16:43:02,851 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:02" (1/1) ... [2022-02-20 16:43:02,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:02" (1/1) ... [2022-02-20 16:43:02,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:02" (1/1) ... [2022-02-20 16:43:02,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:43:02,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:43:02,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:43:02,880 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:43:02,881 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:02" (1/1) ... [2022-02-20 16:43:02,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:43:02,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:43:02,902 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:43:02,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:43:02,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:43:02,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-02-20 16:43:02,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:43:02,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:43:02,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:43:02,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:43:02,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:43:02,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:43:02,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:43:02,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:43:02,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:43:03,010 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:43:03,011 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:43:12,140 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:43:12,148 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:43:12,148 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2022-02-20 16:43:12,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:43:12 BoogieIcfgContainer [2022-02-20 16:43:12,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:43:12,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:43:12,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:43:12,153 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:43:12,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:43:02" (1/3) ... [2022-02-20 16:43:12,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f1b0330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:43:12, skipping insertion in model container [2022-02-20 16:43:12,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:02" (2/3) ... [2022-02-20 16:43:12,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f1b0330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:43:12, skipping insertion in model container [2022-02-20 16:43:12,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:43:12" (3/3) ... [2022-02-20 16:43:12,155 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0833.c [2022-02-20 16:43:12,159 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:43:12,159 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:43:12,190 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:43:12,195 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:43:12,195 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:43:12,207 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 40 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:12,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:43:12,211 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:43:12,211 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:43:12,212 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:43:12,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:43:12,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1903254750, now seen corresponding path program 1 times [2022-02-20 16:43:12,232 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:43:12,233 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078572142] [2022-02-20 16:43:12,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:43:12,234 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:43:12,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:43:12,245 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:43:12,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:43:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:43:12,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:43:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:43:12,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:43:12,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {44#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#halF_exp~0.base, ~#halF_exp~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.5)), ~#halF_exp~0.base, ~#halF_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.5))), ~#halF_exp~0.base, ~bvadd32(4bv32, ~#halF_exp~0.offset), 4bv32);~huge_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30));~twom100_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.8886090522E-31));~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset := 5bv32, 0bv32;call #Ultimate.allocInit(8bv32, 5bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.69313812256)), ~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.69313812256))), ~#ln2HI_exp~0.base, ~bvadd32(4bv32, ~#ln2HI_exp~0.offset), 4bv32);~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset := 6bv32, 0bv32;call #Ultimate.allocInit(8bv32, 6bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 9.0580006145E-6)), ~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 9.0580006145E-6))), ~#ln2LO_exp~0.base, ~bvadd32(4bv32, ~#ln2LO_exp~0.offset), 4bv32);~invln2_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.4426950216));~P1_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.16666667163));~P2_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.002777777845)));~P3_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 6.613755977E-5));~P4_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.6533901999E-6)));~P5_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 4.1381369442E-8)); {44#true} is VALID [2022-02-20 16:43:12,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {44#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1, main_#t~ret17#1, main_#t~short18#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());assume { :begin_inline___ieee754_expf } true;__ieee754_expf_#in~x#1 := main_~x~0#1;havoc __ieee754_expf_#res#1;havoc __ieee754_expf_#t~mem4#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, __ieee754_expf_#t~ite5#1, __ieee754_expf_#t~mem6#1, __ieee754_expf_#t~mem7#1, __ieee754_expf_#t~mem8#1, __ieee754_expf_#t~mem9#1, __ieee754_expf_#t~mem10#1, __ieee754_expf_#t~mem11#1, __ieee754_expf_~#gf_u~1#1.base, __ieee754_expf_~#gf_u~1#1.offset, __ieee754_expf_#t~mem12#1, __ieee754_expf_~#sf_u~0#1.base, __ieee754_expf_~#sf_u~0#1.offset, __ieee754_expf_~hy~0#1, __ieee754_expf_#t~mem13#1, __ieee754_expf_~#gf_u~2#1.base, __ieee754_expf_~#gf_u~2#1.offset, __ieee754_expf_#t~mem14#1, __ieee754_expf_~#sf_u~1#1.base, __ieee754_expf_~#sf_u~1#1.offset, __ieee754_expf_~hy~1#1, __ieee754_expf_~x#1, __ieee754_expf_~y~0#1, __ieee754_expf_~hi~0#1, __ieee754_expf_~lo~0#1, __ieee754_expf_~c~0#1, __ieee754_expf_~t~0#1, __ieee754_expf_~k~0#1, __ieee754_expf_~xsb~0#1, __ieee754_expf_~sx~0#1, __ieee754_expf_~hx~0#1;__ieee754_expf_~x#1 := __ieee754_expf_#in~x#1;havoc __ieee754_expf_~y~0#1;havoc __ieee754_expf_~hi~0#1;havoc __ieee754_expf_~lo~0#1;havoc __ieee754_expf_~c~0#1;havoc __ieee754_expf_~t~0#1;__ieee754_expf_~k~0#1 := 0bv32;havoc __ieee754_expf_~xsb~0#1;havoc __ieee754_expf_~sx~0#1;havoc __ieee754_expf_~hx~0#1; {44#true} is VALID [2022-02-20 16:43:12,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#true} assume !true; {45#false} is VALID [2022-02-20 16:43:12,752 INFO L290 TraceCheckUtils]: 3: Hoare triple {45#false} __ieee754_expf_~xsb~0#1 := ~bvand32(1bv32, ~bvashr32(__ieee754_expf_~sx~0#1, 31bv32));__ieee754_expf_~hx~0#1 := ~bvand32(2147483647bv32, __ieee754_expf_~sx~0#1); {45#false} is VALID [2022-02-20 16:43:12,752 INFO L290 TraceCheckUtils]: 4: Hoare triple {45#false} assume ~bvugt32(__ieee754_expf_~hx~0#1, 2139095040bv32);__ieee754_expf_#res#1 := ~fp.add~FLOAT(currentRoundingMode, __ieee754_expf_~x#1, __ieee754_expf_~x#1); {45#false} is VALID [2022-02-20 16:43:12,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {45#false} main_#t~ret16#1 := __ieee754_expf_#res#1;assume { :end_inline___ieee754_expf } true;main_~res~0#1 := main_#t~ret16#1;havoc main_#t~ret16#1;main_#t~short18#1 := ~fp.eq~FLOAT(main_~res~0#1, ~Pluszero~FLOAT()); {45#false} is VALID [2022-02-20 16:43:12,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {45#false} assume !main_#t~short18#1; {45#false} is VALID [2022-02-20 16:43:12,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {45#false} assume !main_#t~short18#1;havoc main_#t~ret17#1;havoc main_#t~short18#1; {45#false} is VALID [2022-02-20 16:43:12,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {45#false} assume !false; {45#false} is VALID [2022-02-20 16:43:12,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:43:12,755 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:43:12,771 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:43:12,771 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1078572142] [2022-02-20 16:43:12,771 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1078572142] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:43:12,771 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:43:12,772 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:43:12,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800584178] [2022-02-20 16:43:12,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:43:12,777 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 16:43:12,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:43:12,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:12,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:43:12,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:43:12,813 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:43:12,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:43:12,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:43:12,836 INFO L87 Difference]: Start difference. First operand has 41 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 40 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:21,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:21,889 INFO L93 Difference]: Finished difference Result 80 states and 128 transitions. [2022-02-20 16:43:21,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:43:21,889 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 16:43:21,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:43:21,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:21,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 128 transitions. [2022-02-20 16:43:21,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:21,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 128 transitions. [2022-02-20 16:43:21,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 128 transitions. [2022-02-20 16:43:24,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:43:24,195 INFO L225 Difference]: With dead ends: 80 [2022-02-20 16:43:24,197 INFO L226 Difference]: Without dead ends: 38 [2022-02-20 16:43:24,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:43:24,205 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:43:24,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:43:24,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-20 16:43:24,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-02-20 16:43:24,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:43:24,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:24,229 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:24,229 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:24,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:24,234 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2022-02-20 16:43:24,234 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-02-20 16:43:24,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:43:24,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:43:24,236 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 38 states. [2022-02-20 16:43:24,239 INFO L87 Difference]: Start difference. First operand has 38 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 38 states. [2022-02-20 16:43:24,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:24,246 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2022-02-20 16:43:24,247 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-02-20 16:43:24,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:43:24,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:43:24,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:43:24,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:43:24,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:24,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-02-20 16:43:24,252 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 9 [2022-02-20 16:43:24,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:43:24,252 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-02-20 16:43:24,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:24,252 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-02-20 16:43:24,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:43:24,253 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:43:24,253 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:43:24,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:43:24,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:43:24,454 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:43:24,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:43:24,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1485096063, now seen corresponding path program 1 times [2022-02-20 16:43:24,455 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:43:24,455 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [523186230] [2022-02-20 16:43:24,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:43:24,455 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:43:24,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:43:24,456 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:43:24,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:43:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:43:24,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:43:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:43:24,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:43:25,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {286#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#halF_exp~0.base, ~#halF_exp~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.5)), ~#halF_exp~0.base, ~#halF_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.5))), ~#halF_exp~0.base, ~bvadd32(4bv32, ~#halF_exp~0.offset), 4bv32);~huge_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30));~twom100_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.8886090522E-31));~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset := 5bv32, 0bv32;call #Ultimate.allocInit(8bv32, 5bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.69313812256)), ~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.69313812256))), ~#ln2HI_exp~0.base, ~bvadd32(4bv32, ~#ln2HI_exp~0.offset), 4bv32);~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset := 6bv32, 0bv32;call #Ultimate.allocInit(8bv32, 6bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 9.0580006145E-6)), ~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 9.0580006145E-6))), ~#ln2LO_exp~0.base, ~bvadd32(4bv32, ~#ln2LO_exp~0.offset), 4bv32);~invln2_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.4426950216));~P1_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.16666667163));~P2_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.002777777845)));~P3_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 6.613755977E-5));~P4_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.6533901999E-6)));~P5_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 4.1381369442E-8)); {286#true} is VALID [2022-02-20 16:43:25,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {286#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1, main_#t~ret17#1, main_#t~short18#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());assume { :begin_inline___ieee754_expf } true;__ieee754_expf_#in~x#1 := main_~x~0#1;havoc __ieee754_expf_#res#1;havoc __ieee754_expf_#t~mem4#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, __ieee754_expf_#t~ite5#1, __ieee754_expf_#t~mem6#1, __ieee754_expf_#t~mem7#1, __ieee754_expf_#t~mem8#1, __ieee754_expf_#t~mem9#1, __ieee754_expf_#t~mem10#1, __ieee754_expf_#t~mem11#1, __ieee754_expf_~#gf_u~1#1.base, __ieee754_expf_~#gf_u~1#1.offset, __ieee754_expf_#t~mem12#1, __ieee754_expf_~#sf_u~0#1.base, __ieee754_expf_~#sf_u~0#1.offset, __ieee754_expf_~hy~0#1, __ieee754_expf_#t~mem13#1, __ieee754_expf_~#gf_u~2#1.base, __ieee754_expf_~#gf_u~2#1.offset, __ieee754_expf_#t~mem14#1, __ieee754_expf_~#sf_u~1#1.base, __ieee754_expf_~#sf_u~1#1.offset, __ieee754_expf_~hy~1#1, __ieee754_expf_~x#1, __ieee754_expf_~y~0#1, __ieee754_expf_~hi~0#1, __ieee754_expf_~lo~0#1, __ieee754_expf_~c~0#1, __ieee754_expf_~t~0#1, __ieee754_expf_~k~0#1, __ieee754_expf_~xsb~0#1, __ieee754_expf_~sx~0#1, __ieee754_expf_~hx~0#1;__ieee754_expf_~x#1 := __ieee754_expf_#in~x#1;havoc __ieee754_expf_~y~0#1;havoc __ieee754_expf_~hi~0#1;havoc __ieee754_expf_~lo~0#1;havoc __ieee754_expf_~c~0#1;havoc __ieee754_expf_~t~0#1;__ieee754_expf_~k~0#1 := 0bv32;havoc __ieee754_expf_~xsb~0#1;havoc __ieee754_expf_~sx~0#1;havoc __ieee754_expf_~hx~0#1; {294#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_expf_~x#1|))} is VALID [2022-02-20 16:43:25,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_expf_~x#1|))} call __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_expf_~x#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4bv32);call __ieee754_expf_#t~mem4#1 := read~intINTTYPE4(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4bv32);__ieee754_expf_~sx~0#1 := __ieee754_expf_#t~mem4#1;havoc __ieee754_expf_#t~mem4#1;call ULTIMATE.dealloc(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset);havoc __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset; {298#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} is VALID [2022-02-20 16:43:25,189 INFO L290 TraceCheckUtils]: 3: Hoare triple {298#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} goto; {298#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} is VALID [2022-02-20 16:43:25,192 INFO L290 TraceCheckUtils]: 4: Hoare triple {298#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} __ieee754_expf_~xsb~0#1 := ~bvand32(1bv32, ~bvashr32(__ieee754_expf_~sx~0#1, 31bv32));__ieee754_expf_~hx~0#1 := ~bvand32(2147483647bv32, __ieee754_expf_~sx~0#1); {305#(exists ((|ULTIMATE.start___ieee754_expf_~sx~0#1| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_expf_~hx~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))))} is VALID [2022-02-20 16:43:25,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {305#(exists ((|ULTIMATE.start___ieee754_expf_~sx~0#1| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_expf_~hx~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))))} assume ~bvugt32(__ieee754_expf_~hx~0#1, 2139095040bv32);__ieee754_expf_#res#1 := ~fp.add~FLOAT(currentRoundingMode, __ieee754_expf_~x#1, __ieee754_expf_~x#1); {287#false} is VALID [2022-02-20 16:43:25,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {287#false} main_#t~ret16#1 := __ieee754_expf_#res#1;assume { :end_inline___ieee754_expf } true;main_~res~0#1 := main_#t~ret16#1;havoc main_#t~ret16#1;main_#t~short18#1 := ~fp.eq~FLOAT(main_~res~0#1, ~Pluszero~FLOAT()); {287#false} is VALID [2022-02-20 16:43:25,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {287#false} assume !main_#t~short18#1; {287#false} is VALID [2022-02-20 16:43:25,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {287#false} assume !main_#t~short18#1;havoc main_#t~ret17#1;havoc main_#t~short18#1; {287#false} is VALID [2022-02-20 16:43:25,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {287#false} assume !false; {287#false} is VALID [2022-02-20 16:43:25,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:43:25,204 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:43:25,204 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:43:25,205 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [523186230] [2022-02-20 16:43:25,205 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [523186230] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:43:25,205 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:43:25,205 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:43:25,205 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785873372] [2022-02-20 16:43:25,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:43:25,206 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:43:25,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:43:25,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:25,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:43:25,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:43:25,242 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:43:25,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:43:25,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:43:25,243 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:51,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:51,579 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-02-20 16:43:51,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:43:51,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:43:51,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:43:51,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:51,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-02-20 16:43:51,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:51,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-02-20 16:43:51,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2022-02-20 16:43:52,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:43:52,880 INFO L225 Difference]: With dead ends: 47 [2022-02-20 16:43:52,880 INFO L226 Difference]: Without dead ends: 38 [2022-02-20 16:43:52,881 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:43:52,882 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:43:52,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 28 Unchecked, 0.0s Time] [2022-02-20 16:43:52,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-20 16:43:52,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-02-20 16:43:52,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:43:52,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:52,885 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:52,885 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:52,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:52,886 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-02-20 16:43:52,887 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-02-20 16:43:52,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:43:52,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:43:52,887 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 38 states. [2022-02-20 16:43:52,887 INFO L87 Difference]: Start difference. First operand has 38 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 38 states. [2022-02-20 16:43:52,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:52,889 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-02-20 16:43:52,889 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-02-20 16:43:52,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:43:52,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:43:52,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:43:52,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:43:52,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:52,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2022-02-20 16:43:52,891 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 10 [2022-02-20 16:43:52,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:43:52,893 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2022-02-20 16:43:52,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:52,893 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-02-20 16:43:52,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:43:52,894 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:43:52,894 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:43:52,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 16:43:53,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:43:53,100 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:43:53,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:43:53,101 INFO L85 PathProgramCache]: Analyzing trace with hash 228815620, now seen corresponding path program 1 times [2022-02-20 16:43:53,101 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:43:53,101 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137815526] [2022-02-20 16:43:53,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:43:53,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:43:53,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:43:53,102 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:43:53,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:43:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:43:53,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:43:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:43:53,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:43:53,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {496#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#halF_exp~0.base, ~#halF_exp~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.5)), ~#halF_exp~0.base, ~#halF_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.5))), ~#halF_exp~0.base, ~bvadd32(4bv32, ~#halF_exp~0.offset), 4bv32);~huge_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30));~twom100_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.8886090522E-31));~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset := 5bv32, 0bv32;call #Ultimate.allocInit(8bv32, 5bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.69313812256)), ~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.69313812256))), ~#ln2HI_exp~0.base, ~bvadd32(4bv32, ~#ln2HI_exp~0.offset), 4bv32);~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset := 6bv32, 0bv32;call #Ultimate.allocInit(8bv32, 6bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 9.0580006145E-6)), ~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 9.0580006145E-6))), ~#ln2LO_exp~0.base, ~bvadd32(4bv32, ~#ln2LO_exp~0.offset), 4bv32);~invln2_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.4426950216));~P1_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.16666667163));~P2_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.002777777845)));~P3_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 6.613755977E-5));~P4_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.6533901999E-6)));~P5_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 4.1381369442E-8)); {496#true} is VALID [2022-02-20 16:43:53,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {496#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1, main_#t~ret17#1, main_#t~short18#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());assume { :begin_inline___ieee754_expf } true;__ieee754_expf_#in~x#1 := main_~x~0#1;havoc __ieee754_expf_#res#1;havoc __ieee754_expf_#t~mem4#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, __ieee754_expf_#t~ite5#1, __ieee754_expf_#t~mem6#1, __ieee754_expf_#t~mem7#1, __ieee754_expf_#t~mem8#1, __ieee754_expf_#t~mem9#1, __ieee754_expf_#t~mem10#1, __ieee754_expf_#t~mem11#1, __ieee754_expf_~#gf_u~1#1.base, __ieee754_expf_~#gf_u~1#1.offset, __ieee754_expf_#t~mem12#1, __ieee754_expf_~#sf_u~0#1.base, __ieee754_expf_~#sf_u~0#1.offset, __ieee754_expf_~hy~0#1, __ieee754_expf_#t~mem13#1, __ieee754_expf_~#gf_u~2#1.base, __ieee754_expf_~#gf_u~2#1.offset, __ieee754_expf_#t~mem14#1, __ieee754_expf_~#sf_u~1#1.base, __ieee754_expf_~#sf_u~1#1.offset, __ieee754_expf_~hy~1#1, __ieee754_expf_~x#1, __ieee754_expf_~y~0#1, __ieee754_expf_~hi~0#1, __ieee754_expf_~lo~0#1, __ieee754_expf_~c~0#1, __ieee754_expf_~t~0#1, __ieee754_expf_~k~0#1, __ieee754_expf_~xsb~0#1, __ieee754_expf_~sx~0#1, __ieee754_expf_~hx~0#1;__ieee754_expf_~x#1 := __ieee754_expf_#in~x#1;havoc __ieee754_expf_~y~0#1;havoc __ieee754_expf_~hi~0#1;havoc __ieee754_expf_~lo~0#1;havoc __ieee754_expf_~c~0#1;havoc __ieee754_expf_~t~0#1;__ieee754_expf_~k~0#1 := 0bv32;havoc __ieee754_expf_~xsb~0#1;havoc __ieee754_expf_~sx~0#1;havoc __ieee754_expf_~hx~0#1; {504#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_expf_~x#1|))} is VALID [2022-02-20 16:43:53,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {504#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_expf_~x#1|))} call __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_expf_~x#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4bv32);call __ieee754_expf_#t~mem4#1 := read~intINTTYPE4(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4bv32);__ieee754_expf_~sx~0#1 := __ieee754_expf_#t~mem4#1;havoc __ieee754_expf_#t~mem4#1;call ULTIMATE.dealloc(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset);havoc __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset; {508#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} is VALID [2022-02-20 16:43:53,900 INFO L290 TraceCheckUtils]: 3: Hoare triple {508#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} goto; {508#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} is VALID [2022-02-20 16:43:53,902 INFO L290 TraceCheckUtils]: 4: Hoare triple {508#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} __ieee754_expf_~xsb~0#1 := ~bvand32(1bv32, ~bvashr32(__ieee754_expf_~sx~0#1, 31bv32));__ieee754_expf_~hx~0#1 := ~bvand32(2147483647bv32, __ieee754_expf_~sx~0#1); {515#(exists ((|ULTIMATE.start___ieee754_expf_~sx~0#1| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_expf_~hx~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))))} is VALID [2022-02-20 16:43:53,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {515#(exists ((|ULTIMATE.start___ieee754_expf_~sx~0#1| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_expf_~hx~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))))} assume !~bvugt32(__ieee754_expf_~hx~0#1, 2139095040bv32); {515#(exists ((|ULTIMATE.start___ieee754_expf_~sx~0#1| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_expf_~hx~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))))} is VALID [2022-02-20 16:43:53,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {515#(exists ((|ULTIMATE.start___ieee754_expf_~sx~0#1| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_expf_~hx~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))))} assume !(2139095040bv32 == __ieee754_expf_~hx~0#1); {497#false} is VALID [2022-02-20 16:43:53,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {497#false} assume ~bvsgt32(__ieee754_expf_~sx~0#1, 1118925335bv32);__ieee754_expf_#res#1 := ~fp.mul~FLOAT(currentRoundingMode, ~huge_exp~0, ~huge_exp~0); {497#false} is VALID [2022-02-20 16:43:53,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {497#false} main_#t~ret16#1 := __ieee754_expf_#res#1;assume { :end_inline___ieee754_expf } true;main_~res~0#1 := main_#t~ret16#1;havoc main_#t~ret16#1;main_#t~short18#1 := ~fp.eq~FLOAT(main_~res~0#1, ~Pluszero~FLOAT()); {497#false} is VALID [2022-02-20 16:43:53,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {497#false} assume !main_#t~short18#1; {497#false} is VALID [2022-02-20 16:43:53,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {497#false} assume !main_#t~short18#1;havoc main_#t~ret17#1;havoc main_#t~short18#1; {497#false} is VALID [2022-02-20 16:43:53,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {497#false} assume !false; {497#false} is VALID [2022-02-20 16:43:53,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:43:53,905 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:43:53,905 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:43:53,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137815526] [2022-02-20 16:43:53,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137815526] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:43:53,906 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:43:53,907 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:43:53,907 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87776543] [2022-02-20 16:43:53,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:43:53,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:43:53,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:43:53,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:53,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:43:53,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:43:53,953 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:43:53,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:43:53,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:43:53,954 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:54,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:54,750 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-02-20 16:43:54,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:43:54,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:43:54,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:43:54,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:54,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-02-20 16:43:54,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:54,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-02-20 16:43:54,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 57 transitions. [2022-02-20 16:43:56,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:43:56,034 INFO L225 Difference]: With dead ends: 47 [2022-02-20 16:43:56,035 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 16:43:56,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:43:56,036 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:43:56,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 7 Unchecked, 0.0s Time] [2022-02-20 16:43:56,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 16:43:56,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 16:43:56,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:43:56,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:56,041 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:56,041 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:56,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:56,042 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-02-20 16:43:56,042 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-20 16:43:56,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:43:56,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:43:56,042 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states. [2022-02-20 16:43:56,042 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states. [2022-02-20 16:43:56,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:56,043 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-02-20 16:43:56,043 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-20 16:43:56,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:43:56,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:43:56,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:43:56,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:43:56,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:56,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-02-20 16:43:56,045 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 12 [2022-02-20 16:43:56,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:43:56,045 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-02-20 16:43:56,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:56,045 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-20 16:43:56,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:43:56,045 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:43:56,046 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:43:56,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:43:56,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:43:56,258 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:43:56,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:43:56,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1241168828, now seen corresponding path program 1 times [2022-02-20 16:43:56,259 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:43:56,259 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654100398] [2022-02-20 16:43:56,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:43:56,259 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:43:56,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:43:56,260 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:43:56,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 16:43:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:43:56,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:43:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:43:56,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:43:56,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {650#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#halF_exp~0.base, ~#halF_exp~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.5)), ~#halF_exp~0.base, ~#halF_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.5))), ~#halF_exp~0.base, ~bvadd32(4bv32, ~#halF_exp~0.offset), 4bv32);~huge_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30));~twom100_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.8886090522E-31));~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset := 5bv32, 0bv32;call #Ultimate.allocInit(8bv32, 5bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.69313812256)), ~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.69313812256))), ~#ln2HI_exp~0.base, ~bvadd32(4bv32, ~#ln2HI_exp~0.offset), 4bv32);~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset := 6bv32, 0bv32;call #Ultimate.allocInit(8bv32, 6bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 9.0580006145E-6)), ~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 9.0580006145E-6))), ~#ln2LO_exp~0.base, ~bvadd32(4bv32, ~#ln2LO_exp~0.offset), 4bv32);~invln2_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.4426950216));~P1_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.16666667163));~P2_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.002777777845)));~P3_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 6.613755977E-5));~P4_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.6533901999E-6)));~P5_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 4.1381369442E-8)); {650#true} is VALID [2022-02-20 16:43:56,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {650#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1, main_#t~ret17#1, main_#t~short18#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());assume { :begin_inline___ieee754_expf } true;__ieee754_expf_#in~x#1 := main_~x~0#1;havoc __ieee754_expf_#res#1;havoc __ieee754_expf_#t~mem4#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, __ieee754_expf_#t~ite5#1, __ieee754_expf_#t~mem6#1, __ieee754_expf_#t~mem7#1, __ieee754_expf_#t~mem8#1, __ieee754_expf_#t~mem9#1, __ieee754_expf_#t~mem10#1, __ieee754_expf_#t~mem11#1, __ieee754_expf_~#gf_u~1#1.base, __ieee754_expf_~#gf_u~1#1.offset, __ieee754_expf_#t~mem12#1, __ieee754_expf_~#sf_u~0#1.base, __ieee754_expf_~#sf_u~0#1.offset, __ieee754_expf_~hy~0#1, __ieee754_expf_#t~mem13#1, __ieee754_expf_~#gf_u~2#1.base, __ieee754_expf_~#gf_u~2#1.offset, __ieee754_expf_#t~mem14#1, __ieee754_expf_~#sf_u~1#1.base, __ieee754_expf_~#sf_u~1#1.offset, __ieee754_expf_~hy~1#1, __ieee754_expf_~x#1, __ieee754_expf_~y~0#1, __ieee754_expf_~hi~0#1, __ieee754_expf_~lo~0#1, __ieee754_expf_~c~0#1, __ieee754_expf_~t~0#1, __ieee754_expf_~k~0#1, __ieee754_expf_~xsb~0#1, __ieee754_expf_~sx~0#1, __ieee754_expf_~hx~0#1;__ieee754_expf_~x#1 := __ieee754_expf_#in~x#1;havoc __ieee754_expf_~y~0#1;havoc __ieee754_expf_~hi~0#1;havoc __ieee754_expf_~lo~0#1;havoc __ieee754_expf_~c~0#1;havoc __ieee754_expf_~t~0#1;__ieee754_expf_~k~0#1 := 0bv32;havoc __ieee754_expf_~xsb~0#1;havoc __ieee754_expf_~sx~0#1;havoc __ieee754_expf_~hx~0#1; {658#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_expf_~x#1|))} is VALID [2022-02-20 16:43:56,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {658#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_expf_~x#1|))} call __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_expf_~x#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4bv32);call __ieee754_expf_#t~mem4#1 := read~intINTTYPE4(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4bv32);__ieee754_expf_~sx~0#1 := __ieee754_expf_#t~mem4#1;havoc __ieee754_expf_#t~mem4#1;call ULTIMATE.dealloc(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset);havoc __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset; {662#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} is VALID [2022-02-20 16:43:56,991 INFO L290 TraceCheckUtils]: 3: Hoare triple {662#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} goto; {662#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} is VALID [2022-02-20 16:43:56,993 INFO L290 TraceCheckUtils]: 4: Hoare triple {662#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))} __ieee754_expf_~xsb~0#1 := ~bvand32(1bv32, ~bvashr32(__ieee754_expf_~sx~0#1, 31bv32));__ieee754_expf_~hx~0#1 := ~bvand32(2147483647bv32, __ieee754_expf_~sx~0#1); {669#(exists ((|ULTIMATE.start___ieee754_expf_~sx~0#1| (_ BitVec 32))) (and (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))) (= (bvand (_ bv1 32) (bvashr |ULTIMATE.start___ieee754_expf_~sx~0#1| (_ bv31 32))) |ULTIMATE.start___ieee754_expf_~xsb~0#1|)))} is VALID [2022-02-20 16:43:56,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {669#(exists ((|ULTIMATE.start___ieee754_expf_~sx~0#1| (_ BitVec 32))) (and (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))) (= (bvand (_ bv1 32) (bvashr |ULTIMATE.start___ieee754_expf_~sx~0#1| (_ bv31 32))) |ULTIMATE.start___ieee754_expf_~xsb~0#1|)))} assume !~bvugt32(__ieee754_expf_~hx~0#1, 2139095040bv32); {669#(exists ((|ULTIMATE.start___ieee754_expf_~sx~0#1| (_ BitVec 32))) (and (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))) (= (bvand (_ bv1 32) (bvashr |ULTIMATE.start___ieee754_expf_~sx~0#1| (_ bv31 32))) |ULTIMATE.start___ieee754_expf_~xsb~0#1|)))} is VALID [2022-02-20 16:43:56,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {669#(exists ((|ULTIMATE.start___ieee754_expf_~sx~0#1| (_ BitVec 32))) (and (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))) (= (bvand (_ bv1 32) (bvashr |ULTIMATE.start___ieee754_expf_~sx~0#1| (_ bv31 32))) |ULTIMATE.start___ieee754_expf_~xsb~0#1|)))} assume 2139095040bv32 == __ieee754_expf_~hx~0#1; {669#(exists ((|ULTIMATE.start___ieee754_expf_~sx~0#1| (_ BitVec 32))) (and (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))) (= (bvand (_ bv1 32) (bvashr |ULTIMATE.start___ieee754_expf_~sx~0#1| (_ bv31 32))) |ULTIMATE.start___ieee754_expf_~xsb~0#1|)))} is VALID [2022-02-20 16:43:57,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {669#(exists ((|ULTIMATE.start___ieee754_expf_~sx~0#1| (_ BitVec 32))) (and (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))) (= (bvand (_ bv1 32) (bvashr |ULTIMATE.start___ieee754_expf_~sx~0#1| (_ bv31 32))) |ULTIMATE.start___ieee754_expf_~xsb~0#1|)))} assume 0bv32 == __ieee754_expf_~xsb~0#1;__ieee754_expf_#t~ite5#1 := ~convertFLOATToDOUBLE(currentRoundingMode, __ieee754_expf_~x#1); {651#false} is VALID [2022-02-20 16:43:57,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {651#false} __ieee754_expf_#res#1 := ~convertDOUBLEToFLOAT(currentRoundingMode, __ieee754_expf_#t~ite5#1);havoc __ieee754_expf_#t~ite5#1; {651#false} is VALID [2022-02-20 16:43:57,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {651#false} main_#t~ret16#1 := __ieee754_expf_#res#1;assume { :end_inline___ieee754_expf } true;main_~res~0#1 := main_#t~ret16#1;havoc main_#t~ret16#1;main_#t~short18#1 := ~fp.eq~FLOAT(main_~res~0#1, ~Pluszero~FLOAT()); {651#false} is VALID [2022-02-20 16:43:57,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {651#false} assume !main_#t~short18#1; {651#false} is VALID [2022-02-20 16:43:57,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {651#false} assume !main_#t~short18#1;havoc main_#t~ret17#1;havoc main_#t~short18#1; {651#false} is VALID [2022-02-20 16:43:57,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {651#false} assume !false; {651#false} is VALID [2022-02-20 16:43:57,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:43:57,012 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:43:57,012 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:43:57,013 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [654100398] [2022-02-20 16:43:57,013 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [654100398] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:43:57,013 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:43:57,013 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:43:57,013 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318996464] [2022-02-20 16:43:57,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:43:57,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:43:57,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:43:57,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:57,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:43:57,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:43:57,081 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:43:57,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:43:57,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:43:57,082 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:57,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:57,621 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-02-20 16:43:57,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:43:57,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:43:57,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:43:57,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:57,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2022-02-20 16:43:57,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:57,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2022-02-20 16:43:57,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 29 transitions. [2022-02-20 16:43:57,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:43:57,712 INFO L225 Difference]: With dead ends: 28 [2022-02-20 16:43:57,712 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 16:43:57,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:43:57,713 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:43:57,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 5 Unchecked, 0.0s Time] [2022-02-20 16:43:57,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 16:43:57,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 16:43:57,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:43:57,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:57,715 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:57,715 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:57,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:57,716 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-02-20 16:43:57,716 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-02-20 16:43:57,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:43:57,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:43:57,717 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states. [2022-02-20 16:43:57,717 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states. [2022-02-20 16:43:57,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:57,717 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-02-20 16:43:57,717 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-02-20 16:43:57,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:43:57,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:43:57,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:43:57,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:43:57,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:57,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-02-20 16:43:57,719 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 13 [2022-02-20 16:43:57,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:43:57,719 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-02-20 16:43:57,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:57,719 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-02-20 16:43:57,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:43:57,720 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:43:57,720 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:43:57,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 16:43:57,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:43:57,935 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:43:57,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:43:57,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1183910526, now seen corresponding path program 1 times [2022-02-20 16:43:57,936 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:43:57,936 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1786833472] [2022-02-20 16:43:57,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:43:57,936 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:43:57,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:43:57,939 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:43:57,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 16:43:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:43:58,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 16:43:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:43:58,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:43:58,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {786#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#halF_exp~0.base, ~#halF_exp~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.5)), ~#halF_exp~0.base, ~#halF_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.5))), ~#halF_exp~0.base, ~bvadd32(4bv32, ~#halF_exp~0.offset), 4bv32);~huge_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30));~twom100_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.8886090522E-31));~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset := 5bv32, 0bv32;call #Ultimate.allocInit(8bv32, 5bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.69313812256)), ~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.69313812256))), ~#ln2HI_exp~0.base, ~bvadd32(4bv32, ~#ln2HI_exp~0.offset), 4bv32);~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset := 6bv32, 0bv32;call #Ultimate.allocInit(8bv32, 6bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 9.0580006145E-6)), ~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 9.0580006145E-6))), ~#ln2LO_exp~0.base, ~bvadd32(4bv32, ~#ln2LO_exp~0.offset), 4bv32);~invln2_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.4426950216));~P1_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.16666667163));~P2_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.002777777845)));~P3_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 6.613755977E-5));~P4_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.6533901999E-6)));~P5_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 4.1381369442E-8)); {791#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:43:58,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {791#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1, main_#t~ret17#1, main_#t~short18#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());assume { :begin_inline___ieee754_expf } true;__ieee754_expf_#in~x#1 := main_~x~0#1;havoc __ieee754_expf_#res#1;havoc __ieee754_expf_#t~mem4#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, __ieee754_expf_#t~ite5#1, __ieee754_expf_#t~mem6#1, __ieee754_expf_#t~mem7#1, __ieee754_expf_#t~mem8#1, __ieee754_expf_#t~mem9#1, __ieee754_expf_#t~mem10#1, __ieee754_expf_#t~mem11#1, __ieee754_expf_~#gf_u~1#1.base, __ieee754_expf_~#gf_u~1#1.offset, __ieee754_expf_#t~mem12#1, __ieee754_expf_~#sf_u~0#1.base, __ieee754_expf_~#sf_u~0#1.offset, __ieee754_expf_~hy~0#1, __ieee754_expf_#t~mem13#1, __ieee754_expf_~#gf_u~2#1.base, __ieee754_expf_~#gf_u~2#1.offset, __ieee754_expf_#t~mem14#1, __ieee754_expf_~#sf_u~1#1.base, __ieee754_expf_~#sf_u~1#1.offset, __ieee754_expf_~hy~1#1, __ieee754_expf_~x#1, __ieee754_expf_~y~0#1, __ieee754_expf_~hi~0#1, __ieee754_expf_~lo~0#1, __ieee754_expf_~c~0#1, __ieee754_expf_~t~0#1, __ieee754_expf_~k~0#1, __ieee754_expf_~xsb~0#1, __ieee754_expf_~sx~0#1, __ieee754_expf_~hx~0#1;__ieee754_expf_~x#1 := __ieee754_expf_#in~x#1;havoc __ieee754_expf_~y~0#1;havoc __ieee754_expf_~hi~0#1;havoc __ieee754_expf_~lo~0#1;havoc __ieee754_expf_~c~0#1;havoc __ieee754_expf_~t~0#1;__ieee754_expf_~k~0#1 := 0bv32;havoc __ieee754_expf_~xsb~0#1;havoc __ieee754_expf_~sx~0#1;havoc __ieee754_expf_~hx~0#1; {791#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:43:58,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {791#(= currentRoundingMode roundNearestTiesToEven)} call __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_expf_~x#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4bv32);call __ieee754_expf_#t~mem4#1 := read~intINTTYPE4(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4bv32);__ieee754_expf_~sx~0#1 := __ieee754_expf_#t~mem4#1;havoc __ieee754_expf_#t~mem4#1;call ULTIMATE.dealloc(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset);havoc __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset; {791#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:43:58,624 INFO L290 TraceCheckUtils]: 3: Hoare triple {791#(= currentRoundingMode roundNearestTiesToEven)} goto; {791#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:43:58,624 INFO L290 TraceCheckUtils]: 4: Hoare triple {791#(= currentRoundingMode roundNearestTiesToEven)} __ieee754_expf_~xsb~0#1 := ~bvand32(1bv32, ~bvashr32(__ieee754_expf_~sx~0#1, 31bv32));__ieee754_expf_~hx~0#1 := ~bvand32(2147483647bv32, __ieee754_expf_~sx~0#1); {791#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:43:58,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {791#(= currentRoundingMode roundNearestTiesToEven)} assume !~bvugt32(__ieee754_expf_~hx~0#1, 2139095040bv32); {791#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:43:58,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {791#(= currentRoundingMode roundNearestTiesToEven)} assume 2139095040bv32 == __ieee754_expf_~hx~0#1; {791#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:43:58,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {791#(= currentRoundingMode roundNearestTiesToEven)} assume !(0bv32 == __ieee754_expf_~xsb~0#1);__ieee754_expf_#t~ite5#1 := ~Pluszero~DOUBLE(); {813#(and (= (_ +zero 11 53) |ULTIMATE.start___ieee754_expf_#t~ite5#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:43:58,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {813#(and (= (_ +zero 11 53) |ULTIMATE.start___ieee754_expf_#t~ite5#1|) (= currentRoundingMode roundNearestTiesToEven))} __ieee754_expf_#res#1 := ~convertDOUBLEToFLOAT(currentRoundingMode, __ieee754_expf_#t~ite5#1);havoc __ieee754_expf_#t~ite5#1; {817#(= ((_ to_fp 8 24) roundNearestTiesToEven (_ +zero 11 53)) |ULTIMATE.start___ieee754_expf_#res#1|)} is VALID [2022-02-20 16:43:58,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {817#(= ((_ to_fp 8 24) roundNearestTiesToEven (_ +zero 11 53)) |ULTIMATE.start___ieee754_expf_#res#1|)} main_#t~ret16#1 := __ieee754_expf_#res#1;assume { :end_inline___ieee754_expf } true;main_~res~0#1 := main_#t~ret16#1;havoc main_#t~ret16#1;main_#t~short18#1 := ~fp.eq~FLOAT(main_~res~0#1, ~Pluszero~FLOAT()); {821#|ULTIMATE.start_main_#t~short18#1|} is VALID [2022-02-20 16:43:58,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {821#|ULTIMATE.start_main_#t~short18#1|} assume !main_#t~short18#1; {787#false} is VALID [2022-02-20 16:43:58,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {787#false} assume !main_#t~short18#1;havoc main_#t~ret17#1;havoc main_#t~short18#1; {787#false} is VALID [2022-02-20 16:43:58,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {787#false} assume !false; {787#false} is VALID [2022-02-20 16:43:58,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:43:58,628 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:43:58,628 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:43:58,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1786833472] [2022-02-20 16:43:58,628 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1786833472] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:43:58,628 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:43:58,628 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:43:58,628 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642500208] [2022-02-20 16:43:58,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:43:58,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:43:58,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:43:58,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:58,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:43:58,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:43:58,675 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:43:58,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:43:58,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:43:58,676 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:59,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:59,319 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2022-02-20 16:43:59,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:43:59,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:43:59,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:43:59,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:59,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-02-20 16:43:59,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:59,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-02-20 16:43:59,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-02-20 16:43:59,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:43:59,399 INFO L225 Difference]: With dead ends: 21 [2022-02-20 16:43:59,399 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 16:43:59,399 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:43:59,400 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 16:43:59,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 39 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 16:43:59,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 16:43:59,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 16:43:59,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:43:59,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.0) internal successors, (17), 17 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:59,402 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.0) internal successors, (17), 17 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:59,402 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.0) internal successors, (17), 17 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:59,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:59,402 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2022-02-20 16:43:59,403 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2022-02-20 16:43:59,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:43:59,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:43:59,403 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 17 states have (on average 1.0) internal successors, (17), 17 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states. [2022-02-20 16:43:59,403 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.0) internal successors, (17), 17 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states. [2022-02-20 16:43:59,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:59,403 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2022-02-20 16:43:59,404 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2022-02-20 16:43:59,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:43:59,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:43:59,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:43:59,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:43:59,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0) internal successors, (17), 17 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:59,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 17 transitions. [2022-02-20 16:43:59,405 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 17 transitions. Word has length 13 [2022-02-20 16:43:59,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:43:59,405 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 17 transitions. [2022-02-20 16:43:59,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:59,406 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2022-02-20 16:43:59,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 16:43:59,407 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:43:59,407 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:43:59,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 16:43:59,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:43:59,625 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:43:59,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:43:59,626 INFO L85 PathProgramCache]: Analyzing trace with hash 893748631, now seen corresponding path program 1 times [2022-02-20 16:43:59,626 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:43:59,626 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946946137] [2022-02-20 16:43:59,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:43:59,626 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:43:59,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:43:59,627 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:43:59,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 16:43:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:43:59,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 16:44:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:44:00,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:44:00,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {917#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#halF_exp~0.base, ~#halF_exp~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.5)), ~#halF_exp~0.base, ~#halF_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.5))), ~#halF_exp~0.base, ~bvadd32(4bv32, ~#halF_exp~0.offset), 4bv32);~huge_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30));~twom100_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.8886090522E-31));~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset := 5bv32, 0bv32;call #Ultimate.allocInit(8bv32, 5bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.69313812256)), ~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.69313812256))), ~#ln2HI_exp~0.base, ~bvadd32(4bv32, ~#ln2HI_exp~0.offset), 4bv32);~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset := 6bv32, 0bv32;call #Ultimate.allocInit(8bv32, 6bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 9.0580006145E-6)), ~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 9.0580006145E-6))), ~#ln2LO_exp~0.base, ~bvadd32(4bv32, ~#ln2LO_exp~0.offset), 4bv32);~invln2_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.4426950216));~P1_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.16666667163));~P2_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.002777777845)));~P3_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 6.613755977E-5));~P4_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.6533901999E-6)));~P5_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 4.1381369442E-8)); {917#true} is VALID [2022-02-20 16:44:00,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {917#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1, main_#t~ret17#1, main_#t~short18#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());assume { :begin_inline___ieee754_expf } true;__ieee754_expf_#in~x#1 := main_~x~0#1;havoc __ieee754_expf_#res#1;havoc __ieee754_expf_#t~mem4#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, __ieee754_expf_#t~ite5#1, __ieee754_expf_#t~mem6#1, __ieee754_expf_#t~mem7#1, __ieee754_expf_#t~mem8#1, __ieee754_expf_#t~mem9#1, __ieee754_expf_#t~mem10#1, __ieee754_expf_#t~mem11#1, __ieee754_expf_~#gf_u~1#1.base, __ieee754_expf_~#gf_u~1#1.offset, __ieee754_expf_#t~mem12#1, __ieee754_expf_~#sf_u~0#1.base, __ieee754_expf_~#sf_u~0#1.offset, __ieee754_expf_~hy~0#1, __ieee754_expf_#t~mem13#1, __ieee754_expf_~#gf_u~2#1.base, __ieee754_expf_~#gf_u~2#1.offset, __ieee754_expf_#t~mem14#1, __ieee754_expf_~#sf_u~1#1.base, __ieee754_expf_~#sf_u~1#1.offset, __ieee754_expf_~hy~1#1, __ieee754_expf_~x#1, __ieee754_expf_~y~0#1, __ieee754_expf_~hi~0#1, __ieee754_expf_~lo~0#1, __ieee754_expf_~c~0#1, __ieee754_expf_~t~0#1, __ieee754_expf_~k~0#1, __ieee754_expf_~xsb~0#1, __ieee754_expf_~sx~0#1, __ieee754_expf_~hx~0#1;__ieee754_expf_~x#1 := __ieee754_expf_#in~x#1;havoc __ieee754_expf_~y~0#1;havoc __ieee754_expf_~hi~0#1;havoc __ieee754_expf_~lo~0#1;havoc __ieee754_expf_~c~0#1;havoc __ieee754_expf_~t~0#1;__ieee754_expf_~k~0#1 := 0bv32;havoc __ieee754_expf_~xsb~0#1;havoc __ieee754_expf_~sx~0#1;havoc __ieee754_expf_~hx~0#1; {917#true} is VALID [2022-02-20 16:44:00,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {917#true} call __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_expf_~x#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4bv32);call __ieee754_expf_#t~mem4#1 := read~intINTTYPE4(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4bv32);__ieee754_expf_~sx~0#1 := __ieee754_expf_#t~mem4#1;havoc __ieee754_expf_#t~mem4#1;call ULTIMATE.dealloc(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset);havoc __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset; {917#true} is VALID [2022-02-20 16:44:00,891 INFO L290 TraceCheckUtils]: 3: Hoare triple {917#true} goto; {917#true} is VALID [2022-02-20 16:44:00,891 INFO L290 TraceCheckUtils]: 4: Hoare triple {917#true} __ieee754_expf_~xsb~0#1 := ~bvand32(1bv32, ~bvashr32(__ieee754_expf_~sx~0#1, 31bv32));__ieee754_expf_~hx~0#1 := ~bvand32(2147483647bv32, __ieee754_expf_~sx~0#1); {917#true} is VALID [2022-02-20 16:44:00,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {917#true} assume !~bvugt32(__ieee754_expf_~hx~0#1, 2139095040bv32); {917#true} is VALID [2022-02-20 16:44:00,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {917#true} assume 2139095040bv32 == __ieee754_expf_~hx~0#1; {917#true} is VALID [2022-02-20 16:44:00,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {917#true} assume !(0bv32 == __ieee754_expf_~xsb~0#1);__ieee754_expf_#t~ite5#1 := ~Pluszero~DOUBLE(); {943#(= (_ +zero 11 53) |ULTIMATE.start___ieee754_expf_#t~ite5#1|)} is VALID [2022-02-20 16:44:00,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {943#(= (_ +zero 11 53) |ULTIMATE.start___ieee754_expf_#t~ite5#1|)} __ieee754_expf_#res#1 := ~convertDOUBLEToFLOAT(currentRoundingMode, __ieee754_expf_#t~ite5#1);havoc __ieee754_expf_#t~ite5#1; {947#(exists ((currentRoundingMode RoundingMode)) (= ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) |ULTIMATE.start___ieee754_expf_#res#1|))} is VALID [2022-02-20 16:44:00,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {947#(exists ((currentRoundingMode RoundingMode)) (= ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) |ULTIMATE.start___ieee754_expf_#res#1|))} main_#t~ret16#1 := __ieee754_expf_#res#1;assume { :end_inline___ieee754_expf } true;main_~res~0#1 := main_#t~ret16#1;havoc main_#t~ret16#1;main_#t~short18#1 := ~fp.eq~FLOAT(main_~res~0#1, ~Pluszero~FLOAT()); {951#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_main_~res~0#1| ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53))))} is VALID [2022-02-20 16:44:00,895 INFO L290 TraceCheckUtils]: 10: Hoare triple {951#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_main_~res~0#1| ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53))))} assume main_#t~short18#1;assume { :begin_inline___signbit_float } true;__signbit_float_#in~x#1 := main_~res~0#1;havoc __signbit_float_#res#1;havoc __signbit_float_#t~mem15#1, __signbit_float_~#gf_u~3#1.base, __signbit_float_~#gf_u~3#1.offset, __signbit_float_~x#1, __signbit_float_~w~0#1;__signbit_float_~x#1 := __signbit_float_#in~x#1;havoc __signbit_float_~w~0#1; {955#(exists ((currentRoundingMode RoundingMode)) (= ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) |ULTIMATE.start___signbit_float_~x#1|))} is VALID [2022-02-20 16:44:00,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {955#(exists ((currentRoundingMode RoundingMode)) (= ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) |ULTIMATE.start___signbit_float_~x#1|))} call __signbit_float_~#gf_u~3#1.base, __signbit_float_~#gf_u~3#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__signbit_float_~x#1, __signbit_float_~#gf_u~3#1.base, __signbit_float_~#gf_u~3#1.offset, 4bv32);call __signbit_float_#t~mem15#1 := read~intINTTYPE4(__signbit_float_~#gf_u~3#1.base, __signbit_float_~#gf_u~3#1.offset, 4bv32);__signbit_float_~w~0#1 := __signbit_float_#t~mem15#1;havoc __signbit_float_#t~mem15#1;call ULTIMATE.dealloc(__signbit_float_~#gf_u~3#1.base, __signbit_float_~#gf_u~3#1.offset);havoc __signbit_float_~#gf_u~3#1.base, __signbit_float_~#gf_u~3#1.offset; {959#(exists ((currentRoundingMode RoundingMode)) (= ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|))))} is VALID [2022-02-20 16:44:00,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {959#(exists ((currentRoundingMode RoundingMode)) (= ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|))))} goto; {959#(exists ((currentRoundingMode RoundingMode)) (= ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|))))} is VALID [2022-02-20 16:44:00,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {959#(exists ((currentRoundingMode RoundingMode)) (= ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|))))} __signbit_float_#res#1 := (if 0bv32 != ~bvand32(2147483648bv32, __signbit_float_~w~0#1) then 1bv32 else 0bv32); {966#(= |ULTIMATE.start___signbit_float_#res#1| (_ bv0 32))} is VALID [2022-02-20 16:44:00,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {966#(= |ULTIMATE.start___signbit_float_#res#1| (_ bv0 32))} main_#t~ret17#1 := __signbit_float_#res#1;assume { :end_inline___signbit_float } true;main_#t~short18#1 := 0bv32 == main_#t~ret17#1; {970#|ULTIMATE.start_main_#t~short18#1|} is VALID [2022-02-20 16:44:00,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {970#|ULTIMATE.start_main_#t~short18#1|} assume !main_#t~short18#1;havoc main_#t~ret17#1;havoc main_#t~short18#1; {918#false} is VALID [2022-02-20 16:44:00,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {918#false} assume !false; {918#false} is VALID [2022-02-20 16:44:00,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:44:00,900 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:44:00,900 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:44:00,900 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946946137] [2022-02-20 16:44:00,900 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1946946137] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:44:00,900 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:44:00,900 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 16:44:00,900 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243268467] [2022-02-20 16:44:00,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:44:00,901 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 16:44:00,901 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:44:00,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:44:00,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:44:00,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 16:44:00,956 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:44:00,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 16:44:00,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:44:00,957 INFO L87 Difference]: Start difference. First operand 18 states and 17 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:44:02,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:44:02,066 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2022-02-20 16:44:02,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 16:44:02,066 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 16:44:02,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:44:02,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:44:02,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 17 transitions. [2022-02-20 16:44:02,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:44:02,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 17 transitions. [2022-02-20 16:44:02,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 17 transitions. [2022-02-20 16:44:02,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:44:02,126 INFO L225 Difference]: With dead ends: 18 [2022-02-20 16:44:02,126 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:44:02,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:44:02,127 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 16:44:02,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 66 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 13 Unchecked, 0.2s Time] [2022-02-20 16:44:02,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:44:02,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:44:02,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:44:02,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:44:02,129 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:44:02,129 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:44:02,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:44:02,129 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:44:02,129 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:44:02,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:44:02,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:44:02,129 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 16:44:02,130 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 16:44:02,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:44:02,130 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:44:02,130 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:44:02,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:44:02,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:44:02,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:44:02,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:44:02,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:44:02,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:44:02,130 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-02-20 16:44:02,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:44:02,130 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:44:02,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:44:02,131 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:44:02,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:44:02,133 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:44:02,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-02-20 16:44:02,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:44:02,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:44:02,618 INFO L858 garLoopResultBuilder]: For program point L52(lines 52 53) no Hoare annotation was computed. [2022-02-20 16:44:02,618 INFO L858 garLoopResultBuilder]: For program point L77(lines 77 80) no Hoare annotation was computed. [2022-02-20 16:44:02,618 INFO L858 garLoopResultBuilder]: For program point L69(lines 69 72) no Hoare annotation was computed. [2022-02-20 16:44:02,618 INFO L858 garLoopResultBuilder]: For program point L69-2(lines 57 72) no Hoare annotation was computed. [2022-02-20 16:44:02,618 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:44:02,618 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:44:02,618 INFO L854 garLoopResultBuilder]: At program point L119(lines 110 120) the Hoare annotation is: (and (= |ULTIMATE.start___signbit_float_#res#1| (_ bv0 32)) |ULTIMATE.start_main_#t~short18#1| (= ((_ to_fp 8 24) roundNearestTiesToEven (_ +zero 11 53)) |ULTIMATE.start___ieee754_expf_#res#1|) (= currentRoundingMode roundNearestTiesToEven)) [2022-02-20 16:44:02,619 INFO L858 garLoopResultBuilder]: For program point L70(lines 70 71) no Hoare annotation was computed. [2022-02-20 16:44:02,619 INFO L858 garLoopResultBuilder]: For program point L54(lines 54 55) no Hoare annotation was computed. [2022-02-20 16:44:02,619 INFO L861 garLoopResultBuilder]: At program point L137(lines 122 138) the Hoare annotation is: true [2022-02-20 16:44:02,619 INFO L858 garLoopResultBuilder]: For program point L96-1(lines 96 100) no Hoare annotation was computed. [2022-02-20 16:44:02,619 INFO L854 garLoopResultBuilder]: At program point L96-2(lines 96 100) the Hoare annotation is: false [2022-02-20 16:44:02,619 INFO L858 garLoopResultBuilder]: For program point L88(lines 88 92) no Hoare annotation was computed. [2022-02-20 16:44:02,619 INFO L858 garLoopResultBuilder]: For program point L88-1(lines 81 94) no Hoare annotation was computed. [2022-02-20 16:44:02,619 INFO L858 garLoopResultBuilder]: For program point L88-2(lines 88 92) no Hoare annotation was computed. [2022-02-20 16:44:02,620 INFO L858 garLoopResultBuilder]: For program point L113-1(lines 113 117) no Hoare annotation was computed. [2022-02-20 16:44:02,620 INFO L854 garLoopResultBuilder]: At program point L113-2(lines 113 117) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short18#1| (= ((_ to_fp 8 24) roundNearestTiesToEven (_ +zero 11 53)) |ULTIMATE.start___ieee754_expf_#res#1|) (exists ((currentRoundingMode RoundingMode)) (= ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) |ULTIMATE.start___signbit_float_~x#1|)) (= currentRoundingMode roundNearestTiesToEven)) [2022-02-20 16:44:02,620 INFO L858 garLoopResultBuilder]: For program point L113-3(lines 113 117) no Hoare annotation was computed. [2022-02-20 16:44:02,620 INFO L858 garLoopResultBuilder]: For program point L81(lines 81 107) no Hoare annotation was computed. [2022-02-20 16:44:02,620 INFO L858 garLoopResultBuilder]: For program point L48(lines 48 49) no Hoare annotation was computed. [2022-02-20 16:44:02,620 INFO L854 garLoopResultBuilder]: At program point L106(lines 35 108) the Hoare annotation is: (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ +zero 11 53)) |ULTIMATE.start___ieee754_expf_#res#1|) (= currentRoundingMode roundNearestTiesToEven)) [2022-02-20 16:44:02,620 INFO L858 garLoopResultBuilder]: For program point L40-1(lines 40 44) no Hoare annotation was computed. [2022-02-20 16:44:02,620 INFO L854 garLoopResultBuilder]: At program point L40-2(lines 40 44) the Hoare annotation is: (and (= currentRoundingMode roundNearestTiesToEven) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_expf_~x#1|))) [2022-02-20 16:44:02,621 INFO L858 garLoopResultBuilder]: For program point L40-3(lines 40 44) no Hoare annotation was computed. [2022-02-20 16:44:02,621 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:44:02,621 INFO L858 garLoopResultBuilder]: For program point L57(lines 57 72) no Hoare annotation was computed. [2022-02-20 16:44:02,621 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2022-02-20 16:44:02,621 INFO L858 garLoopResultBuilder]: For program point L132(line 132) no Hoare annotation was computed. [2022-02-20 16:44:02,621 INFO L858 garLoopResultBuilder]: For program point L132-2(lines 132 135) no Hoare annotation was computed. [2022-02-20 16:44:02,621 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:44:02,621 INFO L858 garLoopResultBuilder]: For program point L58(lines 58 67) no Hoare annotation was computed. [2022-02-20 16:44:02,622 INFO L858 garLoopResultBuilder]: For program point L58-2(lines 58 67) no Hoare annotation was computed. [2022-02-20 16:44:02,622 INFO L858 garLoopResultBuilder]: For program point L50(lines 50 51) no Hoare annotation was computed. [2022-02-20 16:44:02,622 INFO L858 garLoopResultBuilder]: For program point L83-1(lines 83 87) no Hoare annotation was computed. [2022-02-20 16:44:02,622 INFO L854 garLoopResultBuilder]: At program point L83-2(lines 83 87) the Hoare annotation is: false [2022-02-20 16:44:02,622 INFO L858 garLoopResultBuilder]: For program point L133(line 133) no Hoare annotation was computed. [2022-02-20 16:44:02,622 INFO L858 garLoopResultBuilder]: For program point L51(line 51) no Hoare annotation was computed. [2022-02-20 16:44:02,622 INFO L858 garLoopResultBuilder]: For program point L51-2(line 51) no Hoare annotation was computed. [2022-02-20 16:44:02,622 INFO L858 garLoopResultBuilder]: For program point L101(lines 101 105) no Hoare annotation was computed. [2022-02-20 16:44:02,623 INFO L858 garLoopResultBuilder]: For program point L101-1(lines 94 107) no Hoare annotation was computed. [2022-02-20 16:44:02,623 INFO L858 garLoopResultBuilder]: For program point L101-2(lines 101 105) no Hoare annotation was computed. [2022-02-20 16:44:02,626 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 16:44:02,627 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:44:02,629 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:44:02,629 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:44:02,629 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-02-20 16:44:02,629 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2022-02-20 16:44:02,629 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-02-20 16:44:02,629 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-02-20 16:44:02,629 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2022-02-20 16:44:02,630 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:44:02,630 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:44:02,630 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2022-02-20 16:44:02,630 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-02-20 16:44:02,630 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-02-20 16:44:02,630 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2022-02-20 16:44:02,630 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2022-02-20 16:44:02,630 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-02-20 16:44:02,630 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-02-20 16:44:02,630 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-02-20 16:44:02,631 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-02-20 16:44:02,631 WARN L170 areAnnotationChecker]: L113-1 has no Hoare annotation [2022-02-20 16:44:02,631 WARN L170 areAnnotationChecker]: L113-3 has no Hoare annotation [2022-02-20 16:44:02,631 WARN L170 areAnnotationChecker]: L132-2 has no Hoare annotation [2022-02-20 16:44:02,631 WARN L170 areAnnotationChecker]: L132-2 has no Hoare annotation [2022-02-20 16:44:02,631 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2022-02-20 16:44:02,631 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:44:02,631 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:44:02,631 WARN L170 areAnnotationChecker]: L113-1 has no Hoare annotation [2022-02-20 16:44:02,631 WARN L170 areAnnotationChecker]: L113-1 has no Hoare annotation [2022-02-20 16:44:02,631 WARN L170 areAnnotationChecker]: L113-3 has no Hoare annotation [2022-02-20 16:44:02,631 WARN L170 areAnnotationChecker]: L133 has no Hoare annotation [2022-02-20 16:44:02,631 WARN L170 areAnnotationChecker]: L133 has no Hoare annotation [2022-02-20 16:44:02,631 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:44:02,631 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:44:02,631 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:44:02,631 WARN L170 areAnnotationChecker]: L132-2 has no Hoare annotation [2022-02-20 16:44:02,631 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:44:02,631 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-02-20 16:44:02,631 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-02-20 16:44:02,632 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:44:02,632 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:44:02,632 WARN L170 areAnnotationChecker]: L58-2 has no Hoare annotation [2022-02-20 16:44:02,632 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-02-20 16:44:02,632 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-02-20 16:44:02,632 WARN L170 areAnnotationChecker]: L69-2 has no Hoare annotation [2022-02-20 16:44:02,632 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2022-02-20 16:44:02,632 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2022-02-20 16:44:02,632 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-02-20 16:44:02,632 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-02-20 16:44:02,632 WARN L170 areAnnotationChecker]: L83-1 has no Hoare annotation [2022-02-20 16:44:02,632 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2022-02-20 16:44:02,632 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2022-02-20 16:44:02,632 WARN L170 areAnnotationChecker]: L101-1 has no Hoare annotation [2022-02-20 16:44:02,632 WARN L170 areAnnotationChecker]: L83-1 has no Hoare annotation [2022-02-20 16:44:02,632 WARN L170 areAnnotationChecker]: L83-1 has no Hoare annotation [2022-02-20 16:44:02,632 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2022-02-20 16:44:02,632 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2022-02-20 16:44:02,632 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2022-02-20 16:44:02,632 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2022-02-20 16:44:02,632 WARN L170 areAnnotationChecker]: L101-1 has no Hoare annotation [2022-02-20 16:44:02,632 WARN L170 areAnnotationChecker]: L101-1 has no Hoare annotation [2022-02-20 16:44:02,632 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:44:02,633 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:44:02,633 WARN L170 areAnnotationChecker]: L88-2 has no Hoare annotation [2022-02-20 16:44:02,633 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2022-02-20 16:44:02,633 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2022-02-20 16:44:02,633 WARN L170 areAnnotationChecker]: L101-2 has no Hoare annotation [2022-02-20 16:44:02,633 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:44:02,635 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:02,636 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:02,645 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:02,645 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:02,650 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:02,650 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:44:02,650 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:44:02,653 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:02,653 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:44:02,653 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:44:02,654 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:02,654 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:44:02,654 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:02,655 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:02,655 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:44:02,655 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:02,655 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:02,656 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:02,656 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:02,656 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:02,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:44:02 BoogieIcfgContainer [2022-02-20 16:44:02,657 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:44:02,657 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:44:02,657 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:44:02,657 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:44:02,658 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:43:12" (3/4) ... [2022-02-20 16:44:02,660 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:44:02,671 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-02-20 16:44:02,672 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-02-20 16:44:02,672 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:44:02,672 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:44:02,695 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) [2022-02-20 16:44:02,696 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE()) == \result && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-02-20 16:44:02,697 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((aux-res == 0.0f && __signbit_float(res) == 0-aux && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE()) == \result) && (\exists currentRoundingMode : FloatRoundingMode :: ~to_fp~LONGDOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE()) == x)) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-02-20 16:44:02,699 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 0bv32 && aux-res == 0.0f && __signbit_float(res) == 0-aux) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE()) == \result) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-02-20 16:44:02,726 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:44:02,727 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:44:02,728 INFO L158 Benchmark]: Toolchain (without parser) took 60276.70ms. Allocated memory was 62.9MB in the beginning and 81.8MB in the end (delta: 18.9MB). Free memory was 42.6MB in the beginning and 36.7MB in the end (delta: 5.9MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2022-02-20 16:44:02,728 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 62.9MB. Free memory was 44.8MB in the beginning and 44.7MB in the end (delta: 45.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:44:02,728 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.47ms. Allocated memory is still 62.9MB. Free memory was 42.5MB in the beginning and 43.3MB in the end (delta: -813.0kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 16:44:02,729 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.64ms. Allocated memory is still 62.9MB. Free memory was 43.3MB in the beginning and 40.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:44:02,729 INFO L158 Benchmark]: Boogie Preprocessor took 57.98ms. Allocated memory is still 62.9MB. Free memory was 40.6MB in the beginning and 38.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:44:02,729 INFO L158 Benchmark]: RCFGBuilder took 9269.72ms. Allocated memory was 62.9MB in the beginning and 81.8MB in the end (delta: 18.9MB). Free memory was 38.1MB in the beginning and 54.7MB in the end (delta: -16.5MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2022-02-20 16:44:02,729 INFO L158 Benchmark]: TraceAbstraction took 50505.88ms. Allocated memory is still 81.8MB. Free memory was 54.0MB in the beginning and 40.9MB in the end (delta: 13.1MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2022-02-20 16:44:02,730 INFO L158 Benchmark]: Witness Printer took 69.73ms. Allocated memory is still 81.8MB. Free memory was 40.9MB in the beginning and 36.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:44:02,733 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 62.9MB. Free memory was 44.8MB in the beginning and 44.7MB in the end (delta: 45.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.47ms. Allocated memory is still 62.9MB. Free memory was 42.5MB in the beginning and 43.3MB in the end (delta: -813.0kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.64ms. Allocated memory is still 62.9MB. Free memory was 43.3MB in the beginning and 40.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.98ms. Allocated memory is still 62.9MB. Free memory was 40.6MB in the beginning and 38.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 9269.72ms. Allocated memory was 62.9MB in the beginning and 81.8MB in the end (delta: 18.9MB). Free memory was 38.1MB in the beginning and 54.7MB in the end (delta: -16.5MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * TraceAbstraction took 50505.88ms. Allocated memory is still 81.8MB. Free memory was 54.0MB in the beginning and 40.9MB in the end (delta: 13.1MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * Witness Printer took 69.73ms. Allocated memory is still 81.8MB. Free memory was 40.9MB in the beginning and 36.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 133]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 50.4s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 43.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 419 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 53 IncrementalHoareTripleChecker+Unchecked, 270 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 149 mSDtfsCounter, 22 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=0, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 12 NumberOfFragments, 55 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 6 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 68 ConstructedInterpolants, 20 QuantifiedInterpolants, 388 SizeOfPredicates, 33 NumberOfNonLiveVariables, 461 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 110]: Loop Invariant [2022-02-20 16:44:02,742 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:02,742 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:02,743 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:02,743 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((\result == 0bv32 && aux-res == 0.0f && __signbit_float(res) == 0-aux) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE()) == \result) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 40]: Loop Invariant [2022-02-20 16:44:02,743 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:02,743 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:44:02,744 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:44:02,744 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:02,744 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:44:02,744 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 113]: Loop Invariant [2022-02-20 16:44:02,745 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:02,745 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:44:02,745 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:02,746 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:02,746 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:44:02,746 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((aux-res == 0.0f && __signbit_float(res) == 0-aux && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE()) == \result) && (\exists currentRoundingMode : FloatRoundingMode :: ~to_fp~LONGDOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE()) == x)) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 35]: Loop Invariant [2022-02-20 16:44:02,746 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:02,746 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:02,746 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:02,747 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE()) == \result && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven RESULT: Ultimate proved your program to be correct! [2022-02-20 16:44:02,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE