./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1092a.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_1092a.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 22f65bf7dc6be28e766baed8be33578320f214b34c577175c650fbf680c0e83b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:14,760 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:14,762 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:14,796 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:14,796 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:14,799 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:14,800 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:14,802 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:14,803 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:14,806 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:14,807 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:14,808 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:14,808 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:14,811 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:14,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:14,815 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:14,816 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:14,817 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:14,819 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:14,824 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:14,826 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:14,827 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:14,828 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:14,829 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:14,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:14,835 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:14,835 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:14,836 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:14,837 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:14,838 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:14,838 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:14,839 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:14,840 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:14,842 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:14,843 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:14,843 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:14,844 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:14,844 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:14,844 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:14,845 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:14,845 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:14,846 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:14,874 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:14,874 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:14,875 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:14,875 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:14,876 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:14,876 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:14,876 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:14,877 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:14,877 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:14,877 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:14,878 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:14,878 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:46:14,878 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:14,878 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:14,878 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:14,879 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:14,879 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:14,879 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:14,879 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:14,879 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:14,880 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:14,880 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:14,880 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:14,880 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:14,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:14,881 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:14,881 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:14,881 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:14,881 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:46:14,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:46:14,881 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:14,882 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:14,882 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:14,882 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 -> 22f65bf7dc6be28e766baed8be33578320f214b34c577175c650fbf680c0e83b [2022-02-20 16:46:15,079 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:15,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:15,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:15,095 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:15,095 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:15,096 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1092a.c [2022-02-20 16:46:15,142 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c01a976d6/e7ad1fceb9144fed8f6acd17639aa41b/FLAG0acdad866 [2022-02-20 16:46:15,534 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:15,534 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1092a.c [2022-02-20 16:46:15,539 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c01a976d6/e7ad1fceb9144fed8f6acd17639aa41b/FLAG0acdad866 [2022-02-20 16:46:15,552 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c01a976d6/e7ad1fceb9144fed8f6acd17639aa41b [2022-02-20 16:46:15,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:15,555 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:15,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:15,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:15,560 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:15,561 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:15" (1/1) ... [2022-02-20 16:46:15,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fee5e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:15, skipping insertion in model container [2022-02-20 16:46:15,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:15" (1/1) ... [2022-02-20 16:46:15,567 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:15,579 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:15,719 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_1092a.c[1753,1766] [2022-02-20 16:46:15,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:15,726 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:15,750 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_1092a.c[1753,1766] [2022-02-20 16:46:15,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:15,762 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:15,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:15 WrapperNode [2022-02-20 16:46:15,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:15,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:15,763 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:15,763 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:15,768 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:15" (1/1) ... [2022-02-20 16:46:15,781 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:15" (1/1) ... [2022-02-20 16:46:15,814 INFO L137 Inliner]: procedures = 16, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2022-02-20 16:46:15,814 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:15,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:15,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:15,815 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:15,825 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:15" (1/1) ... [2022-02-20 16:46:15,825 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:15" (1/1) ... [2022-02-20 16:46:15,827 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:15" (1/1) ... [2022-02-20 16:46:15,827 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:15" (1/1) ... [2022-02-20 16:46:15,832 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:15" (1/1) ... [2022-02-20 16:46:15,835 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:15" (1/1) ... [2022-02-20 16:46:15,836 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:15" (1/1) ... [2022-02-20 16:46:15,837 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:15,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:15,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:15,838 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:15,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:15" (1/1) ... [2022-02-20 16:46:15,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:15,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:15,876 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:15,878 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:15,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:15,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:46:15,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:15,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:46:15,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:46:15,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:46:15,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:15,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:15,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:46:15,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:16,000 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:16,008 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:16,313 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:16,317 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:16,317 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 16:46:16,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:16 BoogieIcfgContainer [2022-02-20 16:46:16,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:16,320 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:16,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:16,324 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:16,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:15" (1/3) ... [2022-02-20 16:46:16,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f075b31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:16, skipping insertion in model container [2022-02-20 16:46:16,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:15" (2/3) ... [2022-02-20 16:46:16,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f075b31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:16, skipping insertion in model container [2022-02-20 16:46:16,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:16" (3/3) ... [2022-02-20 16:46:16,328 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1092a.c [2022-02-20 16:46:16,334 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:16,334 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:16,370 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:16,375 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:16,375 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:16,386 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 0 states have call successors, (0), 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:16,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:46:16,389 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:16,390 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:16,390 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:16,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:16,397 INFO L85 PathProgramCache]: Analyzing trace with hash -2022248449, now seen corresponding path program 1 times [2022-02-20 16:46:16,403 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:16,403 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146109181] [2022-02-20 16:46:16,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:16,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:16,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#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);~huge_ceil~0 := 1.0E30; {33#true} is VALID [2022-02-20 16:46:16,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_#t~short9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someUnaryFLOAToperation(0.0);assume { :begin_inline_ceil_float } true;ceil_float_#in~x#1 := main_~x~0#1;havoc ceil_float_#res#1;havoc ceil_float_#t~mem4#1, ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, ceil_float_#t~mem5#1, ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset, ceil_float_~x#1, ceil_float_~i0~0#1, ceil_float_~j0~0#1, ceil_float_~i~0#1, ceil_float_~ix~0#1;ceil_float_~x#1 := ceil_float_#in~x#1;havoc ceil_float_~i0~0#1;havoc ceil_float_~j0~0#1;havoc ceil_float_~i~0#1;havoc ceil_float_~ix~0#1; {33#true} is VALID [2022-02-20 16:46:16,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume !true; {34#false} is VALID [2022-02-20 16:46:16,526 INFO L290 TraceCheckUtils]: 3: Hoare triple {34#false} ceil_float_~ix~0#1 := (if 0 == ceil_float_~i0~0#1 then 0 else (if 1 == ceil_float_~i0~0#1 then 1 else ~bitwiseAnd(ceil_float_~i0~0#1, 2147483647)));ceil_float_~j0~0#1 := (if (ceil_float_~ix~0#1 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (ceil_float_~ix~0#1 / 8388608 - 127) % 4294967296 % 4294967296 else (ceil_float_~ix~0#1 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); {34#false} is VALID [2022-02-20 16:46:16,526 INFO L290 TraceCheckUtils]: 4: Hoare triple {34#false} assume !(ceil_float_~j0~0#1 < 23); {34#false} is VALID [2022-02-20 16:46:16,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#false} assume !!(ceil_float_~ix~0#1 % 4294967296 < 2139095040);ceil_float_#res#1 := ceil_float_~x#1; {34#false} is VALID [2022-02-20 16:46:16,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#false} main_#t~ret7#1 := ceil_float_#res#1;assume { :end_inline_ceil_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_#t~short9#1 := ~someBinaryFLOATComparisonOperation(main_~res~0#1, ~someUnaryFLOAToperation(0.0)); {34#false} is VALID [2022-02-20 16:46:16,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#false} assume !main_#t~short9#1; {34#false} is VALID [2022-02-20 16:46:16,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#false} assume !main_#t~short9#1;havoc main_#t~ret8#1;havoc main_#t~short9#1; {34#false} is VALID [2022-02-20 16:46:16,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-02-20 16:46:16,529 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:16,529 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:16,530 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146109181] [2022-02-20 16:46:16,530 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146109181] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:16,530 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:16,531 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:16,533 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665890756] [2022-02-20 16:46:16,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:16,539 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:16,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:16,542 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:16,555 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:16,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:16,556 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:16,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:16,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:16,578 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 0 states have call successors, (0), 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:16,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:16,638 INFO L93 Difference]: Finished difference Result 58 states and 90 transitions. [2022-02-20 16:46:16,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:16,639 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:16,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:16,640 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:16,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 90 transitions. [2022-02-20 16:46:16,651 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:16,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 90 transitions. [2022-02-20 16:46:16,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 90 transitions. [2022-02-20 16:46:16,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:16,763 INFO L225 Difference]: With dead ends: 58 [2022-02-20 16:46:16,764 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 16:46:16,766 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:16,769 INFO L933 BasicCegarLoop]: 39 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, 39 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:16,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 39 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:16,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 16:46:16,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-20 16:46:16,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:16,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 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:16,793 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 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:16,794 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 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:16,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:16,796 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-02-20 16:46:16,796 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-02-20 16:46:16,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:16,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:16,797 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 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 27 states. [2022-02-20 16:46:16,798 INFO L87 Difference]: Start difference. First operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 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 27 states. [2022-02-20 16:46:16,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:16,800 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-02-20 16:46:16,800 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-02-20 16:46:16,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:16,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:16,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:16,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:16,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 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:16,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-02-20 16:46:16,804 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 10 [2022-02-20 16:46:16,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:16,805 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-02-20 16:46:16,805 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:16,805 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-02-20 16:46:16,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:46:16,806 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:16,806 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:16,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:46:16,807 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:16,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:16,808 INFO L85 PathProgramCache]: Analyzing trace with hash -62588350, now seen corresponding path program 1 times [2022-02-20 16:46:16,808 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:16,808 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284731535] [2022-02-20 16:46:16,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:16,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:16,862 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:46:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:16,911 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:46:16,914 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:46:16,916 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:16,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:46:16,920 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:46:16,922 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:16,951 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:16,951 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:16,951 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-02-20 16:46:16,951 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-02-20 16:46:16,952 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-20 16:46:16,952 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-20 16:46:16,952 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2022-02-20 16:46:16,952 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-20 16:46:16,952 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-20 16:46:16,952 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:46:16,952 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:46:16,953 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 16:46:16,953 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 16:46:16,953 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:16,954 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:16,954 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:16,954 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:16,954 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:46:16,954 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:46:16,955 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:46:16,955 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-02-20 16:46:16,955 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-02-20 16:46:16,955 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:16,955 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:16,955 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-02-20 16:46:16,956 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-02-20 16:46:16,956 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:46:16,956 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:46:16,956 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-02-20 16:46:16,956 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-02-20 16:46:16,956 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2022-02-20 16:46:16,956 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:46:16,957 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:46:16,957 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:46:16,957 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:46:16,957 WARN L170 areAnnotationChecker]: L82-2 has no Hoare annotation [2022-02-20 16:46:16,957 WARN L170 areAnnotationChecker]: L82-2 has no Hoare annotation [2022-02-20 16:46:16,957 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-02-20 16:46:16,957 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-02-20 16:46:16,958 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-02-20 16:46:16,958 WARN L170 areAnnotationChecker]: L61-3 has no Hoare annotation [2022-02-20 16:46:16,958 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2022-02-20 16:46:16,958 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2022-02-20 16:46:16,958 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2022-02-20 16:46:16,958 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-02-20 16:46:16,958 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:16,959 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:16,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:16 BoogieIcfgContainer [2022-02-20 16:46:16,960 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:16,962 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:16,962 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:16,962 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:16,963 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:16" (3/4) ... [2022-02-20 16:46:16,966 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:46:16,966 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:16,968 INFO L158 Benchmark]: Toolchain (without parser) took 1411.58ms. Allocated memory was 107.0MB in the beginning and 148.9MB in the end (delta: 41.9MB). Free memory was 76.2MB in the beginning and 94.4MB in the end (delta: -18.3MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2022-02-20 16:46:16,968 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 107.0MB. Free memory was 62.4MB in the beginning and 62.4MB in the end (delta: 46.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:16,971 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.74ms. Allocated memory is still 107.0MB. Free memory was 76.2MB in the beginning and 81.4MB in the end (delta: -5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:46:16,972 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.99ms. Allocated memory is still 107.0MB. Free memory was 81.4MB in the beginning and 79.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:16,972 INFO L158 Benchmark]: Boogie Preprocessor took 22.70ms. Allocated memory is still 107.0MB. Free memory was 79.3MB in the beginning and 77.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:16,972 INFO L158 Benchmark]: RCFGBuilder took 480.77ms. Allocated memory is still 107.0MB. Free memory was 77.6MB in the beginning and 61.2MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-20 16:46:16,973 INFO L158 Benchmark]: TraceAbstraction took 640.79ms. Allocated memory was 107.0MB in the beginning and 148.9MB in the end (delta: 41.9MB). Free memory was 60.8MB in the beginning and 94.4MB in the end (delta: -33.6MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2022-02-20 16:46:16,973 INFO L158 Benchmark]: Witness Printer took 3.95ms. Allocated memory is still 148.9MB. Free memory is still 94.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:16,975 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 107.0MB. Free memory was 62.4MB in the beginning and 62.4MB in the end (delta: 46.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.74ms. Allocated memory is still 107.0MB. Free memory was 76.2MB in the beginning and 81.4MB in the end (delta: -5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.99ms. Allocated memory is still 107.0MB. Free memory was 81.4MB in the beginning and 79.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.70ms. Allocated memory is still 107.0MB. Free memory was 79.3MB in the beginning and 77.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 480.77ms. Allocated memory is still 107.0MB. Free memory was 77.6MB in the beginning and 61.2MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 640.79ms. Allocated memory was 107.0MB in the beginning and 148.9MB in the end (delta: 41.9MB). Free memory was 60.8MB in the beginning and 94.4MB in the end (delta: -33.6MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Witness Printer took 3.95ms. Allocated memory is still 148.9MB. Free memory is still 94.4MB. 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: 83]: 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 82, overapproximation of someUnaryFLOAToperation at line 78, overapproximation of bitwiseAnd at line 23. Possible FailurePath: [L13] static const float huge_ceil = 1.0e30; VAL [huge_ceil=1000000000000000000000000000000] [L78] float x = -0.0f; [L79] CALL, EXPR ceil_float(x) [L16] __int32_t i0, j0; [L17] __uint32_t i, ix; VAL [\old(x)=1000000000000000000000000000001, huge_ceil=1000000000000000000000000000000, x=1000000000000000000000000000001] [L19] ieee_float_shape_type gf_u; [L20] gf_u.value = (x) [L21] EXPR gf_u.word [L21] (i0) = gf_u.word [L23] ix = (i0 & 0x7fffffff) [L24] j0 = (ix >> 23) - 0x7f VAL [\old(x)=1000000000000000000000000000001, huge_ceil=1000000000000000000000000000000, i=-18014398509481984, i0=6, j0=2147483521, x=1000000000000000000000000000001] [L25] COND FALSE !(j0 < 23) VAL [\old(x)=1000000000000000000000000000001, huge_ceil=1000000000000000000000000000000, i=-18014398509481984, i0=6, j0=2147483521, x=1000000000000000000000000000001] [L45] COND FALSE !(!((ix) < 0x7f800000L)) [L48] return x; VAL [\old(x)=1000000000000000000000000000001, \result=1000000000000000000000000000001, huge_ceil=1000000000000000000000000000000, i=-18014398509481984, i0=6, j0=2147483521, x=1000000000000000000000000000001] [L79] RET, EXPR ceil_float(x) [L79] float res = ceil_float(x); [L82] EXPR res == -0.0f && __signbit_float(res) == 1 VAL [huge_ceil=1000000000000000000000000000000, res=1000000000000000000000000000001, res == -0.0f && __signbit_float(res) == 1=0, x=1000000000000000000000000000001] [L82] COND TRUE !(res == -0.0f && __signbit_float(res) == 1) [L83] reach_error() VAL [huge_ceil=1000000000000000000000000000000, res=1000000000000000000000000000001, x=1000000000000000000000000000001] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 39 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, 39 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=30occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 9 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-20 16:46:17,010 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_1092a.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 22f65bf7dc6be28e766baed8be33578320f214b34c577175c650fbf680c0e83b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:18,697 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:18,699 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:18,728 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:18,728 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:18,729 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:18,730 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:18,731 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:18,733 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:18,733 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:18,734 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:18,735 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:18,744 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:18,747 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:18,750 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:18,751 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:18,753 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:18,755 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:18,758 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:18,762 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:18,764 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:18,765 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:18,765 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:18,767 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:18,772 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:18,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:18,776 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:18,777 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:18,778 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:18,779 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:18,779 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:18,779 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:18,780 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:18,781 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:18,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:18,782 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:18,783 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:18,783 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:18,783 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:18,785 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:18,785 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:18,786 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:18,815 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:18,815 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:18,816 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:18,816 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:18,817 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:18,817 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:18,818 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:18,818 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:18,818 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:18,819 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:18,819 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:18,819 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:18,820 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:18,820 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:18,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:18,820 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:18,820 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:46:18,820 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:46:18,820 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:46:18,821 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:18,821 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:18,821 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:18,821 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:18,821 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:18,821 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:18,822 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:18,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:18,822 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:18,822 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:18,822 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:18,822 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:46:18,822 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:46:18,823 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:18,823 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:18,823 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:18,823 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:46:18,823 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 -> 22f65bf7dc6be28e766baed8be33578320f214b34c577175c650fbf680c0e83b [2022-02-20 16:46:19,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:19,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:19,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:19,077 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:19,077 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:19,079 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1092a.c [2022-02-20 16:46:19,128 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fdf60b48/f519d647ab6740ddafeee306ffbb8438/FLAGb8718ed87 [2022-02-20 16:46:19,476 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:19,476 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1092a.c [2022-02-20 16:46:19,482 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fdf60b48/f519d647ab6740ddafeee306ffbb8438/FLAGb8718ed87 [2022-02-20 16:46:19,499 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fdf60b48/f519d647ab6740ddafeee306ffbb8438 [2022-02-20 16:46:19,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:19,502 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:19,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:19,505 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:19,507 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:19,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:19" (1/1) ... [2022-02-20 16:46:19,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@df450c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19, skipping insertion in model container [2022-02-20 16:46:19,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:19" (1/1) ... [2022-02-20 16:46:19,515 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:19,529 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:19,632 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_1092a.c[1753,1766] [2022-02-20 16:46:19,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:19,658 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:19,675 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_1092a.c[1753,1766] [2022-02-20 16:46:19,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:19,694 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:19,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19 WrapperNode [2022-02-20 16:46:19,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:19,696 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:19,697 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:19,697 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:19,701 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:19" (1/1) ... [2022-02-20 16:46:19,716 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:19" (1/1) ... [2022-02-20 16:46:19,738 INFO L137 Inliner]: procedures = 19, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2022-02-20 16:46:19,738 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:19,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:19,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:19,739 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:19,745 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:19" (1/1) ... [2022-02-20 16:46:19,745 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:19" (1/1) ... [2022-02-20 16:46:19,751 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:19" (1/1) ... [2022-02-20 16:46:19,751 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:19" (1/1) ... [2022-02-20 16:46:19,759 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:19" (1/1) ... [2022-02-20 16:46:19,764 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:19" (1/1) ... [2022-02-20 16:46:19,767 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:19" (1/1) ... [2022-02-20 16:46:19,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:19,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:19,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:19,780 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:19,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19" (1/1) ... [2022-02-20 16:46:19,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:19,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:19,803 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:19,820 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:19,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:19,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:46:19,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:46:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:46:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:19,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:46:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:46:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:19,914 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:19,916 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:20,300 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:20,305 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:20,305 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 16:46:20,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:20 BoogieIcfgContainer [2022-02-20 16:46:20,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:20,315 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:20,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:20,317 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:20,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:19" (1/3) ... [2022-02-20 16:46:20,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32480716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:20, skipping insertion in model container [2022-02-20 16:46:20,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19" (2/3) ... [2022-02-20 16:46:20,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32480716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:20, skipping insertion in model container [2022-02-20 16:46:20,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:20" (3/3) ... [2022-02-20 16:46:20,326 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1092a.c [2022-02-20 16:46:20,330 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:20,331 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:20,361 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:20,368 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:20,369 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:20,383 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 0 states have call successors, (0), 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:20,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:46:20,388 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:20,388 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:20,390 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:20,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:20,399 INFO L85 PathProgramCache]: Analyzing trace with hash -2022248449, now seen corresponding path program 1 times [2022-02-20 16:46:20,408 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:20,409 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878741044] [2022-02-20 16:46:20,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:20,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:20,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:20,412 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:20,423 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:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:20,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:46:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:20,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:20,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#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);~huge_ceil~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30)); {33#true} is VALID [2022-02-20 16:46:20,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_#t~short9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());assume { :begin_inline_ceil_float } true;ceil_float_#in~x#1 := main_~x~0#1;havoc ceil_float_#res#1;havoc ceil_float_#t~mem4#1, ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, ceil_float_#t~mem5#1, ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset, ceil_float_~x#1, ceil_float_~i0~0#1, ceil_float_~j0~0#1, ceil_float_~i~0#1, ceil_float_~ix~0#1;ceil_float_~x#1 := ceil_float_#in~x#1;havoc ceil_float_~i0~0#1;havoc ceil_float_~j0~0#1;havoc ceil_float_~i~0#1;havoc ceil_float_~ix~0#1; {33#true} is VALID [2022-02-20 16:46:20,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume !true; {34#false} is VALID [2022-02-20 16:46:20,541 INFO L290 TraceCheckUtils]: 3: Hoare triple {34#false} ceil_float_~ix~0#1 := ~bvand32(2147483647bv32, ceil_float_~i0~0#1);ceil_float_~j0~0#1 := ~bvsub32(~bvlshr32(ceil_float_~ix~0#1, 23bv32), 127bv32); {34#false} is VALID [2022-02-20 16:46:20,541 INFO L290 TraceCheckUtils]: 4: Hoare triple {34#false} assume !~bvslt32(ceil_float_~j0~0#1, 23bv32); {34#false} is VALID [2022-02-20 16:46:20,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#false} assume !!~bvult32(ceil_float_~ix~0#1, 2139095040bv32);ceil_float_#res#1 := ceil_float_~x#1; {34#false} is VALID [2022-02-20 16:46:20,542 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#false} main_#t~ret7#1 := ceil_float_#res#1;assume { :end_inline_ceil_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_#t~short9#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {34#false} is VALID [2022-02-20 16:46:20,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#false} assume !main_#t~short9#1; {34#false} is VALID [2022-02-20 16:46:20,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#false} assume !main_#t~short9#1;havoc main_#t~ret8#1;havoc main_#t~short9#1; {34#false} is VALID [2022-02-20 16:46:20,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-02-20 16:46:20,543 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:20,543 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:20,544 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:20,544 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878741044] [2022-02-20 16:46:20,544 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1878741044] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:20,544 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:20,545 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:20,547 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431974658] [2022-02-20 16:46:20,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:20,551 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:20,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:20,554 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:20,565 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:20,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:20,566 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:20,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:20,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:20,584 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 0 states have call successors, (0), 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:20,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:20,830 INFO L93 Difference]: Finished difference Result 58 states and 90 transitions. [2022-02-20 16:46:20,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:20,831 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:46:20,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:20,832 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:20,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 90 transitions. [2022-02-20 16:46:20,837 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:20,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 90 transitions. [2022-02-20 16:46:20,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 90 transitions. [2022-02-20 16:46:21,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:21,115 INFO L225 Difference]: With dead ends: 58 [2022-02-20 16:46:21,115 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 16:46:21,117 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:21,119 INFO L933 BasicCegarLoop]: 39 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, 39 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:21,120 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 39 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:21,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 16:46:21,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-20 16:46:21,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:21,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 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:21,142 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 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:21,143 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 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:21,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:21,147 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-02-20 16:46:21,147 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-02-20 16:46:21,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:21,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:21,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 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 27 states. [2022-02-20 16:46:21,149 INFO L87 Difference]: Start difference. First operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 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 27 states. [2022-02-20 16:46:21,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:21,163 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-02-20 16:46:21,163 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-02-20 16:46:21,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:21,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:21,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:21,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:21,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 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:21,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-02-20 16:46:21,166 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 10 [2022-02-20 16:46:21,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:21,167 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-02-20 16:46:21,167 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:21,167 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-02-20 16:46:21,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:46:21,168 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:21,168 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:21,179 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:21,370 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:21,370 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:21,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:21,372 INFO L85 PathProgramCache]: Analyzing trace with hash -62588350, now seen corresponding path program 1 times [2022-02-20 16:46:21,373 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:21,373 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744503273] [2022-02-20 16:46:21,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:21,373 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:21,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:21,374 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:21,376 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:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:21,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 16:46:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:21,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:21,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {217#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);~huge_ceil~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30)); {217#true} is VALID [2022-02-20 16:46:21,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {217#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_#t~short9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());assume { :begin_inline_ceil_float } true;ceil_float_#in~x#1 := main_~x~0#1;havoc ceil_float_#res#1;havoc ceil_float_#t~mem4#1, ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, ceil_float_#t~mem5#1, ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset, ceil_float_~x#1, ceil_float_~i0~0#1, ceil_float_~j0~0#1, ceil_float_~i~0#1, ceil_float_~ix~0#1;ceil_float_~x#1 := ceil_float_#in~x#1;havoc ceil_float_~i0~0#1;havoc ceil_float_~j0~0#1;havoc ceil_float_~i~0#1;havoc ceil_float_~ix~0#1; {225#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|)} is VALID [2022-02-20 16:46:21,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {225#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|)} call ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(ceil_float_~x#1, ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, 4bv32);call ceil_float_#t~mem4#1 := read~intINTTYPE4(ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, 4bv32);ceil_float_~i0~0#1 := ceil_float_#t~mem4#1;havoc ceil_float_#t~mem4#1;call ULTIMATE.dealloc(ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset);havoc ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset; {229#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|)))} is VALID [2022-02-20 16:46:21,605 INFO L290 TraceCheckUtils]: 3: Hoare triple {229#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|)))} goto; {229#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|)))} is VALID [2022-02-20 16:46:21,606 INFO L290 TraceCheckUtils]: 4: Hoare triple {229#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|)))} ceil_float_~ix~0#1 := ~bvand32(2147483647bv32, ceil_float_~i0~0#1);ceil_float_~j0~0#1 := ~bvsub32(~bvlshr32(ceil_float_~ix~0#1, 23bv32), 127bv32); {236#(exists ((|ULTIMATE.start_ceil_float_~i0~0#1| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|))) (= (bvadd (bvlshr (bvand (_ bv2147483647 32) |ULTIMATE.start_ceil_float_~i0~0#1|) (_ bv23 32)) (_ bv4294967169 32)) |ULTIMATE.start_ceil_float_~j0~0#1|)))} is VALID [2022-02-20 16:46:21,607 INFO L290 TraceCheckUtils]: 5: Hoare triple {236#(exists ((|ULTIMATE.start_ceil_float_~i0~0#1| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|))) (= (bvadd (bvlshr (bvand (_ bv2147483647 32) |ULTIMATE.start_ceil_float_~i0~0#1|) (_ bv23 32)) (_ bv4294967169 32)) |ULTIMATE.start_ceil_float_~j0~0#1|)))} assume !~bvslt32(ceil_float_~j0~0#1, 23bv32); {218#false} is VALID [2022-02-20 16:46:21,608 INFO L290 TraceCheckUtils]: 6: Hoare triple {218#false} assume !!~bvult32(ceil_float_~ix~0#1, 2139095040bv32);ceil_float_#res#1 := ceil_float_~x#1; {218#false} is VALID [2022-02-20 16:46:21,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {218#false} main_#t~ret7#1 := ceil_float_#res#1;assume { :end_inline_ceil_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_#t~short9#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {218#false} is VALID [2022-02-20 16:46:21,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {218#false} assume !main_#t~short9#1; {218#false} is VALID [2022-02-20 16:46:21,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {218#false} assume !main_#t~short9#1;havoc main_#t~ret8#1;havoc main_#t~short9#1; {218#false} is VALID [2022-02-20 16:46:21,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {218#false} assume !false; {218#false} is VALID [2022-02-20 16:46:21,609 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:21,609 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:21,610 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:21,610 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744503273] [2022-02-20 16:46:21,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1744503273] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:21,610 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:21,610 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:21,611 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292761740] [2022-02-20 16:46:21,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:21,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:21,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:21,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:21,639 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:21,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:21,640 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:21,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:21,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:21,641 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:22,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:22,833 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2022-02-20 16:46:22,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:46:22,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:22,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:22,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:22,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-02-20 16:46:22,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:22,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-02-20 16:46:22,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2022-02-20 16:46:22,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:22,916 INFO L225 Difference]: With dead ends: 48 [2022-02-20 16:46:22,916 INFO L226 Difference]: Without dead ends: 38 [2022-02-20 16:46:22,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:22,917 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 27 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:22,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 116 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 8 Unchecked, 0.2s Time] [2022-02-20 16:46:22,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-20 16:46:22,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2022-02-20 16:46:22,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:22,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 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:22,920 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 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:22,920 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 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:22,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:22,922 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-02-20 16:46:22,922 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-02-20 16:46:22,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:22,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:22,922 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 38 states. [2022-02-20 16:46:22,924 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 38 states. [2022-02-20 16:46:22,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:22,943 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-02-20 16:46:22,943 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-02-20 16:46:22,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:22,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:22,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:22,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:22,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 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:22,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-02-20 16:46:22,945 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 11 [2022-02-20 16:46:22,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:22,945 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-02-20 16:46:22,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:22,945 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-02-20 16:46:22,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:46:22,946 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:22,946 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:22,960 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:23,154 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:23,155 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:23,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:23,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1311186430, now seen corresponding path program 1 times [2022-02-20 16:46:23,155 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:23,156 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392649178] [2022-02-20 16:46:23,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:23,156 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:23,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:23,157 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:23,158 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:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:23,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 16:46:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:23,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:23,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {422#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);~huge_ceil~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30)); {422#true} is VALID [2022-02-20 16:46:23,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {422#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_#t~short9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());assume { :begin_inline_ceil_float } true;ceil_float_#in~x#1 := main_~x~0#1;havoc ceil_float_#res#1;havoc ceil_float_#t~mem4#1, ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, ceil_float_#t~mem5#1, ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset, ceil_float_~x#1, ceil_float_~i0~0#1, ceil_float_~j0~0#1, ceil_float_~i~0#1, ceil_float_~ix~0#1;ceil_float_~x#1 := ceil_float_#in~x#1;havoc ceil_float_~i0~0#1;havoc ceil_float_~j0~0#1;havoc ceil_float_~i~0#1;havoc ceil_float_~ix~0#1; {430#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|)} is VALID [2022-02-20 16:46:23,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {430#(= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|)} call ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(ceil_float_~x#1, ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, 4bv32);call ceil_float_#t~mem4#1 := read~intINTTYPE4(ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, 4bv32);ceil_float_~i0~0#1 := ceil_float_#t~mem4#1;havoc ceil_float_#t~mem4#1;call ULTIMATE.dealloc(ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset);havoc ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset; {434#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|)))} is VALID [2022-02-20 16:46:23,358 INFO L290 TraceCheckUtils]: 3: Hoare triple {434#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|)))} goto; {434#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|)))} is VALID [2022-02-20 16:46:23,359 INFO L290 TraceCheckUtils]: 4: Hoare triple {434#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|)))} ceil_float_~ix~0#1 := ~bvand32(2147483647bv32, ceil_float_~i0~0#1);ceil_float_~j0~0#1 := ~bvsub32(~bvlshr32(ceil_float_~ix~0#1, 23bv32), 127bv32); {441#(exists ((|ULTIMATE.start_ceil_float_~i0~0#1| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|))) (= (bvadd (bvlshr (bvand (_ bv2147483647 32) |ULTIMATE.start_ceil_float_~i0~0#1|) (_ bv23 32)) (_ bv4294967169 32)) |ULTIMATE.start_ceil_float_~j0~0#1|)))} is VALID [2022-02-20 16:46:23,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {441#(exists ((|ULTIMATE.start_ceil_float_~i0~0#1| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|))) (= (bvadd (bvlshr (bvand (_ bv2147483647 32) |ULTIMATE.start_ceil_float_~i0~0#1|) (_ bv23 32)) (_ bv4294967169 32)) |ULTIMATE.start_ceil_float_~j0~0#1|)))} assume ~bvslt32(ceil_float_~j0~0#1, 23bv32); {441#(exists ((|ULTIMATE.start_ceil_float_~i0~0#1| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|))) (= (bvadd (bvlshr (bvand (_ bv2147483647 32) |ULTIMATE.start_ceil_float_~i0~0#1|) (_ bv23 32)) (_ bv4294967169 32)) |ULTIMATE.start_ceil_float_~j0~0#1|)))} is VALID [2022-02-20 16:46:23,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {441#(exists ((|ULTIMATE.start_ceil_float_~i0~0#1| (_ BitVec 32))) (and (= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|))) (= (bvadd (bvlshr (bvand (_ bv2147483647 32) |ULTIMATE.start_ceil_float_~i0~0#1|) (_ bv23 32)) (_ bv4294967169 32)) |ULTIMATE.start_ceil_float_~j0~0#1|)))} assume !~bvslt32(ceil_float_~j0~0#1, 0bv32);ceil_float_~i~0#1 := ~bvashr32(8388607bv32, ceil_float_~j0~0#1); {423#false} is VALID [2022-02-20 16:46:23,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {423#false} assume 0bv32 == ~bvand32(ceil_float_~i0~0#1, ceil_float_~i~0#1);ceil_float_#res#1 := ceil_float_~x#1; {423#false} is VALID [2022-02-20 16:46:23,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {423#false} main_#t~ret7#1 := ceil_float_#res#1;assume { :end_inline_ceil_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_#t~short9#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {423#false} is VALID [2022-02-20 16:46:23,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {423#false} assume !main_#t~short9#1; {423#false} is VALID [2022-02-20 16:46:23,362 INFO L290 TraceCheckUtils]: 10: Hoare triple {423#false} assume !main_#t~short9#1;havoc main_#t~ret8#1;havoc main_#t~short9#1; {423#false} is VALID [2022-02-20 16:46:23,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {423#false} assume !false; {423#false} is VALID [2022-02-20 16:46:23,363 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:23,363 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:23,363 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:23,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [392649178] [2022-02-20 16:46:23,363 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [392649178] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:23,363 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:23,363 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:23,364 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177270924] [2022-02-20 16:46:23,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:23,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:46:23,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:23,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:23,377 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:23,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:23,377 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:23,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:23,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:23,378 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:23,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:23,932 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-02-20 16:46:23,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:46:23,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:46:23,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:23,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:23,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2022-02-20 16:46:23,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:23,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2022-02-20 16:46:23,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 57 transitions. [2022-02-20 16:46:24,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:24,022 INFO L225 Difference]: With dead ends: 50 [2022-02-20 16:46:24,022 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 16:46:24,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:24,024 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 27 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:24,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 91 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 6 Unchecked, 0.1s Time] [2022-02-20 16:46:24,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 16:46:24,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 22. [2022-02-20 16:46:24,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:24,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 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:24,026 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 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:24,026 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 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:24,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:24,028 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-02-20 16:46:24,028 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-02-20 16:46:24,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:24,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:24,028 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 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 34 states. [2022-02-20 16:46:24,028 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 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 34 states. [2022-02-20 16:46:24,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:24,029 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-02-20 16:46:24,029 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-02-20 16:46:24,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:24,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:24,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:24,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:24,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 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:24,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-02-20 16:46:24,030 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 12 [2022-02-20 16:46:24,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:24,031 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-02-20 16:46:24,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:24,031 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 16:46:24,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:46:24,031 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:24,031 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:24,041 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:24,239 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:24,239 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:24,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:24,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1612307429, now seen corresponding path program 1 times [2022-02-20 16:46:24,240 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:24,241 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820014855] [2022-02-20 16:46:24,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:24,241 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:24,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:24,242 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:24,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 16:46:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:24,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 16:46:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:24,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:24,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {620#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);~huge_ceil~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30)); {625#(and (= ~huge_ceil~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:24,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {625#(and (= ~huge_ceil~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_#t~short9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());assume { :begin_inline_ceil_float } true;ceil_float_#in~x#1 := main_~x~0#1;havoc ceil_float_#res#1;havoc ceil_float_#t~mem4#1, ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, ceil_float_#t~mem5#1, ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset, ceil_float_~x#1, ceil_float_~i0~0#1, ceil_float_~j0~0#1, ceil_float_~i~0#1, ceil_float_~ix~0#1;ceil_float_~x#1 := ceil_float_#in~x#1;havoc ceil_float_~i0~0#1;havoc ceil_float_~j0~0#1;havoc ceil_float_~i~0#1;havoc ceil_float_~ix~0#1; {629#(and (= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= ~huge_ceil~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:24,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {629#(and (= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= ~huge_ceil~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven))} call ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(ceil_float_~x#1, ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, 4bv32);call ceil_float_#t~mem4#1 := read~intINTTYPE4(ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, 4bv32);ceil_float_~i0~0#1 := ceil_float_#t~mem4#1;havoc ceil_float_#t~mem4#1;call ULTIMATE.dealloc(ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset);havoc ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset; {629#(and (= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= ~huge_ceil~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:24,459 INFO L290 TraceCheckUtils]: 3: Hoare triple {629#(and (= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= ~huge_ceil~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven))} goto; {629#(and (= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= ~huge_ceil~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:24,460 INFO L290 TraceCheckUtils]: 4: Hoare triple {629#(and (= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= ~huge_ceil~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven))} ceil_float_~ix~0#1 := ~bvand32(2147483647bv32, ceil_float_~i0~0#1);ceil_float_~j0~0#1 := ~bvsub32(~bvlshr32(ceil_float_~ix~0#1, 23bv32), 127bv32); {629#(and (= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= ~huge_ceil~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:24,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {629#(and (= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= ~huge_ceil~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven))} assume ~bvslt32(ceil_float_~j0~0#1, 23bv32); {629#(and (= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= ~huge_ceil~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:24,461 INFO L290 TraceCheckUtils]: 6: Hoare triple {629#(and (= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= ~huge_ceil~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven))} assume ~bvslt32(ceil_float_~j0~0#1, 0bv32); {629#(and (= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= ~huge_ceil~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:24,461 INFO L290 TraceCheckUtils]: 7: Hoare triple {629#(and (= (fp.neg (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= ~huge_ceil~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven))} assume !~fp.gt~FLOAT(~fp.add~FLOAT(currentRoundingMode, ~huge_ceil~0, ceil_float_~x#1), ~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE())); {621#false} is VALID [2022-02-20 16:46:24,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {621#false} call ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(ceil_float_~i0~0#1, ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset, 4bv32);call ceil_float_#t~mem5#1 := read~intFLOATTYPE4(ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset, 4bv32);ceil_float_~x#1 := ceil_float_#t~mem5#1;havoc ceil_float_#t~mem5#1;call ULTIMATE.dealloc(ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset);havoc ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset; {621#false} is VALID [2022-02-20 16:46:24,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {621#false} goto; {621#false} is VALID [2022-02-20 16:46:24,462 INFO L290 TraceCheckUtils]: 10: Hoare triple {621#false} ceil_float_#res#1 := ceil_float_~x#1; {621#false} is VALID [2022-02-20 16:46:24,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {621#false} main_#t~ret7#1 := ceil_float_#res#1;assume { :end_inline_ceil_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_#t~short9#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {621#false} is VALID [2022-02-20 16:46:24,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {621#false} assume !main_#t~short9#1; {621#false} is VALID [2022-02-20 16:46:24,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {621#false} assume !main_#t~short9#1;havoc main_#t~ret8#1;havoc main_#t~short9#1; {621#false} is VALID [2022-02-20 16:46:24,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {621#false} assume !false; {621#false} is VALID [2022-02-20 16:46:24,463 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:24,463 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:24,463 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:24,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820014855] [2022-02-20 16:46:24,463 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820014855] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:24,464 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:24,464 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:46:24,464 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269595230] [2022-02-20 16:46:24,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:24,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 16:46:24,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:24,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:24,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:24,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:46:24,493 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:24,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:46:24,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:46:24,494 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:24,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:24,570 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-02-20 16:46:24,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:46:24,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 16:46:24,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:24,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:24,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-02-20 16:46:24,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:24,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-02-20 16:46:24,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-02-20 16:46:24,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:24,632 INFO L225 Difference]: With dead ends: 34 [2022-02-20 16:46:24,632 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 16:46:24,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:46:24,633 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 28 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:24,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:24,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 16:46:24,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 16:46:24,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:24,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 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:24,637 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 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:24,637 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 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:24,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:24,637 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-02-20 16:46:24,638 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-02-20 16:46:24,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:24,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:24,638 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 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 22 states. [2022-02-20 16:46:24,638 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 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 22 states. [2022-02-20 16:46:24,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:24,639 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-02-20 16:46:24,639 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-02-20 16:46:24,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:24,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:24,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:24,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:24,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 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:24,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-02-20 16:46:24,640 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2022-02-20 16:46:24,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:24,644 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-02-20 16:46:24,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:24,644 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-02-20 16:46:24,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 16:46:24,644 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:24,644 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:24,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:24,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:24,870 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:24,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:24,870 INFO L85 PathProgramCache]: Analyzing trace with hash 879764433, now seen corresponding path program 1 times [2022-02-20 16:46:24,870 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:24,870 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1480562337] [2022-02-20 16:46:24,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:24,871 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:24,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:24,872 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:24,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 16:46:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:24,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 16:46:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:24,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:25,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {779#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);~huge_ceil~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30)); {779#true} is VALID [2022-02-20 16:46:25,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {779#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_#t~short9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());assume { :begin_inline_ceil_float } true;ceil_float_#in~x#1 := main_~x~0#1;havoc ceil_float_#res#1;havoc ceil_float_#t~mem4#1, ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, ceil_float_#t~mem5#1, ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset, ceil_float_~x#1, ceil_float_~i0~0#1, ceil_float_~j0~0#1, ceil_float_~i~0#1, ceil_float_~ix~0#1;ceil_float_~x#1 := ceil_float_#in~x#1;havoc ceil_float_~i0~0#1;havoc ceil_float_~j0~0#1;havoc ceil_float_~i~0#1;havoc ceil_float_~ix~0#1; {779#true} is VALID [2022-02-20 16:46:25,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {779#true} call ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(ceil_float_~x#1, ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, 4bv32);call ceil_float_#t~mem4#1 := read~intINTTYPE4(ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, 4bv32);ceil_float_~i0~0#1 := ceil_float_#t~mem4#1;havoc ceil_float_#t~mem4#1;call ULTIMATE.dealloc(ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset);havoc ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset; {779#true} is VALID [2022-02-20 16:46:25,036 INFO L290 TraceCheckUtils]: 3: Hoare triple {779#true} goto; {779#true} is VALID [2022-02-20 16:46:25,036 INFO L290 TraceCheckUtils]: 4: Hoare triple {779#true} ceil_float_~ix~0#1 := ~bvand32(2147483647bv32, ceil_float_~i0~0#1);ceil_float_~j0~0#1 := ~bvsub32(~bvlshr32(ceil_float_~ix~0#1, 23bv32), 127bv32); {779#true} is VALID [2022-02-20 16:46:25,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {779#true} assume ~bvslt32(ceil_float_~j0~0#1, 23bv32); {779#true} is VALID [2022-02-20 16:46:25,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {779#true} assume ~bvslt32(ceil_float_~j0~0#1, 0bv32); {779#true} is VALID [2022-02-20 16:46:25,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {779#true} assume ~fp.gt~FLOAT(~fp.add~FLOAT(currentRoundingMode, ~huge_ceil~0, ceil_float_~x#1), ~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE())); {779#true} is VALID [2022-02-20 16:46:25,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {779#true} assume ~bvslt32(ceil_float_~i0~0#1, 0bv32);ceil_float_~i0~0#1 := 2147483648bv32; {808#(= |ULTIMATE.start_ceil_float_~i0~0#1| (_ bv2147483648 32))} is VALID [2022-02-20 16:46:25,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {808#(= |ULTIMATE.start_ceil_float_~i0~0#1| (_ bv2147483648 32))} call ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(ceil_float_~i0~0#1, ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset, 4bv32);call ceil_float_#t~mem5#1 := read~intFLOATTYPE4(ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset, 4bv32);ceil_float_~x#1 := ceil_float_#t~mem5#1;havoc ceil_float_#t~mem5#1;call ULTIMATE.dealloc(ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset);havoc ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset; {812#(= (fp (_ bv1 1) (_ bv0 8) (_ bv0 23)) |ULTIMATE.start_ceil_float_~x#1|)} is VALID [2022-02-20 16:46:25,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {812#(= (fp (_ bv1 1) (_ bv0 8) (_ bv0 23)) |ULTIMATE.start_ceil_float_~x#1|)} goto; {812#(= (fp (_ bv1 1) (_ bv0 8) (_ bv0 23)) |ULTIMATE.start_ceil_float_~x#1|)} is VALID [2022-02-20 16:46:25,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {812#(= (fp (_ bv1 1) (_ bv0 8) (_ bv0 23)) |ULTIMATE.start_ceil_float_~x#1|)} ceil_float_#res#1 := ceil_float_~x#1; {819#(= (fp (_ bv1 1) (_ bv0 8) (_ bv0 23)) |ULTIMATE.start_ceil_float_#res#1|)} is VALID [2022-02-20 16:46:25,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {819#(= (fp (_ bv1 1) (_ bv0 8) (_ bv0 23)) |ULTIMATE.start_ceil_float_#res#1|)} main_#t~ret7#1 := ceil_float_#res#1;assume { :end_inline_ceil_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_#t~short9#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {823#|ULTIMATE.start_main_#t~short9#1|} is VALID [2022-02-20 16:46:25,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {823#|ULTIMATE.start_main_#t~short9#1|} assume !main_#t~short9#1; {780#false} is VALID [2022-02-20 16:46:25,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {780#false} assume !main_#t~short9#1;havoc main_#t~ret8#1;havoc main_#t~short9#1; {780#false} is VALID [2022-02-20 16:46:25,044 INFO L290 TraceCheckUtils]: 15: Hoare triple {780#false} assume !false; {780#false} is VALID [2022-02-20 16:46:25,044 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,044 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:25,044 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:25,044 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1480562337] [2022-02-20 16:46:25,044 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1480562337] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:25,044 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:25,044 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:46:25,044 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756045118] [2022-02-20 16:46:25,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:25,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 16:46:25,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:25,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:25,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:25,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:46:25,070 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:25,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:46:25,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:46:25,070 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:25,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:25,250 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-02-20 16:46:25,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:46:25,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 16:46:25,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:25,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:25,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-02-20 16:46:25,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:25,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-02-20 16:46:25,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-02-20 16:46:25,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:25,295 INFO L225 Difference]: With dead ends: 34 [2022-02-20 16:46:25,295 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 16:46:25,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:46:25,296 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 42 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:25,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 25 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:46:25,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 16:46:25,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 16:46:25,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:25,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 20 states have (on average 1.0) internal successors, (20), 20 states have internal predecessors, (20), 0 states have call successors, (0), 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,298 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 20 states have (on average 1.0) internal successors, (20), 20 states have internal predecessors, (20), 0 states have call successors, (0), 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,298 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 20 states have (on average 1.0) internal successors, (20), 20 states have internal predecessors, (20), 0 states have call successors, (0), 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,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:25,299 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2022-02-20 16:46:25,299 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2022-02-20 16:46:25,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:25,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:25,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 20 states have (on average 1.0) internal successors, (20), 20 states have internal predecessors, (20), 0 states have call successors, (0), 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 21 states. [2022-02-20 16:46:25,299 INFO L87 Difference]: Start difference. First operand has 21 states, 20 states have (on average 1.0) internal successors, (20), 20 states have internal predecessors, (20), 0 states have call successors, (0), 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 21 states. [2022-02-20 16:46:25,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:25,300 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2022-02-20 16:46:25,300 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2022-02-20 16:46:25,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:25,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:25,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:25,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:25,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.0) internal successors, (20), 20 states have internal predecessors, (20), 0 states have call successors, (0), 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,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2022-02-20 16:46:25,302 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 16 [2022-02-20 16:46:25,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:25,302 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2022-02-20 16:46:25,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:25,302 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2022-02-20 16:46:25,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 16:46:25,303 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:25,303 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:25,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:25,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:25,518 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:25,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:25,518 INFO L85 PathProgramCache]: Analyzing trace with hash -733783834, now seen corresponding path program 1 times [2022-02-20 16:46:25,518 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:25,518 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1302529841] [2022-02-20 16:46:25,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:25,520 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:25,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:25,525 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:25,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 16:46:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:25,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 16:46:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:25,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:25,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 16:46:25,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2022-02-20 16:46:25,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {947#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);~huge_ceil~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30)); {947#true} is VALID [2022-02-20 16:46:25,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {947#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_#t~short9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());assume { :begin_inline_ceil_float } true;ceil_float_#in~x#1 := main_~x~0#1;havoc ceil_float_#res#1;havoc ceil_float_#t~mem4#1, ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, ceil_float_#t~mem5#1, ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset, ceil_float_~x#1, ceil_float_~i0~0#1, ceil_float_~j0~0#1, ceil_float_~i~0#1, ceil_float_~ix~0#1;ceil_float_~x#1 := ceil_float_#in~x#1;havoc ceil_float_~i0~0#1;havoc ceil_float_~j0~0#1;havoc ceil_float_~i~0#1;havoc ceil_float_~ix~0#1; {947#true} is VALID [2022-02-20 16:46:25,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {947#true} call ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(ceil_float_~x#1, ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, 4bv32);call ceil_float_#t~mem4#1 := read~intINTTYPE4(ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, 4bv32);ceil_float_~i0~0#1 := ceil_float_#t~mem4#1;havoc ceil_float_#t~mem4#1;call ULTIMATE.dealloc(ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset);havoc ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset; {947#true} is VALID [2022-02-20 16:46:25,897 INFO L290 TraceCheckUtils]: 3: Hoare triple {947#true} goto; {947#true} is VALID [2022-02-20 16:46:25,897 INFO L290 TraceCheckUtils]: 4: Hoare triple {947#true} ceil_float_~ix~0#1 := ~bvand32(2147483647bv32, ceil_float_~i0~0#1);ceil_float_~j0~0#1 := ~bvsub32(~bvlshr32(ceil_float_~ix~0#1, 23bv32), 127bv32); {947#true} is VALID [2022-02-20 16:46:25,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {947#true} assume ~bvslt32(ceil_float_~j0~0#1, 23bv32); {947#true} is VALID [2022-02-20 16:46:25,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {947#true} assume ~bvslt32(ceil_float_~j0~0#1, 0bv32); {947#true} is VALID [2022-02-20 16:46:25,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {947#true} assume ~fp.gt~FLOAT(~fp.add~FLOAT(currentRoundingMode, ~huge_ceil~0, ceil_float_~x#1), ~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE())); {947#true} is VALID [2022-02-20 16:46:25,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {947#true} assume ~bvslt32(ceil_float_~i0~0#1, 0bv32);ceil_float_~i0~0#1 := 2147483648bv32; {976#(= |ULTIMATE.start_ceil_float_~i0~0#1| (_ bv2147483648 32))} is VALID [2022-02-20 16:46:25,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {976#(= |ULTIMATE.start_ceil_float_~i0~0#1| (_ bv2147483648 32))} call ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(ceil_float_~i0~0#1, ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset, 4bv32);call ceil_float_#t~mem5#1 := read~intFLOATTYPE4(ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset, 4bv32);ceil_float_~x#1 := ceil_float_#t~mem5#1;havoc ceil_float_#t~mem5#1;call ULTIMATE.dealloc(ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset);havoc ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset; {980#(exists ((|v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32)) (_ bv2147483648 32)) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) |ULTIMATE.start_ceil_float_~x#1|)))} is VALID [2022-02-20 16:46:25,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {980#(exists ((|v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32)) (_ bv2147483648 32)) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) |ULTIMATE.start_ceil_float_~x#1|)))} goto; {980#(exists ((|v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32)) (_ bv2147483648 32)) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) |ULTIMATE.start_ceil_float_~x#1|)))} is VALID [2022-02-20 16:46:25,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {980#(exists ((|v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32)) (_ bv2147483648 32)) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) |ULTIMATE.start_ceil_float_~x#1|)))} ceil_float_#res#1 := ceil_float_~x#1; {987#(exists ((|v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32)) (_ bv2147483648 32)) (= |ULTIMATE.start_ceil_float_#res#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32)))))))} is VALID [2022-02-20 16:46:25,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {987#(exists ((|v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32)) (_ bv2147483648 32)) (= |ULTIMATE.start_ceil_float_#res#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32)))))))} main_#t~ret7#1 := ceil_float_#res#1;assume { :end_inline_ceil_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_#t~short9#1 := ~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {991#(exists ((|v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32)) (_ bv2147483648 32)) (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32)))))))} is VALID [2022-02-20 16:46:25,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {991#(exists ((|v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32)) (_ bv2147483648 32)) (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32)))))))} assume main_#t~short9#1;assume { :begin_inline___signbit_float } true;__signbit_float_#in~x#1 := main_~res~0#1;havoc __signbit_float_#res#1;havoc __signbit_float_#t~mem6#1, __signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset, __signbit_float_~x#1, __signbit_float_~w~0#1;__signbit_float_~x#1 := __signbit_float_#in~x#1;havoc __signbit_float_~w~0#1; {995#(exists ((|v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9| (_ BitVec 32))) (and (= |ULTIMATE.start___signbit_float_~x#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32)) (_ bv2147483648 32))))} is VALID [2022-02-20 16:46:25,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {995#(exists ((|v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9| (_ BitVec 32))) (and (= |ULTIMATE.start___signbit_float_~x#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32)) (_ bv2147483648 32))))} call __signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__signbit_float_~x#1, __signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset, 4bv32);call __signbit_float_#t~mem6#1 := read~intINTTYPE4(__signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset, 4bv32);__signbit_float_~w~0#1 := __signbit_float_#t~mem6#1;havoc __signbit_float_#t~mem6#1;call ULTIMATE.dealloc(__signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset);havoc __signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset; {999#(= (fp (_ bv1 1) (_ bv0 8) (_ bv0 23)) (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|)))} is VALID [2022-02-20 16:46:25,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {999#(= (fp (_ bv1 1) (_ bv0 8) (_ bv0 23)) (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|)))} goto; {999#(= (fp (_ bv1 1) (_ bv0 8) (_ bv0 23)) (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|)))} is VALID [2022-02-20 16:46:25,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {999#(= (fp (_ bv1 1) (_ bv0 8) (_ bv0 23)) (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|)))} __signbit_float_#res#1 := (if 0bv32 != ~bvand32(2147483648bv32, __signbit_float_~w~0#1) then 1bv32 else 0bv32); {1006#(= |ULTIMATE.start___signbit_float_#res#1| (_ bv1 32))} is VALID [2022-02-20 16:46:25,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {1006#(= |ULTIMATE.start___signbit_float_#res#1| (_ bv1 32))} main_#t~ret8#1 := __signbit_float_#res#1;assume { :end_inline___signbit_float } true;main_#t~short9#1 := 1bv32 == main_#t~ret8#1; {1010#|ULTIMATE.start_main_#t~short9#1|} is VALID [2022-02-20 16:46:25,906 INFO L290 TraceCheckUtils]: 18: Hoare triple {1010#|ULTIMATE.start_main_#t~short9#1|} assume !main_#t~short9#1;havoc main_#t~ret8#1;havoc main_#t~short9#1; {948#false} is VALID [2022-02-20 16:46:25,906 INFO L290 TraceCheckUtils]: 19: Hoare triple {948#false} assume !false; {948#false} is VALID [2022-02-20 16:46:25,906 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,906 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:25,907 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:25,907 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1302529841] [2022-02-20 16:46:25,907 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1302529841] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:25,907 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:25,907 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 16:46:25,907 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507752566] [2022-02-20 16:46:25,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:25,908 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-02-20 16:46:25,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:25,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 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,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:25,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 16:46:25,935 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:25,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 16:46:25,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:46:25,936 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 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:26,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:26,385 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2022-02-20 16:46:26,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 16:46:26,385 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-02-20 16:46:26,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:26,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 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:26,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 20 transitions. [2022-02-20 16:46:26,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 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:26,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 20 transitions. [2022-02-20 16:46:26,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 20 transitions. [2022-02-20 16:46:26,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:26,413 INFO L225 Difference]: With dead ends: 21 [2022-02-20 16:46:26,413 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:46:26,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-02-20 16:46:26,414 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:26,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 79 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 27 Unchecked, 0.0s Time] [2022-02-20 16:46:26,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:46:26,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:46:26,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:26,415 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:26,415 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:26,415 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:26,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:26,415 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:26,415 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:26,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:26,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:26,415 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:26,415 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:26,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:26,415 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:26,415 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:26,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:26,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:26,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:26,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:26,416 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:26,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:46:26,416 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-02-20 16:46:26,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:26,416 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:46:26,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 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:26,416 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:26,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:26,418 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:26,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:26,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:26,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:46:26,705 INFO L858 garLoopResultBuilder]: For program point L27(lines 27 33) no Hoare annotation was computed. [2022-02-20 16:46:26,705 INFO L858 garLoopResultBuilder]: For program point L36(lines 36 37) no Hoare annotation was computed. [2022-02-20 16:46:26,705 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:46:26,705 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:46:26,705 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:46:26,705 INFO L858 garLoopResultBuilder]: For program point L28(lines 28 32) no Hoare annotation was computed. [2022-02-20 16:46:26,705 INFO L858 garLoopResultBuilder]: For program point L61-1(lines 61 65) no Hoare annotation was computed. [2022-02-20 16:46:26,705 INFO L854 garLoopResultBuilder]: At program point L61-2(lines 61 65) the Hoare annotation is: (let ((.cse0 (fp (_ bv1 1) (_ bv0 8) (_ bv0 23)))) (and (= |ULTIMATE.start_ceil_float_~i0~0#1| (_ bv2147483648 32)) (= ~huge_ceil~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= .cse0 |ULTIMATE.start_ceil_float_~x#1|) (= .cse0 |ULTIMATE.start_ceil_float_#res#1|) |ULTIMATE.start_main_#t~short9#1| (= currentRoundingMode roundNearestTiesToEven) (exists ((|v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9| (_ BitVec 32))) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) (and (= |ULTIMATE.start___signbit_float_~x#1| (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (= .cse1 (_ bv2147483648 32))))))) [2022-02-20 16:46:26,705 INFO L858 garLoopResultBuilder]: For program point L61-3(lines 61 65) no Hoare annotation was computed. [2022-02-20 16:46:26,706 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2022-02-20 16:46:26,706 INFO L858 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2022-02-20 16:46:26,706 INFO L858 garLoopResultBuilder]: For program point L82-2(lines 82 85) no Hoare annotation was computed. [2022-02-20 16:46:26,706 INFO L858 garLoopResultBuilder]: For program point L45(lines 45 48) no Hoare annotation was computed. [2022-02-20 16:46:26,706 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:46:26,706 INFO L858 garLoopResultBuilder]: For program point L25(lines 25 49) no Hoare annotation was computed. [2022-02-20 16:46:26,706 INFO L861 garLoopResultBuilder]: At program point L87(lines 70 88) the Hoare annotation is: true [2022-02-20 16:46:26,706 INFO L858 garLoopResultBuilder]: For program point L83(line 83) no Hoare annotation was computed. [2022-02-20 16:46:26,706 INFO L858 garLoopResultBuilder]: For program point L50(lines 50 54) no Hoare annotation was computed. [2022-02-20 16:46:26,706 INFO L858 garLoopResultBuilder]: For program point L50-1(lines 15 56) no Hoare annotation was computed. [2022-02-20 16:46:26,706 INFO L858 garLoopResultBuilder]: For program point L50-2(lines 50 54) no Hoare annotation was computed. [2022-02-20 16:46:26,706 INFO L858 garLoopResultBuilder]: For program point L38(lines 38 42) no Hoare annotation was computed. [2022-02-20 16:46:26,706 INFO L854 garLoopResultBuilder]: At program point L67(lines 58 68) the Hoare annotation is: (let ((.cse0 (fp (_ bv1 1) (_ bv0 8) (_ bv0 23)))) (and (= .cse0 (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~0#1|))) (= |ULTIMATE.start_ceil_float_~i0~0#1| (_ bv2147483648 32)) (= ~huge_ceil~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= .cse0 |ULTIMATE.start_ceil_float_~x#1|) (= |ULTIMATE.start___signbit_float_#res#1| (_ bv1 32)) (= .cse0 |ULTIMATE.start_ceil_float_#res#1|) |ULTIMATE.start_main_#t~short9#1| (= currentRoundingMode roundNearestTiesToEven))) [2022-02-20 16:46:26,706 INFO L858 garLoopResultBuilder]: For program point L30(lines 30 32) no Hoare annotation was computed. [2022-02-20 16:46:26,706 INFO L858 garLoopResultBuilder]: For program point L26(lines 26 43) no Hoare annotation was computed. [2022-02-20 16:46:26,706 INFO L854 garLoopResultBuilder]: At program point L55(lines 15 56) the Hoare annotation is: (and (exists ((|v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9| (_ BitVec 32))) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) (and (= .cse0 (_ bv2147483648 32)) (= |ULTIMATE.start_ceil_float_#res#1| (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))))) (= |ULTIMATE.start_ceil_float_~i0~0#1| (_ bv2147483648 32)) (= ~huge_ceil~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= (fp (_ bv1 1) (_ bv0 8) (_ bv0 23)) |ULTIMATE.start_ceil_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven)) [2022-02-20 16:46:26,723 INFO L858 garLoopResultBuilder]: For program point L18-1(lines 18 22) no Hoare annotation was computed. [2022-02-20 16:46:26,723 INFO L854 garLoopResultBuilder]: At program point L18-2(lines 18 22) the Hoare annotation is: (and (= ~huge_ceil~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= (fp (_ bv1 1) (_ bv0 8) (_ bv0 23)) |ULTIMATE.start_ceil_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven)) [2022-02-20 16:46:26,723 INFO L858 garLoopResultBuilder]: For program point L18-3(lines 18 22) no Hoare annotation was computed. [2022-02-20 16:46:26,723 INFO L858 garLoopResultBuilder]: For program point L39(lines 39 40) no Hoare annotation was computed. [2022-02-20 16:46:26,723 INFO L858 garLoopResultBuilder]: For program point L39-2(lines 39 40) no Hoare annotation was computed. [2022-02-20 16:46:26,725 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 16:46:26,726 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:26,728 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:26,728 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:26,729 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-20 16:46:26,729 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2022-02-20 16:46:26,729 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-20 16:46:26,729 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-20 16:46:26,729 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2022-02-20 16:46:26,729 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-20 16:46:26,729 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-20 16:46:26,729 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:46:26,729 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:46:26,729 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 16:46:26,729 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 16:46:26,729 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:26,729 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:26,730 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:26,730 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:26,730 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-02-20 16:46:26,730 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:46:26,730 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:46:26,730 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-02-20 16:46:26,730 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-02-20 16:46:26,730 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:26,730 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:26,730 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-02-20 16:46:26,730 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-02-20 16:46:26,730 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:46:26,730 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:46:26,730 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-02-20 16:46:26,730 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-02-20 16:46:26,730 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2022-02-20 16:46:26,730 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:46:26,730 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:46:26,730 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-02-20 16:46:26,730 WARN L170 areAnnotationChecker]: L61-3 has no Hoare annotation [2022-02-20 16:46:26,730 WARN L170 areAnnotationChecker]: L82-2 has no Hoare annotation [2022-02-20 16:46:26,730 WARN L170 areAnnotationChecker]: L82-2 has no Hoare annotation [2022-02-20 16:46:26,730 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-02-20 16:46:26,730 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-02-20 16:46:26,730 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-02-20 16:46:26,730 WARN L170 areAnnotationChecker]: L61-3 has no Hoare annotation [2022-02-20 16:46:26,730 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2022-02-20 16:46:26,730 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2022-02-20 16:46:26,730 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:26,731 WARN L170 areAnnotationChecker]: L82-2 has no Hoare annotation [2022-02-20 16:46:26,731 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:26,731 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,733 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:26,737 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:26,742 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:26,743 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:26,743 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:26,744 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:26,744 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:26,744 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:26,744 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:26,744 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:26,745 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:26,745 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:26,745 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:26,745 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:26,749 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:26,749 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:26,749 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:26,749 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:26,750 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:26,750 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:26,750 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:26,750 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:26,750 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:26,750 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:26,752 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,752 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:26,752 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:26,753 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:26,753 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:26,753 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:20" (3/4) ... [2022-02-20 16:46:26,755 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:46:26,763 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-02-20 16:46:26,763 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-02-20 16:46:26,763 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:46:26,764 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:46:26,781 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9 : bv32 :: unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9][0bv32] == 2147483648bv32 && \result == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9][0bv32][22:0])) && i0 == 2147483648bv32) && huge_ceil == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E30))) && ~fp~LONGDOUBLE(1bv1, 0bv8, 0bv23) == x) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-02-20 16:46:26,783 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((i0 == 2147483648bv32 && huge_ceil == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E30))) && ~fp~LONGDOUBLE(1bv1, 0bv8, 0bv23) == x) && ~fp~LONGDOUBLE(1bv1, 0bv8, 0bv23) == \result) && aux-res == -0.0f && __signbit_float(res) == 1-aux) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9 : bv32 :: x == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9][0bv32][22:0]) && unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9][0bv32] == 2147483648bv32) [2022-02-20 16:46:26,783 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~fp~LONGDOUBLE(1bv1, 0bv8, 0bv23) == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && i0 == 2147483648bv32) && huge_ceil == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E30))) && ~fp~LONGDOUBLE(1bv1, 0bv8, 0bv23) == x) && \result == 1bv32) && ~fp~LONGDOUBLE(1bv1, 0bv8, 0bv23) == \result) && aux-res == -0.0f && __signbit_float(res) == 1-aux) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-02-20 16:46:26,795 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:46:26,795 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:26,796 INFO L158 Benchmark]: Toolchain (without parser) took 7293.60ms. Allocated memory was 52.4MB in the beginning and 83.9MB in the end (delta: 31.5MB). Free memory was 31.6MB in the beginning and 33.3MB in the end (delta: -1.7MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2022-02-20 16:46:26,796 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 52.4MB. Free memory was 33.9MB in the beginning and 33.8MB in the end (delta: 43.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:26,796 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.08ms. Allocated memory was 52.4MB in the beginning and 69.2MB in the end (delta: 16.8MB). Free memory was 31.4MB in the beginning and 50.7MB in the end (delta: -19.2MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2022-02-20 16:46:26,797 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.40ms. Allocated memory is still 69.2MB. Free memory was 50.5MB in the beginning and 48.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:26,797 INFO L158 Benchmark]: Boogie Preprocessor took 32.69ms. Allocated memory is still 69.2MB. Free memory was 48.6MB in the beginning and 46.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:26,797 INFO L158 Benchmark]: RCFGBuilder took 534.06ms. Allocated memory is still 69.2MB. Free memory was 46.8MB in the beginning and 52.4MB in the end (delta: -5.6MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2022-02-20 16:46:26,797 INFO L158 Benchmark]: TraceAbstraction took 6437.18ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 52.1MB in the beginning and 36.1MB in the end (delta: 16.0MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2022-02-20 16:46:26,797 INFO L158 Benchmark]: Witness Printer took 42.75ms. Allocated memory is still 83.9MB. Free memory was 36.1MB in the beginning and 33.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:26,799 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.16ms. Allocated memory is still 52.4MB. Free memory was 33.9MB in the beginning and 33.8MB in the end (delta: 43.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.08ms. Allocated memory was 52.4MB in the beginning and 69.2MB in the end (delta: 16.8MB). Free memory was 31.4MB in the beginning and 50.7MB in the end (delta: -19.2MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.40ms. Allocated memory is still 69.2MB. Free memory was 50.5MB in the beginning and 48.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.69ms. Allocated memory is still 69.2MB. Free memory was 48.6MB in the beginning and 46.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 534.06ms. Allocated memory is still 69.2MB. Free memory was 46.8MB in the beginning and 52.4MB in the end (delta: -5.6MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6437.18ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 52.1MB in the beginning and 36.1MB in the end (delta: 16.0MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * Witness Printer took 42.75ms. Allocated memory is still 83.9MB. Free memory was 36.1MB in the beginning and 33.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,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[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,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[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 83]: 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, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 129 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 382 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 41 IncrementalHoareTripleChecker+Unchecked, 227 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 74 IncrementalHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 155 mSDtfsCounter, 74 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 24 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 10 NumberOfFragments, 167 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 10 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 78 ConstructedInterpolants, 8 QuantifiedInterpolants, 462 SizeOfPredicates, 34 NumberOfNonLiveVariables, 303 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 58]: Loop Invariant [2022-02-20 16:46:26,812 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:26,827 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((((~fp~LONGDOUBLE(1bv1, 0bv8, 0bv23) == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && i0 == 2147483648bv32) && huge_ceil == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E30))) && ~fp~LONGDOUBLE(1bv1, 0bv8, 0bv23) == x) && \result == 1bv32) && ~fp~LONGDOUBLE(1bv1, 0bv8, 0bv23) == \result) && aux-res == -0.0f && __signbit_float(res) == 1-aux) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 18]: Loop Invariant [2022-02-20 16:46:26,828 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:26,828 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (huge_ceil == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E30)) && ~fp~LONGDOUBLE(1bv1, 0bv8, 0bv23) == x) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 61]: Loop Invariant [2022-02-20 16:46:26,828 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:26,828 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:26,828 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:26,828 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:26,829 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:26,829 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:26,829 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:26,829 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:26,829 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:26,829 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] Derived loop invariant: (((((i0 == 2147483648bv32 && huge_ceil == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E30))) && ~fp~LONGDOUBLE(1bv1, 0bv8, 0bv23) == x) && ~fp~LONGDOUBLE(1bv1, 0bv8, 0bv23) == \result) && aux-res == -0.0f && __signbit_float(res) == 1-aux) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9 : bv32 :: x == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9][0bv32][22:0]) && unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9][0bv32] == 2147483648bv32) - InvariantResult [Line: 15]: Loop Invariant [2022-02-20 16:46:26,829 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:26,829 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:26,830 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:26,830 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:26,830 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:26,830 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:26,830 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:26,830 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:26,830 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:26,830 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((\exists v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9 : bv32 :: unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9][0bv32] == 2147483648bv32 && \result == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_9][0bv32][22:0])) && i0 == 2147483648bv32) && huge_ceil == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E30))) && ~fp~LONGDOUBLE(1bv1, 0bv8, 0bv23) == x) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven RESULT: Ultimate proved your program to be correct! [2022-02-20 16:46:26,853 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