./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1051.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_1051.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 d76ec759ff5c4ba8ac5ab3cd461da9e97af9099f3ad7ef7f0d1dfc5d0eb9df52 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:03,303 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:03,305 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:03,349 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:03,350 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:03,353 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:03,354 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:03,356 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:03,357 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:03,361 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:03,362 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:03,362 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:03,363 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:03,364 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:03,365 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:03,367 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:03,367 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:03,368 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:03,369 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:03,370 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:03,370 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:03,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:03,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:03,372 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:03,374 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:03,374 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:03,374 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:03,375 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:03,375 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:03,376 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:03,376 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:03,377 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:03,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:03,378 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:03,378 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:03,378 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:03,379 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:03,379 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:03,379 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:03,380 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:03,380 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:03,384 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:03,409 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:03,409 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:03,409 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:03,410 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:03,410 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:03,410 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:03,411 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:03,411 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:03,411 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:03,411 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:03,412 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:03,412 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:46:03,412 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:03,413 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:03,413 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:03,413 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:03,413 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:03,413 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:03,419 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:03,420 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:03,420 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:03,420 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:03,420 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:03,420 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:03,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:03,420 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:03,421 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:03,421 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:03,421 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:46:03,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:46:03,421 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:03,421 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:03,422 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:03,422 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 -> d76ec759ff5c4ba8ac5ab3cd461da9e97af9099f3ad7ef7f0d1dfc5d0eb9df52 [2022-02-20 16:46:03,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:03,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:03,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:03,634 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:03,635 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:03,635 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1051.c [2022-02-20 16:46:03,686 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d433fcf72/7e27d09ede534215810d2b1b37ca1576/FLAG759dcb81a [2022-02-20 16:46:04,064 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:04,064 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1051.c [2022-02-20 16:46:04,068 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d433fcf72/7e27d09ede534215810d2b1b37ca1576/FLAG759dcb81a [2022-02-20 16:46:04,078 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d433fcf72/7e27d09ede534215810d2b1b37ca1576 [2022-02-20 16:46:04,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:04,080 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:04,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:04,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:04,083 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:04,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:04" (1/1) ... [2022-02-20 16:46:04,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19a74103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:04, skipping insertion in model container [2022-02-20 16:46:04,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:04" (1/1) ... [2022-02-20 16:46:04,089 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:04,098 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:04,203 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_1051.c[1637,1650] [2022-02-20 16:46:04,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:04,213 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:04,228 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_1051.c[1637,1650] [2022-02-20 16:46:04,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:04,237 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:04,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:04 WrapperNode [2022-02-20 16:46:04,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:04,239 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:04,239 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:04,239 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:04,244 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:04" (1/1) ... [2022-02-20 16:46:04,249 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:04" (1/1) ... [2022-02-20 16:46:04,268 INFO L137 Inliner]: procedures = 17, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2022-02-20 16:46:04,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:04,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:04,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:04,269 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:04,274 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:04" (1/1) ... [2022-02-20 16:46:04,274 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:04" (1/1) ... [2022-02-20 16:46:04,276 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:04" (1/1) ... [2022-02-20 16:46:04,277 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:04" (1/1) ... [2022-02-20 16:46:04,283 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:04" (1/1) ... [2022-02-20 16:46:04,286 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:04" (1/1) ... [2022-02-20 16:46:04,287 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:04" (1/1) ... [2022-02-20 16:46:04,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:04,289 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:04,289 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:04,289 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:04,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:04" (1/1) ... [2022-02-20 16:46:04,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:04,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:04,326 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:04,346 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:04,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:04,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:46:04,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:04,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:46:04,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:46:04,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:46:04,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:04,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:04,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:46:04,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:04,404 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:04,406 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:04,652 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:04,657 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:04,657 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 16:46:04,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:04 BoogieIcfgContainer [2022-02-20 16:46:04,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:04,659 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:04,659 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:04,663 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:04,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:04" (1/3) ... [2022-02-20 16:46:04,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6221b939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:04, skipping insertion in model container [2022-02-20 16:46:04,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:04" (2/3) ... [2022-02-20 16:46:04,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6221b939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:04, skipping insertion in model container [2022-02-20 16:46:04,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:04" (3/3) ... [2022-02-20 16:46:04,666 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1051.c [2022-02-20 16:46:04,670 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:04,670 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:04,695 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:04,700 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:04,700 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:04,709 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 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:04,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:46:04,712 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:04,712 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:04,712 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:04,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:04,715 INFO L85 PathProgramCache]: Analyzing trace with hash -2022266355, now seen corresponding path program 1 times [2022-02-20 16:46:04,721 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:04,721 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664359008] [2022-02-20 16:46:04,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:04,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:04,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~huge_floor~0 := 1.0E30; {29#true} is VALID [2022-02-20 16:46:04,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret6#1, main_#t~ret7#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);assume { :begin_inline_floor_float } true;floor_float_#in~x#1 := main_~x~0#1;havoc floor_float_#res#1;havoc floor_float_#t~mem4#1, floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, floor_float_#t~mem5#1, floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset, floor_float_~x#1, floor_float_~i0~0#1, floor_float_~j0~0#1, floor_float_~i~0#1, floor_float_~ix~0#1;floor_float_~x#1 := floor_float_#in~x#1;havoc floor_float_~i0~0#1;havoc floor_float_~j0~0#1;havoc floor_float_~i~0#1;havoc floor_float_~ix~0#1; {29#true} is VALID [2022-02-20 16:46:04,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-02-20 16:46:04,832 INFO L290 TraceCheckUtils]: 3: Hoare triple {30#false} floor_float_~ix~0#1 := (if 0 == floor_float_~i0~0#1 then 0 else (if 1 == floor_float_~i0~0#1 then 1 else ~bitwiseAnd(floor_float_~i0~0#1, 2147483647)));floor_float_~j0~0#1 := (if (floor_float_~ix~0#1 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (floor_float_~ix~0#1 / 8388608 - 127) % 4294967296 % 4294967296 else (floor_float_~ix~0#1 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); {30#false} is VALID [2022-02-20 16:46:04,832 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#false} assume !(floor_float_~j0~0#1 < 23); {30#false} is VALID [2022-02-20 16:46:04,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#false} assume !!(floor_float_~ix~0#1 % 4294967296 < 2139095040);floor_float_#res#1 := floor_float_~x#1; {30#false} is VALID [2022-02-20 16:46:04,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#false} main_#t~ret6#1 := floor_float_#res#1;assume { :end_inline_floor_float } true;main_~res~0#1 := main_#t~ret6#1;havoc main_#t~ret6#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if ~someBinaryFLOATComparisonOperation(isnan_float_~x#1, isnan_float_~x#1) then 1 else 0); {30#false} is VALID [2022-02-20 16:46:04,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} main_#t~ret7#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true;assume -2147483648 <= main_#t~ret7#1 && main_#t~ret7#1 <= 2147483647; {30#false} is VALID [2022-02-20 16:46:04,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} assume 0 == main_#t~ret7#1;havoc main_#t~ret7#1; {30#false} is VALID [2022-02-20 16:46:04,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-02-20 16:46:04,834 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:04,834 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:04,835 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664359008] [2022-02-20 16:46:04,835 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664359008] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:04,835 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:04,835 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:04,836 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570879001] [2022-02-20 16:46:04,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:04,840 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:46:04,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:04,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:04,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:04,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:04,853 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:04,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:04,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:04,870 INFO L87 Difference]: Start difference. First operand has 26 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:04,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:04,916 INFO L93 Difference]: Finished difference Result 50 states and 76 transitions. [2022-02-20 16:46:04,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:04,916 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:46:04,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:04,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:04,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2022-02-20 16:46:04,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:04,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2022-02-20 16:46:04,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 76 transitions. [2022-02-20 16:46:05,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:05,013 INFO L225 Difference]: With dead ends: 50 [2022-02-20 16:46:05,013 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 16:46:05,021 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:05,024 INFO L933 BasicCegarLoop]: 34 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, 34 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:05,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 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:05,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 16:46:05,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 16:46:05,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:05,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 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:05,042 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 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:05,042 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 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:05,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:05,055 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2022-02-20 16:46:05,055 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-02-20 16:46:05,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:05,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:05,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 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 23 states. [2022-02-20 16:46:05,057 INFO L87 Difference]: Start difference. First operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 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 23 states. [2022-02-20 16:46:05,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:05,058 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2022-02-20 16:46:05,058 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-02-20 16:46:05,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:05,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:05,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:05,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:05,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 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:05,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-02-20 16:46:05,062 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 10 [2022-02-20 16:46:05,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:05,062 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-02-20 16:46:05,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:05,062 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-02-20 16:46:05,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:46:05,063 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:05,063 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:05,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:46:05,065 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:05,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:05,066 INFO L85 PathProgramCache]: Analyzing trace with hash -62606256, now seen corresponding path program 1 times [2022-02-20 16:46:05,066 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:05,067 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553276830] [2022-02-20 16:46:05,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:05,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:05,133 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:46:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:05,194 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:46:05,196 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:46:05,198 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:05,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:46:05,201 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:46:05,203 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:05,227 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:05,228 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:05,228 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-02-20 16:46:05,228 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-02-20 16:46:05,228 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-20 16:46:05,229 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-20 16:46:05,229 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-02-20 16:46:05,229 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:46:05,229 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:46:05,229 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:05,229 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:05,230 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 16:46:05,230 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 16:46:05,230 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:46:05,230 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:46:05,230 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 16:46:05,230 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 16:46:05,230 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-02-20 16:46:05,230 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 16:46:05,231 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 16:46:05,231 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2022-02-20 16:46:05,231 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2022-02-20 16:46:05,231 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:46:05,231 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:46:05,231 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:46:05,231 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 16:46:05,231 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 16:46:05,231 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-02-20 16:46:05,232 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-02-20 16:46:05,232 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2022-02-20 16:46:05,232 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:46:05,232 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:46:05,232 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:46:05,232 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:46:05,232 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-02-20 16:46:05,233 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:46:05,233 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:46:05,233 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2022-02-20 16:46:05,233 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:05,233 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:05,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:05 BoogieIcfgContainer [2022-02-20 16:46:05,234 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:05,235 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:05,235 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:05,235 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:05,236 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:04" (3/4) ... [2022-02-20 16:46:05,238 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:46:05,238 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:05,239 INFO L158 Benchmark]: Toolchain (without parser) took 1158.04ms. Allocated memory is still 102.8MB. Free memory was 82.0MB in the beginning and 47.9MB in the end (delta: 34.1MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. [2022-02-20 16:46:05,239 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 83.9MB. Free memory is still 61.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:05,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 157.03ms. Allocated memory is still 102.8MB. Free memory was 81.8MB in the beginning and 70.7MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 16:46:05,242 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.59ms. Allocated memory is still 102.8MB. Free memory was 70.7MB in the beginning and 68.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:05,243 INFO L158 Benchmark]: Boogie Preprocessor took 19.83ms. Allocated memory is still 102.8MB. Free memory was 68.4MB in the beginning and 66.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:05,243 INFO L158 Benchmark]: RCFGBuilder took 369.17ms. Allocated memory is still 102.8MB. Free memory was 66.7MB in the beginning and 51.3MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 16:46:05,243 INFO L158 Benchmark]: TraceAbstraction took 575.35ms. Allocated memory is still 102.8MB. Free memory was 50.8MB in the beginning and 47.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2022-02-20 16:46:05,243 INFO L158 Benchmark]: Witness Printer took 2.49ms. Allocated memory is still 102.8MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:05,245 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.13ms. Allocated memory is still 83.9MB. Free memory is still 61.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 157.03ms. Allocated memory is still 102.8MB. Free memory was 81.8MB in the beginning and 70.7MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.59ms. Allocated memory is still 102.8MB. Free memory was 70.7MB in the beginning and 68.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.83ms. Allocated memory is still 102.8MB. Free memory was 68.4MB in the beginning and 66.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 369.17ms. Allocated memory is still 102.8MB. Free memory was 66.7MB in the beginning and 51.3MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 575.35ms. Allocated memory is still 102.8MB. Free memory was 50.8MB in the beginning and 47.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Witness Printer took 2.49ms. Allocated memory is still 102.8MB. Free memory is still 47.9MB. 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: 73]: 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 60, overapproximation of someBinaryArithmeticFLOAToperation at line 68, overapproximation of bitwiseAnd at line 24. Possible FailurePath: [L14] static const float huge_floor = 1.0e30; VAL [huge_floor=1000000000000000000000000000000] [L68] float x = 0.0f / 0.0f; [L69] CALL, EXPR floor_float(x) [L17] __int32_t i0, j0; [L18] __uint32_t i, ix; VAL [\old(x)=1000000000000000000000000000001, huge_floor=1000000000000000000000000000000, x=1000000000000000000000000000001] [L20] ieee_float_shape_type gf_u; [L21] gf_u.value = (x) [L22] EXPR gf_u.word [L22] (i0) = gf_u.word [L24] ix = (i0 & 0x7fffffff) [L25] j0 = (ix >> 23) - 0x7f VAL [\old(x)=1000000000000000000000000000001, huge_floor=1000000000000000000000000000000, i=-18014398509481984, i0=-1, j0=2147483521, x=1000000000000000000000000000001] [L26] COND FALSE !(j0 < 23) VAL [\old(x)=1000000000000000000000000000001, huge_floor=1000000000000000000000000000000, i=-18014398509481984, i0=-1, j0=2147483521, x=1000000000000000000000000000001] [L46] COND FALSE !(!((ix) < 0x7f800000L)) [L49] return x; VAL [\old(x)=1000000000000000000000000000001, \result=1000000000000000000000000000001, huge_floor=1000000000000000000000000000000, i=-18014398509481984, i0=-1, j0=2147483521, x=1000000000000000000000000000001] [L69] RET, EXPR floor_float(x) [L69] float res = floor_float(x); [L72] CALL, EXPR isnan_float(res) [L60] return x != x; VAL [\old(x)=1000000000000000000000000000001, \result=0, huge_floor=1000000000000000000000000000000, x=1000000000000000000000000000001] [L72] RET, EXPR isnan_float(res) [L72] COND TRUE !isnan_float(res) [L73] reach_error() VAL [huge_floor=1000000000000000000000000000000, res=1000000000000000000000000000001, x=1000000000000000000000000000001] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, 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, 34 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, 34 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=26occurred 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.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 9 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:05,274 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_1051.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 d76ec759ff5c4ba8ac5ab3cd461da9e97af9099f3ad7ef7f0d1dfc5d0eb9df52 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:06,938 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:06,941 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:06,973 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:06,973 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:06,974 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:06,975 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:06,977 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:06,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:06,981 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:06,983 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:06,984 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:06,985 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:06,987 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:06,988 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:06,992 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:06,994 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:06,994 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:06,997 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:07,002 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:07,003 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:07,004 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:07,005 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:07,006 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:07,020 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:07,020 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:07,021 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:07,022 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:07,023 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:07,023 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:07,024 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:07,024 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:07,025 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:07,026 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:07,027 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:07,027 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:07,028 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:07,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:07,028 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:07,029 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:07,030 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:07,030 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:07,061 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:07,061 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:07,062 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:07,062 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:07,063 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:07,063 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:07,064 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:07,064 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:07,064 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:07,064 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:07,065 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:07,065 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:07,065 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:07,065 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:07,065 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:07,066 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:07,066 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:46:07,066 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:46:07,066 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:46:07,066 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:07,066 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:07,067 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:07,067 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:07,067 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:07,067 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:07,067 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:07,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:07,068 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:07,068 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:07,068 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:07,068 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:46:07,069 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:46:07,069 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:07,069 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:07,069 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:07,069 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:46:07,069 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 -> d76ec759ff5c4ba8ac5ab3cd461da9e97af9099f3ad7ef7f0d1dfc5d0eb9df52 [2022-02-20 16:46:07,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:07,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:07,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:07,329 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:07,329 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:07,330 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1051.c [2022-02-20 16:46:07,379 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d38c7018/115f395546724bbc8f28a7bce0667d40/FLAGbaa7f8dcd [2022-02-20 16:46:07,769 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:07,769 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1051.c [2022-02-20 16:46:07,775 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d38c7018/115f395546724bbc8f28a7bce0667d40/FLAGbaa7f8dcd [2022-02-20 16:46:07,787 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d38c7018/115f395546724bbc8f28a7bce0667d40 [2022-02-20 16:46:07,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:07,790 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:07,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:07,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:07,796 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:07,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:07" (1/1) ... [2022-02-20 16:46:07,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fe80691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:07, skipping insertion in model container [2022-02-20 16:46:07,798 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:07" (1/1) ... [2022-02-20 16:46:07,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:07,815 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:07,912 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_1051.c[1637,1650] [2022-02-20 16:46:07,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:07,927 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:07,950 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_1051.c[1637,1650] [2022-02-20 16:46:07,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:07,963 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:07,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:07 WrapperNode [2022-02-20 16:46:07,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:07,964 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:07,965 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:07,965 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:07,969 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:07" (1/1) ... [2022-02-20 16:46:07,977 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:07" (1/1) ... [2022-02-20 16:46:08,007 INFO L137 Inliner]: procedures = 20, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2022-02-20 16:46:08,007 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:08,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:08,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:08,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:08,014 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:07" (1/1) ... [2022-02-20 16:46:08,014 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:07" (1/1) ... [2022-02-20 16:46:08,028 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:07" (1/1) ... [2022-02-20 16:46:08,028 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:07" (1/1) ... [2022-02-20 16:46:08,033 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:07" (1/1) ... [2022-02-20 16:46:08,036 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:07" (1/1) ... [2022-02-20 16:46:08,037 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:07" (1/1) ... [2022-02-20 16:46:08,039 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:08,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:08,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:08,040 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:08,040 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:07" (1/1) ... [2022-02-20 16:46:08,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:08,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:08,062 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:08,069 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:08,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:08,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:46:08,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:08,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:46:08,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:46:08,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:08,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:08,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:46:08,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:46:08,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:08,159 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:08,160 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:08,549 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:08,554 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:08,554 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 16:46:08,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:08 BoogieIcfgContainer [2022-02-20 16:46:08,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:08,558 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:08,558 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:08,560 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:08,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:07" (1/3) ... [2022-02-20 16:46:08,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27af1bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:08, skipping insertion in model container [2022-02-20 16:46:08,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:07" (2/3) ... [2022-02-20 16:46:08,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27af1bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:08, skipping insertion in model container [2022-02-20 16:46:08,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:08" (3/3) ... [2022-02-20 16:46:08,563 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1051.c [2022-02-20 16:46:08,568 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:08,569 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:08,620 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:08,628 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:08,628 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:08,639 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 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:08,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:46:08,642 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:08,643 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:08,643 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:08,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:08,647 INFO L85 PathProgramCache]: Analyzing trace with hash -2022266355, now seen corresponding path program 1 times [2022-02-20 16:46:08,655 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:08,656 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952722411] [2022-02-20 16:46:08,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:08,656 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:08,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:08,659 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:08,660 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:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:08,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:46:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:08,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:08,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~huge_floor~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30)); {29#true} is VALID [2022-02-20 16:46:08,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret6#1, main_#t~ret7#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_floor_float } true;floor_float_#in~x#1 := main_~x~0#1;havoc floor_float_#res#1;havoc floor_float_#t~mem4#1, floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, floor_float_#t~mem5#1, floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset, floor_float_~x#1, floor_float_~i0~0#1, floor_float_~j0~0#1, floor_float_~i~0#1, floor_float_~ix~0#1;floor_float_~x#1 := floor_float_#in~x#1;havoc floor_float_~i0~0#1;havoc floor_float_~j0~0#1;havoc floor_float_~i~0#1;havoc floor_float_~ix~0#1; {29#true} is VALID [2022-02-20 16:46:08,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-02-20 16:46:08,819 INFO L290 TraceCheckUtils]: 3: Hoare triple {30#false} floor_float_~ix~0#1 := ~bvand32(2147483647bv32, floor_float_~i0~0#1);floor_float_~j0~0#1 := ~bvsub32(~bvlshr32(floor_float_~ix~0#1, 23bv32), 127bv32); {30#false} is VALID [2022-02-20 16:46:08,819 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#false} assume !~bvslt32(floor_float_~j0~0#1, 23bv32); {30#false} is VALID [2022-02-20 16:46:08,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#false} assume !!~bvult32(floor_float_~ix~0#1, 2139095040bv32);floor_float_#res#1 := floor_float_~x#1; {30#false} is VALID [2022-02-20 16:46:08,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#false} main_#t~ret6#1 := floor_float_#res#1;assume { :end_inline_floor_float } true;main_~res~0#1 := main_#t~ret6#1;havoc main_#t~ret6#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {30#false} is VALID [2022-02-20 16:46:08,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} main_#t~ret7#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {30#false} is VALID [2022-02-20 16:46:08,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} assume 0bv32 == main_#t~ret7#1;havoc main_#t~ret7#1; {30#false} is VALID [2022-02-20 16:46:08,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-02-20 16:46:08,822 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:08,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:08,823 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:08,823 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952722411] [2022-02-20 16:46:08,823 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [952722411] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:08,824 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:08,824 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:08,827 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612748394] [2022-02-20 16:46:08,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:08,831 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:46:08,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:08,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:08,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:08,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:08,845 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:08,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:08,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:08,871 INFO L87 Difference]: Start difference. First operand has 26 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:09,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:09,064 INFO L93 Difference]: Finished difference Result 50 states and 76 transitions. [2022-02-20 16:46:09,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:09,064 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:46:09,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:09,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:09,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2022-02-20 16:46:09,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:09,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2022-02-20 16:46:09,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 76 transitions. [2022-02-20 16:46:09,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:09,225 INFO L225 Difference]: With dead ends: 50 [2022-02-20 16:46:09,225 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 16:46:09,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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:09,230 INFO L933 BasicCegarLoop]: 34 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, 34 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:09,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 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:09,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 16:46:09,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 16:46:09,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:09,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 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:09,250 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 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:09,250 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 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:09,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:09,255 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2022-02-20 16:46:09,255 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-02-20 16:46:09,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:09,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:09,256 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 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 23 states. [2022-02-20 16:46:09,257 INFO L87 Difference]: Start difference. First operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 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 23 states. [2022-02-20 16:46:09,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:09,258 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2022-02-20 16:46:09,258 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-02-20 16:46:09,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:09,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:09,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:09,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:09,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 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:09,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-02-20 16:46:09,261 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 10 [2022-02-20 16:46:09,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:09,262 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-02-20 16:46:09,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:09,262 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-02-20 16:46:09,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:46:09,263 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:09,263 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:09,271 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:09,463 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:09,464 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:09,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:09,464 INFO L85 PathProgramCache]: Analyzing trace with hash -62606256, now seen corresponding path program 1 times [2022-02-20 16:46:09,465 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:09,465 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883938866] [2022-02-20 16:46:09,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:09,465 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:09,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:09,467 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:09,468 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:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:09,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:46:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:09,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:09,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {190#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~huge_floor~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30)); {190#true} is VALID [2022-02-20 16:46:09,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {190#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret6#1, main_#t~ret7#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_floor_float } true;floor_float_#in~x#1 := main_~x~0#1;havoc floor_float_#res#1;havoc floor_float_#t~mem4#1, floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, floor_float_#t~mem5#1, floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset, floor_float_~x#1, floor_float_~i0~0#1, floor_float_~j0~0#1, floor_float_~i~0#1, floor_float_~ix~0#1;floor_float_~x#1 := floor_float_#in~x#1;havoc floor_float_~i0~0#1;havoc floor_float_~j0~0#1;havoc floor_float_~i~0#1;havoc floor_float_~ix~0#1; {198#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_floor_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:09,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {198#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_floor_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} call floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(floor_float_~x#1, floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, 4bv32);call floor_float_#t~mem4#1 := read~intINTTYPE4(floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, 4bv32);floor_float_~i0~0#1 := floor_float_#t~mem4#1;havoc floor_float_#t~mem4#1;call ULTIMATE.dealloc(floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset);havoc floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset; {198#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_floor_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:09,742 INFO L290 TraceCheckUtils]: 3: Hoare triple {198#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_floor_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} goto; {198#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_floor_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:09,743 INFO L290 TraceCheckUtils]: 4: Hoare triple {198#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_floor_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} floor_float_~ix~0#1 := ~bvand32(2147483647bv32, floor_float_~i0~0#1);floor_float_~j0~0#1 := ~bvsub32(~bvlshr32(floor_float_~ix~0#1, 23bv32), 127bv32); {198#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_floor_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:09,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {198#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_floor_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume !~bvslt32(floor_float_~j0~0#1, 23bv32); {198#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_floor_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:09,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {198#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_floor_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume !!~bvult32(floor_float_~ix~0#1, 2139095040bv32);floor_float_#res#1 := floor_float_~x#1; {214#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_floor_float_#res#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:09,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {214#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_floor_float_#res#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} main_#t~ret6#1 := floor_float_#res#1;assume { :end_inline_floor_float } true;main_~res~0#1 := main_#t~ret6#1;havoc main_#t~ret6#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {218#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} is VALID [2022-02-20 16:46:09,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {218#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} main_#t~ret7#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {222#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret7#1|)} is VALID [2022-02-20 16:46:09,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {222#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret7#1|)} assume 0bv32 == main_#t~ret7#1;havoc main_#t~ret7#1; {191#false} is VALID [2022-02-20 16:46:09,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {191#false} assume !false; {191#false} is VALID [2022-02-20 16:46:09,747 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:09,748 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:09,748 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:09,748 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883938866] [2022-02-20 16:46:09,748 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883938866] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:09,748 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:09,749 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:46:09,749 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405003009] [2022-02-20 16:46:09,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:09,752 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:46:09,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:09,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:09,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:09,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:46:09,774 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:09,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:46:09,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:46:09,776 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:09,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:09,942 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-02-20 16:46:09,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:46:09,942 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:46:09,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:09,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:09,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-02-20 16:46:09,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:09,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-02-20 16:46:09,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2022-02-20 16:46:10,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:10,055 INFO L225 Difference]: With dead ends: 28 [2022-02-20 16:46:10,055 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 16:46:10,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:10,056 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:10,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 91 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 15 Unchecked, 0.0s Time] [2022-02-20 16:46:10,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 16:46:10,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 16:46:10,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:10,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 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:10,060 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 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:10,060 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 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:10,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:10,061 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2022-02-20 16:46:10,062 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-02-20 16:46:10,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:10,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:10,062 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 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 23 states. [2022-02-20 16:46:10,063 INFO L87 Difference]: Start difference. First operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 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 23 states. [2022-02-20 16:46:10,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:10,065 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2022-02-20 16:46:10,065 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-02-20 16:46:10,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:10,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:10,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:10,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:10,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 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:10,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2022-02-20 16:46:10,068 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 11 [2022-02-20 16:46:10,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:10,068 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2022-02-20 16:46:10,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:10,068 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-02-20 16:46:10,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:46:10,069 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:10,069 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:10,084 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:10,280 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:10,281 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:10,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:10,282 INFO L85 PathProgramCache]: Analyzing trace with hash -64453298, now seen corresponding path program 1 times [2022-02-20 16:46:10,282 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:10,282 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615172942] [2022-02-20 16:46:10,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:10,282 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:10,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:10,283 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:10,285 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:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:10,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 16:46:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:10,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:10,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {335#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~huge_floor~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30)); {340#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:46:10,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {340#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret6#1, main_#t~ret7#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_floor_float } true;floor_float_#in~x#1 := main_~x~0#1;havoc floor_float_#res#1;havoc floor_float_#t~mem4#1, floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, floor_float_#t~mem5#1, floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset, floor_float_~x#1, floor_float_~i0~0#1, floor_float_~j0~0#1, floor_float_~i~0#1, floor_float_~ix~0#1;floor_float_~x#1 := floor_float_#in~x#1;havoc floor_float_~i0~0#1;havoc floor_float_~j0~0#1;havoc floor_float_~i~0#1;havoc floor_float_~ix~0#1; {344#(and (= |ULTIMATE.start_floor_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:10,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {344#(and (= |ULTIMATE.start_floor_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} call floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(floor_float_~x#1, floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, 4bv32);call floor_float_#t~mem4#1 := read~intINTTYPE4(floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, 4bv32);floor_float_~i0~0#1 := floor_float_#t~mem4#1;havoc floor_float_#t~mem4#1;call ULTIMATE.dealloc(floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset);havoc floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset; {344#(and (= |ULTIMATE.start_floor_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:10,514 INFO L290 TraceCheckUtils]: 3: Hoare triple {344#(and (= |ULTIMATE.start_floor_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} goto; {344#(and (= |ULTIMATE.start_floor_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:10,515 INFO L290 TraceCheckUtils]: 4: Hoare triple {344#(and (= |ULTIMATE.start_floor_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} floor_float_~ix~0#1 := ~bvand32(2147483647bv32, floor_float_~i0~0#1);floor_float_~j0~0#1 := ~bvsub32(~bvlshr32(floor_float_~ix~0#1, 23bv32), 127bv32); {344#(and (= |ULTIMATE.start_floor_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:10,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {344#(and (= |ULTIMATE.start_floor_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} assume !~bvslt32(floor_float_~j0~0#1, 23bv32); {344#(and (= |ULTIMATE.start_floor_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:10,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {344#(and (= |ULTIMATE.start_floor_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} assume !~bvult32(floor_float_~ix~0#1, 2139095040bv32);floor_float_#res#1 := ~fp.add~FLOAT(currentRoundingMode, floor_float_~x#1, floor_float_~x#1); {360#(= |ULTIMATE.start_floor_float_#res#1| (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)) (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:10,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {360#(= |ULTIMATE.start_floor_float_#res#1| (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)) (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24))))} main_#t~ret6#1 := floor_float_#res#1;assume { :end_inline_floor_float } true;main_~res~0#1 := main_#t~ret6#1;havoc main_#t~ret6#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {364#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} is VALID [2022-02-20 16:46:10,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {364#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} main_#t~ret7#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {368#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret7#1|)} is VALID [2022-02-20 16:46:10,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {368#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret7#1|)} assume 0bv32 == main_#t~ret7#1;havoc main_#t~ret7#1; {336#false} is VALID [2022-02-20 16:46:10,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {336#false} assume !false; {336#false} is VALID [2022-02-20 16:46:10,518 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:10,518 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:10,518 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:10,518 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615172942] [2022-02-20 16:46:10,518 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615172942] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:10,519 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:10,519 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:46:10,519 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714984553] [2022-02-20 16:46:10,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:10,519 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:46:10,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:10,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:10,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:10,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:46:10,538 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:10,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:46:10,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:10,539 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:10,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:10,944 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-02-20 16:46:10,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:46:10,945 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:46:10,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:10,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:10,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-02-20 16:46:10,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:10,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-02-20 16:46:10,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 40 transitions. [2022-02-20 16:46:11,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:11,012 INFO L225 Difference]: With dead ends: 34 [2022-02-20 16:46:11,012 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 16:46:11,013 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:46:11,013 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 25 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:11,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 56 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 16:46:11,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 16:46:11,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 16:46:11,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:11,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:11,016 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:11,016 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:11,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:11,017 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-02-20 16:46:11,017 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-02-20 16:46:11,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:11,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:11,017 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states. [2022-02-20 16:46:11,017 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states. [2022-02-20 16:46:11,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:11,018 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-02-20 16:46:11,018 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-02-20 16:46:11,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:11,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:11,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:11,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:11,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:11,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-02-20 16:46:11,019 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 11 [2022-02-20 16:46:11,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:11,019 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-02-20 16:46:11,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:11,023 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-02-20 16:46:11,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:46:11,025 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:11,025 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:11,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:11,234 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:11,236 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:11,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:11,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1612289523, now seen corresponding path program 1 times [2022-02-20 16:46:11,237 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:11,237 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769249036] [2022-02-20 16:46:11,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:11,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:11,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:11,238 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:11,240 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:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:11,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 16:46:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:11,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:11,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {478#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~huge_floor~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30)); {478#true} is VALID [2022-02-20 16:46:11,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {478#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret6#1, main_#t~ret7#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_floor_float } true;floor_float_#in~x#1 := main_~x~0#1;havoc floor_float_#res#1;havoc floor_float_#t~mem4#1, floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, floor_float_#t~mem5#1, floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset, floor_float_~x#1, floor_float_~i0~0#1, floor_float_~j0~0#1, floor_float_~i~0#1, floor_float_~ix~0#1;floor_float_~x#1 := floor_float_#in~x#1;havoc floor_float_~i0~0#1;havoc floor_float_~j0~0#1;havoc floor_float_~i~0#1;havoc floor_float_~ix~0#1; {486#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_floor_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:11,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {486#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_floor_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} call floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(floor_float_~x#1, floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, 4bv32);call floor_float_#t~mem4#1 := read~intINTTYPE4(floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset, 4bv32);floor_float_~i0~0#1 := floor_float_#t~mem4#1;havoc floor_float_#t~mem4#1;call ULTIMATE.dealloc(floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset);havoc floor_float_~#gf_u~0#1.base, floor_float_~#gf_u~0#1.offset; {490#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:11,474 INFO L290 TraceCheckUtils]: 3: Hoare triple {490#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} goto; {490#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:11,479 INFO L290 TraceCheckUtils]: 4: Hoare triple {490#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} floor_float_~ix~0#1 := ~bvand32(2147483647bv32, floor_float_~i0~0#1);floor_float_~j0~0#1 := ~bvsub32(~bvlshr32(floor_float_~ix~0#1, 23bv32), 127bv32); {497#(exists ((|ULTIMATE.start_floor_float_~i0~0#1| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (bvadd (bvlshr (bvand (_ bv2147483647 32) |ULTIMATE.start_floor_float_~i0~0#1|) (_ bv23 32)) (_ bv4294967169 32)) |ULTIMATE.start_floor_float_~j0~0#1|) (= (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)))))} is VALID [2022-02-20 16:46:11,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {497#(exists ((|ULTIMATE.start_floor_float_~i0~0#1| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (bvadd (bvlshr (bvand (_ bv2147483647 32) |ULTIMATE.start_floor_float_~i0~0#1|) (_ bv23 32)) (_ bv4294967169 32)) |ULTIMATE.start_floor_float_~j0~0#1|) (= (fp ((_ extract 31 31) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_floor_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_floor_float_~i0~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)))))} assume ~bvslt32(floor_float_~j0~0#1, 23bv32); {479#false} is VALID [2022-02-20 16:46:11,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {479#false} assume ~bvslt32(floor_float_~j0~0#1, 0bv32); {479#false} is VALID [2022-02-20 16:46:11,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {479#false} assume !~fp.gt~FLOAT(~fp.add~FLOAT(currentRoundingMode, ~huge_floor~0, floor_float_~x#1), ~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE())); {479#false} is VALID [2022-02-20 16:46:11,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {479#false} call floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(floor_float_~i0~0#1, floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset, 4bv32);call floor_float_#t~mem5#1 := read~intFLOATTYPE4(floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset, 4bv32);floor_float_~x#1 := floor_float_#t~mem5#1;havoc floor_float_#t~mem5#1;call ULTIMATE.dealloc(floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset);havoc floor_float_~#sf_u~0#1.base, floor_float_~#sf_u~0#1.offset; {479#false} is VALID [2022-02-20 16:46:11,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {479#false} goto; {479#false} is VALID [2022-02-20 16:46:11,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {479#false} floor_float_#res#1 := floor_float_~x#1; {479#false} is VALID [2022-02-20 16:46:11,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {479#false} main_#t~ret6#1 := floor_float_#res#1;assume { :end_inline_floor_float } true;main_~res~0#1 := main_#t~ret6#1;havoc main_#t~ret6#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {479#false} is VALID [2022-02-20 16:46:11,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {479#false} main_#t~ret7#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {479#false} is VALID [2022-02-20 16:46:11,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {479#false} assume 0bv32 == main_#t~ret7#1;havoc main_#t~ret7#1; {479#false} is VALID [2022-02-20 16:46:11,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {479#false} assume !false; {479#false} is VALID [2022-02-20 16:46:11,482 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:11,482 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:11,482 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:11,482 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769249036] [2022-02-20 16:46:11,482 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [769249036] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:11,482 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:11,482 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:11,483 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055632755] [2022-02-20 16:46:11,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:11,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2022-02-20 16:46:11,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:11,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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:11,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:11,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:11,512 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:11,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:11,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:11,513 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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:11,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:11,532 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-02-20 16:46:11,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:46:11,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2022-02-20 16:46:11,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:11,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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:11,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2022-02-20 16:46:11,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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:11,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2022-02-20 16:46:11,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 18 transitions. [2022-02-20 16:46:11,577 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:11,577 INFO L225 Difference]: With dead ends: 18 [2022-02-20 16:46:11,577 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:46:11,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:11,578 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:11,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-02-20 16:46:11,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:46:11,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:46:11,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:11,579 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:11,579 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:11,579 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:11,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:11,580 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:11,580 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:11,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:11,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:11,580 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:11,580 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:11,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:11,580 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:11,580 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:11,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:11,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:11,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:11,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:11,581 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:11,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:46:11,586 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2022-02-20 16:46:11,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:11,586 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:46:11,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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:11,586 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:11,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:11,596 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:11,607 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:11,805 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:11,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:46:11,845 INFO L858 garLoopResultBuilder]: For program point L31(lines 31 33) no Hoare annotation was computed. [2022-02-20 16:46:11,845 INFO L854 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|) [2022-02-20 16:46:11,846 INFO L858 garLoopResultBuilder]: For program point L27(lines 27 44) no Hoare annotation was computed. [2022-02-20 16:46:11,846 INFO L854 garLoopResultBuilder]: At program point L56(lines 16 57) the Hoare annotation is: (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_floor_float_#res#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)))) [2022-02-20 16:46:11,846 INFO L858 garLoopResultBuilder]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2022-02-20 16:46:11,846 INFO L854 garLoopResultBuilder]: At program point L19-2(lines 19 23) the Hoare annotation is: (and (= currentRoundingMode roundNearestTiesToEven) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_floor_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))) [2022-02-20 16:46:11,846 INFO L858 garLoopResultBuilder]: For program point L19-3(lines 19 23) no Hoare annotation was computed. [2022-02-20 16:46:11,846 INFO L861 garLoopResultBuilder]: At program point L77(lines 62 78) the Hoare annotation is: true [2022-02-20 16:46:11,846 INFO L858 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2022-02-20 16:46:11,846 INFO L858 garLoopResultBuilder]: For program point L40(lines 40 41) no Hoare annotation was computed. [2022-02-20 16:46:11,846 INFO L858 garLoopResultBuilder]: For program point L40-2(lines 40 41) no Hoare annotation was computed. [2022-02-20 16:46:11,846 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:46:11,846 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:46:11,846 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:46:11,847 INFO L858 garLoopResultBuilder]: For program point L28(lines 28 34) no Hoare annotation was computed. [2022-02-20 16:46:11,847 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 73) no Hoare annotation was computed. [2022-02-20 16:46:11,847 INFO L858 garLoopResultBuilder]: For program point L37(lines 37 38) no Hoare annotation was computed. [2022-02-20 16:46:11,847 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:46:11,847 INFO L858 garLoopResultBuilder]: For program point L29(lines 29 33) no Hoare annotation was computed. [2022-02-20 16:46:11,847 INFO L858 garLoopResultBuilder]: For program point L46(lines 46 49) no Hoare annotation was computed. [2022-02-20 16:46:11,847 INFO L858 garLoopResultBuilder]: For program point L26(lines 26 50) no Hoare annotation was computed. [2022-02-20 16:46:11,847 INFO L858 garLoopResultBuilder]: For program point L51(lines 51 55) no Hoare annotation was computed. [2022-02-20 16:46:11,847 INFO L858 garLoopResultBuilder]: For program point L51-1(lines 16 57) no Hoare annotation was computed. [2022-02-20 16:46:11,847 INFO L858 garLoopResultBuilder]: For program point L51-2(lines 51 55) no Hoare annotation was computed. [2022-02-20 16:46:11,847 INFO L858 garLoopResultBuilder]: For program point L72(lines 72 75) no Hoare annotation was computed. [2022-02-20 16:46:11,848 INFO L858 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2022-02-20 16:46:11,850 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 16:46:11,851 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:11,853 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:11,854 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:11,854 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-20 16:46:11,854 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-02-20 16:46:11,854 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-20 16:46:11,854 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-20 16:46:11,855 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-02-20 16:46:11,855 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:46:11,855 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:46:11,855 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:11,855 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:11,855 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 16:46:11,855 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 16:46:11,855 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:46:11,855 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:46:11,856 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 16:46:11,862 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 16:46:11,864 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 16:46:11,864 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 16:46:11,865 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2022-02-20 16:46:11,865 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2022-02-20 16:46:11,865 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:46:11,865 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:46:11,865 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:46:11,865 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 16:46:11,865 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 16:46:11,865 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-02-20 16:46:11,865 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-02-20 16:46:11,866 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2022-02-20 16:46:11,866 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:46:11,866 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:46:11,866 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:46:11,866 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:46:11,866 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-02-20 16:46:11,866 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:46:11,866 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:46:11,867 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:11,867 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:11,867 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:11,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,870 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:11,873 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,873 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:11,875 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:11,875 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:11,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:11 BoogieIcfgContainer [2022-02-20 16:46:11,876 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:11,876 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:11,876 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:11,876 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:11,877 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:08" (3/4) ... [2022-02-20 16:46:11,879 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:46:11,886 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-02-20 16:46:11,886 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-02-20 16:46:11,886 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:46:11,887 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:46:11,905 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven && (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) [2022-02-20 16:46:11,906 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: \result == ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) [2022-02-20 16:46:11,906 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: 1bv32 == \result [2022-02-20 16:46:11,913 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:46:11,913 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:11,914 INFO L158 Benchmark]: Toolchain (without parser) took 4123.74ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 49.2MB in the beginning and 61.2MB in the end (delta: -12.0MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2022-02-20 16:46:11,914 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 46.1MB. Free memory was 27.9MB in the beginning and 27.8MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:11,915 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.89ms. Allocated memory is still 65.0MB. Free memory was 49.0MB in the beginning and 37.4MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 16:46:11,915 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.12ms. Allocated memory is still 65.0MB. Free memory was 37.4MB in the beginning and 35.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:11,915 INFO L158 Benchmark]: Boogie Preprocessor took 30.19ms. Allocated memory is still 65.0MB. Free memory was 35.3MB in the beginning and 33.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:11,916 INFO L158 Benchmark]: RCFGBuilder took 517.52ms. Allocated memory is still 65.0MB. Free memory was 33.6MB in the beginning and 38.3MB in the end (delta: -4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 16:46:11,916 INFO L158 Benchmark]: TraceAbstraction took 3317.44ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 37.8MB in the beginning and 63.9MB in the end (delta: -26.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:11,916 INFO L158 Benchmark]: Witness Printer took 37.37ms. Allocated memory is still 88.1MB. Free memory was 63.9MB in the beginning and 61.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:46:11,917 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.15ms. Allocated memory is still 46.1MB. Free memory was 27.9MB in the beginning and 27.8MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 170.89ms. Allocated memory is still 65.0MB. Free memory was 49.0MB in the beginning and 37.4MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.12ms. Allocated memory is still 65.0MB. Free memory was 37.4MB in the beginning and 35.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.19ms. Allocated memory is still 65.0MB. Free memory was 35.3MB in the beginning and 33.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 517.52ms. Allocated memory is still 65.0MB. Free memory was 33.6MB in the beginning and 38.3MB in the end (delta: -4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3317.44ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 37.8MB in the beginning and 63.9MB in the end (delta: -26.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 37.37ms. Allocated memory is still 88.1MB. Free memory was 63.9MB in the beginning and 61.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,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: 73]: 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, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 189 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 19 IncrementalHoareTripleChecker+Unchecked, 118 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 39 IncrementalHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 71 mSDtfsCounter, 39 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=0, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 10 NumberOfFragments, 22 HoareAnnotationTreeSize, 4 FomulaSimplifications, 26 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 29 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 43 ConstructedInterpolants, 10 QuantifiedInterpolants, 197 SizeOfPredicates, 26 NumberOfNonLiveVariables, 177 ConjunctsInSsa, 33 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: 19]: Loop Invariant [2022-02-20 16:46:11,924 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,924 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:11,925 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:11,925 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven && (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: 1bv32 == \result - InvariantResult [Line: 16]: Loop Invariant [2022-02-20 16:46:11,926 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:11,926 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: \result == ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-02-20 16:46:11,963 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