./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1122b.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_1122b.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 531a1139fb1df73d7771aceceeca279cd2242c70bbd9f853f2d0e457d633cadc --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:25,154 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:25,157 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:25,199 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:25,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:25,203 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:25,205 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:25,207 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:25,209 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:25,213 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:25,214 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:25,215 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:25,215 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:25,217 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:25,219 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:25,221 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:25,222 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:25,223 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:25,225 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:25,230 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:25,232 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:25,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:25,234 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:25,235 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:25,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:25,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:25,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:25,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:25,244 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:25,245 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:25,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:25,246 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:25,248 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:25,249 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:25,250 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:25,250 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:25,251 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:25,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:25,251 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:25,252 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:25,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:25,253 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:25,285 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:25,285 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:25,286 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:25,286 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:25,287 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:25,287 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:25,287 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:25,288 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:25,288 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:25,288 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:25,289 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:25,289 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:46:25,289 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:25,289 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:25,290 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:25,290 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:25,290 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:25,290 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:25,290 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:25,291 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:25,291 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:25,291 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:25,291 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:25,291 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:25,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:25,292 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:25,292 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:25,293 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:25,293 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:46:25,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:46:25,294 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:25,294 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:25,294 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:25,294 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 -> 531a1139fb1df73d7771aceceeca279cd2242c70bbd9f853f2d0e457d633cadc [2022-02-20 16:46:25,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:25,552 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:25,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:25,555 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:25,557 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:25,558 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1122b.c [2022-02-20 16:46:25,623 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cbadf003/abf6f908bf464e8b98794fae35506c7f/FLAGbaa9073db [2022-02-20 16:46:26,029 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:26,031 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1122b.c [2022-02-20 16:46:26,039 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cbadf003/abf6f908bf464e8b98794fae35506c7f/FLAGbaa9073db [2022-02-20 16:46:26,052 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cbadf003/abf6f908bf464e8b98794fae35506c7f [2022-02-20 16:46:26,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:26,057 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:26,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:26,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:26,063 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:26,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:26" (1/1) ... [2022-02-20 16:46:26,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70588796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:26, skipping insertion in model container [2022-02-20 16:46:26,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:26" (1/1) ... [2022-02-20 16:46:26,071 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:26,094 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:26,322 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_1122b.c[2726,2739] [2022-02-20 16:46:26,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:26,339 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:26,403 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_1122b.c[2726,2739] [2022-02-20 16:46:26,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:26,423 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:26,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:26 WrapperNode [2022-02-20 16:46:26,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:26,427 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:26,427 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:26,427 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:26,434 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:26" (1/1) ... [2022-02-20 16:46:26,454 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:26" (1/1) ... [2022-02-20 16:46:26,507 INFO L137 Inliner]: procedures = 18, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 205 [2022-02-20 16:46:26,508 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:26,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:26,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:26,509 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:26,516 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:26" (1/1) ... [2022-02-20 16:46:26,517 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:26" (1/1) ... [2022-02-20 16:46:26,529 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:26" (1/1) ... [2022-02-20 16:46:26,530 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:26" (1/1) ... [2022-02-20 16:46:26,540 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:26" (1/1) ... [2022-02-20 16:46:26,545 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:26" (1/1) ... [2022-02-20 16:46:26,546 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:26" (1/1) ... [2022-02-20 16:46:26,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:26,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:26,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:26,551 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:26,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:26" (1/1) ... [2022-02-20 16:46:26,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:26,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:26,584 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:26,586 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:26,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:26,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:46:26,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:26,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:46:26,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:46:26,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:46:26,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:26,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:26,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:46:26,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-02-20 16:46:26,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:26,724 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:26,730 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:27,231 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:27,264 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:27,264 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2022-02-20 16:46:27,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:27 BoogieIcfgContainer [2022-02-20 16:46:27,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:27,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:27,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:27,271 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:27,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:26" (1/3) ... [2022-02-20 16:46:27,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34bf49c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:27, skipping insertion in model container [2022-02-20 16:46:27,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:26" (2/3) ... [2022-02-20 16:46:27,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34bf49c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:27, skipping insertion in model container [2022-02-20 16:46:27,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:27" (3/3) ... [2022-02-20 16:46:27,275 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1122b.c [2022-02-20 16:46:27,280 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:27,280 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:27,327 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:27,333 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:27,335 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:27,353 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 52 states have (on average 1.8076923076923077) internal successors, (94), 53 states have internal predecessors, (94), 0 states have call successors, (0), 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:27,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:46:27,357 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:27,358 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:27,358 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:27,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:27,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1366069876, now seen corresponding path program 1 times [2022-02-20 16:46:27,373 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:27,373 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881673043] [2022-02-20 16:46:27,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:27,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:27,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {57#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~one_fmod~0 := 1.0;~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~real(0.0, ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.0), ~#Zero_fmod~0.base, 4 + ~#Zero_fmod~0.offset, 4); {57#true} is VALID [2022-02-20 16:46:27,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {57#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~ret16#1, main_#t~ret17#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0);main_~y~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume { :begin_inline_fmod_float } true;fmod_float_#in~x#1, fmod_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmod_float_#res#1;havoc fmod_float_#t~mem4#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, fmod_float_#t~mem5#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, fmod_float_#t~mem7#1, fmod_float_#t~mem11#1, fmod_float_#t~post10#1, fmod_float_#t~mem12#1, fmod_float_#t~mem13#1, fmod_float_~#sf_u~0#1.base, fmod_float_~#sf_u~0#1.offset, fmod_float_#t~mem14#1, fmod_float_~#sf_u~1#1.base, fmod_float_~#sf_u~1#1.offset, fmod_float_~x#1, fmod_float_~y#1, fmod_float_~n~0#1, fmod_float_~hx~0#1, fmod_float_~hy~0#1, fmod_float_~hz~0#1, fmod_float_~ix~0#1, fmod_float_~iy~0#1, fmod_float_~sx~0#1, fmod_float_~i~0#1, fmod_float_#t~nondet6#1, fmod_float_#t~nondet8#1, fmod_float_#t~nondet9#1;fmod_float_~x#1 := fmod_float_#in~x#1;fmod_float_~y#1 := fmod_float_#in~y#1;havoc fmod_float_~n~0#1;havoc fmod_float_~hx~0#1;havoc fmod_float_~hy~0#1;havoc fmod_float_~hz~0#1;havoc fmod_float_~ix~0#1;havoc fmod_float_~iy~0#1;havoc fmod_float_~sx~0#1;havoc fmod_float_~i~0#1; {57#true} is VALID [2022-02-20 16:46:27,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {57#true} assume !true; {58#false} is VALID [2022-02-20 16:46:27,513 INFO L290 TraceCheckUtils]: 3: Hoare triple {58#false} assume !true; {58#false} is VALID [2022-02-20 16:46:27,513 INFO L290 TraceCheckUtils]: 4: Hoare triple {58#false} assume 0 == fmod_float_~hx~0#1;fmod_float_~sx~0#1 := 0; {58#false} is VALID [2022-02-20 16:46:27,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {58#false} fmod_float_~hx~0#1 := (if (1 == fmod_float_~hx~0#1 || 0 == fmod_float_~hx~0#1) && (1 == fmod_float_~sx~0#1 || 0 == fmod_float_~sx~0#1) then (if fmod_float_~hx~0#1 == fmod_float_~sx~0#1 then 0 else 1) else (if 0 == fmod_float_~hx~0#1 then fmod_float_~sx~0#1 else (if 0 == fmod_float_~sx~0#1 then fmod_float_~hx~0#1 else ~bitwiseXOr(fmod_float_~hx~0#1, fmod_float_~sx~0#1))));fmod_float_~hy~0#1 := (if 0 == fmod_float_~hy~0#1 then 0 else (if 1 == fmod_float_~hy~0#1 then 1 else ~bitwiseAnd(fmod_float_~hy~0#1, 2147483647))); {58#false} is VALID [2022-02-20 16:46:27,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {58#false} assume (0 == fmod_float_~hy~0#1 || !(fmod_float_~hx~0#1 < 2139095040)) || fmod_float_~hy~0#1 > 2139095040;fmod_float_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(fmod_float_~x#1, fmod_float_~y#1), ~someBinaryArithmeticFLOAToperation(fmod_float_~x#1, fmod_float_~y#1)); {58#false} is VALID [2022-02-20 16:46:27,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {58#false} main_#t~ret16#1 := fmod_float_#res#1;assume { :end_inline_fmod_float } true;main_~res~0#1 := main_#t~ret16#1;havoc main_#t~ret16#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); {58#false} is VALID [2022-02-20 16:46:27,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {58#false} main_#t~ret17#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {58#false} is VALID [2022-02-20 16:46:27,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {58#false} assume 0 == main_#t~ret17#1;havoc main_#t~ret17#1; {58#false} is VALID [2022-02-20 16:46:27,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {58#false} assume !false; {58#false} is VALID [2022-02-20 16:46:27,517 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:27,517 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:27,518 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881673043] [2022-02-20 16:46:27,519 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881673043] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:27,519 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:27,519 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:27,520 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404522056] [2022-02-20 16:46:27,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:27,525 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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:27,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:27,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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:27,546 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:27,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:27,546 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:27,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:27,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:27,572 INFO L87 Difference]: Start difference. First operand has 54 states, 52 states have (on average 1.8076923076923077) internal successors, (94), 53 states have internal predecessors, (94), 0 states have call successors, (0), 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.5) internal successors, (11), 2 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:27,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:27,658 INFO L93 Difference]: Finished difference Result 106 states and 186 transitions. [2022-02-20 16:46:27,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:27,658 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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:27,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:27,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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:27,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 186 transitions. [2022-02-20 16:46:27,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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:27,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 186 transitions. [2022-02-20 16:46:27,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 186 transitions. [2022-02-20 16:46:27,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:27,858 INFO L225 Difference]: With dead ends: 106 [2022-02-20 16:46:27,858 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 16:46:27,861 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:27,866 INFO L933 BasicCegarLoop]: 73 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, 73 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:27,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 73 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:27,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 16:46:27,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-02-20 16:46:27,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:27,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 0 states have call successors, (0), 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:27,892 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 0 states have call successors, (0), 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:27,892 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 0 states have call successors, (0), 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:27,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:27,896 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-02-20 16:46:27,896 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-02-20 16:46:27,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:27,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:27,897 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 0 states have call successors, (0), 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 51 states. [2022-02-20 16:46:27,898 INFO L87 Difference]: Start difference. First operand has 51 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 0 states have call successors, (0), 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 51 states. [2022-02-20 16:46:27,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:27,901 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-02-20 16:46:27,901 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-02-20 16:46:27,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:27,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:27,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:27,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:27,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 0 states have call successors, (0), 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:27,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2022-02-20 16:46:27,907 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 11 [2022-02-20 16:46:27,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:27,907 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2022-02-20 16:46:27,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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:27,908 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-02-20 16:46:27,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:46:27,908 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:27,908 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:27,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:46:27,909 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:27,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:27,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1947332695, now seen corresponding path program 1 times [2022-02-20 16:46:27,910 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:27,910 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013782143] [2022-02-20 16:46:27,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:27,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:27,969 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:46:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:28,055 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:46:28,055 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:46:28,057 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:28,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:46:28,061 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:46:28,064 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:28,085 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:28,085 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:28,085 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-02-20 16:46:28,085 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-02-20 16:46:28,085 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:28,086 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:28,086 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:28,086 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:28,086 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:28,086 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:28,086 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2022-02-20 16:46:28,086 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2022-02-20 16:46:28,086 WARN L170 areAnnotationChecker]: L32-7 has no Hoare annotation [2022-02-20 16:46:28,087 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-02-20 16:46:28,087 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-02-20 16:46:28,087 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:28,087 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:28,087 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-02-20 16:46:28,087 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-02-20 16:46:28,087 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2022-02-20 16:46:28,088 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:28,088 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:28,088 WARN L170 areAnnotationChecker]: L32-5 has no Hoare annotation [2022-02-20 16:46:28,088 WARN L170 areAnnotationChecker]: L32-5 has no Hoare annotation [2022-02-20 16:46:28,088 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2022-02-20 16:46:28,088 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:46:28,088 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:46:28,088 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:46:28,089 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:46:28,089 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:28,089 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:28,089 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2022-02-20 16:46:28,089 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2022-02-20 16:46:28,089 WARN L170 areAnnotationChecker]: L129 has no Hoare annotation [2022-02-20 16:46:28,089 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:46:28,089 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:46:28,090 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:46:28,090 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:28,090 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:28,090 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:28,090 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:46:28,090 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-02-20 16:46:28,090 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-02-20 16:46:28,091 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-02-20 16:46:28,091 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:28,091 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:28,091 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2022-02-20 16:46:28,091 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:46:28,091 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:46:28,091 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:46:28,092 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:46:28,092 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:46:28,092 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:46:28,092 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:46:28,092 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:46:28,092 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:46:28,092 WARN L170 areAnnotationChecker]: L55-4 has no Hoare annotation [2022-02-20 16:46:28,092 WARN L170 areAnnotationChecker]: L55-4 has no Hoare annotation [2022-02-20 16:46:28,093 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:46:28,093 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:46:28,093 WARN L170 areAnnotationChecker]: L69-2 has no Hoare annotation [2022-02-20 16:46:28,093 WARN L170 areAnnotationChecker]: L69-2 has no Hoare annotation [2022-02-20 16:46:28,093 WARN L170 areAnnotationChecker]: L55-6 has no Hoare annotation [2022-02-20 16:46:28,093 WARN L170 areAnnotationChecker]: L55-6 has no Hoare annotation [2022-02-20 16:46:28,093 WARN L170 areAnnotationChecker]: L61-4 has no Hoare annotation [2022-02-20 16:46:28,094 WARN L170 areAnnotationChecker]: L61-4 has no Hoare annotation [2022-02-20 16:46:28,094 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2022-02-20 16:46:28,094 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:46:28,094 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:46:28,094 WARN L170 areAnnotationChecker]: L61-6 has no Hoare annotation [2022-02-20 16:46:28,094 WARN L170 areAnnotationChecker]: L61-6 has no Hoare annotation [2022-02-20 16:46:28,094 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:46:28,094 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:46:28,095 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:28,095 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:28,095 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:46:28,095 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:46:28,095 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:46:28,095 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:46:28,095 WARN L170 areAnnotationChecker]: L84-2 has no Hoare annotation [2022-02-20 16:46:28,096 WARN L170 areAnnotationChecker]: L84-2 has no Hoare annotation [2022-02-20 16:46:28,096 WARN L170 areAnnotationChecker]: L84-2 has no Hoare annotation [2022-02-20 16:46:28,096 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:28,096 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:28,096 WARN L170 areAnnotationChecker]: L90-2 has no Hoare annotation [2022-02-20 16:46:28,096 WARN L170 areAnnotationChecker]: L90-2 has no Hoare annotation [2022-02-20 16:46:28,096 WARN L170 areAnnotationChecker]: L99-2 has no Hoare annotation [2022-02-20 16:46:28,096 WARN L170 areAnnotationChecker]: L99-2 has no Hoare annotation [2022-02-20 16:46:28,097 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:28,097 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:28,097 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:46:28,097 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:46:28,097 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:46:28,097 WARN L170 areAnnotationChecker]: L99-3 has no Hoare annotation [2022-02-20 16:46:28,097 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:28,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:28 BoogieIcfgContainer [2022-02-20 16:46:28,098 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:28,099 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:28,099 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:28,099 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:28,100 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:27" (3/4) ... [2022-02-20 16:46:28,102 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:46:28,102 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:28,103 INFO L158 Benchmark]: Toolchain (without parser) took 2046.30ms. Allocated memory was 88.1MB in the beginning and 115.3MB in the end (delta: 27.3MB). Free memory was 53.2MB in the beginning and 71.4MB in the end (delta: -18.2MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2022-02-20 16:46:28,104 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 88.1MB. Free memory was 57.7MB in the beginning and 57.7MB in the end (delta: 24.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:28,104 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.09ms. Allocated memory was 88.1MB in the beginning and 115.3MB in the end (delta: 27.3MB). Free memory was 52.9MB in the beginning and 87.6MB in the end (delta: -34.6MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2022-02-20 16:46:28,105 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.32ms. Allocated memory is still 115.3MB. Free memory was 87.6MB in the beginning and 84.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:28,105 INFO L158 Benchmark]: Boogie Preprocessor took 40.87ms. Allocated memory is still 115.3MB. Free memory was 84.4MB in the beginning and 82.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:28,106 INFO L158 Benchmark]: RCFGBuilder took 716.77ms. Allocated memory is still 115.3MB. Free memory was 82.3MB in the beginning and 89.5MB in the end (delta: -7.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-02-20 16:46:28,106 INFO L158 Benchmark]: TraceAbstraction took 829.57ms. Allocated memory is still 115.3MB. Free memory was 89.0MB in the beginning and 72.3MB in the end (delta: 16.8MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2022-02-20 16:46:28,107 INFO L158 Benchmark]: Witness Printer took 3.30ms. Allocated memory is still 115.3MB. Free memory was 72.0MB in the beginning and 71.4MB in the end (delta: 623.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:28,109 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.12ms. Allocated memory is still 88.1MB. Free memory was 57.7MB in the beginning and 57.7MB in the end (delta: 24.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.09ms. Allocated memory was 88.1MB in the beginning and 115.3MB in the end (delta: 27.3MB). Free memory was 52.9MB in the beginning and 87.6MB in the end (delta: -34.6MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.32ms. Allocated memory is still 115.3MB. Free memory was 87.6MB in the beginning and 84.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.87ms. Allocated memory is still 115.3MB. Free memory was 84.4MB in the beginning and 82.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 716.77ms. Allocated memory is still 115.3MB. Free memory was 82.3MB in the beginning and 89.5MB in the end (delta: -7.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 829.57ms. Allocated memory is still 115.3MB. Free memory was 89.0MB in the beginning and 72.3MB in the end (delta: 16.8MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. * Witness Printer took 3.30ms. Allocated memory is still 115.3MB. Free memory was 72.0MB in the beginning and 71.4MB in the end (delta: 623.6kB). Peak memory consumption was 2.1MB. 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: 125]: 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 110, overapproximation of someUnaryDOUBLEoperation at line 16, overapproximation of bitwiseAnd at line 34, overapproximation of someBinaryArithmeticFLOAToperation at line 37, overapproximation of bitwiseXOr at line 33. Possible FailurePath: [L14-L17] static const float one_fmod = 1.0, Zero_fmod[] = { 0.0, -0.0, }; VAL [one_fmod=1, Zero_fmod={4:0}] [L119] float x = -1.0f / 0.0f; [L120] float y = __VERIFIER_nondet_float(); [L121] CALL, EXPR fmod_float(x, y) [L20] __int32_t n, hx, hy, hz, ix, iy, sx, i; VAL [\old(x)=4294967299, \old(y)=4294967297, one_fmod=1, x=4294967299, y=4294967297, Zero_fmod={4:0}] [L23] ieee_float_shape_type gf_u; [L24] gf_u.value = (x) [L25] EXPR gf_u.word [L25] (hx) = gf_u.word [L28] ieee_float_shape_type gf_u; [L29] gf_u.value = (y) [L30] EXPR gf_u.word [L30] (hy) = gf_u.word [L32] sx = hx & 0x80000000 VAL [\old(x)=4294967299, \old(y)=4294967297, hx=0, hy=-1, one_fmod=1, sx=0, x=4294967299, y=4294967297, Zero_fmod={4:0}] [L33] hx ^= sx [L34] hy &= 0x7fffffff VAL [\old(x)=4294967299, \old(y)=4294967297, hx=0, hy=0, one_fmod=1, sx=0, x=4294967299, y=4294967297, Zero_fmod={4:0}] [L36] COND TRUE ((hy) == 0) || !((hx) < 0x7f800000L) || ((hy) > 0x7f800000L) [L37] return (x * y) / (x * y); VAL [\old(x)=4294967299, \old(y)=4294967297, hx=0, hy=0, one_fmod=1, sx=0, x=4294967299, y=4294967297, Zero_fmod={4:0}] [L121] RET, EXPR fmod_float(x, y) [L121] float res = fmod_float(x, y); [L124] CALL, EXPR isnan_float(res) [L110] return x != x; VAL [\old(x)=4294967298, \result=0, one_fmod=1, x=4294967298, Zero_fmod={4:0}] [L124] RET, EXPR isnan_float(res) [L124] COND TRUE !isnan_float(res) [L125] reach_error() VAL [one_fmod=1, res=4294967298, x=4294967299, y=4294967297, Zero_fmod={4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 73 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, 73 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=54occurred 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.1s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 10 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:28,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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_1122b.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 531a1139fb1df73d7771aceceeca279cd2242c70bbd9f853f2d0e457d633cadc --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:30,021 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:30,023 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:30,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:30,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:30,053 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:30,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:30,056 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:30,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:30,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:30,059 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:30,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:30,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:30,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:30,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:30,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:30,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:30,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:30,066 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:30,068 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:30,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:30,070 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:30,071 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:30,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:30,074 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:30,074 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:30,074 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:30,075 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:30,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:30,076 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:30,076 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:30,077 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:30,078 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:30,079 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:30,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:30,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:30,080 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:30,081 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:30,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:30,082 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:30,082 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:30,083 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:30,102 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:30,103 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:30,103 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:30,103 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:30,104 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:30,104 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:30,105 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:30,105 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:30,106 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:30,106 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:30,106 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:30,106 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:30,107 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:30,107 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:30,107 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:30,107 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:30,108 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:46:30,108 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:46:30,108 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:46:30,108 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:30,108 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:30,109 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:30,109 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:30,109 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:30,109 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:30,109 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:30,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:30,110 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:30,110 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:30,110 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:30,111 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:46:30,111 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:46:30,111 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:30,111 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:30,111 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:30,112 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:46:30,112 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 -> 531a1139fb1df73d7771aceceeca279cd2242c70bbd9f853f2d0e457d633cadc [2022-02-20 16:46:30,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:30,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:30,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:30,519 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:30,520 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:30,521 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1122b.c [2022-02-20 16:46:30,579 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a8a851e9/a694984b44294a1cae380f7221306f28/FLAGc24aecaa2 [2022-02-20 16:46:31,006 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:31,007 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1122b.c [2022-02-20 16:46:31,017 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a8a851e9/a694984b44294a1cae380f7221306f28/FLAGc24aecaa2 [2022-02-20 16:46:31,406 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a8a851e9/a694984b44294a1cae380f7221306f28 [2022-02-20 16:46:31,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:31,410 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:31,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:31,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:31,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:31,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:31" (1/1) ... [2022-02-20 16:46:31,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77aab081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:31, skipping insertion in model container [2022-02-20 16:46:31,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:31" (1/1) ... [2022-02-20 16:46:31,426 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:31,451 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:31,618 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_1122b.c[2726,2739] [2022-02-20 16:46:31,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:31,655 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:31,700 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_1122b.c[2726,2739] [2022-02-20 16:46:31,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:31,720 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:31,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:31 WrapperNode [2022-02-20 16:46:31,722 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:31,723 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:31,724 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:31,724 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:31,728 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:31" (1/1) ... [2022-02-20 16:46:31,738 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:31" (1/1) ... [2022-02-20 16:46:31,769 INFO L137 Inliner]: procedures = 21, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 169 [2022-02-20 16:46:31,769 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:31,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:31,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:31,770 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:31,777 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:31" (1/1) ... [2022-02-20 16:46:31,778 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:31" (1/1) ... [2022-02-20 16:46:31,791 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:31" (1/1) ... [2022-02-20 16:46:31,792 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:31" (1/1) ... [2022-02-20 16:46:31,807 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:31" (1/1) ... [2022-02-20 16:46:31,812 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:31" (1/1) ... [2022-02-20 16:46:31,814 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:31" (1/1) ... [2022-02-20 16:46:31,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:31,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:31,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:31,819 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:31,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:31" (1/1) ... [2022-02-20 16:46:31,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:31,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:31,857 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:31,861 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:31,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:31,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-02-20 16:46:31,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:46:31,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:31,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:46:31,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:46:31,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:31,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:31,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:46:31,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:46:31,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:32,015 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:32,017 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:34,595 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:34,601 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:34,601 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2022-02-20 16:46:34,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:34 BoogieIcfgContainer [2022-02-20 16:46:34,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:34,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:34,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:34,607 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:34,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:31" (1/3) ... [2022-02-20 16:46:34,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@766d3441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:34, skipping insertion in model container [2022-02-20 16:46:34,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:31" (2/3) ... [2022-02-20 16:46:34,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@766d3441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:34, skipping insertion in model container [2022-02-20 16:46:34,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:34" (3/3) ... [2022-02-20 16:46:34,609 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1122b.c [2022-02-20 16:46:34,614 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:34,614 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:34,651 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:34,657 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:34,657 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:34,674 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.75) internal successors, (70), 41 states have internal predecessors, (70), 0 states have call successors, (0), 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:34,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:46:34,678 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:34,679 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:34,680 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:34,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:34,690 INFO L85 PathProgramCache]: Analyzing trace with hash 666555284, now seen corresponding path program 1 times [2022-02-20 16:46:34,702 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:34,703 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1521014181] [2022-02-20 16:46:34,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:34,703 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:34,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:34,706 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:34,707 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:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:34,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:46:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:34,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:35,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_fmod~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE()), ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())), ~#Zero_fmod~0.base, ~bvadd32(4bv32, ~#Zero_fmod~0.offset), 4bv32); {45#true} is VALID [2022-02-20 16:46:35,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~ret14#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());main_~y~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume { :begin_inline_fmod_float } true;fmod_float_#in~x#1, fmod_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmod_float_#res#1;havoc fmod_float_#t~mem4#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, fmod_float_#t~mem5#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, fmod_float_#t~mem6#1, fmod_float_#t~mem8#1, fmod_float_#t~post7#1, fmod_float_#t~mem9#1, fmod_float_#t~mem10#1, fmod_float_~#sf_u~0#1.base, fmod_float_~#sf_u~0#1.offset, fmod_float_#t~mem11#1, fmod_float_~#sf_u~1#1.base, fmod_float_~#sf_u~1#1.offset, fmod_float_~x#1, fmod_float_~y#1, fmod_float_~n~0#1, fmod_float_~hx~0#1, fmod_float_~hy~0#1, fmod_float_~hz~0#1, fmod_float_~ix~0#1, fmod_float_~iy~0#1, fmod_float_~sx~0#1, fmod_float_~i~0#1;fmod_float_~x#1 := fmod_float_#in~x#1;fmod_float_~y#1 := fmod_float_#in~y#1;havoc fmod_float_~n~0#1;havoc fmod_float_~hx~0#1;havoc fmod_float_~hy~0#1;havoc fmod_float_~hz~0#1;havoc fmod_float_~ix~0#1;havoc fmod_float_~iy~0#1;havoc fmod_float_~sx~0#1;havoc fmod_float_~i~0#1; {45#true} is VALID [2022-02-20 16:46:35,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {45#true} assume !true; {46#false} is VALID [2022-02-20 16:46:35,073 INFO L290 TraceCheckUtils]: 3: Hoare triple {46#false} assume !true; {46#false} is VALID [2022-02-20 16:46:35,090 INFO L290 TraceCheckUtils]: 4: Hoare triple {46#false} fmod_float_~sx~0#1 := ~bvand32(2147483648bv32, fmod_float_~hx~0#1);fmod_float_~hx~0#1 := ~bvxor32(fmod_float_~hx~0#1, fmod_float_~sx~0#1);fmod_float_~hy~0#1 := ~bvand32(2147483647bv32, fmod_float_~hy~0#1); {46#false} is VALID [2022-02-20 16:46:35,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {46#false} assume (0bv32 == fmod_float_~hy~0#1 || !~bvslt32(fmod_float_~hx~0#1, 2139095040bv32)) || ~bvsgt32(fmod_float_~hy~0#1, 2139095040bv32);fmod_float_#res#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, fmod_float_~x#1, fmod_float_~y#1), ~fp.mul~FLOAT(currentRoundingMode, fmod_float_~x#1, fmod_float_~y#1)); {46#false} is VALID [2022-02-20 16:46:35,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {46#false} main_#t~ret13#1 := fmod_float_#res#1;assume { :end_inline_fmod_float } true;main_~res~0#1 := main_#t~ret13#1;havoc main_#t~ret13#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); {46#false} is VALID [2022-02-20 16:46:35,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {46#false} main_#t~ret14#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {46#false} is VALID [2022-02-20 16:46:35,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {46#false} assume 0bv32 == main_#t~ret14#1;havoc main_#t~ret14#1; {46#false} is VALID [2022-02-20 16:46:35,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {46#false} assume !false; {46#false} is VALID [2022-02-20 16:46:35,092 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:35,092 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:35,093 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:35,093 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1521014181] [2022-02-20 16:46:35,093 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1521014181] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:35,094 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:35,094 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:35,095 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657744963] [2022-02-20 16:46:35,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:35,099 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:35,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:35,103 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:35,392 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:35,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:35,392 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:35,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:35,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:35,412 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.75) internal successors, (70), 41 states have internal predecessors, (70), 0 states have call successors, (0), 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:36,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:36,249 INFO L93 Difference]: Finished difference Result 82 states and 138 transitions. [2022-02-20 16:46:36,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:36,249 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:36,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:36,251 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:36,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 138 transitions. [2022-02-20 16:46:36,259 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:36,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 138 transitions. [2022-02-20 16:46:36,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 138 transitions. [2022-02-20 16:46:36,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:36,946 INFO L225 Difference]: With dead ends: 82 [2022-02-20 16:46:36,946 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 16:46:36,948 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:36,951 INFO L933 BasicCegarLoop]: 57 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, 57 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:36,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 57 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:36,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 16:46:36,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-02-20 16:46:36,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:36,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:36,976 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:36,977 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:36,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:36,980 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-02-20 16:46:36,980 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-02-20 16:46:36,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:36,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:36,982 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 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 39 states. [2022-02-20 16:46:36,982 INFO L87 Difference]: Start difference. First operand has 39 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 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 39 states. [2022-02-20 16:46:36,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:36,985 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-02-20 16:46:36,985 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-02-20 16:46:36,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:36,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:36,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:36,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:36,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:36,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2022-02-20 16:46:36,990 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 10 [2022-02-20 16:46:36,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:36,990 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2022-02-20 16:46:36,991 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:36,991 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-02-20 16:46:36,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:46:36,993 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:36,993 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:37,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:37,194 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:37,195 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:37,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:37,196 INFO L85 PathProgramCache]: Analyzing trace with hash 131116369, now seen corresponding path program 1 times [2022-02-20 16:46:37,196 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:37,196 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991289136] [2022-02-20 16:46:37,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:37,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:37,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:37,199 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:37,201 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:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:37,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 16:46:37,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:37,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:40,475 INFO L290 TraceCheckUtils]: 0: Hoare triple {304#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_fmod~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE()), ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())), ~#Zero_fmod~0.base, ~bvadd32(4bv32, ~#Zero_fmod~0.offset), 4bv32); {309#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:46:40,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~ret14#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());main_~y~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume { :begin_inline_fmod_float } true;fmod_float_#in~x#1, fmod_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmod_float_#res#1;havoc fmod_float_#t~mem4#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, fmod_float_#t~mem5#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, fmod_float_#t~mem6#1, fmod_float_#t~mem8#1, fmod_float_#t~post7#1, fmod_float_#t~mem9#1, fmod_float_#t~mem10#1, fmod_float_~#sf_u~0#1.base, fmod_float_~#sf_u~0#1.offset, fmod_float_#t~mem11#1, fmod_float_~#sf_u~1#1.base, fmod_float_~#sf_u~1#1.offset, fmod_float_~x#1, fmod_float_~y#1, fmod_float_~n~0#1, fmod_float_~hx~0#1, fmod_float_~hy~0#1, fmod_float_~hz~0#1, fmod_float_~ix~0#1, fmod_float_~iy~0#1, fmod_float_~sx~0#1, fmod_float_~i~0#1;fmod_float_~x#1 := fmod_float_#in~x#1;fmod_float_~y#1 := fmod_float_#in~y#1;havoc fmod_float_~n~0#1;havoc fmod_float_~hx~0#1;havoc fmod_float_~hy~0#1;havoc fmod_float_~hz~0#1;havoc fmod_float_~ix~0#1;havoc fmod_float_~iy~0#1;havoc fmod_float_~sx~0#1;havoc fmod_float_~i~0#1; {313#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:40,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {313#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} call fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~x#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);call fmod_float_#t~mem4#1 := read~intINTTYPE4(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);fmod_float_~hx~0#1 := fmod_float_#t~mem4#1;havoc fmod_float_#t~mem4#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset);havoc fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset; {313#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:40,477 INFO L290 TraceCheckUtils]: 3: Hoare triple {313#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} goto; {313#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:40,478 INFO L290 TraceCheckUtils]: 4: Hoare triple {313#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} call fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~y#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);call fmod_float_#t~mem5#1 := read~intINTTYPE4(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);fmod_float_~hy~0#1 := fmod_float_#t~mem5#1;havoc fmod_float_#t~mem5#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset);havoc fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset; {313#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:40,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {313#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} goto; {313#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:40,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {313#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} fmod_float_~sx~0#1 := ~bvand32(2147483648bv32, fmod_float_~hx~0#1);fmod_float_~hx~0#1 := ~bvxor32(fmod_float_~hx~0#1, fmod_float_~sx~0#1);fmod_float_~hy~0#1 := ~bvand32(2147483647bv32, fmod_float_~hy~0#1); {313#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:40,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {313#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} assume (0bv32 == fmod_float_~hy~0#1 || !~bvslt32(fmod_float_~hx~0#1, 2139095040bv32)) || ~bvsgt32(fmod_float_~hy~0#1, 2139095040bv32);fmod_float_#res#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, fmod_float_~x#1, fmod_float_~y#1), ~fp.mul~FLOAT(currentRoundingMode, fmod_float_~x#1, fmod_float_~y#1)); {332#(exists ((|ULTIMATE.start_fmod_float_~y#1| (_ FloatingPoint 8 24))) (= (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~y#1|) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~y#1|)) |ULTIMATE.start_fmod_float_#res#1|))} is VALID [2022-02-20 16:46:40,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {332#(exists ((|ULTIMATE.start_fmod_float_~y#1| (_ FloatingPoint 8 24))) (= (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~y#1|) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~y#1|)) |ULTIMATE.start_fmod_float_#res#1|))} main_#t~ret13#1 := fmod_float_#res#1;assume { :end_inline_fmod_float } true;main_~res~0#1 := main_#t~ret13#1;havoc main_#t~ret13#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); {336#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} is VALID [2022-02-20 16:46:40,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {336#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} main_#t~ret14#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {340#(= |ULTIMATE.start_main_#t~ret14#1| (_ bv1 32))} is VALID [2022-02-20 16:46:40,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {340#(= |ULTIMATE.start_main_#t~ret14#1| (_ bv1 32))} assume 0bv32 == main_#t~ret14#1;havoc main_#t~ret14#1; {305#false} is VALID [2022-02-20 16:46:40,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {305#false} assume !false; {305#false} is VALID [2022-02-20 16:46:40,793 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:40,793 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:40,793 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:40,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991289136] [2022-02-20 16:46:40,794 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991289136] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:40,794 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:40,794 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:46:40,794 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302335140] [2022-02-20 16:46:40,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:40,795 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:46:40,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:40,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:41,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:41,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:46:41,199 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:41,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:46:41,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:41,200 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:44,793 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:46:55,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:55,899 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2022-02-20 16:46:55,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:46:55,900 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:46:55,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:55,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:55,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-02-20 16:46:55,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:55,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-02-20 16:46:55,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 59 transitions. [2022-02-20 16:46:56,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:56,354 INFO L225 Difference]: With dead ends: 45 [2022-02-20 16:46:56,354 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 16:46:56,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:46:56,355 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 87 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:56,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 188 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 10 Unchecked, 4.1s Time] [2022-02-20 16:46:56,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 16:46:56,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-02-20 16:46:56,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:56,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 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:56,361 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 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:56,361 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 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:56,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:56,363 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2022-02-20 16:46:56,363 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2022-02-20 16:46:56,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:56,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:56,364 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 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 40 states. [2022-02-20 16:46:56,364 INFO L87 Difference]: Start difference. First operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 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 40 states. [2022-02-20 16:46:56,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:56,366 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2022-02-20 16:46:56,367 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2022-02-20 16:46:56,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:56,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:56,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:56,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:56,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 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:56,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-02-20 16:46:56,370 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 12 [2022-02-20 16:46:56,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:56,370 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2022-02-20 16:46:56,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:56,370 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-02-20 16:46:56,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:46:56,371 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:56,371 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:56,389 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:56,588 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:56,588 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:56,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:56,589 INFO L85 PathProgramCache]: Analyzing trace with hash -302456811, now seen corresponding path program 1 times [2022-02-20 16:46:56,589 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:56,590 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470851759] [2022-02-20 16:46:56,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:56,590 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:56,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:56,591 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:56,593 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:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:56,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 16:46:56,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:56,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:56,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {535#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_fmod~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE()), ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())), ~#Zero_fmod~0.base, ~bvadd32(4bv32, ~#Zero_fmod~0.offset), 4bv32); {535#true} is VALID [2022-02-20 16:46:56,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {535#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~ret14#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());main_~y~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume { :begin_inline_fmod_float } true;fmod_float_#in~x#1, fmod_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmod_float_#res#1;havoc fmod_float_#t~mem4#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, fmod_float_#t~mem5#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, fmod_float_#t~mem6#1, fmod_float_#t~mem8#1, fmod_float_#t~post7#1, fmod_float_#t~mem9#1, fmod_float_#t~mem10#1, fmod_float_~#sf_u~0#1.base, fmod_float_~#sf_u~0#1.offset, fmod_float_#t~mem11#1, fmod_float_~#sf_u~1#1.base, fmod_float_~#sf_u~1#1.offset, fmod_float_~x#1, fmod_float_~y#1, fmod_float_~n~0#1, fmod_float_~hx~0#1, fmod_float_~hy~0#1, fmod_float_~hz~0#1, fmod_float_~ix~0#1, fmod_float_~iy~0#1, fmod_float_~sx~0#1, fmod_float_~i~0#1;fmod_float_~x#1 := fmod_float_#in~x#1;fmod_float_~y#1 := fmod_float_#in~y#1;havoc fmod_float_~n~0#1;havoc fmod_float_~hx~0#1;havoc fmod_float_~hy~0#1;havoc fmod_float_~hz~0#1;havoc fmod_float_~ix~0#1;havoc fmod_float_~iy~0#1;havoc fmod_float_~sx~0#1;havoc fmod_float_~i~0#1; {543#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~x#1|))} is VALID [2022-02-20 16:46:56,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {543#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~x#1|))} call fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~x#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);call fmod_float_#t~mem4#1 := read~intINTTYPE4(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);fmod_float_~hx~0#1 := fmod_float_#t~mem4#1;havoc fmod_float_#t~mem4#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset);havoc fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset; {547#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|))))} is VALID [2022-02-20 16:46:56,945 INFO L290 TraceCheckUtils]: 3: Hoare triple {547#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|))))} goto; {547#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|))))} is VALID [2022-02-20 16:46:56,948 INFO L290 TraceCheckUtils]: 4: Hoare triple {547#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|))))} call fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~y#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);call fmod_float_#t~mem5#1 := read~intINTTYPE4(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);fmod_float_~hy~0#1 := fmod_float_#t~mem5#1;havoc fmod_float_#t~mem5#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset);havoc fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset; {547#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|))))} is VALID [2022-02-20 16:46:56,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {547#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|))))} goto; {547#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|))))} is VALID [2022-02-20 16:46:56,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {547#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hx~0#1|))))} fmod_float_~sx~0#1 := ~bvand32(2147483648bv32, fmod_float_~hx~0#1);fmod_float_~hx~0#1 := ~bvxor32(fmod_float_~hx~0#1, fmod_float_~sx~0#1);fmod_float_~hy~0#1 := ~bvand32(2147483647bv32, fmod_float_~hy~0#1); {560#(exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_35| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_35|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_35|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_35|))) (= (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_35| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_35|) |ULTIMATE.start_fmod_float_~hx~0#1|)))} is VALID [2022-02-20 16:46:56,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {560#(exists ((|v_ULTIMATE.start_fmod_float_~hx~0#1_35| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hx~0#1_35|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hx~0#1_35|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hx~0#1_35|))) (= (bvxor (bvand |v_ULTIMATE.start_fmod_float_~hx~0#1_35| (_ bv2147483648 32)) |v_ULTIMATE.start_fmod_float_~hx~0#1_35|) |ULTIMATE.start_fmod_float_~hx~0#1|)))} assume !((0bv32 == fmod_float_~hy~0#1 || !~bvslt32(fmod_float_~hx~0#1, 2139095040bv32)) || ~bvsgt32(fmod_float_~hy~0#1, 2139095040bv32)); {536#false} is VALID [2022-02-20 16:46:56,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {536#false} assume ~bvslt32(fmod_float_~hx~0#1, fmod_float_~hy~0#1);fmod_float_#res#1 := fmod_float_~x#1; {536#false} is VALID [2022-02-20 16:46:56,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {536#false} main_#t~ret13#1 := fmod_float_#res#1;assume { :end_inline_fmod_float } true;main_~res~0#1 := main_#t~ret13#1;havoc main_#t~ret13#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); {536#false} is VALID [2022-02-20 16:46:56,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {536#false} main_#t~ret14#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {536#false} is VALID [2022-02-20 16:46:56,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {536#false} assume 0bv32 == main_#t~ret14#1;havoc main_#t~ret14#1; {536#false} is VALID [2022-02-20 16:46:56,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {536#false} assume !false; {536#false} is VALID [2022-02-20 16:46:56,957 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:56,957 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:56,957 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:56,957 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470851759] [2022-02-20 16:46:56,957 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470851759] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:56,957 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:56,958 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:56,958 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827893761] [2022-02-20 16:46:56,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:56,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:46:56,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:56,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:56,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:57,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:57,000 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:57,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:57,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:57,001 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:57,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:57,089 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2022-02-20 16:46:57,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:46:57,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:46:57,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:57,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:57,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-02-20 16:46:57,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:57,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-02-20 16:46:57,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-02-20 16:46:57,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:57,197 INFO L225 Difference]: With dead ends: 39 [2022-02-20 16:46:57,197 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:46:57,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:57,199 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 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:57,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 14 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:57,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:46:57,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:46:57,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:57,201 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:57,201 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:57,202 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:57,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:57,202 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:57,202 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:57,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:57,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:57,202 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:57,202 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:57,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:57,202 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:57,202 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:57,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:57,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:57,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:57,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:57,203 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:57,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:46:57,203 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-02-20 16:46:57,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:57,203 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:46:57,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:57,203 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:57,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:57,205 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:57,213 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:57,406 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:57,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:46:58,252 INFO L858 garLoopResultBuilder]: For program point L27(lines 27 31) no Hoare annotation was computed. [2022-02-20 16:46:58,252 INFO L858 garLoopResultBuilder]: For program point L60-1(lines 60 65) no Hoare annotation was computed. [2022-02-20 16:46:58,252 INFO L858 garLoopResultBuilder]: For program point L27-1(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:58,252 INFO L858 garLoopResultBuilder]: For program point L27-2(lines 27 31) no Hoare annotation was computed. [2022-02-20 16:46:58,253 INFO L854 garLoopResultBuilder]: At program point L110(line 110) the Hoare annotation is: (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|) [2022-02-20 16:46:58,253 INFO L858 garLoopResultBuilder]: For program point L69(lines 69 75) no Hoare annotation was computed. [2022-02-20 16:46:58,253 INFO L858 garLoopResultBuilder]: For program point L36(lines 36 37) no Hoare annotation was computed. [2022-02-20 16:46:58,253 INFO L854 garLoopResultBuilder]: At program point L69-2(lines 67 76) the Hoare annotation is: false [2022-02-20 16:46:58,253 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:46:58,253 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:46:58,253 INFO L858 garLoopResultBuilder]: For program point L78(lines 78 80) no Hoare annotation was computed. [2022-02-20 16:46:58,253 INFO L858 garLoopResultBuilder]: For program point L78-2(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:58,253 INFO L858 garLoopResultBuilder]: For program point L54-1(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:58,253 INFO L858 garLoopResultBuilder]: For program point L38(lines 38 39) no Hoare annotation was computed. [2022-02-20 16:46:58,253 INFO L861 garLoopResultBuilder]: At program point L129(lines 112 130) the Hoare annotation is: true [2022-02-20 16:46:58,254 INFO L858 garLoopResultBuilder]: For program point L88(lines 88 105) no Hoare annotation was computed. [2022-02-20 16:46:58,254 INFO L858 garLoopResultBuilder]: For program point L22-1(lines 22 26) no Hoare annotation was computed. [2022-02-20 16:46:58,254 INFO L854 garLoopResultBuilder]: At program point L22-2(lines 22 26) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~x#1|)) (= currentRoundingMode roundNearestTiesToEven)) [2022-02-20 16:46:58,254 INFO L858 garLoopResultBuilder]: For program point L72(lines 72 73) no Hoare annotation was computed. [2022-02-20 16:46:58,254 INFO L858 garLoopResultBuilder]: For program point L48(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:58,255 INFO L854 garLoopResultBuilder]: At program point L106(lines 19 107) the Hoare annotation is: (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven) (exists ((|ULTIMATE.start_fmod_float_~y#1| (_ FloatingPoint 8 24))) (= (let ((.cse0 (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~y#1|))) (fp.div roundNearestTiesToEven .cse0 .cse0)) |ULTIMATE.start_fmod_float_#res#1|))) [2022-02-20 16:46:58,255 INFO L858 garLoopResultBuilder]: For program point L40(lines 40 41) no Hoare annotation was computed. [2022-02-20 16:46:58,255 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:46:58,255 INFO L858 garLoopResultBuilder]: For program point L90-1(lines 90 94) no Hoare annotation was computed. [2022-02-20 16:46:58,255 INFO L854 garLoopResultBuilder]: At program point L90-2(lines 90 94) the Hoare annotation is: false [2022-02-20 16:46:58,255 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 125) no Hoare annotation was computed. [2022-02-20 16:46:58,256 INFO L858 garLoopResultBuilder]: For program point L49-2(lines 49 50) no Hoare annotation was computed. [2022-02-20 16:46:58,256 INFO L854 garLoopResultBuilder]: At program point L49-3(lines 49 50) the Hoare annotation is: false [2022-02-20 16:46:58,256 INFO L858 garLoopResultBuilder]: For program point L99-1(lines 99 103) no Hoare annotation was computed. [2022-02-20 16:46:58,256 INFO L854 garLoopResultBuilder]: At program point L99-2(lines 99 103) the Hoare annotation is: false [2022-02-20 16:46:58,256 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:46:58,256 INFO L858 garLoopResultBuilder]: For program point L99-3(lines 99 103) no Hoare annotation was computed. [2022-02-20 16:46:58,257 INFO L858 garLoopResultBuilder]: For program point L124(lines 124 127) no Hoare annotation was computed. [2022-02-20 16:46:58,257 INFO L858 garLoopResultBuilder]: For program point L42(lines 42 46) no Hoare annotation was computed. [2022-02-20 16:46:58,257 INFO L858 garLoopResultBuilder]: For program point L42-1(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:58,257 INFO L858 garLoopResultBuilder]: For program point L67-1(lines 67 76) no Hoare annotation was computed. [2022-02-20 16:46:58,257 INFO L858 garLoopResultBuilder]: For program point L67-3(lines 67 76) no Hoare annotation was computed. [2022-02-20 16:46:58,257 INFO L858 garLoopResultBuilder]: For program point L125(line 125) no Hoare annotation was computed. [2022-02-20 16:46:58,257 INFO L854 garLoopResultBuilder]: At program point L84-2(lines 84 87) the Hoare annotation is: false [2022-02-20 16:46:58,258 INFO L858 garLoopResultBuilder]: For program point L84-3(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:58,258 INFO L858 garLoopResultBuilder]: For program point L43-2(lines 43 44) no Hoare annotation was computed. [2022-02-20 16:46:58,258 INFO L854 garLoopResultBuilder]: At program point L43-3(lines 43 44) the Hoare annotation is: false [2022-02-20 16:46:58,261 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:46:58,262 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:58,265 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:58,265 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:58,265 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:58,265 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:58,266 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:58,266 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:58,266 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:58,266 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:58,266 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:58,266 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:58,266 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2022-02-20 16:46:58,266 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:58,267 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:58,420 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:58,420 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:58,420 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:46:58,420 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:46:58,420 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:46:58,420 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:46:58,420 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:46:58,420 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:58,420 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:58,420 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2022-02-20 16:46:58,421 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2022-02-20 16:46:58,421 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:58,421 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:58,421 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:58,421 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:46:58,421 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:58,421 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:58,421 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:58,421 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:46:58,421 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:58,421 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:58,421 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2022-02-20 16:46:58,421 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:58,421 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:58,421 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2022-02-20 16:46:58,422 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2022-02-20 16:46:58,422 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2022-02-20 16:46:58,422 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2022-02-20 16:46:58,422 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2022-02-20 16:46:58,422 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:46:58,422 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2022-02-20 16:46:58,422 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:46:58,422 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:46:58,422 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:46:58,422 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:46:58,422 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:58,422 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:58,422 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:46:58,422 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:46:58,422 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:46:58,422 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:46:58,423 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:58,423 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:58,423 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:58,423 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:58,423 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:58,424 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:46:58,424 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:46:58,424 WARN L170 areAnnotationChecker]: L99-3 has no Hoare annotation [2022-02-20 16:46:58,424 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:58,424 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:58,424 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:46:58,424 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:46:58,424 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:46:58,424 WARN L170 areAnnotationChecker]: L99-3 has no Hoare annotation [2022-02-20 16:46:58,424 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:46:58,430 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:58,431 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:58,431 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,432 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:58,432 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:58,432 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,433 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,433 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,433 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,433 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,434 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,434 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~y#1,QUANTIFIED] [2022-02-20 16:46:58,434 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,434 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,434 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,434 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~y#1,QUANTIFIED] [2022-02-20 16:46:58,435 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,435 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,436 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,436 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,436 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,436 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~y#1,QUANTIFIED] [2022-02-20 16:46:58,436 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,436 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,437 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,437 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~y#1,QUANTIFIED] [2022-02-20 16:46:58,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:58 BoogieIcfgContainer [2022-02-20 16:46:58,438 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:58,438 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:58,438 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:58,439 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:58,439 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:34" (3/4) ... [2022-02-20 16:46:58,441 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:46:58,449 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-02-20 16:46:58,449 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-02-20 16:46:58,450 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:46:58,450 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:46:58,468 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-02-20 16:46:58,476 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:46:58,476 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:58,477 INFO L158 Benchmark]: Toolchain (without parser) took 27067.36ms. Allocated memory was 58.7MB in the beginning and 81.8MB in the end (delta: 23.1MB). Free memory was 38.0MB in the beginning and 53.7MB in the end (delta: -15.7MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:58,477 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 58.7MB. Free memory is still 41.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:58,477 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.83ms. Allocated memory is still 58.7MB. Free memory was 37.8MB in the beginning and 39.8MB in the end (delta: -2.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 16:46:58,478 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.10ms. Allocated memory is still 58.7MB. Free memory was 39.8MB in the beginning and 37.3MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:46:58,478 INFO L158 Benchmark]: Boogie Preprocessor took 47.79ms. Allocated memory is still 58.7MB. Free memory was 37.3MB in the beginning and 35.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:58,478 INFO L158 Benchmark]: RCFGBuilder took 2783.89ms. Allocated memory was 58.7MB in the beginning and 81.8MB in the end (delta: 23.1MB). Free memory was 35.0MB in the beginning and 55.9MB in the end (delta: -20.9MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2022-02-20 16:46:58,478 INFO L158 Benchmark]: TraceAbstraction took 23833.68ms. Allocated memory is still 81.8MB. Free memory was 55.5MB in the beginning and 55.8MB in the end (delta: -229.2kB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:58,478 INFO L158 Benchmark]: Witness Printer took 38.20ms. Allocated memory is still 81.8MB. Free memory was 55.8MB in the beginning and 53.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:58,480 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.19ms. Allocated memory is still 58.7MB. Free memory is still 41.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.83ms. Allocated memory is still 58.7MB. Free memory was 37.8MB in the beginning and 39.8MB in the end (delta: -2.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.10ms. Allocated memory is still 58.7MB. Free memory was 39.8MB in the beginning and 37.3MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.79ms. Allocated memory is still 58.7MB. Free memory was 37.3MB in the beginning and 35.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2783.89ms. Allocated memory was 58.7MB in the beginning and 81.8MB in the end (delta: 23.1MB). Free memory was 35.0MB in the beginning and 55.9MB in the end (delta: -20.9MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * TraceAbstraction took 23833.68ms. Allocated memory is still 81.8MB. Free memory was 55.5MB in the beginning and 55.8MB in the end (delta: -229.2kB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. * Witness Printer took 38.20ms. Allocated memory is still 81.8MB. Free memory was 55.8MB in the beginning and 53.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~y#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~y#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~y#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~y#1,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: 125]: 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, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 87 mSDsluCounter, 259 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 14 IncrementalHoareTripleChecker+Unchecked, 150 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 109 mSDtfsCounter, 25 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 14, 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, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 14 NumberOfFragments, 62 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 9 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 32 ConstructedInterpolants, 7 QuantifiedInterpolants, 226 SizeOfPredicates, 17 NumberOfNonLiveVariables, 180 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: 1bv32 == \result - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 90]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 22]: Loop Invariant [2022-02-20 16:46:58,491 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:58,491 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:58,491 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,492 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:58,492 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:58,492 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 19]: Loop Invariant [2022-02-20 16:46:58,493 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,493 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,493 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,493 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,493 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,493 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~y#1,QUANTIFIED] [2022-02-20 16:46:58,494 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,494 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,494 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,494 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~y#1,QUANTIFIED] [2022-02-20 16:46:58,495 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,495 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,495 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,495 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,495 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,495 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~y#1,QUANTIFIED] [2022-02-20 16:46:58,496 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,496 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,496 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:58,496 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~y#1,QUANTIFIED] Derived loop invariant: (~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)), ~Pluszero~LONGDOUBLE()) == x && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists ULTIMATE.start_fmod_float_~y#1 : C_FLOAT :: ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ULTIMATE.start_fmod_float_~y#1), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ULTIMATE.start_fmod_float_~y#1)) == \result) RESULT: Ultimate proved your program to be correct! [2022-02-20 16:46:58,617 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