./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1122a.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_1122a.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 11d6107924de66a58b91836187b6b12fed7ff2a1cca830501395e849f6954c14 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:23,190 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:23,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:23,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:23,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:23,231 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:23,233 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:23,235 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:23,238 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:23,243 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:23,244 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:23,245 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:23,245 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:23,248 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:23,249 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:23,252 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:23,253 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:23,254 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:23,256 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:23,259 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:23,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:23,263 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:23,264 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:23,265 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:23,269 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:23,269 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:23,270 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:23,271 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:23,272 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:23,272 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:23,273 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:23,274 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:23,275 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:23,276 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:23,277 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:23,277 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:23,278 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:23,278 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:23,278 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:23,279 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:23,280 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:23,280 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:23,312 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:23,316 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:23,316 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:23,316 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:23,317 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:23,317 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:23,318 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:23,318 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:23,318 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:23,319 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:23,319 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:23,320 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:46:23,320 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:23,320 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:23,320 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:23,321 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:23,321 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:23,321 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:23,321 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:23,321 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:23,321 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:23,322 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:23,322 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:23,322 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:23,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:23,323 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:23,323 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:23,324 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:23,324 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:46:23,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:46:23,324 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:23,325 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:23,325 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:23,325 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 -> 11d6107924de66a58b91836187b6b12fed7ff2a1cca830501395e849f6954c14 [2022-02-20 16:46:23,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:23,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:23,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:23,594 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:23,594 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:23,595 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1122a.c [2022-02-20 16:46:23,661 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02748907e/d61be30562c147b4b121c0a251d342ba/FLAGb7e5ef8ae [2022-02-20 16:46:24,080 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:24,081 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1122a.c [2022-02-20 16:46:24,087 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02748907e/d61be30562c147b4b121c0a251d342ba/FLAGb7e5ef8ae [2022-02-20 16:46:24,098 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02748907e/d61be30562c147b4b121c0a251d342ba [2022-02-20 16:46:24,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:24,101 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:24,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:24,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:24,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:24,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:24" (1/1) ... [2022-02-20 16:46:24,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e97b865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:24, skipping insertion in model container [2022-02-20 16:46:24,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:24" (1/1) ... [2022-02-20 16:46:24,115 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:24,130 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:24,384 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_1122a.c[2725,2738] [2022-02-20 16:46:24,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:24,401 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:24,447 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_1122a.c[2725,2738] [2022-02-20 16:46:24,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:24,468 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:24,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:24 WrapperNode [2022-02-20 16:46:24,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:24,470 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:24,471 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:24,471 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:24,476 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:24" (1/1) ... [2022-02-20 16:46:24,496 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:24" (1/1) ... [2022-02-20 16:46:24,536 INFO L137 Inliner]: procedures = 18, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 205 [2022-02-20 16:46:24,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:24,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:24,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:24,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:24,545 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:24" (1/1) ... [2022-02-20 16:46:24,546 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:24" (1/1) ... [2022-02-20 16:46:24,557 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:24" (1/1) ... [2022-02-20 16:46:24,558 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:24" (1/1) ... [2022-02-20 16:46:24,570 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:24" (1/1) ... [2022-02-20 16:46:24,583 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:24" (1/1) ... [2022-02-20 16:46:24,586 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:24" (1/1) ... [2022-02-20 16:46:24,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:24,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:24,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:24,592 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:24,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:24" (1/1) ... [2022-02-20 16:46:24,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:24,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:24,626 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:24,650 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:24,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:24,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:46:24,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:24,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:46:24,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:46:24,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:46:24,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:24,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:24,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:46:24,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-02-20 16:46:24,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:24,764 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:24,766 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:25,170 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:25,176 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:25,191 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2022-02-20 16:46:25,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:25 BoogieIcfgContainer [2022-02-20 16:46:25,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:25,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:25,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:25,198 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:25,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:24" (1/3) ... [2022-02-20 16:46:25,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e505302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:25, skipping insertion in model container [2022-02-20 16:46:25,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:24" (2/3) ... [2022-02-20 16:46:25,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e505302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:25, skipping insertion in model container [2022-02-20 16:46:25,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:25" (3/3) ... [2022-02-20 16:46:25,201 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1122a.c [2022-02-20 16:46:25,205 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:25,205 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:25,249 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:25,269 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:25,270 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:25,302 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:25,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:46:25,317 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:25,318 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:25,318 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:25,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:25,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1366069876, now seen corresponding path program 1 times [2022-02-20 16:46:25,331 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:25,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874714429] [2022-02-20 16:46:25,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:25,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:25,514 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:25,514 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(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:25,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {57#true} assume !true; {58#false} is VALID [2022-02-20 16:46:25,515 INFO L290 TraceCheckUtils]: 3: Hoare triple {58#false} assume !true; {58#false} is VALID [2022-02-20 16:46:25,516 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:25,516 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:25,516 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:25,517 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:25,518 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:25,518 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:25,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {58#false} assume !false; {58#false} is VALID [2022-02-20 16:46:25,520 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:25,520 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:25,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874714429] [2022-02-20 16:46:25,522 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874714429] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:25,522 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:25,522 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:25,524 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484725364] [2022-02-20 16:46:25,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:25,529 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:25,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:25,532 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:25,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:25,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:25,547 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:25,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:25,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:25,570 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:25,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:25,650 INFO L93 Difference]: Finished difference Result 106 states and 186 transitions. [2022-02-20 16:46:25,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:25,650 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:25,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:25,652 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:25,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 186 transitions. [2022-02-20 16:46:25,662 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:25,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 186 transitions. [2022-02-20 16:46:25,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 186 transitions. [2022-02-20 16:46:25,832 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:25,845 INFO L225 Difference]: With dead ends: 106 [2022-02-20 16:46:25,845 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 16:46:25,848 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:25,855 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:25,856 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:25,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 16:46:25,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-02-20 16:46:25,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:25,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:25,893 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:25,896 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:25,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:25,901 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-02-20 16:46:25,901 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-02-20 16:46:25,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:25,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:25,902 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:25,903 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:25,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:25,906 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-02-20 16:46:25,906 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-02-20 16:46:25,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:25,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:25,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:25,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:25,907 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:25,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2022-02-20 16:46:25,911 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 11 [2022-02-20 16:46:25,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:25,911 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2022-02-20 16:46:25,911 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:25,912 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-02-20 16:46:25,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:46:25,912 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:25,913 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:25,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:46:25,913 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:25,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:25,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1947332695, now seen corresponding path program 1 times [2022-02-20 16:46:25,914 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:25,915 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97950743] [2022-02-20 16:46:25,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:25,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:25,986 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:46:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:26,037 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:46:26,037 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:46:26,038 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:26,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:46:26,042 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:46:26,044 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:26,067 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:26,067 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:26,067 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-02-20 16:46:26,067 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-02-20 16:46:26,068 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:26,068 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:26,068 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:26,068 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:26,068 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:26,068 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:26,068 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2022-02-20 16:46:26,069 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2022-02-20 16:46:26,069 WARN L170 areAnnotationChecker]: L32-7 has no Hoare annotation [2022-02-20 16:46:26,069 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-02-20 16:46:26,069 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-02-20 16:46:26,069 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:26,069 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:26,069 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-02-20 16:46:26,069 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-02-20 16:46:26,070 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2022-02-20 16:46:26,070 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:26,070 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:26,070 WARN L170 areAnnotationChecker]: L32-5 has no Hoare annotation [2022-02-20 16:46:26,070 WARN L170 areAnnotationChecker]: L32-5 has no Hoare annotation [2022-02-20 16:46:26,070 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2022-02-20 16:46:26,070 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:46:26,071 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:46:26,071 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:46:26,071 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:46:26,071 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:26,071 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:26,071 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2022-02-20 16:46:26,071 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2022-02-20 16:46:26,071 WARN L170 areAnnotationChecker]: L129 has no Hoare annotation [2022-02-20 16:46:26,072 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:46:26,072 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:46:26,072 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:46:26,072 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:26,072 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:26,072 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:26,072 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:46:26,073 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-02-20 16:46:26,073 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-02-20 16:46:26,073 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-02-20 16:46:26,073 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:26,073 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:26,073 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2022-02-20 16:46:26,073 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:46:26,074 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:46:26,074 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:46:26,074 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:46:26,074 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:46:26,074 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:46:26,074 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:46:26,074 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:46:26,074 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:46:26,075 WARN L170 areAnnotationChecker]: L55-4 has no Hoare annotation [2022-02-20 16:46:26,075 WARN L170 areAnnotationChecker]: L55-4 has no Hoare annotation [2022-02-20 16:46:26,075 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:46:26,075 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:46:26,075 WARN L170 areAnnotationChecker]: L69-2 has no Hoare annotation [2022-02-20 16:46:26,075 WARN L170 areAnnotationChecker]: L69-2 has no Hoare annotation [2022-02-20 16:46:26,075 WARN L170 areAnnotationChecker]: L55-6 has no Hoare annotation [2022-02-20 16:46:26,076 WARN L170 areAnnotationChecker]: L55-6 has no Hoare annotation [2022-02-20 16:46:26,076 WARN L170 areAnnotationChecker]: L61-4 has no Hoare annotation [2022-02-20 16:46:26,076 WARN L170 areAnnotationChecker]: L61-4 has no Hoare annotation [2022-02-20 16:46:26,076 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2022-02-20 16:46:26,076 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:46:26,076 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:46:26,076 WARN L170 areAnnotationChecker]: L61-6 has no Hoare annotation [2022-02-20 16:46:26,076 WARN L170 areAnnotationChecker]: L61-6 has no Hoare annotation [2022-02-20 16:46:26,077 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:46:26,077 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:46:26,077 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:26,077 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:26,077 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:46:26,077 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:46:26,077 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:46:26,078 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:46:26,078 WARN L170 areAnnotationChecker]: L84-2 has no Hoare annotation [2022-02-20 16:46:26,078 WARN L170 areAnnotationChecker]: L84-2 has no Hoare annotation [2022-02-20 16:46:26,078 WARN L170 areAnnotationChecker]: L84-2 has no Hoare annotation [2022-02-20 16:46:26,078 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:26,078 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:26,078 WARN L170 areAnnotationChecker]: L90-2 has no Hoare annotation [2022-02-20 16:46:26,078 WARN L170 areAnnotationChecker]: L90-2 has no Hoare annotation [2022-02-20 16:46:26,079 WARN L170 areAnnotationChecker]: L99-2 has no Hoare annotation [2022-02-20 16:46:26,079 WARN L170 areAnnotationChecker]: L99-2 has no Hoare annotation [2022-02-20 16:46:26,079 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:26,079 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:26,080 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:46:26,080 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:46:26,080 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:46:26,080 WARN L170 areAnnotationChecker]: L99-3 has no Hoare annotation [2022-02-20 16:46:26,080 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:26,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:26 BoogieIcfgContainer [2022-02-20 16:46:26,081 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:26,082 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:26,082 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:26,083 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:26,083 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:25" (3/4) ... [2022-02-20 16:46:26,088 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:46:26,088 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:26,090 INFO L158 Benchmark]: Toolchain (without parser) took 1988.22ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 55.3MB in the beginning and 58.0MB in the end (delta: -2.6MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2022-02-20 16:46:26,090 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 88.1MB. Free memory was 42.7MB in the beginning and 42.6MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:26,090 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.31ms. Allocated memory is still 88.1MB. Free memory was 55.2MB in the beginning and 60.9MB in the end (delta: -5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:46:26,091 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.30ms. Allocated memory is still 88.1MB. Free memory was 60.9MB in the beginning and 57.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:26,091 INFO L158 Benchmark]: Boogie Preprocessor took 54.13ms. Allocated memory is still 88.1MB. Free memory was 57.8MB in the beginning and 55.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:26,092 INFO L158 Benchmark]: RCFGBuilder took 601.53ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 55.5MB in the beginning and 79.8MB in the end (delta: -24.3MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2022-02-20 16:46:26,092 INFO L158 Benchmark]: TraceAbstraction took 886.47ms. Allocated memory is still 111.1MB. Free memory was 79.2MB in the beginning and 58.4MB in the end (delta: 20.7MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2022-02-20 16:46:26,093 INFO L158 Benchmark]: Witness Printer took 6.05ms. Allocated memory is still 111.1MB. Free memory is still 58.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:26,095 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 88.1MB. Free memory was 42.7MB in the beginning and 42.6MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.31ms. Allocated memory is still 88.1MB. Free memory was 55.2MB in the beginning and 60.9MB in the end (delta: -5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.30ms. Allocated memory is still 88.1MB. Free memory was 60.9MB in the beginning and 57.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.13ms. Allocated memory is still 88.1MB. Free memory was 57.8MB in the beginning and 55.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 601.53ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 55.5MB in the beginning and 79.8MB in the end (delta: -24.3MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * TraceAbstraction took 886.47ms. Allocated memory is still 111.1MB. Free memory was 79.2MB in the beginning and 58.4MB in the end (delta: 20.7MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. * Witness Printer took 6.05ms. Allocated memory is still 111.1MB. Free memory is still 58.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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.8s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 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:26,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1122a.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 11d6107924de66a58b91836187b6b12fed7ff2a1cca830501395e849f6954c14 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:27,962 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:27,965 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:28,009 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:28,010 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:28,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:28,014 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:28,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:28,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:28,027 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:28,029 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:28,030 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:28,030 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:28,033 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:28,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:28,040 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:28,041 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:28,041 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:28,043 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:28,046 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:28,049 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:28,050 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:28,051 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:28,053 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:28,057 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:28,057 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:28,057 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:28,059 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:28,059 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:28,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:28,060 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:28,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:28,061 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:28,062 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:28,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:28,063 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:28,063 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:28,064 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:28,064 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:28,065 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:28,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:28,069 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:28,110 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:28,110 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:28,111 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:28,112 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:28,113 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:28,113 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:28,114 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:28,114 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:28,114 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:28,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:28,115 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:28,115 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:28,116 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:28,116 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:28,116 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:28,116 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:28,116 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:46:28,116 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:46:28,117 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:46:28,117 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:28,117 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:28,117 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:28,117 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:28,118 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:28,118 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:28,118 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:28,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:28,119 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:28,119 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:28,119 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:28,119 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:46:28,119 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:46:28,120 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:28,120 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:28,120 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:28,120 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:46:28,121 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 -> 11d6107924de66a58b91836187b6b12fed7ff2a1cca830501395e849f6954c14 [2022-02-20 16:46:28,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:28,424 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:28,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:28,427 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:28,428 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:28,429 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1122a.c [2022-02-20 16:46:28,484 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd0333780/aa3d036e6aeb47a3a48f26ce4d3666fa/FLAGa13399a28 [2022-02-20 16:46:28,904 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:28,904 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1122a.c [2022-02-20 16:46:28,911 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd0333780/aa3d036e6aeb47a3a48f26ce4d3666fa/FLAGa13399a28 [2022-02-20 16:46:28,923 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd0333780/aa3d036e6aeb47a3a48f26ce4d3666fa [2022-02-20 16:46:28,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:28,927 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:28,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:28,929 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:28,932 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:28,933 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:28" (1/1) ... [2022-02-20 16:46:28,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e8c153b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:28, skipping insertion in model container [2022-02-20 16:46:28,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:28" (1/1) ... [2022-02-20 16:46:28,942 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:28,969 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:29,223 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_1122a.c[2725,2738] [2022-02-20 16:46:29,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:29,245 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:29,290 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_1122a.c[2725,2738] [2022-02-20 16:46:29,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:29,305 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:29,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:29 WrapperNode [2022-02-20 16:46:29,306 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:29,308 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:29,309 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:29,309 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:29,315 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:29" (1/1) ... [2022-02-20 16:46:29,337 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:29" (1/1) ... [2022-02-20 16:46:29,376 INFO L137 Inliner]: procedures = 21, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 169 [2022-02-20 16:46:29,376 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:29,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:29,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:29,378 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:29,385 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:29" (1/1) ... [2022-02-20 16:46:29,385 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:29" (1/1) ... [2022-02-20 16:46:29,401 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:29" (1/1) ... [2022-02-20 16:46:29,402 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:29" (1/1) ... [2022-02-20 16:46:29,416 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:29" (1/1) ... [2022-02-20 16:46:29,425 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:29" (1/1) ... [2022-02-20 16:46:29,431 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:29" (1/1) ... [2022-02-20 16:46:29,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:29,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:29,445 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:29,445 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:29,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:29" (1/1) ... [2022-02-20 16:46:29,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:29,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:29,481 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:29,505 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:29,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:29,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-02-20 16:46:29,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:46:29,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:29,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:46:29,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:46:29,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:29,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:29,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:46:29,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:46:29,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:29,630 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:29,632 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:32,104 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:32,110 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:32,110 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2022-02-20 16:46:32,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:32 BoogieIcfgContainer [2022-02-20 16:46:32,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:32,113 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:32,113 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:32,116 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:32,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:28" (1/3) ... [2022-02-20 16:46:32,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c476221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:32, skipping insertion in model container [2022-02-20 16:46:32,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:29" (2/3) ... [2022-02-20 16:46:32,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c476221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:32, skipping insertion in model container [2022-02-20 16:46:32,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:32" (3/3) ... [2022-02-20 16:46:32,118 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1122a.c [2022-02-20 16:46:32,122 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:32,122 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:32,159 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:32,165 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:32,165 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:32,177 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:32,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:46:32,181 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:32,181 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:32,182 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:32,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:32,186 INFO L85 PathProgramCache]: Analyzing trace with hash 666555284, now seen corresponding path program 1 times [2022-02-20 16:46:32,196 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:32,197 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1896995718] [2022-02-20 16:46:32,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:32,198 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:32,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:32,203 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:32,239 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:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:32,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:46:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:32,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:32,609 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:32,610 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, ~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:32,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {45#true} assume !true; {46#false} is VALID [2022-02-20 16:46:32,612 INFO L290 TraceCheckUtils]: 3: Hoare triple {46#false} assume !true; {46#false} is VALID [2022-02-20 16:46:32,612 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:32,613 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:32,614 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:32,614 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:32,614 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:32,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {46#false} assume !false; {46#false} is VALID [2022-02-20 16:46:32,616 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:32,616 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:32,617 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:32,617 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1896995718] [2022-02-20 16:46:32,618 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1896995718] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:32,618 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:32,618 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:32,619 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359846205] [2022-02-20 16:46:32,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:32,626 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:32,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:32,630 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:32,886 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:32,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:32,887 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:32,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:32,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:32,917 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:35,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:35,247 INFO L93 Difference]: Finished difference Result 82 states and 138 transitions. [2022-02-20 16:46:35,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:35,247 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,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:35,249 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:35,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 138 transitions. [2022-02-20 16:46:35,256 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:35,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 138 transitions. [2022-02-20 16:46:35,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 138 transitions. [2022-02-20 16:46:35,913 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:35,927 INFO L225 Difference]: With dead ends: 82 [2022-02-20 16:46:35,928 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 16:46:35,931 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:35,934 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:35,936 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:35,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 16:46:35,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-02-20 16:46:35,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:35,963 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:35,964 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:35,964 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:35,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:35,967 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-02-20 16:46:35,967 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-02-20 16:46:35,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:35,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:35,969 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:35,969 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:35,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:35,972 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-02-20 16:46:35,972 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-02-20 16:46:35,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:35,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:35,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:35,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:35,973 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:35,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2022-02-20 16:46:35,977 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 10 [2022-02-20 16:46:35,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:35,977 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2022-02-20 16:46:35,977 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:35,977 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-02-20 16:46:35,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:46:35,978 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:35,978 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:35,993 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:36,190 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:36,191 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:36,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:36,192 INFO L85 PathProgramCache]: Analyzing trace with hash 131116369, now seen corresponding path program 1 times [2022-02-20 16:46:36,192 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:36,193 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [353597125] [2022-02-20 16:46:36,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:36,193 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:36,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:36,195 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:36,197 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:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:36,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 16:46:36,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:36,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:39,065 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:39,066 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, ~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 (= |ULTIMATE.start_fmod_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:39,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {313#(and (= |ULTIMATE.start_fmod_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= 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 (= |ULTIMATE.start_fmod_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:39,067 INFO L290 TraceCheckUtils]: 3: Hoare triple {313#(and (= |ULTIMATE.start_fmod_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} goto; {313#(and (= |ULTIMATE.start_fmod_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:39,068 INFO L290 TraceCheckUtils]: 4: Hoare triple {313#(and (= |ULTIMATE.start_fmod_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= 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 (= |ULTIMATE.start_fmod_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:39,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {313#(and (= |ULTIMATE.start_fmod_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} goto; {313#(and (= |ULTIMATE.start_fmod_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:39,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {313#(and (= |ULTIMATE.start_fmod_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= 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 (= |ULTIMATE.start_fmod_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:39,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {313#(and (= |ULTIMATE.start_fmod_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= 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 ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~y#1|) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ 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:39,393 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 ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)) |ULTIMATE.start_fmod_float_~y#1|) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ 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:39,394 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:39,395 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:39,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {305#false} assume !false; {305#false} is VALID [2022-02-20 16:46:39,400 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:39,400 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:39,400 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:39,401 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [353597125] [2022-02-20 16:46:39,401 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [353597125] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:39,401 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:39,401 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:46:39,401 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490325631] [2022-02-20 16:46:39,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:39,402 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:39,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:39,402 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:39,773 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:39,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:46:39,774 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:39,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:46:39,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:39,775 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:42,300 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s 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:51,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:51,959 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2022-02-20 16:46:51,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:46:51,959 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:51,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:51,960 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:51,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-02-20 16:46:51,961 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:51,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-02-20 16:46:51,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 59 transitions. [2022-02-20 16:46:52,404 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:52,405 INFO L225 Difference]: With dead ends: 45 [2022-02-20 16:46:52,406 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 16:46:52,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:46:52,407 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 87 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s 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, 3.4s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:52,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 188 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 10 Unchecked, 3.4s Time] [2022-02-20 16:46:52,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 16:46:52,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-02-20 16:46:52,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:52,412 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:52,413 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:52,413 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:52,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:52,415 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2022-02-20 16:46:52,415 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2022-02-20 16:46:52,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:52,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:52,416 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:52,417 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:52,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:52,419 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2022-02-20 16:46:52,419 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2022-02-20 16:46:52,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:52,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:52,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:52,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:52,420 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:52,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-02-20 16:46:52,422 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 12 [2022-02-20 16:46:52,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:52,422 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2022-02-20 16:46:52,422 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:52,422 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-02-20 16:46:52,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:46:52,423 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:52,423 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:52,439 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:52,637 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:52,637 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:52,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:52,638 INFO L85 PathProgramCache]: Analyzing trace with hash -302456811, now seen corresponding path program 1 times [2022-02-20 16:46:52,638 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:52,638 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [993260584] [2022-02-20 16:46:52,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:52,639 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:52,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:52,641 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:52,644 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:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:52,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 16:46:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:52,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:52,976 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:52,979 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, ~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)) (= |ULTIMATE.start_fmod_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:52,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {543#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmod_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} call fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~x#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);call fmod_float_#t~mem4#1 := read~intINTTYPE4(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);fmod_float_~hx~0#1 := fmod_float_#t~mem4#1;havoc fmod_float_#t~mem4#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset);havoc fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset; {547#(exists ((currentRoundingMode RoundingMode)) (= (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|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:52,983 INFO L290 TraceCheckUtils]: 3: Hoare triple {547#(exists ((currentRoundingMode RoundingMode)) (= (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|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} goto; {547#(exists ((currentRoundingMode RoundingMode)) (= (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|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:52,987 INFO L290 TraceCheckUtils]: 4: Hoare triple {547#(exists ((currentRoundingMode RoundingMode)) (= (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|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} call fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~y#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);call fmod_float_#t~mem5#1 := read~intINTTYPE4(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);fmod_float_~hy~0#1 := fmod_float_#t~mem5#1;havoc fmod_float_#t~mem5#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset);havoc fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset; {547#(exists ((currentRoundingMode RoundingMode)) (= (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|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:52,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {547#(exists ((currentRoundingMode RoundingMode)) (= (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|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} goto; {547#(exists ((currentRoundingMode RoundingMode)) (= (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|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:52,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {547#(exists ((currentRoundingMode RoundingMode)) (= (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|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} fmod_float_~sx~0#1 := ~bvand32(2147483648bv32, fmod_float_~hx~0#1);fmod_float_~hx~0#1 := ~bvxor32(fmod_float_~hx~0#1, fmod_float_~sx~0#1);fmod_float_~hy~0#1 := ~bvand32(2147483647bv32, fmod_float_~hy~0#1); {547#(exists ((currentRoundingMode RoundingMode)) (= (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|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:52,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {547#(exists ((currentRoundingMode RoundingMode)) (= (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|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} 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:52,993 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:52,993 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:52,993 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:52,993 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:52,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {536#false} assume !false; {536#false} is VALID [2022-02-20 16:46:52,994 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:52,994 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:52,994 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:52,994 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [993260584] [2022-02-20 16:46:52,994 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [993260584] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:52,994 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:52,995 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:46:52,995 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126477398] [2022-02-20 16:46:52,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:52,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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:52,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:52,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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:53,023 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:53,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:46:53,024 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:53,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:46:53,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:46:53,025 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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:53,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:53,083 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2022-02-20 16:46:53,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:46:53,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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:53,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:53,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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:53,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-02-20 16:46:53,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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:53,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-02-20 16:46:53,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 53 transitions. [2022-02-20 16:46:53,179 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:53,180 INFO L225 Difference]: With dead ends: 39 [2022-02-20 16:46:53,180 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:46:53,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:46:53,182 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:53,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 3 Unchecked, 0.0s Time] [2022-02-20 16:46:53,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:46:53,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:46:53,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:53,183 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:53,183 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:53,183 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:53,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:53,183 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:53,184 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:53,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:53,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:53,184 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:53,184 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:53,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:53,184 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:53,184 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:53,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:53,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:53,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:53,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:53,185 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:53,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:46:53,185 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-02-20 16:46:53,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:53,185 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:46:53,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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:53,186 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:53,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:53,188 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:53,198 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:53,398 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:53,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:46:54,048 INFO L858 garLoopResultBuilder]: For program point L27(lines 27 31) no Hoare annotation was computed. [2022-02-20 16:46:54,048 INFO L858 garLoopResultBuilder]: For program point L60-1(lines 60 65) no Hoare annotation was computed. [2022-02-20 16:46:54,048 INFO L858 garLoopResultBuilder]: For program point L27-1(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:54,048 INFO L858 garLoopResultBuilder]: For program point L27-2(lines 27 31) no Hoare annotation was computed. [2022-02-20 16:46:54,048 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:54,048 INFO L858 garLoopResultBuilder]: For program point L69(lines 69 75) no Hoare annotation was computed. [2022-02-20 16:46:54,048 INFO L858 garLoopResultBuilder]: For program point L36(lines 36 37) no Hoare annotation was computed. [2022-02-20 16:46:54,049 INFO L854 garLoopResultBuilder]: At program point L69-2(lines 67 76) the Hoare annotation is: false [2022-02-20 16:46:54,049 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:46:54,049 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:46:54,049 INFO L858 garLoopResultBuilder]: For program point L78(lines 78 80) no Hoare annotation was computed. [2022-02-20 16:46:54,049 INFO L858 garLoopResultBuilder]: For program point L78-2(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:54,049 INFO L858 garLoopResultBuilder]: For program point L54-1(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:54,049 INFO L858 garLoopResultBuilder]: For program point L38(lines 38 39) no Hoare annotation was computed. [2022-02-20 16:46:54,049 INFO L861 garLoopResultBuilder]: At program point L129(lines 112 130) the Hoare annotation is: true [2022-02-20 16:46:54,049 INFO L858 garLoopResultBuilder]: For program point L88(lines 88 105) no Hoare annotation was computed. [2022-02-20 16:46:54,049 INFO L858 garLoopResultBuilder]: For program point L22-1(lines 22 26) no Hoare annotation was computed. [2022-02-20 16:46:54,050 INFO L854 garLoopResultBuilder]: At program point L22-2(lines 22 26) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmod_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))) (= currentRoundingMode roundNearestTiesToEven)) [2022-02-20 16:46:54,050 INFO L858 garLoopResultBuilder]: For program point L72(lines 72 73) no Hoare annotation was computed. [2022-02-20 16:46:54,050 INFO L858 garLoopResultBuilder]: For program point L48(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:54,050 INFO L854 garLoopResultBuilder]: At program point L106(lines 19 107) the Hoare annotation is: (and (= |ULTIMATE.start_fmod_float_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven) (exists ((|ULTIMATE.start_fmod_float_~y#1| (_ FloatingPoint 8 24))) (= (let ((.cse0 (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ 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:54,050 INFO L858 garLoopResultBuilder]: For program point L40(lines 40 41) no Hoare annotation was computed. [2022-02-20 16:46:54,050 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:46:54,050 INFO L858 garLoopResultBuilder]: For program point L90-1(lines 90 94) no Hoare annotation was computed. [2022-02-20 16:46:54,050 INFO L854 garLoopResultBuilder]: At program point L90-2(lines 90 94) the Hoare annotation is: false [2022-02-20 16:46:54,050 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 125) no Hoare annotation was computed. [2022-02-20 16:46:54,051 INFO L858 garLoopResultBuilder]: For program point L49-2(lines 49 50) no Hoare annotation was computed. [2022-02-20 16:46:54,051 INFO L854 garLoopResultBuilder]: At program point L49-3(lines 49 50) the Hoare annotation is: false [2022-02-20 16:46:54,051 INFO L858 garLoopResultBuilder]: For program point L99-1(lines 99 103) no Hoare annotation was computed. [2022-02-20 16:46:54,051 INFO L854 garLoopResultBuilder]: At program point L99-2(lines 99 103) the Hoare annotation is: false [2022-02-20 16:46:54,051 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:46:54,051 INFO L858 garLoopResultBuilder]: For program point L99-3(lines 99 103) no Hoare annotation was computed. [2022-02-20 16:46:54,051 INFO L858 garLoopResultBuilder]: For program point L124(lines 124 127) no Hoare annotation was computed. [2022-02-20 16:46:54,051 INFO L858 garLoopResultBuilder]: For program point L42(lines 42 46) no Hoare annotation was computed. [2022-02-20 16:46:54,051 INFO L858 garLoopResultBuilder]: For program point L42-1(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:54,051 INFO L858 garLoopResultBuilder]: For program point L67-1(lines 67 76) no Hoare annotation was computed. [2022-02-20 16:46:54,052 INFO L858 garLoopResultBuilder]: For program point L67-3(lines 67 76) no Hoare annotation was computed. [2022-02-20 16:46:54,052 INFO L858 garLoopResultBuilder]: For program point L125(line 125) no Hoare annotation was computed. [2022-02-20 16:46:54,052 INFO L854 garLoopResultBuilder]: At program point L84-2(lines 84 87) the Hoare annotation is: false [2022-02-20 16:46:54,052 INFO L858 garLoopResultBuilder]: For program point L84-3(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:54,053 INFO L858 garLoopResultBuilder]: For program point L43-2(lines 43 44) no Hoare annotation was computed. [2022-02-20 16:46:54,053 INFO L854 garLoopResultBuilder]: At program point L43-3(lines 43 44) the Hoare annotation is: false [2022-02-20 16:46:54,055 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:46:54,056 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:54,060 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:54,060 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:54,060 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:54,060 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:54,060 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:54,061 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:54,061 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:54,061 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:54,061 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:54,061 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:54,061 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2022-02-20 16:46:54,061 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:54,062 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:54,192 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:54,193 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:54,193 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:46:54,193 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:46:54,193 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:46:54,194 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:46:54,194 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:46:54,194 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:54,194 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:54,194 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2022-02-20 16:46:54,194 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2022-02-20 16:46:54,194 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:54,194 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:54,194 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:54,194 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:46:54,194 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:54,194 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:54,194 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:54,194 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:46:54,195 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:54,195 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:54,195 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2022-02-20 16:46:54,195 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:54,195 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:54,195 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2022-02-20 16:46:54,195 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2022-02-20 16:46:54,195 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2022-02-20 16:46:54,195 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2022-02-20 16:46:54,195 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2022-02-20 16:46:54,195 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:46:54,195 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2022-02-20 16:46:54,195 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:46:54,195 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:46:54,195 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:46:54,195 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:46:54,196 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:54,196 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:54,196 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:46:54,196 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:46:54,196 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:46:54,196 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:46:54,196 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:54,196 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:54,196 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:54,196 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:54,196 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:54,197 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:46:54,197 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:46:54,197 WARN L170 areAnnotationChecker]: L99-3 has no Hoare annotation [2022-02-20 16:46:54,197 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:54,197 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:54,197 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:46:54,197 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:46:54,197 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:46:54,197 WARN L170 areAnnotationChecker]: L99-3 has no Hoare annotation [2022-02-20 16:46:54,197 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:54,205 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:54,206 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:54,206 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,206 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:54,207 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:54,207 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,207 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,208 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,208 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,208 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,208 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,208 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:54,208 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,208 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,208 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,209 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:54,209 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,209 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,210 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,210 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,210 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,210 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:54,210 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,210 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,210 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,210 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:54,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:54 BoogieIcfgContainer [2022-02-20 16:46:54,211 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:54,212 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:54,212 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:54,220 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:54,220 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:32" (3/4) ... [2022-02-20 16:46:54,223 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:46:54,230 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-02-20 16:46:54,230 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-02-20 16:46:54,230 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:46:54,230 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:46:54,249 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-02-20 16:46:54,261 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:46:54,262 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:54,262 INFO L158 Benchmark]: Toolchain (without parser) took 25335.15ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 29.1MB in the beginning and 30.9MB in the end (delta: -1.9MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2022-02-20 16:46:54,263 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 52.4MB. Free memory was 33.9MB in the beginning and 33.8MB in the end (delta: 46.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:54,263 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.51ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 28.9MB in the beginning and 45.9MB in the end (delta: -17.0MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2022-02-20 16:46:54,263 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.87ms. Allocated memory is still 67.1MB. Free memory was 45.9MB in the beginning and 43.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:54,264 INFO L158 Benchmark]: Boogie Preprocessor took 66.38ms. Allocated memory is still 67.1MB. Free memory was 43.5MB in the beginning and 41.2MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:46:54,264 INFO L158 Benchmark]: RCFGBuilder took 2667.67ms. Allocated memory is still 67.1MB. Free memory was 41.2MB in the beginning and 39.0MB in the end (delta: 2.2MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2022-02-20 16:46:54,264 INFO L158 Benchmark]: TraceAbstraction took 22098.04ms. Allocated memory is still 67.1MB. Free memory was 38.4MB in the beginning and 33.5MB in the end (delta: 4.9MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2022-02-20 16:46:54,264 INFO L158 Benchmark]: Witness Printer took 49.81ms. Allocated memory is still 67.1MB. Free memory was 33.5MB in the beginning and 30.9MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:46:54,266 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.20ms. Allocated memory is still 52.4MB. Free memory was 33.9MB in the beginning and 33.8MB in the end (delta: 46.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.51ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 28.9MB in the beginning and 45.9MB in the end (delta: -17.0MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.87ms. Allocated memory is still 67.1MB. Free memory was 45.9MB in the beginning and 43.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.38ms. Allocated memory is still 67.1MB. Free memory was 43.5MB in the beginning and 41.2MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2667.67ms. Allocated memory is still 67.1MB. Free memory was 41.2MB in the beginning and 39.0MB in the end (delta: 2.2MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * TraceAbstraction took 22098.04ms. Allocated memory is still 67.1MB. Free memory was 38.4MB in the beginning and 33.5MB in the end (delta: 4.9MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. * Witness Printer took 49.81ms. Allocated memory is still 67.1MB. Free memory was 33.5MB in the beginning and 30.9MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. 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: 21.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 87 mSDsluCounter, 255 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 13 IncrementalHoareTripleChecker+Unchecked, 146 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 109 mSDtfsCounter, 25 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 13, 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, 58 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 8 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 32 ConstructedInterpolants, 7 QuantifiedInterpolants, 204 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:54,277 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:54,277 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:54,277 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,277 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:54,277 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:54,278 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 19]: Loop Invariant [2022-02-20 16:46:54,278 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,278 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,278 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,279 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,279 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,279 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:54,279 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,279 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,279 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,279 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:54,280 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,280 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,280 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,280 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,280 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,281 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:54,281 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,281 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,281 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:54,281 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~y#1,QUANTIFIED] Derived loop invariant: (x == ~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0), ~Pluszero~LONGDOUBLE()) && 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, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()), ULTIMATE.start_fmod_float_~y#1), ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~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:54,407 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