./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1131a.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_1131a.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 9d7de4eae0919f71f47a70084dddfbb7e8bba2261ae33533b8e450f3643f4e28 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:27,206 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:27,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:27,226 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:27,229 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:27,230 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:27,232 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:27,235 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:27,237 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:27,238 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:27,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:27,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:27,241 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:27,243 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:27,244 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:27,245 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:27,246 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:27,250 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:27,251 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:27,255 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:27,256 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:27,260 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:27,260 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:27,261 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:27,262 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:27,265 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:27,266 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:27,266 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:27,267 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:27,267 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:27,268 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:27,268 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:27,270 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:27,270 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:27,271 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:27,272 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:27,272 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:27,272 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:27,273 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:27,273 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:27,274 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:27,274 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:46:27,294 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:27,295 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:27,295 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:27,295 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:27,296 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:27,296 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:27,297 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:27,297 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:27,297 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:27,297 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:27,298 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:27,298 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:46:27,298 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:27,298 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:27,298 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:27,298 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:27,299 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:27,299 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:27,299 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:27,299 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:27,299 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:27,299 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:27,299 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:27,300 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:27,300 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:27,300 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:27,300 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:27,300 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:27,300 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:46:27,300 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:46:27,301 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:27,301 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:27,301 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:27,301 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 -> 9d7de4eae0919f71f47a70084dddfbb7e8bba2261ae33533b8e450f3643f4e28 [2022-02-20 16:46:27,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:27,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:27,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:27,575 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:27,576 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:27,577 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1131a.c [2022-02-20 16:46:27,667 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3025cca8/615818020ecc4bc6ab8eabffc519ef5d/FLAG5b8f5466f [2022-02-20 16:46:28,101 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:28,102 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1131a.c [2022-02-20 16:46:28,119 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3025cca8/615818020ecc4bc6ab8eabffc519ef5d/FLAG5b8f5466f [2022-02-20 16:46:28,134 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3025cca8/615818020ecc4bc6ab8eabffc519ef5d [2022-02-20 16:46:28,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:28,151 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:28,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:28,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:28,155 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:28,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:28" (1/1) ... [2022-02-20 16:46:28,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26b006dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:28, skipping insertion in model container [2022-02-20 16:46:28,157 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:28" (1/1) ... [2022-02-20 16:46:28,162 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:28,173 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:28,335 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_1131a.c[2945,2958] [2022-02-20 16:46:28,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:28,352 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:28,378 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_1131a.c[2945,2958] [2022-02-20 16:46:28,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:28,389 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:28,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:28 WrapperNode [2022-02-20 16:46:28,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:28,390 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:28,390 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:28,391 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:28,396 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:46:28" (1/1) ... [2022-02-20 16:46:28,402 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:46:28" (1/1) ... [2022-02-20 16:46:28,433 INFO L137 Inliner]: procedures = 18, calls = 35, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 219 [2022-02-20 16:46:28,433 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:28,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:28,434 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:28,434 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:28,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:28" (1/1) ... [2022-02-20 16:46:28,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:28" (1/1) ... [2022-02-20 16:46:28,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:28" (1/1) ... [2022-02-20 16:46:28,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:28" (1/1) ... [2022-02-20 16:46:28,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:28" (1/1) ... [2022-02-20 16:46:28,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:28" (1/1) ... [2022-02-20 16:46:28,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:28" (1/1) ... [2022-02-20 16:46:28,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:28,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:28,478 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:28,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:28,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:28" (1/1) ... [2022-02-20 16:46:28,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:28,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:28,522 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:46:28,530 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:46:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:46:28,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:46:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:46:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:46:28,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:28,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:46:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-02-20 16:46:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:28,675 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:28,676 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:28,983 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:28,988 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:28,988 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-02-20 16:46:28,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:28 BoogieIcfgContainer [2022-02-20 16:46:28,989 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:28,990 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:28,990 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:28,993 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:28,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:28" (1/3) ... [2022-02-20 16:46:28,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6884921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:28, skipping insertion in model container [2022-02-20 16:46:28,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:28" (2/3) ... [2022-02-20 16:46:28,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6884921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:28, skipping insertion in model container [2022-02-20 16:46:28,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:28" (3/3) ... [2022-02-20 16:46:28,995 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1131a.c [2022-02-20 16:46:29,000 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:29,000 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:29,029 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:29,034 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:46:29,034 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:29,045 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 57 states have (on average 1.7894736842105263) internal successors, (102), 58 states have internal predecessors, (102), 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:46:29,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:46:29,048 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:29,049 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:29,049 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:29,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:29,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1228515262, now seen corresponding path program 1 times [2022-02-20 16:46:29,058 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:29,059 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882468430] [2022-02-20 16:46:29,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:29,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:29,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {62#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(21, 2);call #Ultimate.allocInit(12, 3);~one_fmod~0 := 1.0;~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~real(0.0, ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.0), ~#Zero_fmod~0.base, 4 + ~#Zero_fmod~0.offset, 4); {62#true} is VALID [2022-02-20 16:46:29,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {62#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~ret17#1, main_#t~ret18#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;main_~y~0#1 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0);assume { :begin_inline_isfinite_float } true;isfinite_float_#in~x#1 := main_~x~0#1;havoc isfinite_float_#res#1;havoc isfinite_float_#t~mem15#1, isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset, isfinite_float_~x#1, isfinite_float_~ix~1#1;isfinite_float_~x#1 := isfinite_float_#in~x#1;havoc isfinite_float_~ix~1#1; {62#true} is VALID [2022-02-20 16:46:29,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {62#true} assume !true; {63#false} is VALID [2022-02-20 16:46:29,208 INFO L290 TraceCheckUtils]: 3: Hoare triple {63#false} isfinite_float_~ix~1#1 := (if 0 == isfinite_float_~ix~1#1 then 0 else (if 1 == isfinite_float_~ix~1#1 then 1 else ~bitwiseAnd(isfinite_float_~ix~1#1, 2147483647)));isfinite_float_#res#1 := (if isfinite_float_~ix~1#1 < 2139095040 then 1 else 0); {63#false} is VALID [2022-02-20 16:46:29,208 INFO L290 TraceCheckUtils]: 4: Hoare triple {63#false} main_#t~ret17#1 := isfinite_float_#res#1;assume { :end_inline_isfinite_float } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {63#false} is VALID [2022-02-20 16:46:29,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {63#false} assume 0 != main_#t~ret17#1;havoc main_#t~ret17#1;assume { :begin_inline_fmod_float } true;fmod_float_#in~x#1, fmod_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmod_float_#res#1;havoc fmod_float_#t~mem4#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, fmod_float_#t~mem5#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, fmod_float_#t~mem7#1, fmod_float_#t~mem11#1, fmod_float_#t~post10#1, fmod_float_#t~mem12#1, fmod_float_#t~mem13#1, fmod_float_~#sf_u~0#1.base, fmod_float_~#sf_u~0#1.offset, fmod_float_#t~mem14#1, fmod_float_~#sf_u~1#1.base, fmod_float_~#sf_u~1#1.offset, fmod_float_~x#1, fmod_float_~y#1, fmod_float_~n~0#1, fmod_float_~hx~0#1, fmod_float_~hy~0#1, fmod_float_~hz~0#1, fmod_float_~ix~0#1, fmod_float_~iy~0#1, fmod_float_~sx~0#1, fmod_float_~i~0#1, fmod_float_#t~nondet6#1, fmod_float_#t~nondet8#1, fmod_float_#t~nondet9#1;fmod_float_~x#1 := fmod_float_#in~x#1;fmod_float_~y#1 := fmod_float_#in~y#1;havoc fmod_float_~n~0#1;havoc fmod_float_~hx~0#1;havoc fmod_float_~hy~0#1;havoc fmod_float_~hz~0#1;havoc fmod_float_~ix~0#1;havoc fmod_float_~iy~0#1;havoc fmod_float_~sx~0#1;havoc fmod_float_~i~0#1; {63#false} is VALID [2022-02-20 16:46:29,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {63#false} assume !true; {63#false} is VALID [2022-02-20 16:46:29,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {63#false} assume !true; {63#false} is VALID [2022-02-20 16:46:29,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {63#false} assume 0 == fmod_float_~hx~0#1;fmod_float_~sx~0#1 := 0; {63#false} is VALID [2022-02-20 16:46:29,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {63#false} fmod_float_~hx~0#1 := (if (1 == fmod_float_~hx~0#1 || 0 == fmod_float_~hx~0#1) && (1 == fmod_float_~sx~0#1 || 0 == fmod_float_~sx~0#1) then (if fmod_float_~hx~0#1 == fmod_float_~sx~0#1 then 0 else 1) else (if 0 == fmod_float_~hx~0#1 then fmod_float_~sx~0#1 else (if 0 == fmod_float_~sx~0#1 then fmod_float_~hx~0#1 else ~bitwiseXOr(fmod_float_~hx~0#1, fmod_float_~sx~0#1))));fmod_float_~hy~0#1 := (if 0 == fmod_float_~hy~0#1 then 0 else (if 1 == fmod_float_~hy~0#1 then 1 else ~bitwiseAnd(fmod_float_~hy~0#1, 2147483647))); {63#false} is VALID [2022-02-20 16:46:29,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {63#false} assume (0 == fmod_float_~hy~0#1 || !(fmod_float_~hx~0#1 < 2139095040)) || fmod_float_~hy~0#1 > 2139095040;fmod_float_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(fmod_float_~x#1, fmod_float_~y#1), ~someBinaryArithmeticFLOAToperation(fmod_float_~x#1, fmod_float_~y#1)); {63#false} is VALID [2022-02-20 16:46:29,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {63#false} main_#t~ret18#1 := fmod_float_#res#1;assume { :end_inline_fmod_float } true;main_~res~0#1 := main_#t~ret18#1;havoc main_#t~ret18#1; {63#false} is VALID [2022-02-20 16:46:29,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {63#false} assume ~someBinaryFLOATComparisonOperation(main_~res~0#1, main_~x~0#1); {63#false} is VALID [2022-02-20 16:46:29,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {63#false} assume !false; {63#false} is VALID [2022-02-20 16:46:29,213 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:46:29,213 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:29,213 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882468430] [2022-02-20 16:46:29,214 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882468430] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:29,214 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:29,214 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:29,215 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952062977] [2022-02-20 16:46:29,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:29,219 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 14 [2022-02-20 16:46:29,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:29,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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:46:29,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:29,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:29,244 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:29,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:29,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:29,266 INFO L87 Difference]: Start difference. First operand has 59 states, 57 states have (on average 1.7894736842105263) internal successors, (102), 58 states have internal predecessors, (102), 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 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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:46:29,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:29,360 INFO L93 Difference]: Finished difference Result 116 states and 202 transitions. [2022-02-20 16:46:29,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:29,360 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 14 [2022-02-20 16:46:29,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:29,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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:46:29,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 202 transitions. [2022-02-20 16:46:29,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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:46:29,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 202 transitions. [2022-02-20 16:46:29,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 202 transitions. [2022-02-20 16:46:29,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:29,528 INFO L225 Difference]: With dead ends: 116 [2022-02-20 16:46:29,528 INFO L226 Difference]: Without dead ends: 55 [2022-02-20 16:46:29,530 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:46:29,536 INFO L933 BasicCegarLoop]: 79 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, 79 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:46:29,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:29,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-02-20 16:46:29,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-02-20 16:46:29,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:29,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 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:46:29,576 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 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:46:29,578 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 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:46:29,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:29,584 INFO L93 Difference]: Finished difference Result 55 states and 74 transitions. [2022-02-20 16:46:29,584 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2022-02-20 16:46:29,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:29,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:29,586 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 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 55 states. [2022-02-20 16:46:29,587 INFO L87 Difference]: Start difference. First operand has 55 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 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 55 states. [2022-02-20 16:46:29,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:29,592 INFO L93 Difference]: Finished difference Result 55 states and 74 transitions. [2022-02-20 16:46:29,592 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2022-02-20 16:46:29,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:29,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:29,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:29,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:29,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 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:46:29,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 74 transitions. [2022-02-20 16:46:29,601 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 74 transitions. Word has length 14 [2022-02-20 16:46:29,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:29,602 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 74 transitions. [2022-02-20 16:46:29,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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:46:29,603 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2022-02-20 16:46:29,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 16:46:29,604 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:29,605 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:46:29,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:46:29,605 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:29,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:29,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1196155650, now seen corresponding path program 1 times [2022-02-20 16:46:29,609 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:29,609 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530204915] [2022-02-20 16:46:29,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:29,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:29,713 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:46:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:29,777 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:46:29,778 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:46:29,779 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:29,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:46:29,782 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:46:29,784 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:29,815 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:29,815 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:29,815 WARN L170 areAnnotationChecker]: L112-2 has no Hoare annotation [2022-02-20 16:46:29,815 WARN L170 areAnnotationChecker]: L112-2 has no Hoare annotation [2022-02-20 16:46:29,816 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-02-20 16:46:29,816 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-02-20 16:46:29,816 WARN L170 areAnnotationChecker]: L112-3 has no Hoare annotation [2022-02-20 16:46:29,816 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2022-02-20 16:46:29,816 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2022-02-20 16:46:29,816 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2022-02-20 16:46:29,816 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-02-20 16:46:29,816 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-02-20 16:46:29,817 WARN L170 areAnnotationChecker]: L131-2 has no Hoare annotation [2022-02-20 16:46:29,817 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:29,817 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:29,817 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:29,817 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:29,817 WARN L170 areAnnotationChecker]: L142 has no Hoare annotation [2022-02-20 16:46:29,817 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:29,817 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:29,817 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2022-02-20 16:46:29,818 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2022-02-20 16:46:29,818 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:29,818 WARN L170 areAnnotationChecker]: L32-7 has no Hoare annotation [2022-02-20 16:46:29,818 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-02-20 16:46:29,818 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-02-20 16:46:29,818 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:29,818 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:29,818 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-02-20 16:46:29,818 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-02-20 16:46:29,818 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2022-02-20 16:46:29,819 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:29,819 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:29,819 WARN L170 areAnnotationChecker]: L32-5 has no Hoare annotation [2022-02-20 16:46:29,819 WARN L170 areAnnotationChecker]: L32-5 has no Hoare annotation [2022-02-20 16:46:29,819 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-02-20 16:46:29,819 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-02-20 16:46:29,819 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:46:29,819 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:46:29,819 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2022-02-20 16:46:29,820 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2022-02-20 16:46:29,820 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:29,820 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:29,820 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:46:29,820 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:46:29,820 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:46:29,820 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:29,820 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:29,821 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:46:29,821 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-02-20 16:46:29,821 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-02-20 16:46:29,821 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-02-20 16:46:29,821 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:29,821 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:29,821 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2022-02-20 16:46:29,821 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:46:29,821 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:46:29,822 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:46:29,822 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:46:29,822 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:46:29,822 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:46:29,822 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:46:29,822 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:46:29,822 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:46:29,822 WARN L170 areAnnotationChecker]: L55-4 has no Hoare annotation [2022-02-20 16:46:29,822 WARN L170 areAnnotationChecker]: L55-4 has no Hoare annotation [2022-02-20 16:46:29,823 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:46:29,823 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:46:29,823 WARN L170 areAnnotationChecker]: L69-2 has no Hoare annotation [2022-02-20 16:46:29,823 WARN L170 areAnnotationChecker]: L69-2 has no Hoare annotation [2022-02-20 16:46:29,823 WARN L170 areAnnotationChecker]: L55-6 has no Hoare annotation [2022-02-20 16:46:29,823 WARN L170 areAnnotationChecker]: L55-6 has no Hoare annotation [2022-02-20 16:46:29,823 WARN L170 areAnnotationChecker]: L61-4 has no Hoare annotation [2022-02-20 16:46:29,823 WARN L170 areAnnotationChecker]: L61-4 has no Hoare annotation [2022-02-20 16:46:29,823 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2022-02-20 16:46:29,824 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:46:29,824 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:46:29,824 WARN L170 areAnnotationChecker]: L61-6 has no Hoare annotation [2022-02-20 16:46:29,824 WARN L170 areAnnotationChecker]: L61-6 has no Hoare annotation [2022-02-20 16:46:29,824 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:46:29,824 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:46:29,824 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:29,824 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:29,824 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:46:29,825 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:46:29,825 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:46:29,825 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:46:29,825 WARN L170 areAnnotationChecker]: L84-2 has no Hoare annotation [2022-02-20 16:46:29,825 WARN L170 areAnnotationChecker]: L84-2 has no Hoare annotation [2022-02-20 16:46:29,825 WARN L170 areAnnotationChecker]: L84-2 has no Hoare annotation [2022-02-20 16:46:29,825 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:29,825 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:29,825 WARN L170 areAnnotationChecker]: L90-2 has no Hoare annotation [2022-02-20 16:46:29,825 WARN L170 areAnnotationChecker]: L90-2 has no Hoare annotation [2022-02-20 16:46:29,826 WARN L170 areAnnotationChecker]: L99-2 has no Hoare annotation [2022-02-20 16:46:29,826 WARN L170 areAnnotationChecker]: L99-2 has no Hoare annotation [2022-02-20 16:46:29,826 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:29,826 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:29,826 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:46:29,826 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:46:29,826 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:46:29,826 WARN L170 areAnnotationChecker]: L99-3 has no Hoare annotation [2022-02-20 16:46:29,826 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:46:29,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:29 BoogieIcfgContainer [2022-02-20 16:46:29,828 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:29,829 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:29,829 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:29,832 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:29,832 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:28" (3/4) ... [2022-02-20 16:46:29,835 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:46:29,835 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:29,836 INFO L158 Benchmark]: Toolchain (without parser) took 1684.66ms. Allocated memory is still 115.3MB. Free memory was 80.5MB in the beginning and 54.5MB in the end (delta: 26.0MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. [2022-02-20 16:46:29,837 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 115.3MB. Free memory was 85.9MB in the beginning and 85.9MB in the end (delta: 29.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:29,838 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.37ms. Allocated memory is still 115.3MB. Free memory was 80.3MB in the beginning and 87.9MB in the end (delta: -7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:46:29,841 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.30ms. Allocated memory is still 115.3MB. Free memory was 87.9MB in the beginning and 84.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:46:29,842 INFO L158 Benchmark]: Boogie Preprocessor took 34.63ms. Allocated memory is still 115.3MB. Free memory was 84.8MB in the beginning and 82.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:29,846 INFO L158 Benchmark]: RCFGBuilder took 520.06ms. Allocated memory is still 115.3MB. Free memory was 82.7MB in the beginning and 58.5MB in the end (delta: 24.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:29,846 INFO L158 Benchmark]: TraceAbstraction took 837.69ms. Allocated memory is still 115.3MB. Free memory was 58.0MB in the beginning and 54.6MB in the end (delta: 3.4MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2022-02-20 16:46:29,846 INFO L158 Benchmark]: Witness Printer took 6.41ms. Allocated memory is still 115.3MB. Free memory was 54.6MB in the beginning and 54.5MB in the end (delta: 162.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:29,848 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.21ms. Allocated memory is still 115.3MB. Free memory was 85.9MB in the beginning and 85.9MB in the end (delta: 29.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.37ms. Allocated memory is still 115.3MB. Free memory was 80.3MB in the beginning and 87.9MB in the end (delta: -7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.30ms. Allocated memory is still 115.3MB. Free memory was 87.9MB in the beginning and 84.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.63ms. Allocated memory is still 115.3MB. Free memory was 84.8MB in the beginning and 82.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 520.06ms. Allocated memory is still 115.3MB. Free memory was 82.7MB in the beginning and 58.5MB in the end (delta: 24.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 837.69ms. Allocated memory is still 115.3MB. Free memory was 58.0MB in the beginning and 54.6MB in the end (delta: 3.4MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Witness Printer took 6.41ms. Allocated memory is still 115.3MB. Free memory was 54.6MB in the beginning and 54.5MB in the end (delta: 162.1kB). 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: 137]: 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 136, overapproximation of someUnaryDOUBLEoperation at line 16, overapproximation of bitwiseAnd at line 34, overapproximation of someBinaryArithmeticFLOAToperation at line 37, overapproximation of bitwiseXOr at line 33. Possible FailurePath: [L14-L17] static const float one_fmod = 1.0, Zero_fmod[] = { 0.0, -0.0, }; VAL [one_fmod=1, Zero_fmod={4:0}] [L128] float x = __VERIFIER_nondet_float(); [L129] float y = 1.0f / 0.0f; [L131] CALL isfinite_float(x) [L111] __int32_t ix; VAL [\old(x)=4294967307, one_fmod=1, x=4294967307, Zero_fmod={4:0}] [L113] ieee_float_shape_type gf_u; [L114] gf_u.value = (x) [L115] EXPR gf_u.word [L115] (ix) = gf_u.word [L117] ix &= 0x7fffffff [L118] return (((ix) < 0x7f800000L)); VAL [\old(x)=4294967307, \result=1, ix=1, one_fmod=1, x=4294967307, Zero_fmod={4:0}] [L131] RET isfinite_float(x) [L131] COND TRUE isfinite_float(x) [L133] CALL, EXPR fmod_float(x, y) [L20] __int32_t n, hx, hy, hz, ix, iy, sx, i; VAL [\old(x)=4294967307, \old(y)=4294967306, one_fmod=1, x=4294967307, y=4294967306, Zero_fmod={4:0}] [L23] ieee_float_shape_type gf_u; [L24] gf_u.value = (x) [L25] EXPR gf_u.word [L25] (hx) = gf_u.word [L28] ieee_float_shape_type gf_u; [L29] gf_u.value = (y) [L30] EXPR gf_u.word [L30] (hy) = gf_u.word [L32] sx = hx & 0x80000000 VAL [\old(x)=4294967307, \old(y)=4294967306, hx=0, hy=-1, one_fmod=1, sx=0, x=4294967307, y=4294967306, Zero_fmod={4:0}] [L33] hx ^= sx [L34] hy &= 0x7fffffff VAL [\old(x)=4294967307, \old(y)=4294967306, hx=0, hy=0, one_fmod=1, sx=0, x=4294967307, y=4294967306, Zero_fmod={4:0}] [L36] COND TRUE ((hy) == 0) || !((hx) < 0x7f800000L) || ((hy) > 0x7f800000L) [L37] return (x * y) / (x * y); VAL [\old(x)=4294967307, \old(y)=4294967306, hx=0, hy=0, one_fmod=1, sx=0, x=4294967307, y=4294967306, Zero_fmod={4:0}] [L133] RET, EXPR fmod_float(x, y) [L133] float res = fmod_float(x, y); [L136] COND TRUE res != x VAL [one_fmod=1, res=4294967309, x=4294967307, y=4294967306, Zero_fmod={4:0}] [L137] reach_error() VAL [one_fmod=1, res=4294967309, x=4294967307, y=4294967306, Zero_fmod={4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 79 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 79 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 13 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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:46:29,892 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_1131a.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 9d7de4eae0919f71f47a70084dddfbb7e8bba2261ae33533b8e450f3643f4e28 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:31,584 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:31,585 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:31,606 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:31,606 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:31,609 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:31,611 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:31,615 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:31,616 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:31,620 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:31,620 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:31,622 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:31,622 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:31,633 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:31,634 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:31,637 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:31,637 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:31,638 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:31,641 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:31,642 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:31,644 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:31,645 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:31,646 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:31,647 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:31,651 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:31,653 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:31,654 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:31,654 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:31,655 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:31,656 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:31,656 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:31,657 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:31,657 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:31,658 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:31,659 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:31,659 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:31,660 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:31,660 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:31,660 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:31,661 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:31,662 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:31,665 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:46:31,687 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:31,687 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:31,687 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:31,688 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:31,688 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:31,689 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:31,689 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:31,689 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:31,690 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:31,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:31,690 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:31,691 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:31,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:31,691 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:31,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:31,691 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:31,692 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:46:31,692 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:46:31,692 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:46:31,692 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:31,692 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:31,692 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:31,692 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:31,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:31,693 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:31,693 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:31,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:31,693 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:31,694 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:31,694 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:31,694 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:46:31,694 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:46:31,694 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:31,695 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:31,695 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:31,695 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:46:31,695 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 -> 9d7de4eae0919f71f47a70084dddfbb7e8bba2261ae33533b8e450f3643f4e28 [2022-02-20 16:46:31,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:31,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:31,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:31,976 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:31,977 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:31,978 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1131a.c [2022-02-20 16:46:32,019 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ef2b96b3/ec32e56caf0d4b2d9a3b9144831a9c7f/FLAGef5b89e48 [2022-02-20 16:46:32,362 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:32,363 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1131a.c [2022-02-20 16:46:32,368 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ef2b96b3/ec32e56caf0d4b2d9a3b9144831a9c7f/FLAGef5b89e48 [2022-02-20 16:46:32,762 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ef2b96b3/ec32e56caf0d4b2d9a3b9144831a9c7f [2022-02-20 16:46:32,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:32,765 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:32,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:32,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:32,777 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:32,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:32" (1/1) ... [2022-02-20 16:46:32,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@604b55f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:32, skipping insertion in model container [2022-02-20 16:46:32,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:32" (1/1) ... [2022-02-20 16:46:32,794 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:32,813 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:32,928 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_1131a.c[2945,2958] [2022-02-20 16:46:32,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:32,971 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:33,001 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_1131a.c[2945,2958] [2022-02-20 16:46:33,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:33,013 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:33,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:33 WrapperNode [2022-02-20 16:46:33,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:33,015 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:33,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:33,015 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:33,019 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:46:33" (1/1) ... [2022-02-20 16:46:33,027 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:46:33" (1/1) ... [2022-02-20 16:46:33,051 INFO L137 Inliner]: procedures = 21, calls = 35, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 183 [2022-02-20 16:46:33,051 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:33,052 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:33,052 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:33,052 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:33,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:33" (1/1) ... [2022-02-20 16:46:33,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:33" (1/1) ... [2022-02-20 16:46:33,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:33" (1/1) ... [2022-02-20 16:46:33,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:33" (1/1) ... [2022-02-20 16:46:33,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:33" (1/1) ... [2022-02-20 16:46:33,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:33" (1/1) ... [2022-02-20 16:46:33,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:33" (1/1) ... [2022-02-20 16:46:33,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:33,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:33,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:33,077 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:33,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:33" (1/1) ... [2022-02-20 16:46:33,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:33,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:33,109 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:46:33,130 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:46:33,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:33,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-02-20 16:46:33,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:46:33,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:33,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:46:33,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:46:33,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:33,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:33,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:46:33,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:46:33,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:33,195 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:33,196 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:35,648 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:35,653 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:35,653 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-02-20 16:46:35,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:35 BoogieIcfgContainer [2022-02-20 16:46:35,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:35,656 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:35,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:35,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:35,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:32" (1/3) ... [2022-02-20 16:46:35,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da3e7c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:35, skipping insertion in model container [2022-02-20 16:46:35,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:33" (2/3) ... [2022-02-20 16:46:35,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da3e7c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:35, skipping insertion in model container [2022-02-20 16:46:35,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:35" (3/3) ... [2022-02-20 16:46:35,660 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1131a.c [2022-02-20 16:46:35,663 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:35,663 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:35,692 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:35,696 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:46:35,697 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:35,707 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 45 states have (on average 1.7333333333333334) internal successors, (78), 46 states have internal predecessors, (78), 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:46:35,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:46:35,711 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:35,711 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:35,712 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:35,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:35,715 INFO L85 PathProgramCache]: Analyzing trace with hash 2036314411, now seen corresponding path program 1 times [2022-02-20 16:46:35,723 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:35,724 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820232778] [2022-02-20 16:46:35,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:35,725 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:35,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:35,749 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:46:35,785 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:46:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:35,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:46:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:35,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:36,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#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(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_fmod~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE()), ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())), ~#Zero_fmod~0.base, ~bvadd32(4bv32, ~#Zero_fmod~0.offset), 4bv32); {50#true} is VALID [2022-02-20 16:46:36,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {50#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~to_fp~FLOAT(currentRoundingMode, 1.0), ~Pluszero~FLOAT());assume { :begin_inline_isfinite_float } true;isfinite_float_#in~x#1 := main_~x~0#1;havoc isfinite_float_#res#1;havoc isfinite_float_#t~mem12#1, isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset, isfinite_float_~x#1, isfinite_float_~ix~1#1;isfinite_float_~x#1 := isfinite_float_#in~x#1;havoc isfinite_float_~ix~1#1; {50#true} is VALID [2022-02-20 16:46:36,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {50#true} assume !true; {51#false} is VALID [2022-02-20 16:46:36,054 INFO L290 TraceCheckUtils]: 3: Hoare triple {51#false} isfinite_float_~ix~1#1 := ~bvand32(2147483647bv32, isfinite_float_~ix~1#1);isfinite_float_#res#1 := (if ~bvslt32(isfinite_float_~ix~1#1, 2139095040bv32) then 1bv32 else 0bv32); {51#false} is VALID [2022-02-20 16:46:36,054 INFO L290 TraceCheckUtils]: 4: Hoare triple {51#false} main_#t~ret14#1 := isfinite_float_#res#1;assume { :end_inline_isfinite_float } true; {51#false} is VALID [2022-02-20 16:46:36,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {51#false} assume 0bv32 != main_#t~ret14#1;havoc main_#t~ret14#1;assume { :begin_inline_fmod_float } true;fmod_float_#in~x#1, fmod_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmod_float_#res#1;havoc fmod_float_#t~mem4#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, fmod_float_#t~mem5#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, fmod_float_#t~mem6#1, fmod_float_#t~mem8#1, fmod_float_#t~post7#1, fmod_float_#t~mem9#1, fmod_float_#t~mem10#1, fmod_float_~#sf_u~0#1.base, fmod_float_~#sf_u~0#1.offset, fmod_float_#t~mem11#1, fmod_float_~#sf_u~1#1.base, fmod_float_~#sf_u~1#1.offset, fmod_float_~x#1, fmod_float_~y#1, fmod_float_~n~0#1, fmod_float_~hx~0#1, fmod_float_~hy~0#1, fmod_float_~hz~0#1, fmod_float_~ix~0#1, fmod_float_~iy~0#1, fmod_float_~sx~0#1, fmod_float_~i~0#1;fmod_float_~x#1 := fmod_float_#in~x#1;fmod_float_~y#1 := fmod_float_#in~y#1;havoc fmod_float_~n~0#1;havoc fmod_float_~hx~0#1;havoc fmod_float_~hy~0#1;havoc fmod_float_~hz~0#1;havoc fmod_float_~ix~0#1;havoc fmod_float_~iy~0#1;havoc fmod_float_~sx~0#1;havoc fmod_float_~i~0#1; {51#false} is VALID [2022-02-20 16:46:36,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {51#false} assume !true; {51#false} is VALID [2022-02-20 16:46:36,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {51#false} assume !true; {51#false} is VALID [2022-02-20 16:46:36,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {51#false} fmod_float_~sx~0#1 := ~bvand32(2147483648bv32, fmod_float_~hx~0#1);fmod_float_~hx~0#1 := ~bvxor32(fmod_float_~hx~0#1, fmod_float_~sx~0#1);fmod_float_~hy~0#1 := ~bvand32(2147483647bv32, fmod_float_~hy~0#1); {51#false} is VALID [2022-02-20 16:46:36,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {51#false} assume (0bv32 == fmod_float_~hy~0#1 || !~bvslt32(fmod_float_~hx~0#1, 2139095040bv32)) || ~bvsgt32(fmod_float_~hy~0#1, 2139095040bv32);fmod_float_#res#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, fmod_float_~x#1, fmod_float_~y#1), ~fp.mul~FLOAT(currentRoundingMode, fmod_float_~x#1, fmod_float_~y#1)); {51#false} is VALID [2022-02-20 16:46:36,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {51#false} main_#t~ret15#1 := fmod_float_#res#1;assume { :end_inline_fmod_float } true;main_~res~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {51#false} is VALID [2022-02-20 16:46:36,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {51#false} assume !~fp.eq~FLOAT(main_~res~0#1, main_~x~0#1); {51#false} is VALID [2022-02-20 16:46:36,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {51#false} assume !false; {51#false} is VALID [2022-02-20 16:46:36,057 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:46:36,057 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:36,057 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:36,057 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820232778] [2022-02-20 16:46:36,058 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820232778] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:36,058 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:36,058 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:36,059 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119495083] [2022-02-20 16:46:36,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:36,063 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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:46:36,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:36,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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:46:36,300 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:46:36,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:36,300 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:36,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:36,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:36,326 INFO L87 Difference]: Start difference. First operand has 47 states, 45 states have (on average 1.7333333333333334) internal successors, (78), 46 states have internal predecessors, (78), 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 6.5) internal successors, (13), 2 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:46:38,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:38,677 INFO L93 Difference]: Finished difference Result 92 states and 154 transitions. [2022-02-20 16:46:38,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:38,677 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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:46:38,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:38,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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:46:38,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 154 transitions. [2022-02-20 16:46:38,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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:46:38,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 154 transitions. [2022-02-20 16:46:38,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 154 transitions. [2022-02-20 16:46:39,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:39,309 INFO L225 Difference]: With dead ends: 92 [2022-02-20 16:46:39,309 INFO L226 Difference]: Without dead ends: 43 [2022-02-20 16:46:39,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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:46:39,313 INFO L933 BasicCegarLoop]: 63 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, 63 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:46:39,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:39,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-20 16:46:39,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-02-20 16:46:39,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:39,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 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:46:39,333 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 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:46:39,334 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 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:46:39,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:39,336 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2022-02-20 16:46:39,336 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2022-02-20 16:46:39,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:39,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:39,337 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 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 43 states. [2022-02-20 16:46:39,337 INFO L87 Difference]: Start difference. First operand has 43 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 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 43 states. [2022-02-20 16:46:39,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:39,339 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2022-02-20 16:46:39,339 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2022-02-20 16:46:39,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:39,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:39,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:39,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:39,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 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:46:39,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2022-02-20 16:46:39,343 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 13 [2022-02-20 16:46:39,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:39,343 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2022-02-20 16:46:39,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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:46:39,343 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2022-02-20 16:46:39,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 16:46:39,344 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:39,344 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:39,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 16:46:39,556 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:46:39,556 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:39,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:39,557 INFO L85 PathProgramCache]: Analyzing trace with hash -794964373, now seen corresponding path program 1 times [2022-02-20 16:46:39,558 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:39,558 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985334449] [2022-02-20 16:46:39,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:39,558 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:39,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:39,573 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:46:39,574 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:46:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:39,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 30 conjunts are in the unsatisfiable core [2022-02-20 16:46:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:39,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:40,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 16:46:40,857 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-02-20 16:46:40,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 35 [2022-02-20 16:46:41,116 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 16:46:41,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 24 [2022-02-20 16:46:41,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {343#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(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_fmod~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE()), ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())), ~#Zero_fmod~0.base, ~bvadd32(4bv32, ~#Zero_fmod~0.offset), 4bv32); {343#true} is VALID [2022-02-20 16:46:41,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {343#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~to_fp~FLOAT(currentRoundingMode, 1.0), ~Pluszero~FLOAT());assume { :begin_inline_isfinite_float } true;isfinite_float_#in~x#1 := main_~x~0#1;havoc isfinite_float_#res#1;havoc isfinite_float_#t~mem12#1, isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset, isfinite_float_~x#1, isfinite_float_~ix~1#1;isfinite_float_~x#1 := isfinite_float_#in~x#1;havoc isfinite_float_~ix~1#1; {351#(and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_isfinite_float_~x#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 16:46:41,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {351#(and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_isfinite_float_~x#1| |ULTIMATE.start_main_~x~0#1|))} call isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isfinite_float_~x#1, isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset, 4bv32);call isfinite_float_#t~mem12#1 := read~intINTTYPE4(isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset, 4bv32);isfinite_float_~ix~1#1 := isfinite_float_#t~mem12#1;havoc isfinite_float_#t~mem12#1;call ULTIMATE.dealloc(isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset);havoc isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset; {355#(and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_main_~x~0#1|) (= (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)) |ULTIMATE.start_isfinite_float_~ix~1#1|))))} is VALID [2022-02-20 16:46:41,693 INFO L290 TraceCheckUtils]: 3: Hoare triple {355#(and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_main_~x~0#1|) (= (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)) |ULTIMATE.start_isfinite_float_~ix~1#1|))))} goto; {355#(and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_main_~x~0#1|) (= (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)) |ULTIMATE.start_isfinite_float_~ix~1#1|))))} is VALID [2022-02-20 16:46:41,699 INFO L290 TraceCheckUtils]: 4: Hoare triple {355#(and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_main_~x~0#1|) (= (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)) |ULTIMATE.start_isfinite_float_~ix~1#1|))))} isfinite_float_~ix~1#1 := ~bvand32(2147483647bv32, isfinite_float_~ix~1#1);isfinite_float_#res#1 := (if ~bvslt32(isfinite_float_~ix~1#1, 2139095040bv32) then 1bv32 else 0bv32); {362#(and (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_main_~x~0#1|) (or (and (not (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) (_ bv2139095040 32))) (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv0 32))) (and (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv1 32)) (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)))))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 16:46:41,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {362#(and (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_main_~x~0#1|) (or (and (not (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) (_ bv2139095040 32))) (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv0 32))) (and (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv1 32)) (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)))))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)))} main_#t~ret14#1 := isfinite_float_#res#1;assume { :end_inline_isfinite_float } true; {366#(and (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6| (_ BitVec 32))) (and (or (and (= |ULTIMATE.start_main_#t~ret14#1| (_ bv0 32)) (not (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)))) (and (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)) (= |ULTIMATE.start_main_#t~ret14#1| (_ bv1 32)))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_main_~x~0#1|))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 16:46:41,704 INFO L290 TraceCheckUtils]: 6: Hoare triple {366#(and (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6| (_ BitVec 32))) (and (or (and (= |ULTIMATE.start_main_#t~ret14#1| (_ bv0 32)) (not (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)))) (and (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)) (= |ULTIMATE.start_main_#t~ret14#1| (_ bv1 32)))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_main_~x~0#1|))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)))} assume 0bv32 != main_#t~ret14#1;havoc main_#t~ret14#1;assume { :begin_inline_fmod_float } true;fmod_float_#in~x#1, fmod_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmod_float_#res#1;havoc fmod_float_#t~mem4#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, fmod_float_#t~mem5#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, fmod_float_#t~mem6#1, fmod_float_#t~mem8#1, fmod_float_#t~post7#1, fmod_float_#t~mem9#1, fmod_float_#t~mem10#1, fmod_float_~#sf_u~0#1.base, fmod_float_~#sf_u~0#1.offset, fmod_float_#t~mem11#1, fmod_float_~#sf_u~1#1.base, fmod_float_~#sf_u~1#1.offset, fmod_float_~x#1, fmod_float_~y#1, fmod_float_~n~0#1, fmod_float_~hx~0#1, fmod_float_~hy~0#1, fmod_float_~hz~0#1, fmod_float_~ix~0#1, fmod_float_~iy~0#1, fmod_float_~sx~0#1, fmod_float_~i~0#1;fmod_float_~x#1 := fmod_float_#in~x#1;fmod_float_~y#1 := fmod_float_#in~y#1;havoc fmod_float_~n~0#1;havoc fmod_float_~hx~0#1;havoc fmod_float_~hy~0#1;havoc fmod_float_~hz~0#1;havoc fmod_float_~ix~0#1;havoc fmod_float_~iy~0#1;havoc fmod_float_~sx~0#1;havoc fmod_float_~i~0#1; {370#(and (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmod_float_~y#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_fmod_float_~x#1|))))} is VALID [2022-02-20 16:46:41,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {370#(and (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmod_float_~y#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)))) |ULTIMATE.start_fmod_float_~x#1|))))} call fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~x#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);call fmod_float_#t~mem4#1 := read~intINTTYPE4(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);fmod_float_~hx~0#1 := fmod_float_#t~mem4#1;havoc fmod_float_#t~mem4#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset);havoc fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset; {374#(and (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6| (_ BitVec 32)) (|v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)))) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32))))) (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)) (= (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32)) |ULTIMATE.start_fmod_float_~hx~0#1|))) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmod_float_~y#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:41,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {374#(and (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6| (_ BitVec 32)) (|v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)))) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32))))) (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)) (= (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32)) |ULTIMATE.start_fmod_float_~hx~0#1|))) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmod_float_~y#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))} goto; {374#(and (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6| (_ BitVec 32)) (|v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)))) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32))))) (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)) (= (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32)) |ULTIMATE.start_fmod_float_~hx~0#1|))) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmod_float_~y#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:41,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {374#(and (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6| (_ BitVec 32)) (|v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)))) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32))))) (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)) (= (select (select |#memory_int| |v_ULTIMATE.start_fmod_float_~#gf_u~0#1.base_6|) (_ bv0 32)) |ULTIMATE.start_fmod_float_~hx~0#1|))) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmod_float_~y#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))} call fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~y#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);call fmod_float_#t~mem5#1 := read~intINTTYPE4(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);fmod_float_~hy~0#1 := fmod_float_#t~mem5#1;havoc fmod_float_#t~mem5#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset);havoc fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset; {381#(and (exists ((v_arrayElimCell_3 (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) v_arrayElimCell_3) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|))))) (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:41,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {381#(and (exists ((v_arrayElimCell_3 (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) v_arrayElimCell_3) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|))))) (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))} goto; {381#(and (exists ((v_arrayElimCell_3 (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) v_arrayElimCell_3) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|))))) (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:41,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {381#(and (exists ((v_arrayElimCell_3 (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) v_arrayElimCell_3) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|))))) (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))} fmod_float_~sx~0#1 := ~bvand32(2147483648bv32, fmod_float_~hx~0#1);fmod_float_~hx~0#1 := ~bvxor32(fmod_float_~hx~0#1, fmod_float_~sx~0#1);fmod_float_~hy~0#1 := ~bvand32(2147483647bv32, fmod_float_~hy~0#1); {388#(and (exists ((currentRoundingMode RoundingMode) (|v_ULTIMATE.start_fmod_float_~hy~0#1_20| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|) |ULTIMATE.start_fmod_float_~hy~0#1|))) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_35| (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_35|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_35|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_35|))) (bvslt (bvand (_ bv2147483647 32) v_arrayElimCell_3) (_ bv2139095040 32)) (= (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_35| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_35|) |ULTIMATE.start_fmod_float_~hx~0#1|))))} is VALID [2022-02-20 16:46:41,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {388#(and (exists ((currentRoundingMode RoundingMode) (|v_ULTIMATE.start_fmod_float_~hy~0#1_20| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|) |ULTIMATE.start_fmod_float_~hy~0#1|))) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_35| (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_35|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_35|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_35|))) (bvslt (bvand (_ bv2147483647 32) v_arrayElimCell_3) (_ bv2139095040 32)) (= (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_35| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_35|) |ULTIMATE.start_fmod_float_~hx~0#1|))))} assume (0bv32 == fmod_float_~hy~0#1 || !~bvslt32(fmod_float_~hx~0#1, 2139095040bv32)) || ~bvsgt32(fmod_float_~hy~0#1, 2139095040bv32);fmod_float_#res#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, fmod_float_~x#1, fmod_float_~y#1), ~fp.mul~FLOAT(currentRoundingMode, fmod_float_~x#1, fmod_float_~y#1)); {344#false} is VALID [2022-02-20 16:46:41,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {344#false} main_#t~ret15#1 := fmod_float_#res#1;assume { :end_inline_fmod_float } true;main_~res~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {344#false} is VALID [2022-02-20 16:46:41,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {344#false} assume !~fp.eq~FLOAT(main_~res~0#1, main_~x~0#1); {344#false} is VALID [2022-02-20 16:46:41,960 INFO L290 TraceCheckUtils]: 15: Hoare triple {344#false} assume !false; {344#false} is VALID [2022-02-20 16:46:41,960 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:46:41,960 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:41,961 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:41,961 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [985334449] [2022-02-20 16:46:41,961 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [985334449] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:41,961 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:41,961 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 16:46:41,961 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215372292] [2022-02-20 16:46:41,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:41,962 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 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 16 [2022-02-20 16:46:41,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:41,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 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:46:42,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:42,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 16:46:42,250 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:42,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 16:46:42,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:46:42,251 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 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:46:44,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:44,220 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-02-20 16:46:44,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 16:46:44,220 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 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 16 [2022-02-20 16:46:44,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:44,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 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:46:44,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2022-02-20 16:46:44,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 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:46:44,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2022-02-20 16:46:44,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 61 transitions. [2022-02-20 16:46:44,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:44,557 INFO L225 Difference]: With dead ends: 47 [2022-02-20 16:46:44,557 INFO L226 Difference]: Without dead ends: 43 [2022-02-20 16:46:44,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:46:44,558 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:44,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 307 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 90 Unchecked, 0.0s Time] [2022-02-20 16:46:44,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-20 16:46:44,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-02-20 16:46:44,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:44,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 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:46:44,563 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 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:46:44,563 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 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:46:44,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:44,564 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2022-02-20 16:46:44,564 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2022-02-20 16:46:44,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:44,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:44,565 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 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 43 states. [2022-02-20 16:46:44,565 INFO L87 Difference]: Start difference. First operand has 43 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 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 43 states. [2022-02-20 16:46:44,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:44,566 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2022-02-20 16:46:44,566 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2022-02-20 16:46:44,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:44,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:44,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:44,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:44,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 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:46:44,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2022-02-20 16:46:44,568 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 16 [2022-02-20 16:46:44,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:44,568 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2022-02-20 16:46:44,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 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:46:44,569 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2022-02-20 16:46:44,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 16:46:44,569 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:44,569 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:46:44,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:44,774 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:46:44,774 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:44,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:44,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1123581797, now seen corresponding path program 1 times [2022-02-20 16:46:44,775 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:44,775 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409709055] [2022-02-20 16:46:44,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:44,776 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:44,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:44,779 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:46:44,780 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:46:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:44,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 16:46:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:44,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:45,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {597#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(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_fmod~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE()), ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())), ~#Zero_fmod~0.base, ~bvadd32(4bv32, ~#Zero_fmod~0.offset), 4bv32); {597#true} is VALID [2022-02-20 16:46:45,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {597#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~to_fp~FLOAT(currentRoundingMode, 1.0), ~Pluszero~FLOAT());assume { :begin_inline_isfinite_float } true;isfinite_float_#in~x#1 := main_~x~0#1;havoc isfinite_float_#res#1;havoc isfinite_float_#t~mem12#1, isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset, isfinite_float_~x#1, isfinite_float_~ix~1#1;isfinite_float_~x#1 := isfinite_float_#in~x#1;havoc isfinite_float_~ix~1#1; {605#(= |ULTIMATE.start_isfinite_float_~x#1| |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 16:46:45,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {605#(= |ULTIMATE.start_isfinite_float_~x#1| |ULTIMATE.start_main_~x~0#1|)} call isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isfinite_float_~x#1, isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset, 4bv32);call isfinite_float_#t~mem12#1 := read~intINTTYPE4(isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset, 4bv32);isfinite_float_~ix~1#1 := isfinite_float_#t~mem12#1;havoc isfinite_float_#t~mem12#1;call ULTIMATE.dealloc(isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset);havoc isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset; {609#(= (fp ((_ extract 31 31) |ULTIMATE.start_isfinite_float_~ix~1#1|) ((_ extract 30 23) |ULTIMATE.start_isfinite_float_~ix~1#1|) ((_ extract 22 0) |ULTIMATE.start_isfinite_float_~ix~1#1|)) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 16:46:45,747 INFO L290 TraceCheckUtils]: 3: Hoare triple {609#(= (fp ((_ extract 31 31) |ULTIMATE.start_isfinite_float_~ix~1#1|) ((_ extract 30 23) |ULTIMATE.start_isfinite_float_~ix~1#1|) ((_ extract 22 0) |ULTIMATE.start_isfinite_float_~ix~1#1|)) |ULTIMATE.start_main_~x~0#1|)} goto; {609#(= (fp ((_ extract 31 31) |ULTIMATE.start_isfinite_float_~ix~1#1|) ((_ extract 30 23) |ULTIMATE.start_isfinite_float_~ix~1#1|) ((_ extract 22 0) |ULTIMATE.start_isfinite_float_~ix~1#1|)) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 16:46:45,748 INFO L290 TraceCheckUtils]: 4: Hoare triple {609#(= (fp ((_ extract 31 31) |ULTIMATE.start_isfinite_float_~ix~1#1|) ((_ extract 30 23) |ULTIMATE.start_isfinite_float_~ix~1#1|) ((_ extract 22 0) |ULTIMATE.start_isfinite_float_~ix~1#1|)) |ULTIMATE.start_main_~x~0#1|)} isfinite_float_~ix~1#1 := ~bvand32(2147483647bv32, isfinite_float_~ix~1#1);isfinite_float_#res#1 := (if ~bvslt32(isfinite_float_~ix~1#1, 2139095040bv32) then 1bv32 else 0bv32); {616#(exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|) (or (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv1 32))) (and (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv0 32)) (not (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)))))))} is VALID [2022-02-20 16:46:45,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {616#(exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|) (or (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv1 32))) (and (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv0 32)) (not (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)))))))} main_#t~ret14#1 := isfinite_float_#res#1;assume { :end_inline_isfinite_float } true; {620#(exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (or (and (= |ULTIMATE.start_main_#t~ret14#1| (_ bv0 32)) (not (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= |ULTIMATE.start_main_#t~ret14#1| (_ bv1 32)))) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-20 16:46:45,749 INFO L290 TraceCheckUtils]: 6: Hoare triple {620#(exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (or (and (= |ULTIMATE.start_main_#t~ret14#1| (_ bv0 32)) (not (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= |ULTIMATE.start_main_#t~ret14#1| (_ bv1 32)))) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|)))} assume 0bv32 != main_#t~ret14#1;havoc main_#t~ret14#1;assume { :begin_inline_fmod_float } true;fmod_float_#in~x#1, fmod_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmod_float_#res#1;havoc fmod_float_#t~mem4#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, fmod_float_#t~mem5#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, fmod_float_#t~mem6#1, fmod_float_#t~mem8#1, fmod_float_#t~post7#1, fmod_float_#t~mem9#1, fmod_float_#t~mem10#1, fmod_float_~#sf_u~0#1.base, fmod_float_~#sf_u~0#1.offset, fmod_float_#t~mem11#1, fmod_float_~#sf_u~1#1.base, fmod_float_~#sf_u~1#1.offset, fmod_float_~x#1, fmod_float_~y#1, fmod_float_~n~0#1, fmod_float_~hx~0#1, fmod_float_~hy~0#1, fmod_float_~hz~0#1, fmod_float_~ix~0#1, fmod_float_~iy~0#1, fmod_float_~sx~0#1, fmod_float_~i~0#1;fmod_float_~x#1 := fmod_float_#in~x#1;fmod_float_~y#1 := fmod_float_#in~y#1;havoc fmod_float_~n~0#1;havoc fmod_float_~hx~0#1;havoc fmod_float_~hy~0#1;havoc fmod_float_~hz~0#1;havoc fmod_float_~ix~0#1;havoc fmod_float_~iy~0#1;havoc fmod_float_~sx~0#1;havoc fmod_float_~i~0#1; {624#(and (= |ULTIMATE.start_fmod_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 16:46:45,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {624#(and (= |ULTIMATE.start_fmod_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} call fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~x#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);call fmod_float_#t~mem4#1 := read~intINTTYPE4(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);fmod_float_~hx~0#1 := fmod_float_#t~mem4#1;havoc fmod_float_#t~mem4#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset);havoc fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset; {624#(and (= |ULTIMATE.start_fmod_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 16:46:45,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {624#(and (= |ULTIMATE.start_fmod_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} goto; {624#(and (= |ULTIMATE.start_fmod_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 16:46:45,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {624#(and (= |ULTIMATE.start_fmod_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} call fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~y#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);call fmod_float_#t~mem5#1 := read~intINTTYPE4(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);fmod_float_~hy~0#1 := fmod_float_#t~mem5#1;havoc fmod_float_#t~mem5#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset);havoc fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset; {624#(and (= |ULTIMATE.start_fmod_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 16:46:45,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {624#(and (= |ULTIMATE.start_fmod_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} goto; {624#(and (= |ULTIMATE.start_fmod_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 16:46:45,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {624#(and (= |ULTIMATE.start_fmod_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} fmod_float_~sx~0#1 := ~bvand32(2147483648bv32, fmod_float_~hx~0#1);fmod_float_~hx~0#1 := ~bvxor32(fmod_float_~hx~0#1, fmod_float_~sx~0#1);fmod_float_~hy~0#1 := ~bvand32(2147483647bv32, fmod_float_~hy~0#1); {624#(and (= |ULTIMATE.start_fmod_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 16:46:45,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {624#(and (= |ULTIMATE.start_fmod_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} assume !((0bv32 == fmod_float_~hy~0#1 || !~bvslt32(fmod_float_~hx~0#1, 2139095040bv32)) || ~bvsgt32(fmod_float_~hy~0#1, 2139095040bv32)); {624#(and (= |ULTIMATE.start_fmod_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 16:46:45,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {624#(and (= |ULTIMATE.start_fmod_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} assume ~bvslt32(fmod_float_~hx~0#1, fmod_float_~hy~0#1);fmod_float_#res#1 := fmod_float_~x#1; {646#(and (= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_fmod_float_#res#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 16:46:45,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {646#(and (= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_fmod_float_#res#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} main_#t~ret15#1 := fmod_float_#res#1;assume { :end_inline_fmod_float } true;main_~res~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {650#(and (= |ULTIMATE.start_main_~res~0#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-20 16:46:45,759 INFO L290 TraceCheckUtils]: 15: Hoare triple {650#(and (= |ULTIMATE.start_main_~res~0#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|))))} assume !~fp.eq~FLOAT(main_~res~0#1, main_~x~0#1); {598#false} is VALID [2022-02-20 16:46:45,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {598#false} assume !false; {598#false} is VALID [2022-02-20 16:46:45,759 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:46:45,759 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:45,759 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:45,759 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1409709055] [2022-02-20 16:46:45,759 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1409709055] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:45,759 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:45,759 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 16:46:45,759 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573538008] [2022-02-20 16:46:45,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:45,760 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:46:45,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:45,760 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:46:45,795 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:46:45,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 16:46:45,795 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:45,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 16:46:45,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:46:45,796 INFO L87 Difference]: Start difference. First operand 43 states and 57 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:46:47,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:47,607 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2022-02-20 16:46:47,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 16:46:47,607 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:46:47,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:47,608 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:46:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2022-02-20 16:46:47,611 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:46:47,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2022-02-20 16:46:47,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 62 transitions. [2022-02-20 16:46:47,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:47,727 INFO L225 Difference]: With dead ends: 49 [2022-02-20 16:46:47,727 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 16:46:47,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-02-20 16:46:47,728 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 37 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:47,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 341 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 31 Unchecked, 0.0s Time] [2022-02-20 16:46:47,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 16:46:47,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2022-02-20 16:46:47,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:47,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 43 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 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:46:47,751 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 43 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 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:46:47,752 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 43 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 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:46:47,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:47,756 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-02-20 16:46:47,756 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2022-02-20 16:46:47,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:47,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:47,760 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 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 45 states. [2022-02-20 16:46:47,760 INFO L87 Difference]: Start difference. First operand has 43 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 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 45 states. [2022-02-20 16:46:47,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:47,762 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-02-20 16:46:47,762 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2022-02-20 16:46:47,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:47,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:47,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:47,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:47,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 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:46:47,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 56 transitions. [2022-02-20 16:46:47,764 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 56 transitions. Word has length 17 [2022-02-20 16:46:47,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:47,764 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 56 transitions. [2022-02-20 16:46:47,764 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:46:47,765 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2022-02-20 16:46:47,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 16:46:47,766 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:47,766 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:47,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-02-20 16:46:47,966 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:46:47,967 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:47,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:47,967 INFO L85 PathProgramCache]: Analyzing trace with hash 469119878, now seen corresponding path program 1 times [2022-02-20 16:46:47,967 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:47,968 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1233539115] [2022-02-20 16:46:47,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:47,968 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:47,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:47,970 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:46:47,973 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:46:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:48,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 16:46:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:48,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:48,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {864#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(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_fmod~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE()), ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())), ~#Zero_fmod~0.base, ~bvadd32(4bv32, ~#Zero_fmod~0.offset), 4bv32); {864#true} is VALID [2022-02-20 16:46:48,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {864#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~to_fp~FLOAT(currentRoundingMode, 1.0), ~Pluszero~FLOAT());assume { :begin_inline_isfinite_float } true;isfinite_float_#in~x#1 := main_~x~0#1;havoc isfinite_float_#res#1;havoc isfinite_float_#t~mem12#1, isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset, isfinite_float_~x#1, isfinite_float_~ix~1#1;isfinite_float_~x#1 := isfinite_float_#in~x#1;havoc isfinite_float_~ix~1#1; {872#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 16:46:48,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {872#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|))} call isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isfinite_float_~x#1, isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset, 4bv32);call isfinite_float_#t~mem12#1 := read~intINTTYPE4(isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset, 4bv32);isfinite_float_~ix~1#1 := isfinite_float_#t~mem12#1;havoc isfinite_float_#t~mem12#1;call ULTIMATE.dealloc(isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset);havoc isfinite_float_~#gf_u~2#1.base, isfinite_float_~#gf_u~2#1.offset; {872#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 16:46:48,494 INFO L290 TraceCheckUtils]: 3: Hoare triple {872#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|))} goto; {872#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 16:46:48,496 INFO L290 TraceCheckUtils]: 4: Hoare triple {872#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|))} isfinite_float_~ix~1#1 := ~bvand32(2147483647bv32, isfinite_float_~ix~1#1);isfinite_float_#res#1 := (if ~bvslt32(isfinite_float_~ix~1#1, 2139095040bv32) then 1bv32 else 0bv32); {872#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 16:46:48,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {872#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|))} main_#t~ret14#1 := isfinite_float_#res#1;assume { :end_inline_isfinite_float } true; {872#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 16:46:48,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {872#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|))} assume 0bv32 != main_#t~ret14#1;havoc main_#t~ret14#1;assume { :begin_inline_fmod_float } true;fmod_float_#in~x#1, fmod_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmod_float_#res#1;havoc fmod_float_#t~mem4#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, fmod_float_#t~mem5#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, fmod_float_#t~mem6#1, fmod_float_#t~mem8#1, fmod_float_#t~post7#1, fmod_float_#t~mem9#1, fmod_float_#t~mem10#1, fmod_float_~#sf_u~0#1.base, fmod_float_~#sf_u~0#1.offset, fmod_float_#t~mem11#1, fmod_float_~#sf_u~1#1.base, fmod_float_~#sf_u~1#1.offset, fmod_float_~x#1, fmod_float_~y#1, fmod_float_~n~0#1, fmod_float_~hx~0#1, fmod_float_~hy~0#1, fmod_float_~hz~0#1, fmod_float_~ix~0#1, fmod_float_~iy~0#1, fmod_float_~sx~0#1, fmod_float_~i~0#1;fmod_float_~x#1 := fmod_float_#in~x#1;fmod_float_~y#1 := fmod_float_#in~y#1;havoc fmod_float_~n~0#1;havoc fmod_float_~hx~0#1;havoc fmod_float_~hy~0#1;havoc fmod_float_~hz~0#1;havoc fmod_float_~ix~0#1;havoc fmod_float_~iy~0#1;havoc fmod_float_~sx~0#1;havoc fmod_float_~i~0#1; {888#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmod_float_~y#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:48,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {888#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmod_float_~y#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} call fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~x#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);call fmod_float_#t~mem4#1 := read~intINTTYPE4(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);fmod_float_~hx~0#1 := fmod_float_#t~mem4#1;havoc fmod_float_#t~mem4#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset);havoc fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset; {888#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmod_float_~y#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:48,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {888#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmod_float_~y#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} goto; {888#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmod_float_~y#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:48,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {888#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmod_float_~y#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} call fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~y#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);call fmod_float_#t~mem5#1 := read~intINTTYPE4(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);fmod_float_~hy~0#1 := fmod_float_#t~mem5#1;havoc fmod_float_#t~mem5#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset);havoc fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset; {898#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:48,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {898#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} goto; {898#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:48,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {898#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} fmod_float_~sx~0#1 := ~bvand32(2147483648bv32, fmod_float_~hx~0#1);fmod_float_~hx~0#1 := ~bvxor32(fmod_float_~hx~0#1, fmod_float_~sx~0#1);fmod_float_~hy~0#1 := ~bvand32(2147483647bv32, fmod_float_~hy~0#1); {905#(and (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_21| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|) |ULTIMATE.start_fmod_float_~hy~0#1|) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_36| (_ BitVec 32))) (= (bvxor |v_ULTIMATE.start_fmod_float_~hx~0#1_36| (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_36| (_ bv2147483648 32))) |ULTIMATE.start_fmod_float_~hx~0#1|)))} is VALID [2022-02-20 16:46:48,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {905#(and (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_21| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|) |ULTIMATE.start_fmod_float_~hy~0#1|) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_36| (_ BitVec 32))) (= (bvxor |v_ULTIMATE.start_fmod_float_~hx~0#1_36| (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_36| (_ bv2147483648 32))) |ULTIMATE.start_fmod_float_~hx~0#1|)))} assume !((0bv32 == fmod_float_~hy~0#1 || !~bvslt32(fmod_float_~hx~0#1, 2139095040bv32)) || ~bvsgt32(fmod_float_~hy~0#1, 2139095040bv32)); {909#(and (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_21| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|) |ULTIMATE.start_fmod_float_~hy~0#1|) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))) (bvslt |ULTIMATE.start_fmod_float_~hx~0#1| (_ bv2139095040 32)) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_36| (_ BitVec 32))) (= (bvxor |v_ULTIMATE.start_fmod_float_~hx~0#1_36| (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_36| (_ bv2147483648 32))) |ULTIMATE.start_fmod_float_~hx~0#1|)))} is VALID [2022-02-20 16:46:48,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {909#(and (exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_21| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|) |ULTIMATE.start_fmod_float_~hy~0#1|) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hy~0#1_21|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))) (bvslt |ULTIMATE.start_fmod_float_~hx~0#1| (_ bv2139095040 32)) (exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_36| (_ BitVec 32))) (= (bvxor |v_ULTIMATE.start_fmod_float_~hx~0#1_36| (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_36| (_ bv2147483648 32))) |ULTIMATE.start_fmod_float_~hx~0#1|)))} assume !~bvslt32(fmod_float_~hx~0#1, fmod_float_~hy~0#1); {865#false} is VALID [2022-02-20 16:46:48,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {865#false} assume fmod_float_~hx~0#1 == fmod_float_~hy~0#1;call fmod_float_#t~mem6#1 := read~intFLOATTYPE4(~#Zero_fmod~0.base, ~bvadd32(~#Zero_fmod~0.offset, ~bvmul32(4bv32, ~bvlshr32(fmod_float_~sx~0#1, 31bv32))), 4bv32);fmod_float_#res#1 := fmod_float_#t~mem6#1;havoc fmod_float_#t~mem6#1; {865#false} is VALID [2022-02-20 16:46:48,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {865#false} main_#t~ret15#1 := fmod_float_#res#1;assume { :end_inline_fmod_float } true;main_~res~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1; {865#false} is VALID [2022-02-20 16:46:48,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {865#false} assume !~fp.eq~FLOAT(main_~res~0#1, main_~x~0#1); {865#false} is VALID [2022-02-20 16:46:48,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {865#false} assume !false; {865#false} is VALID [2022-02-20 16:46:48,519 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:46:48,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:48,519 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:48,519 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1233539115] [2022-02-20 16:46:48,519 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1233539115] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:48,519 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:48,519 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 16:46:48,519 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221045339] [2022-02-20 16:46:48,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:48,520 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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) Word has length 18 [2022-02-20 16:46:48,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:48,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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:46:48,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:48,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:46:48,561 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:48,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:46:48,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:48,561 INFO L87 Difference]: Start difference. First operand 43 states and 56 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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:46:48,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:48,817 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2022-02-20 16:46:48,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:46:48,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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) Word has length 18 [2022-02-20 16:46:48,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:48,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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:46:48,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2022-02-20 16:46:48,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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:46:48,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2022-02-20 16:46:48,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 56 transitions. [2022-02-20 16:46:48,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:48,917 INFO L225 Difference]: With dead ends: 43 [2022-02-20 16:46:48,917 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:46:48,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:48,918 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 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:46:48,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 5 Unchecked, 0.0s Time] [2022-02-20 16:46:48,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:46:48,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:46:48,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:48,919 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:46:48,919 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:46:48,919 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:46:48,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:48,919 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:48,919 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:48,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:48,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:48,919 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:46:48,920 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:46:48,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:48,920 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:48,920 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:48,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:48,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:48,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:48,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:48,920 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:46:48,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:46:48,920 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-02-20 16:46:48,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:48,920 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:46:48,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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:46:48,920 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:48,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:48,922 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:48,942 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:46:49,131 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:46:49,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:46:49,439 INFO L858 garLoopResultBuilder]: For program point L27(lines 27 31) no Hoare annotation was computed. [2022-02-20 16:46:49,439 INFO L858 garLoopResultBuilder]: For program point L60-1(lines 60 65) no Hoare annotation was computed. [2022-02-20 16:46:49,439 INFO L858 garLoopResultBuilder]: For program point L27-1(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:49,439 INFO L858 garLoopResultBuilder]: For program point L27-2(lines 27 31) no Hoare annotation was computed. [2022-02-20 16:46:49,439 INFO L854 garLoopResultBuilder]: At program point L118(lines 110 119) the Hoare annotation is: (and (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6| (_ BitVec 32))) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)))) (and (= (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)) |ULTIMATE.start_main_~x~0#1|) (let ((.cse1 (bvslt (bvand (_ bv2147483647 32) .cse0) (_ bv2139095040 32)))) (or (and (not .cse1) (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv0 32))) (and (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv1 32)) .cse1)))))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_isfinite_float_~x#1| |ULTIMATE.start_main_~x~0#1|)) [2022-02-20 16:46:49,439 INFO L858 garLoopResultBuilder]: For program point L69(lines 69 75) no Hoare annotation was computed. [2022-02-20 16:46:49,439 INFO L858 garLoopResultBuilder]: For program point L36(lines 36 37) no Hoare annotation was computed. [2022-02-20 16:46:49,439 INFO L854 garLoopResultBuilder]: At program point L69-2(lines 67 76) the Hoare annotation is: false [2022-02-20 16:46:49,439 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:46:49,440 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:46:49,440 INFO L858 garLoopResultBuilder]: For program point L78(lines 78 80) no Hoare annotation was computed. [2022-02-20 16:46:49,440 INFO L858 garLoopResultBuilder]: For program point L78-2(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:49,440 INFO L858 garLoopResultBuilder]: For program point L136(lines 136 139) no Hoare annotation was computed. [2022-02-20 16:46:49,440 INFO L858 garLoopResultBuilder]: For program point L54-1(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:49,440 INFO L858 garLoopResultBuilder]: For program point L112-1(lines 112 116) no Hoare annotation was computed. [2022-02-20 16:46:49,440 INFO L854 garLoopResultBuilder]: At program point L112-2(lines 112 116) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_isfinite_float_~x#1| |ULTIMATE.start_main_~x~0#1|)) [2022-02-20 16:46:49,440 INFO L858 garLoopResultBuilder]: For program point L112-3(lines 112 116) no Hoare annotation was computed. [2022-02-20 16:46:49,440 INFO L858 garLoopResultBuilder]: For program point L137(line 137) no Hoare annotation was computed. [2022-02-20 16:46:49,440 INFO L858 garLoopResultBuilder]: For program point L38(lines 38 39) no Hoare annotation was computed. [2022-02-20 16:46:49,440 INFO L858 garLoopResultBuilder]: For program point L88(lines 88 105) no Hoare annotation was computed. [2022-02-20 16:46:49,440 INFO L858 garLoopResultBuilder]: For program point L22-1(lines 22 26) no Hoare annotation was computed. [2022-02-20 16:46:49,440 INFO L854 garLoopResultBuilder]: At program point L22-2(lines 22 26) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmod_float_~y#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))) (= |ULTIMATE.start_fmod_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6| (_ BitVec 32))) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6|) (_ bv0 32)))) (and (bvslt (bvand (_ bv2147483647 32) .cse0) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)) |ULTIMATE.start_fmod_float_~x#1|))))) [2022-02-20 16:46:49,441 INFO L858 garLoopResultBuilder]: For program point L72(lines 72 73) no Hoare annotation was computed. [2022-02-20 16:46:49,441 INFO L858 garLoopResultBuilder]: For program point L48(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:49,441 INFO L854 garLoopResultBuilder]: At program point L106(lines 19 107) the Hoare annotation is: (and (= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_fmod_float_#res#1|) (exists ((|v_ULTIMATE.start_isfinite_float_~ix~1#1_7| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 30 23) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|) ((_ extract 22 0) |v_ULTIMATE.start_isfinite_float_~ix~1#1_7|)) |ULTIMATE.start_main_~x~0#1|)))) [2022-02-20 16:46:49,441 INFO L858 garLoopResultBuilder]: For program point L40(lines 40 41) no Hoare annotation was computed. [2022-02-20 16:46:49,441 INFO L858 garLoopResultBuilder]: For program point L131(lines 131 140) no Hoare annotation was computed. [2022-02-20 16:46:49,441 INFO L858 garLoopResultBuilder]: For program point L131-2(lines 131 140) no Hoare annotation was computed. [2022-02-20 16:46:49,441 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:46:49,441 INFO L858 garLoopResultBuilder]: For program point L90-1(lines 90 94) no Hoare annotation was computed. [2022-02-20 16:46:49,441 INFO L854 garLoopResultBuilder]: At program point L90-2(lines 90 94) the Hoare annotation is: false [2022-02-20 16:46:49,442 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 137) no Hoare annotation was computed. [2022-02-20 16:46:49,442 INFO L858 garLoopResultBuilder]: For program point L49-2(lines 49 50) no Hoare annotation was computed. [2022-02-20 16:46:49,442 INFO L854 garLoopResultBuilder]: At program point L49-3(lines 49 50) the Hoare annotation is: false [2022-02-20 16:46:49,442 INFO L858 garLoopResultBuilder]: For program point L99-1(lines 99 103) no Hoare annotation was computed. [2022-02-20 16:46:49,442 INFO L854 garLoopResultBuilder]: At program point L99-2(lines 99 103) the Hoare annotation is: false [2022-02-20 16:46:49,442 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:46:49,442 INFO L858 garLoopResultBuilder]: For program point L99-3(lines 99 103) no Hoare annotation was computed. [2022-02-20 16:46:49,442 INFO L858 garLoopResultBuilder]: For program point L42(lines 42 46) no Hoare annotation was computed. [2022-02-20 16:46:49,442 INFO L858 garLoopResultBuilder]: For program point L42-1(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:49,442 INFO L858 garLoopResultBuilder]: For program point L67-1(lines 67 76) no Hoare annotation was computed. [2022-02-20 16:46:49,442 INFO L858 garLoopResultBuilder]: For program point L67-3(lines 67 76) no Hoare annotation was computed. [2022-02-20 16:46:49,442 INFO L854 garLoopResultBuilder]: At program point L84-2(lines 84 87) the Hoare annotation is: false [2022-02-20 16:46:49,442 INFO L858 garLoopResultBuilder]: For program point L84-3(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:49,443 INFO L861 garLoopResultBuilder]: At program point L142(lines 121 143) the Hoare annotation is: true [2022-02-20 16:46:49,443 INFO L858 garLoopResultBuilder]: For program point L43-2(lines 43 44) no Hoare annotation was computed. [2022-02-20 16:46:49,443 INFO L854 garLoopResultBuilder]: At program point L43-3(lines 43 44) the Hoare annotation is: false [2022-02-20 16:46:49,445 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 16:46:49,446 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:49,450 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:49,450 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:49,450 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-02-20 16:46:49,450 WARN L170 areAnnotationChecker]: L112-3 has no Hoare annotation [2022-02-20 16:46:49,450 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-02-20 16:46:49,450 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-02-20 16:46:49,450 WARN L170 areAnnotationChecker]: L112-3 has no Hoare annotation [2022-02-20 16:46:49,451 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2022-02-20 16:46:49,451 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2022-02-20 16:46:49,451 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2022-02-20 16:46:49,451 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:49,451 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:49,451 WARN L170 areAnnotationChecker]: L131-2 has no Hoare annotation [2022-02-20 16:46:49,451 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:49,451 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:49,451 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:49,451 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:49,451 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:49,451 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:49,452 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:49,452 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2022-02-20 16:46:49,452 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:49,452 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:49,452 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:49,452 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-02-20 16:46:49,452 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:49,452 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:49,452 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-02-20 16:46:49,452 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-02-20 16:46:49,452 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:46:49,452 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:46:49,452 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2022-02-20 16:46:49,453 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2022-02-20 16:46:49,453 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:49,453 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:49,453 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:49,453 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:49,453 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:46:49,453 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:49,453 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:49,453 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:46:49,453 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:49,453 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:49,453 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2022-02-20 16:46:49,453 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:49,454 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:49,454 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2022-02-20 16:46:49,454 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2022-02-20 16:46:49,454 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2022-02-20 16:46:49,454 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2022-02-20 16:46:49,454 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2022-02-20 16:46:49,454 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:46:49,454 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2022-02-20 16:46:49,454 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:46:49,454 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:46:49,455 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:46:49,455 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:46:49,455 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:49,455 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:49,455 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:46:49,455 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:46:49,455 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:46:49,455 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:46:49,455 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:49,455 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:49,455 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:49,455 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:49,456 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:49,456 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:46:49,456 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:46:49,456 WARN L170 areAnnotationChecker]: L99-3 has no Hoare annotation [2022-02-20 16:46:49,456 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:49,456 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:49,456 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:46:49,456 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:46:49,456 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:46:49,456 WARN L170 areAnnotationChecker]: L99-3 has no Hoare annotation [2022-02-20 16:46:49,456 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:46:49,462 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:49,462 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:49,463 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,463 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,463 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,463 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,467 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:49,467 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:49,468 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,468 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,468 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,468 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,469 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,470 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,470 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,470 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,470 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,470 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:49,470 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:49,471 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,471 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,471 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,471 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,471 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,472 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:49,472 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:49,472 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:49,472 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:49,473 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:49,473 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:49,473 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] [2022-02-20 16:46:49,473 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] [2022-02-20 16:46:49,473 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] [2022-02-20 16:46:49,473 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] [2022-02-20 16:46:49,474 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] [2022-02-20 16:46:49,474 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] [2022-02-20 16:46:49,474 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] [2022-02-20 16:46:49,474 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] [2022-02-20 16:46:49,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:49 BoogieIcfgContainer [2022-02-20 16:46:49,475 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:49,475 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:49,475 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:49,476 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:49,476 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:35" (3/4) ... [2022-02-20 16:46:49,479 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:46:49,485 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-02-20 16:46:49,489 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-02-20 16:46:49,490 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:46:49,490 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:46:49,505 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE()) == y) && x == x [2022-02-20 16:46:49,506 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\exists v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6 : bv32 :: ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32][22:0]) == x && ((!~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32]), 2139095040bv32) && \result == 0bv32) || (\result == 1bv32 && ~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32]), 2139095040bv32)))) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE()) == y)) && x == x [2022-02-20 16:46:49,506 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE())) && x == x) && (\exists v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6 : bv32 :: ~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32]), 2139095040bv32) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32][22:0]) == x) [2022-02-20 16:46:49,515 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:46:49,515 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:49,515 INFO L158 Benchmark]: Toolchain (without parser) took 16750.82ms. Allocated memory was 65.0MB in the beginning and 92.3MB in the end (delta: 27.3MB). Free memory was 45.2MB in the beginning and 54.6MB in the end (delta: -9.4MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2022-02-20 16:46:49,515 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 65.0MB. Free memory was 47.1MB in the beginning and 47.0MB in the end (delta: 48.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:49,516 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.70ms. Allocated memory is still 65.0MB. Free memory was 45.1MB in the beginning and 45.9MB in the end (delta: -795.8kB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2022-02-20 16:46:49,516 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.68ms. Allocated memory is still 65.0MB. Free memory was 45.7MB in the beginning and 43.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:49,516 INFO L158 Benchmark]: Boogie Preprocessor took 24.77ms. Allocated memory is still 65.0MB. Free memory was 43.3MB in the beginning and 41.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:49,516 INFO L158 Benchmark]: RCFGBuilder took 2577.66ms. Allocated memory was 65.0MB in the beginning and 92.3MB in the end (delta: 27.3MB). Free memory was 40.9MB in the beginning and 69.7MB in the end (delta: -28.9MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2022-02-20 16:46:49,517 INFO L158 Benchmark]: TraceAbstraction took 13818.95ms. Allocated memory is still 92.3MB. Free memory was 69.3MB in the beginning and 57.2MB in the end (delta: 12.1MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2022-02-20 16:46:49,517 INFO L158 Benchmark]: Witness Printer took 39.48ms. Allocated memory is still 92.3MB. Free memory was 57.2MB in the beginning and 54.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:49,519 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.21ms. Allocated memory is still 65.0MB. Free memory was 47.1MB in the beginning and 47.0MB in the end (delta: 48.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.70ms. Allocated memory is still 65.0MB. Free memory was 45.1MB in the beginning and 45.9MB in the end (delta: -795.8kB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.68ms. Allocated memory is still 65.0MB. Free memory was 45.7MB in the beginning and 43.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.77ms. Allocated memory is still 65.0MB. Free memory was 43.3MB in the beginning and 41.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2577.66ms. Allocated memory was 65.0MB in the beginning and 92.3MB in the end (delta: 27.3MB). Free memory was 40.9MB in the beginning and 69.7MB in the end (delta: -28.9MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13818.95ms. Allocated memory is still 92.3MB. Free memory was 69.3MB in the beginning and 57.2MB in the end (delta: 12.1MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * Witness Printer took 39.48ms. Allocated memory is still 92.3MB. Free memory was 57.2MB in the beginning and 54.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] - 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 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 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] * 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: 137]: 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, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.8s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 748 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 126 IncrementalHoareTripleChecker+Unchecked, 577 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4 IncrementalHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 171 mSDtfsCounter, 4 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=0, InterpolantAutomatonStates: 28, 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, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 16 NumberOfFragments, 149 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 47 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 64 NumberOfCodeBlocks, 64 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 60 ConstructedInterpolants, 34 QuantifiedInterpolants, 969 SizeOfPredicates, 33 NumberOfNonLiveVariables, 299 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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: 67]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 90]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 22]: Loop Invariant [2022-02-20 16:46:49,529 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:49,529 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:49,529 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,529 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,529 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,529 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,530 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:49,530 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:49,530 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,532 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,533 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,533 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] Derived loop invariant: ((\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE())) && x == x) && (\exists v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6 : bv32 :: ~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32]), 2139095040bv32) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32][22:0]) == x) - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 110]: Loop Invariant [2022-02-20 16:46:49,535 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,535 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,535 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,535 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,535 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,536 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:49,536 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:49,536 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,537 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,537 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,537 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,538 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6,QUANTIFIED] [2022-02-20 16:46:49,538 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:49,538 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: ((\exists v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6 : bv32 :: ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32][22:0]) == x && ((!~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32]), 2139095040bv32) && \result == 0bv32) || (\result == 1bv32 && ~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~2#1.base_6][0bv32]), 2139095040bv32)))) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE()) == y)) && x == x - InvariantResult [Line: 112]: Loop Invariant [2022-02-20 16:46:49,539 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:49,539 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:49,539 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:49,539 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE()) == y) && x == x - InvariantResult [Line: 19]: Loop Invariant [2022-02-20 16:46:49,542 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] [2022-02-20 16:46:49,542 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] [2022-02-20 16:46:49,542 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] [2022-02-20 16:46:49,542 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] [2022-02-20 16:46:49,542 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] [2022-02-20 16:46:49,542 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] [2022-02-20 16:46:49,542 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] [2022-02-20 16:46:49,542 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~ix~1#1_7,QUANTIFIED] Derived loop invariant: x == \result && (\exists v_ULTIMATE.start_isfinite_float_~ix~1#1_7 : bv32 :: ~bvslt32(~bvand32(2147483647bv32, v_ULTIMATE.start_isfinite_float_~ix~1#1_7), 2139095040bv32) && ~fp~LONGDOUBLE(v_ULTIMATE.start_isfinite_float_~ix~1#1_7[31:31], v_ULTIMATE.start_isfinite_float_~ix~1#1_7[30:23], v_ULTIMATE.start_isfinite_float_~ix~1#1_7[22:0]) == x) RESULT: Ultimate proved your program to be correct! [2022-02-20 16:46:49,596 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 Writing output log to file Ultimate.log Result: TRUE